{"version":3,"sources":["jsdelivr-header.js","/npm/@jdultra/threedtiles@14.0.26/src/geometry/obb.js","/npm/@jdultra/threedtiles@14.0.26/src/utils/LinkedHashMap.js","/npm/@jdultra/threedtiles@14.0.26/src/decoder/FeatureTable.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/utils/BufferGeometryUtils.js","/npm/@jdultra/threedtiles@14.0.26/src/decoder/B3DMDecoder.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/@spz-loader/core/dist/index.js","/npm/@jdultra/threedtiles@14.0.26/src/decoder/GLTFTileDecoder.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/loaders/GLTFLoader.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/loaders/DRACOLoader.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/utils/WorkerPool.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/libs/ktx-parse.module.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/libs/zstddec.module.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/math/ColorSpaces.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/three/examples/jsm/loaders/KTX2Loader.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/implicit/SubtreeDecoder.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/implicit/ImplicitTileResolver.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/meshoptimizer/meshopt_encoder.module.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/meshoptimizer/meshopt_decoder.module.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/meshoptimizer/meshopt_simplifier.module.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/meshoptimizer/meshopt_clusterizer.module.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/TileLoader.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/uuid/dist/stringify.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/uuid/dist/rng.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/uuid/dist/native.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/uuid/dist/v4.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/path-browserify/index.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/@babel/runtime/helpers/esm/extends.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/core/config.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/customs.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/map.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/is.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/object.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/core/function/config.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/entry/configReadonly.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/typed-function/lib/esm/typed-function.mjs","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/factory.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/number.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/core/function/typed.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/decimal.js/decimal.mjs","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/bignumber/BigNumber.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/complex.js/dist/complex.mjs","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/complex/Complex.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/fraction.js/dist/fraction.mjs","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/fraction/Fraction.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/Matrix.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/bignumber/formatter.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/string.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/error/DimensionError.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/error/IndexError.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/array.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/optimizeCallback.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/DenseMatrix.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/collection.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/plain/number/arithmetic.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/product.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/plain/number/probability.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/utils/isZero.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/relational/compareUnits.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/relational/equalScalar.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/bignumber/nearlyEqual.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/complex.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/SparseMatrix.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/number.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/bignumber/function/bignumber.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/fraction/function/fraction.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/function/matrix.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/unaryMinus.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/abs.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/addScalar.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/subtractScalar.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo11xS0s.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/type/matrix/utils/matAlgo14xDs.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/multiplyScalar.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/multiply.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/complex/conj.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/matrix/identity.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/utils/noop.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/matrix/size.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/data-structure-typed/dist/esm/common/index.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/utils/numeric.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/divideScalar.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/arithmetic/pow.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/matrix/dot.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/matrix/det.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/matrix/inv.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/function/probability/gamma.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/mathjs/lib/esm/entry/pureFunctionsAny.generated.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/data-structure-typed/dist/esm/data-structures/base/iterable-element-base.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/data-structure-typed/dist/esm/data-structures/heap/heap.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/data-structure-typed/dist/esm/data-structures/priority-queue/priority-queue.js","/npm/@jdultra/threedtiles@14.0.26/node_modules/data-structure-typed/dist/esm/data-structures/priority-queue/min-priority-queue.js","/npm/@jdultra/threedtiles@14.0.26/src/splats/SplatsColider.js","/npm/@jdultra/threedtiles@14.0.26/src/splats/SplatsMesh.js","/npm/@jdultra/threedtiles@14.0.26/src/simulation/ColliderShape.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/OGC3DTile.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/instanced/InstancedTile.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/instanced/InstancedOGC3DTile.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/instanced/MeshTile.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/instanced/JsonTile.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/instanced/InstancedTileLoader.js","/npm/@jdultra/threedtiles@14.0.26/src/simulation/physics.js","/npm/@jdultra/threedtiles@14.0.26/src/tileset/OcclusionCullingService.js"],"names":[],"mappings":"AAAA;AACA;AACA;AACA;AACA;AACA;AACA,0bCFM,GAAa,IAAI,UACjB,GAAc,IAAI,UAClB,GAAO,IAAI,UACX,GAAO,IAAI,OACF,IAAI,UACH,IAAI,UACpB,MAAM,GAAW,IAAI,MAErB,MAAM,GAUA,WAAA,CAAY,GACV,KAAK,SACL,KAAK,OAAS,IAAI,UAAQ,EAAO,GAAI,EAAO,GAAI,EAAO,IACvD,KAAK,GAAK,IAAI,UAAQ,EAAO,GAAI,EAAO,GAAI,EAAO,IACnD,KAAK,GAAK,IAAI,UAAQ,EAAO,GAAI,EAAO,GAAI,EAAO,IACnD,KAAK,GAAK,IAAI,UAAQ,EAAO,GAAI,EAAO,IAAK,EAAO,KAEpD,KAAK,SAAW,IAAI,UAAQ,KAAK,GAAG,SAAU,KAAK,GAAG,SAAU,KAAK,GAAG,UAExE,KAAK,GAAG,YAER,MAAM,EAAQ,KAAK,GAAG,IAAI,KAAK,IAC/B,KAAK,GAAG,gBAAgB,KAAK,IAAK,GAAO,YAEzC,KAAK,GAAG,KAAK,KAAK,IAAI,MAAM,KAAK,IACN,IAAvB,KAAK,GAAG,YAER,KAAK,GAAG,IAAI,EAAG,EAAG,GACd,KAAK,IAAI,KAAK,GAAG,GAAK,MAAO,KAAK,GAAG,IAAI,EAAG,EAAG,GACnD,KAAK,GAAG,gBAAgB,KAAK,IAAK,KAAK,GAAG,IAAI,KAAK,KAAK,YACxD,KAAK,GAAG,KAAK,KAAK,IAAI,MAAM,KAAK,KAEjC,KAAK,GAAG,YAGZ,KAAK,eAAiB,IAAI,UAC1B,KAAK,eAAe,IAChB,KAAK,GAAG,EAAG,KAAK,GAAG,EAAG,KAAK,GAAG,EAC9B,KAAK,GAAG,EAAG,KAAK,GAAG,EAAG,KAAK,GAAG,EAC9B,KAAK,GAAG,EAAG,KAAK,GAAG,EAAG,KAAK,GAAG,EACtC,CAUA,IAAA,CAAK,GACD,KAAK,OAAO,KAAK,EAAK,QACtB,KAAK,eAAe,KAAK,EAAK,gBAC9B,KAAK,SAAS,KAAK,EAAK,UACxB,KAAK,GAAG,KAAK,EAAK,IAClB,KAAK,GAAG,KAAK,EAAK,IAClB,KAAK,GAAG,KAAK,EAAK,GACtB,CAUA,OAAA,CAAQ,GAEJ,OAAO,EAAO,KAAK,KAAK,UAAU,eAAe,EAErD,CAaG,YAAA,CAAa,GACZ,MAAM,EAAI,EAAO,SAEjB,IAAI,EAAK,GAAY,IAAI,EAAE,GAAI,EAAE,GAAI,EAAE,IAAI,SACvC,EAAK,GAAY,IAAI,EAAE,GAAI,EAAE,GAAI,EAAE,IAAI,SACvC,EAAK,GAAY,IAAI,EAAE,GAAI,EAAE,GAAI,EAAE,KAAK,SAE5C,GAAW,eAAe,GAE1B,MAAM,EAAe,IAAP,EAAW,EAAI,EAAK,EAC5B,EAAe,IAAP,EAAW,EAAI,EAAK,EAC5B,EAAe,IAAP,EAAW,EAAI,EAAK,EAsBlC,OApBA,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAE1B,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAE1B,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAC1B,GAAW,SAAS,IAAM,EAE1B,KAAK,eAAe,YAAY,IAEhC,KAAK,SAAS,GAAK,KAAK,IAAI,GAC5B,KAAK,SAAS,GAAK,KAAK,IAAI,GAC5B,KAAK,SAAS,GAAK,KAAK,IAAI,GAE5B,KAAK,OAAO,aAAa,GACzB,KAAK,eAAe,aAAa,KAAK,GAAI,KAAK,GAAI,KAAK,IACjD,IACX,CAUG,YAAA,CAAa,EAAK,GAEjB,KAAK,QAAQ,IACb,GAAK,qBAAqB,GAAY,IAAI,EAAG,EAAG,GAAI,IAEpD,MAAM,EAAK,GAAW,KAAK,KAAK,gBAAgB,YAKhD,OAHA,GAAS,OAAO,KAAK,EAAI,QAAQ,IAAI,KAAK,QAAQ,aAAa,GAC/D,GAAS,UAAU,KAAK,EAAI,WAAW,aAAa,GAAI,YAEpD,GAAS,aAAa,GAAM,GACrB,EACF,aAAa,KAAK,gBAClB,IAAI,KAAK,QAEP,IAEf,CAWA,UAAA,CAAW,EAAO,GAGd,GAAY,KAAK,GAAO,IAAI,KAAK,QAEjC,MAAM,EAAK,GAAY,IAAI,KAAK,IAC1B,EAAK,GAAY,IAAI,KAAK,IAC1B,EAAK,GAAY,IAAI,KAAK,IAG1B,EAAK,KAAK,KAAM,KAAK,SAAS,EAAG,KAAK,IAAI,KAAK,SAAS,EAAG,IAC3D,EAAK,KAAK,KAAM,KAAK,SAAS,EAAG,KAAK,IAAI,KAAK,SAAS,EAAG,IAC3D,EAAK,KAAK,KAAM,KAAK,SAAS,EAAG,KAAK,IAAI,KAAK,SAAS,EAAG,IAGjE,OAAO,EACF,KAAK,KAAK,QACV,gBAAgB,KAAK,GAAI,GACzB,gBAAgB,KAAK,GAAI,GACzB,gBAAgB,KAAK,GAAI,EAElC,CAUA,gBAAA,CAAiB,GAMb,OAHA,KAAK,WAAW,EAAO,OAAQ,IAGxB,GAAY,kBAAkB,EAAO,SAAW,EAAO,OAAS,EAAO,MAElF,CAWA,aAAA,CAAc,EAAO,EAAU,OAAO,SAElC,MAAM,EAAK,CAAC,KAAK,GAAI,KAAK,GAAI,KAAK,IAC7B,EAAK,CAAC,EAAM,GAAI,EAAM,GAAI,EAAM,IAChC,EAAK,CAAC,KAAK,SAAS,EAAG,KAAK,SAAS,EAAG,KAAK,SAAS,GACtD,EAAK,CAAC,EAAM,SAAS,EAAG,EAAM,SAAS,EAAG,EAAM,SAAS,GAGzD,EAAI,CAAC,CAAC,EAAG,EAAG,GAAI,CAAC,EAAG,EAAG,GAAI,CAAC,EAAG,EAAG,IAClC,EAAO,CAAC,CAAC,EAAG,EAAG,GAAI,CAAC,EAAG,EAAG,GAAI,CAAC,EAAG,EAAG,IAE3C,QAAS,EAAI,EAAG,EAAI,IAAK,EACrB,QAAS,EAAI,EAAG,EAAI,IAAK,EACrB,EAAE,GAAG,GAAK,EAAG,GAAG,IAAI,EAAG,IACvB,EAAK,GAAG,GAAK,KAAK,IAAI,EAAE,GAAG,IAAM,EAKzC,GAAY,WAAW,EAAM,OAAQ,KAAK,QAC1C,MAAM,EAAI,CACN,GAAY,IAAI,EAAG,IACnB,GAAY,IAAI,EAAG,IACnB,GAAY,IAAI,EAAG,KAGvB,IAAI,EAAI,EAGR,QAAS,EAAI,EAAG,EAAI,IAAK,EAGrB,GAFA,EAAK,EAAG,GACR,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC3D,KAAK,IAAI,EAAE,IAAM,EAAK,EAAI,SAIlC,QAAS,EAAI,EAAG,EAAI,IAAK,EAGrB,GAFA,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC/D,EAAK,EAAG,GACJ,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,EAAI,SAM9E,OAFA,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,KACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,IAErD,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GAC1C,EAAK,EAAG,GAAK,EAAK,GAAG,GAAK,EAAG,GAAK,EAAK,GAAG,GACtC,KAAK,IAAI,EAAE,GAAK,EAAE,GAAG,GAAK,EAAE,GAAK,EAAE,GAAG,IAAM,EAAK,UAKzD,CAUA,aAAA,CAAc,GAEV,OAA+C,OAAxC,KAAK,aAAa,EAAK,GAElC,CAYG,WAAA,CAAY,GACX,MAAM,EAAI,EAAM,OACV,EAAO,EAAE,SACf,GAAa,IAAT,EAAY,SAChB,MAAM,EAAO,GAAY,KAAK,GAAG,eAAe,EAAI,GAC9C,EAAI,KAAK,SAAS,EAAI,KAAK,IAAI,EAAK,IAAI,KAAK,KACzC,KAAK,SAAS,EAAI,KAAK,IAAI,EAAK,IAAI,KAAK,KACzC,KAAK,SAAS,EAAI,KAAK,IAAI,EAAK,IAAI,KAAK,KAEnD,OADU,EAAE,IAAI,KAAK,QAAU,EAAM,WACxB,EAAI,CACrB,CAUA,SAAA,CAAU,GAIN,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,CACxB,MAAM,EAAQ,EAAQ,OAAO,GAG7B,IAF0B,KAAK,YAAY,GAGvC,QAER,CACA,QACJ,CASG,eAAA,CAAgB,GAEf,GAAY,KAAK,GACjB,GAAY,IAAI,KAAK,QACrB,MAAM,EAAM,GAAW,KAAK,KAAK,gBAAgB,YACjD,GAAY,aAAa,GAEzB,IAAI,EAAK,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,SAAS,EAAI,GAAY,EAAG,GAAY,EAAI,KAAK,SAAS,IAC1F,EAAK,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,SAAS,EAAI,GAAY,EAAG,GAAY,EAAI,KAAK,SAAS,IAC1F,EAAK,KAAK,IAAI,EAAG,KAAK,KAAK,KAAK,SAAS,EAAI,GAAY,EAAG,GAAY,EAAI,KAAK,SAAS,IAC9F,OAAO,KAAK,KAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAC9C,CAUA,MAAA,GACI,MAAM,EAAK,KAAK,SACV,EAAI,KAAK,OACT,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAK,KAAK,GAGV,EAAU,EACZ,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,eAAe,EAAG,KACtC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,eAAe,EAAG,KACtC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,eAAe,EAAG,KACtC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,eAAe,EAAG,KACtC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,KACvC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,KACvC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,KACvC,IAAI,WAAU,KAAK,GACd,IAAI,EAAG,QAAQ,eAAe,EAAG,IACjC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,IAClC,IAAI,EAAG,QAAQ,gBAAgB,EAAG,KAWrC,GAAW,IAAI,kBAAiB,cAAc,GACpD,EAAS,SARK,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAMzB,EAAS,wBAGT,MAAM,EAAW,IAAI,oBAAkB,CAAE,MAAO,WAG1C,EAAY,IAAI,eAAa,EAAU,GAM7C,OAJA,EAAU,QAAU,KAChB,EAAS,UACT,EAAS,WAEN,CACX,ECjcJ,MAAM,GAKF,WAAA,GACI,KAAK,MAAQ,IAAI,IACjB,KAAK,MAAQ,IAAI,IACjB,KAAK,aACL,KAAK,YACT,CASA,GAAA,CAAI,EAAK,EAAM,MACP,KAAK,IAAI,GACT,KAAK,MAAM,IAAI,EAAK,IAGxB,KAAK,MAAM,IAAI,EAAK,GACpB,KAAK,MAAM,IAAI,EAAK,CAChB,gBACA,cAEc,MAAd,KAAK,OACL,KAAK,MAAQ,EACb,KAAK,MAAQ,GACN,GACP,KAAK,MAAM,IAAI,KAAK,OAAO,SAAW,EACtC,KAAK,MAAM,IAAI,GAAK,KAAO,KAAK,MAChC,KAAK,MAAQ,IAEb,KAAK,MAAM,IAAI,KAAK,OAAO,KAAO,EAClC,KAAK,MAAM,IAAI,GAAK,SAAW,KAAK,MACpC,KAAK,MAAQ,GAErB,CAOA,IAAA,GACI,OACI,IAAK,KAAK,MAAO,MAAO,KAAK,IAAI,KAAK,OAAQ,KAAM,IAAM,KAAK,KAAK,KAAK,OAAQ,SAAU,IAAM,KAEzG,CAOA,IAAA,GACI,OACI,IAAK,KAAK,MAAO,MAAO,KAAK,IAAI,KAAK,OAAQ,KAAM,IAAM,KAAM,SAAU,IAAM,KAAK,SAAS,KAAK,OAE3G,CAQA,GAAA,CAAI,GACA,OAAO,KAAK,MAAM,IAAI,EAC1B,CAQA,WAAA,CAAY,GACR,MAAM,EAAO,KAAK,MAAM,IAAI,GAC5B,OAAsB,GAAK,QAC/B,CAQA,aAAA,CAAc,GACV,OAAO,KAAK,IAAI,KAAK,YAAY,GACrC,CAQA,QAAA,CAAS,GACL,MAAM,EAAU,KAAK,YAAY,GACjC,OACI,IAAK,EACL,MAAO,KAAK,IAAI,GAChB,KAAM,IAAM,KAAK,KAAK,GACtB,SAAU,IAAM,KAAK,SAAS,GAEtC,CAQA,OAAA,CAAQ,GACJ,MAAM,EAAO,KAAK,MAAM,IAAI,GAC5B,OAAsB,GAAK,IAC/B,CAQA,SAAA,CAAU,GACN,OAAO,KAAK,IAAI,KAAK,QAAQ,GACjC,CAQA,IAAA,CAAK,GACD,MAAM,EAAU,KAAK,QAAQ,GAC7B,OACI,IAAK,EACL,MAAO,KAAK,IAAI,GAChB,KAAM,IAAM,KAAK,KAAK,GACtB,SAAU,IAAM,KAAK,SAAS,GAEtC,CAQA,MAAA,CAAO,GACH,MAAM,EAAO,KAAK,MAAM,IAAI,GAC5B,GAAY,MAAR,EACA,GAAoB,IAAhB,KAAK,OACL,KAAK,YACF,CACH,GAAI,IAAQ,KAAK,MAAO,CACpB,MAAM,EAAW,KAAK,MAAM,IAAI,KAAK,OACrC,KAAK,MAAM,IAAI,EAAS,MAAM,SAAW,KACzC,KAAK,MAAQ,EAAS,IAC1B,SAAW,IAAQ,KAAK,MAAO,CAC3B,MAAM,EAAW,KAAK,MAAM,IAAI,KAAK,OACrC,KAAK,MAAM,IAAI,EAAS,UAAU,KAAO,KACzC,KAAK,MAAQ,EAAS,QAC1B,KAAO,CACH,MAAM,EAAM,KAAK,MAAM,IAAI,GACrB,EAAO,KAAK,MAAM,IAAI,EAAI,UAC1B,EAAM,KAAK,MAAM,IAAI,EAAI,MAC/B,EAAK,KAAO,EAAI,KAChB,EAAI,SAAW,EAAI,QACvB,CACA,KAAK,MAAM,OAAO,GAClB,KAAK,MAAM,OAAO,EACtB,CAEJ,OAAO,CACX,CAQA,GAAA,CAAI,GACA,OAAO,KAAK,MAAM,IAAI,EAC1B,CAOA,IAAA,GACI,OAAO,KAAK,MAAM,IACtB,CAMA,KAAA,GACI,KAAK,MAAM,QACX,KAAK,MAAM,QACX,KAAK,aACL,KAAK,YACT,CAOA,IAAA,GACI,OAAO,KAAK,MAAM,MACtB,CAOA,MAAA,GACI,OAAO,KAAK,MAAM,QACtB,CAOA,OAAA,GACI,OAAO,KAAK,MAAM,SACtB,CAQA,OAAA,CAAQ,EAAQ,iBACZ,GAAc,kBAAV,EAA2B,CAC3B,MAAM,EAAe,GACrB,IAAI,EAAO,KAAK,MAChB,KAAe,MAAR,GACH,EAAa,KAAK,CAAE,IAAK,EAAM,MAAO,KAAK,IAAI,KAC/C,EAAO,KAAK,QAAQ,GAExB,OAAO,CACX,CACA,OAAO,MAAM,KAAK,KAAK,QAAQ,KAAK,KAAS,IAAK,EAAG,MAAO,KAAK,IAAI,MACzE,EClQJ,MAAM,GAAc,IAAI,YACjB,MAAM,GAET,WAAA,CAAY,EAAQ,EAAO,EAAc,GAErC,KAAK,OAAS,EACd,KAAK,UAAY,EAAQ,EACzB,KAAK,UAAY,EAEjB,IAAI,EAAS,KACb,GAAqB,IAAjB,EAEA,IACI,MAAM,EAAa,IAAI,WAAW,EAAQ,EAAO,GACjD,EAAS,KAAK,MAAM,GAAY,OAAO,GACzC,OACE,EAAS,EACV,MAIH,EAAS,GAGb,KAAK,OAAS,CAElB,CAEA,OAAA,GAEI,OAAO,OAAO,KAAK,KAAK,OAE5B,CAEA,OAAA,CAAQ,EAAK,EAAO,EAAuB,KAAM,EAAc,MAE3D,MAAM,EAAS,KAAK,OAEpB,KAAM,KAAO,GAET,OAAO,KAIX,MAAM,EAAU,EAAO,GACvB,GAAM,aAAmB,OAIlB,IAAI,MAAM,QAAQ,GAErB,OAAO,EAEJ,CAEH,MAAM,OAAE,EAAM,UAAE,EAAS,UAAE,GAAc,KACnC,EAAa,EAAQ,YAAc,EACnC,EAAc,EAAQ,MAAQ,EAC9B,EAAuB,EAAQ,eAAiB,EAEtD,GAAI,SAAU,GAAW,GAAe,EAAQ,OAAS,EAErD,MAAM,IAAI,MAAM,8DAIpB,IAAI,EAwBA,EAvBJ,OAAQ,GAEJ,IAAK,SACD,EAAS,EACT,MAEJ,IAAK,OACD,EAAS,EACT,MAEJ,IAAK,OACD,EAAS,EACT,MAEJ,IAAK,OACD,EAAS,EACT,MAEJ,QACI,MAAM,IAAI,MAAM,iDAAiD,OAKzE,MAAM,EAAa,EAAY,EACzB,EAAc,EAAQ,EAE5B,OAAQ,GAEJ,IAAK,OACD,EAAO,IAAI,UAAU,EAAQ,EAAY,GACzC,MAEJ,IAAK,gBACD,EAAO,IAAI,WAAW,EAAQ,EAAY,GAC1C,MAEJ,IAAK,QACD,EAAO,IAAI,WAAW,EAAQ,EAAY,GAC1C,MAEJ,IAAK,iBACD,EAAO,IAAI,YAAY,EAAQ,EAAY,GAC3C,MAEJ,IAAK,MACD,EAAO,IAAI,WAAW,EAAQ,EAAY,GAC1C,MAEJ,IAAK,eACD,EAAO,IAAI,YAAY,EAAQ,EAAY,GAC3C,MAEJ,IAAK,QACD,EAAO,IAAI,aAAa,EAAQ,EAAY,GAC5C,MAEJ,IAAK,SACD,EAAO,IAAI,aAAa,EAAQ,EAAY,GAC5C,MAEJ,QACI,MAAM,IAAI,MAAM,2DAA2D,OAKnF,GADgB,EAAa,EAAc,EAAK,kBAClC,EAAY,EAEtB,MAAM,IAAI,MAAM,+DAIpB,OAAO,CAEX,EA/FI,OAAO,CAiGf,EAIG,MAAM,WAAmB,GAE5B,WAAA,CAAY,EAAQ,EAAW,EAAO,EAAc,GAEhD,MAAM,EAAQ,EAAO,EAAc,GACnC,KAAK,UAAY,CAErB,CAEA,OAAA,CAAQ,EAAK,EAAgB,KAAM,EAAO,MAEtC,OAAO,MAAM,QAAQ,EAAK,KAAK,UAAW,EAAe,EAE7D,ECoKJ,SAAS,GAAiB,GAEzB,IAAI,EACA,EACA,EACA,KACA,EAAc,EAElB,QAAU,EAAI,EAAG,EAAI,EAAW,SAAW,EAAI,CAE9C,MAAM,EAAY,EAAY,GAG9B,YADK,IAA2B,EAAa,EAAU,MAAM,aACxD,IAAe,EAAU,MAAM,YAGnC,OADA,QAAQ,MAAO,6IACR,KAKR,YADK,IAAyB,EAAW,EAAU,UAC9C,IAAa,EAAU,SAG3B,OADA,QAAQ,MAAO,iIACR,KAKR,YADK,IAA2B,EAAa,EAAU,YAClD,IAAe,EAAU,WAG7B,OADA,QAAQ,MAAO,mIACR,KAKR,QADK,IAAkB,EAAU,EAAU,SACtC,IAAY,EAAU,QAG1B,OADA,QAAQ,MAAO,gIACR,KAIR,GAAe,EAAU,MAAQ,CAElC,CAEA,MAAM,EAAQ,IAAI,EAAY,GACxB,EAAS,IAAI,kBAAiB,EAAO,EAAU,GACrD,IAAI,EAAS,EAEb,QAAU,EAAI,EAAG,EAAI,EAAW,SAAW,EAAI,CAE9C,MAAM,EAAY,EAAY,GAC9B,GAAK,EAAU,6BAA+B,CAE7C,MAAM,EAAc,EAAS,EAC7B,QAAU,EAAI,EAAG,EAAI,EAAU,MAAO,EAAI,EAAG,IAE5C,QAAU,EAAI,EAAG,EAAI,EAAU,IAAO,CAErC,MAAM,EAAQ,EAAU,aAAc,EAAG,GACzC,EAAO,aAAc,EAAI,EAAa,EAAG,EAE1C,CAIF,MAEC,EAAM,IAAK,EAAU,MAAO,GAI7B,GAAU,EAAU,MAAQ,CAE7B,CAQA,gBANK,IAEJ,EAAO,QAAU,GAIX,CAER,CAwYA,SAAS,GAAqB,EAAU,GAEvC,GAAK,IAAa,oBAGjB,OADA,QAAQ,KAAM,2FACP,EAIR,GAAK,IAAa,uBAAuB,IAAa,wBAAwB,CAE7E,IAAI,EAAQ,EAAS,WAIrB,GAAe,OAAV,EAAiB,CAErB,MAAM,EAAU,GAEV,EAAW,EAAS,aAAc,YAExC,YAAK,EAcJ,OADA,QAAQ,MAAO,2GACR,EAZP,QAAU,EAAI,EAAG,EAAI,EAAS,MAAO,IAEpC,EAAQ,KAAM,GAIf,EAAS,SAAU,GACnB,EAAQ,EAAS,UASnB,CAIA,MAAM,EAAoB,EAAM,MAAQ,EAClC,EAAa,GAEnB,GAAK,IAAa,sBAIjB,QAAU,EAAI,EAAG,GAAK,EAAmB,IAExC,EAAW,KAAM,EAAM,KAAM,IAC7B,EAAW,KAAM,EAAM,KAAM,IAC7B,EAAW,KAAM,EAAM,KAAM,EAAI,SAQlC,QAAU,EAAI,EAAG,EAAI,EAAmB,IAElC,EAAI,GAAM,GAEd,EAAW,KAAM,EAAM,KAAM,IAC7B,EAAW,KAAM,EAAM,KAAM,EAAI,IACjC,EAAW,KAAM,EAAM,KAAM,EAAI,MAIjC,EAAW,KAAM,EAAM,KAAM,EAAI,IACjC,EAAW,KAAM,EAAM,KAAM,EAAI,IACjC,EAAW,KAAM,EAAM,KAAM,KAQzB,EAAW,OAAS,IAAQ,GAElC,QAAQ,MAAO,oGAMhB,MAAM,EAAc,EAAS,QAI7B,OAHA,EAAY,SAAU,GACtB,EAAY,cAEL,CAER,CAGC,OADA,QAAQ,MAAO,sEAAuE,GAC/E,CAIT,CCz4BA,MAAM,GACL,WAAA,CAAY,GACX,KAAK,WAAa,EAClB,KAAK,WAAa,IAAI,EAAM,QAE5B,KAAK,eAAiB,IAAI,EAAM,QAChC,KAAK,eAAe,IACnB,EAAG,EAAG,EAAG,EACT,EAAG,KAAO,EACV,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,EAEX,CAEA,SAAA,CAAU,EAAa,EAAc,EAAe,GACnD,MAAM,EAAO,KACP,EAAW,IAAI,SAAS,GAExB,EACL,OAAO,aAAa,EAAS,SAAS,IACtC,OAAO,aAAa,EAAS,SAAS,IACtC,OAAO,aAAa,EAAS,SAAS,IACtC,OAAO,aAAa,EAAS,SAAS,IACvC,QAAQ,OAAiB,SAAV,GAEf,MAAM,EAAa,EAAS,UAAU,MACtC,QAAQ,OAAO,IAAe,EAAY,YAE1C,MAAM,EAA6B,EAAS,UAAU,OAChD,EAA+B,EAAS,UAAU,OAClD,EAA2B,EAAS,UAAU,OAC9C,EAA6B,EAAS,UAAU,OAGhD,EAAe,IAAI,GAAa,EADZ,GAC4C,EAA4B,GAE5F,EAHoB,GAGkB,EAA6B,EACtD,IAAI,GAAW,EAAa,EAAa,QAAQ,gBAAiB,EAAiB,EAA0B,GAEhI,MAAM,EAAW,EAAkB,EAA2B,EAIxD,EAHW,IAAI,WAAW,EAAa,EAAU,EAAa,GAGxC,QAAQ,OAGpC,OAAO,IAAI,eAAe,EAAS,WAC5B,KAAK,yBACX,KAAK,WAAW,MAAM,EAAY,MAAM,IACvC,MAAM,EAAY,EAAa,QAAQ,cACnC,GACH,KAAK,WAAW,gBAAgB,EAAU,GAAI,EAAU,GAAI,EAAU,IACtE,EAAM,MAAM,aAAa,KAAK,aAClB,EAAM,SAAS,gBAAoB,EAAM,SAAS,eAAe,aAC7E,KAAK,WAAW,gBAAgB,EAAM,SAAS,eAAe,WAAW,OAAO,GAAI,EAAM,SAAS,eAAe,WAAW,OAAO,GAAI,EAAM,SAAS,eAAe,WAAW,OAAO,IACxL,EAAM,MAAM,aAAa,KAAK,aAG3B,GACH,EAAM,MAAM,aAAa,EAAK,gBAE/B,EAAM,MAAM,MAAQ,EAAM,MAC1B,EAAM,MAAM,UAAU,IAEjB,EAAE,SACD,GACH,EAAE,aAAa,EAAK,gBAEf,GACL,EAAa,GAIf,IAED,EAAQ,EAAM,MAAM,IAClB,IACF,QAAQ,MAAM,EAAM,GACnB,GAEJ,CAEA,uBAAyB,SACjB,IAAI,SAAS,IACnB,MAAM,EAAW,kBACV,KAAK,WAAW,iBAAkB,KAAK,WAAW,aAAkB,KAAK,WAAW,gBAAiB,KAAK,WAAW,aAC1H,cAAc,GACd,IACD,GACE,GAAG,IAGR,kBAAA,CAAmB,EAAa,EAAc,EAAU,EAAe,GAEtE,OAAO,KAAK,UAAU,EAAa,EAAc,EAAe,GAAc,MAAK,IAElF,IAAI,EACA,EAAa,GACb,EAAY,GAChB,EAAK,sBAAkB,GACvB,EAAK,UAAS,IACT,EAAM,SACT,EAAM,SAAS,aAAa,EAAM,aAClC,EAAW,KAAK,EAAM,UACtB,EAAU,KAAK,EAAM,UAEtB,IAED,IAAI,WAU8B,GAEpC,IAAI,EAAgB,IAAI,IACxB,SAAW,SAAQ,IAClB,QAAS,KAAa,EAAS,WAC9B,EAAc,IAAI,EACnB,IAID,EAAW,SAAQ,IAClB,EAAc,SAAQ,IACrB,IAAK,EAAS,WAAW,GAAY,CACpC,MAAM,WAYgB,GACzB,OAAQ,GACP,IAAK,WACL,IAAK,SACL,IAAK,QACJ,OAAO,EACR,IAAK,KACL,IAAK,MACJ,OAAO,EAER,QACC,MAAM,IAAI,MAAM,qBAAqB,KAExC,CAzBU,CAAiC,GACjC,EAAS,IAAI,aAAa,EAAgB,EAAS,aAAa,YAAY,OAAO,KAAK,GAC9F,EAAS,aAAa,EAAW,IAAI,EAAM,gBAAgB,EAAQ,GACpE,IACC,aDVsB,EAAY,MAErC,MAAM,EAAsC,OAA1B,EAAY,GAAI,MAE5B,EAAiB,IAAI,IAAK,OAAO,KAAM,EAAY,GAAI,aACvD,EAAsB,IAAI,IAAK,OAAO,KAAM,EAAY,GAAI,kBAE5D,EAAa,GACb,EAAkB,GAElB,EAAuB,EAAY,GAAI,qBAEvC,EAAiB,IAAI,iBAE3B,IAAI,EAAS,EAEb,QAAU,EAAI,EAAG,EAAI,EAAW,SAAW,EAAI,CAE9C,MAAM,EAAW,EAAY,GAC7B,IAAI,EAAkB,EAItB,GAAK,KAAmC,OAAnB,EAAS,OAG7B,OADA,QAAQ,MAAO,+EAAiF,EAAI,gIAC7F,KAMR,UAAY,KAAQ,EAAS,WAAa,CAEzC,IAAO,EAAe,IAAK,GAG1B,OADA,QAAQ,MAAO,+EAAiF,EAAI,gEAAkE,EAAO,gEACtK,cAIH,EAAY,KAAuB,EAAY,GAAS,IAE7D,EAAY,GAAO,KAAM,EAAS,WAAY,IAE9C,GAED,CAIA,GAAK,IAAoB,EAAe,KAGvC,OADA,QAAQ,MAAO,+EAAiF,EAAI,kEAC7F,KAMR,GAAK,IAAyB,EAAS,qBAGtC,OADA,QAAQ,MAAO,+EAAiF,EAAI,yEAC7F,KAIR,UAAY,KAAQ,EAAS,gBAAkB,CAE9C,IAAO,EAAoB,IAAK,GAG/B,OADA,QAAQ,MAAO,+EAAiF,EAAI,qEAC7F,UAIc,IAAjB,EAAiB,KAAuB,EAAiB,GAAS,IAEvE,EAAiB,GAAO,KAAM,EAAS,gBAAiB,GAEzD,CAEA,GAAK,EAAY,CAEhB,IAAI,EAEJ,GAAK,EAEJ,EAAQ,EAAS,MAAM,UAEjB,aAAK,EAAS,WAAW,SAO/B,OADA,QAAQ,MAAO,+EAAiF,EAAI,oEAC7F,KALP,EAAQ,EAAS,WAAW,SAAS,KAOtC,CAEA,EAAe,SAAU,EAAQ,EAAO,GAExC,GAAU,CAEX,CAED,CAIA,GAAK,EAAY,CAEhB,IAAI,EAAc,EAClB,MAAM,EAAc,GAEpB,QAAU,EAAI,EAAG,EAAI,EAAW,SAAW,EAAI,CAE9C,MAAM,EAAQ,EAAY,GAAI,MAE9B,QAAU,EAAI,EAAG,EAAI,EAAM,QAAU,EAEpC,EAAY,KAAM,EAAM,KAAM,GAAM,GAIrC,GAAe,EAAY,GAAI,WAAW,SAAS,KAEpD,CAEA,EAAe,SAAU,EAE1B,CAIA,UAAY,KAAQ,EAAa,CAEhC,MAAM,EAAkB,GAAiB,EAAY,IAErD,IAAO,EAGN,OADA,QAAQ,MAAO,kFAAoF,EAAO,eACnG,KAIR,EAAe,aAAc,EAAM,EAEpC,CAIA,UAAY,KAAQ,EAAkB,CAErC,MAAM,EAAkB,EAAiB,GAAQ,GAAI,OAErD,GAAyB,IAApB,EAAwB,MAE7B,EAAe,gBAAkB,EAAe,iBAAmB,GACnE,EAAe,gBAAiB,GAAS,GAEzC,QAAU,EAAI,EAAG,EAAI,IAAoB,EAAI,CAE5C,MAAM,EAAyB,GAE/B,QAAU,EAAI,EAAG,EAAI,EAAiB,GAAO,SAAW,EAEvD,EAAuB,KAAM,EAAiB,GAAQ,GAAK,IAI5D,MAAM,EAAuB,GAAiB,GAE9C,IAAO,EAGN,OADA,QAAQ,MAAO,kFAAoF,EAAO,oBACnG,KAIR,EAAe,gBAAiB,GAAO,KAAM,EAE9C,CAED,CAEA,OAAO,CAER,CCnLI,CAIsD,KAE1D,CAjCO,CAA6C,GAGjD,OAFA,EAAgB,IAAI,EAAM,cAAc,EAAgB,EAAW,GACnE,EAAc,YAAa,IAAI,EAAM,SAAU,WACxC,CAAa,GAGtB,ECzHD,eAAe,GAAG,EAAI,IACpB,IAAI,EACG,EAAI,EAAG,EAAqB,iBAAV,OAAoB,SAAW,kBAAoB,IAAK,EAAsB,iBAAX,UAAmD,OAA1B,EAAK,QAAQ,iBAA6B,EAAG,OAAyB,YAAhB,QAAQ,KACnL,GAAI,EAAG,CACL,MAAQ,cAAe,SAAY,QAAQ,UAAU,UAAW,KAChE,IAAI,EAAI,yKACV,CACA,IAA+C,EAA3C,EAAI,iBAAkB,SAAI,SAAA,IAAA,QAAA,OAAA,cAAA,YAAA,KAAA,IAAA,WAAA,GAAA,QAAA,eAAA,GAAA,KAAA,IAAA,IAAA,qBAAA,SAAA,SAAA,KAC9B,GAAI,EAAG,CACL,IAAI,EAAK,EAAE,MACX,EAAE,WAAW,UAAY,EAAE,QAAQ,QAAQ,EAAE,OAAO,cAAc,IAAK,EAAK,IAAO,EAAI,EAAG,GAAK,IAAI,IAAI,GAAK,EAAG,EAAG,aAAa,IAAK,EAAI,QAAQ,KAAK,SAAW,EAAI,QAAQ,KAAK,GAAG,QAAQ,MAAO,MAAO,QAAQ,KAAK,MAAM,EAC/N,SAAW,GAAK,EAAG,CACjB,IACE,IAAI,IAAI,IAAK,EACf,OACA,CACA,IAAM,EAAK,IACT,IAAI,EAAI,IAAI,eACZ,OAAO,EAAE,KAAK,MAAO,MAAQ,EAAE,aAAe,cAAe,EAAE,KAAK,MAAO,IAAI,WAAW,EAAE,WAEhG,CACA,IAAqE,EAAkD,EAAI,EAAI,EAAI,EAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAA9J,EAAK,QAAQ,IAAI,KAAK,SAAU,EAAI,QAAQ,MAAM,KAAK,SAAc,KAAS,EAAM,GAAM,EAAE,WAAW,WAA2D,KACtK,SAAS,IACP,IAAI,EAAI,EAAG,OACX,EAAK,IAAI,UAAU,GAAI,EAAI,IAAI,WAAW,GAAI,EAAE,OAAS,EAAI,IAAI,WAAW,GAAI,EAAI,IAAI,YAAY,GAAI,EAAI,IAAI,WAAW,GAAI,EAAI,IAAI,YAAY,GAAI,EAAE,QAAU,EAAK,IAAI,aAAa,GAAI,EAAK,IAAI,aAAa,GAAI,EAAK,IAAI,cAAc,GAAI,EAAK,IAAI,eAAe,EAC5Q,CACA,IAKI,EALA,EAAI,EAAG,EAAI,KACf,SAAS,EAAG,GACV,IAAI,EACJ,MAAyB,OAAlB,EAAI,EAAE,UAAoB,EAAE,KAAK,EAAG,GAA8B,EAA1B,EAAI,WAAa,EAAI,KAAW,KAAS,EAAI,IAAI,YAAY,aAAa,EAAI,4CAA2D,IAAG,GAAI,CACjM,CAoBA,IAAI,EAAM,IACR,KAAO,EAAI,EAAE,QAAU,EAAE,OAAF,CAAU,IAChC,EAAK,GAAI,EAAK,GAAI,EAAK,KACxB,IAAI,EAAI,EAAE,OAAO,QACjB,EAAG,KAAK,IAKP,EAAK,GAAI,EAAM,IAChB,KAAO,EAAE,QAAU,CACjB,IAAI,EAAI,EAAE,MACV,EAAE,KAAF,CAAQ,EACV,GAEF,SAAS,EAAE,GACT,OAAO,KAAK,EAAE,EAAE,GAAK,GACvB,CACA,IAAI,EAAI,GAAI,EAAI,GAAI,EAAK,GAAI,EAAK,cAAc,MAC9C,WAAA,CAAY,GACV,MAAM,GAAI,KAAK,KAAO,eACxB,GACC,EAAI,CAAC,EAAG,EAAG,KACZ,SAAS,EAAE,GACT,IAAI,EAAI,EAAE,IAAM,SAAW,EAAE,OAAQ,MAAM,IAAI,EAAG,mCAClD,QAAS,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,EAAE,EAAE,GAAI,EAAE,GAC/C,CACA,EAAE,SAAS,GAAM,EAAG,GAAK,IACzB,IAAI,EAAI,MAAM,EAAE,QAAS,EAAI,GAAI,EAAI,EACrC,EAAE,UAAS,EAAG,KACZ,EAAE,eAAe,GAAK,EAAE,GAAK,EAAE,IAAM,EAAE,KAAK,GAAI,EAAE,eAAe,KAAO,EAAE,GAAK,IAAK,EAAE,GAAG,WACvF,EAAE,GAAK,EAAE,KAAM,IAAS,EAAE,QAAU,EAAE,EAAE,IACvC,IACY,IAAb,EAAE,QAAgB,EAAE,IACvB,EAAK,IACN,QAAS,EAAI,KAAQ,CACnB,IAAI,EAAI,EAAE,KACV,IAAK,EAAG,OAAO,EACf,GAAK,OAAO,aAAa,EAC3B,GACC,EAAI,cAAc,MACnB,WAAA,CAAY,GACV,MAAM,GAAI,KAAK,KAAO,cACxB,GACC,EAAM,IACP,MAAM,IAAI,EAAE,IAWd,SAAS,EAAE,EAAG,EAAG,EAAI,IACnB,gBAVU,EAAG,EAAG,EAAI,IACpB,IAAI,EAAI,EAAE,KACV,IAAK,EAAG,MAAM,IAAI,EAAE,SAAS,kDAC7B,GAAI,EAAE,eAAe,GAAI,CACvB,GAAI,EAAE,GAAI,OACV,MAAM,IAAI,EAAE,yBAAyB,WACvC,CACA,EAAE,GAAK,SAAU,EAAG,GAAI,EAAE,eAAe,KAAO,EAAI,EAAE,UAAW,EAAE,GAAI,EAAE,SAAS,GAAM,MAC1F,CAEE,CAAU,EAAG,EAAG,EAClB,CACA,IAAI,EAAK,CAAC,EAAG,EAAG,KACd,OAAQ,GACN,KAAK,EACH,OAAO,EAAK,GAAM,EAAG,GAAM,GAAM,EAAE,GACrC,KAAK,EACH,OAAO,EAAK,GAAM,EAAE,GAAK,GAAM,GAAM,EAAE,GAAK,GAC9C,KAAK,EACH,OAAO,EAAK,GAAM,EAAE,GAAK,GAAM,GAAM,EAAE,GAAK,GAC9C,KAAK,EACH,OAAO,EAAK,GAAM,EAAG,GAAK,GAAM,GAAM,EAAG,GAAK,GAChD,QACE,MAAM,IAAI,UAAU,0BAA0B,OAAO,OAExD,EAAM,IACP,MAAM,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,KAAO,8BAC1B,KAAS,GAAK,OACd,GAAK,UAAa,qBAAuB,KAAO,GAAK,GAAM,EAAG,IAAM,EAAK,IAAI,sBAAsB,OACpG,EAAI,EAAE,GAAO,MAAM,MAAyB,IAAlB,EAAE,MAAM,QAAgB,EAAE,EAAI,EAAE,EAAE,EAAE,EAAE,GAAK,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,IAIjF,GAAM,IACP,EAAG,WAAW,KAJZ,GAAK,IACP,IAAI,EAAI,EAAE,EACV,OAAO,EAAE,GAAK,EAAG,SAAS,EAAG,CAAE,EAAG,GAAK,GAAI,IAGxC,IACL,SAAS,KACT,CACA,IAAI,GAAK,CAAC,EAAG,IAAM,OAAO,eAAe,EAAG,OAAQ,CAAE,MAAO,IAAM,GAAK,GAAI,GAAK,CAAC,EAAG,EAAG,KACtF,YAAI,EAAE,GAAG,EAAc,CACrB,IAAI,EAAI,EAAE,GACV,EAAE,GAAK,YAAY,GACjB,IAAK,EAAE,GAAG,EAAE,eAAe,EAAE,QAAS,MAAM,IAAI,EAAE,aAAa,kDAAkD,EAAE,6BAA6B,EAAE,GAAG,OACrJ,OAAO,EAAE,GAAG,EAAE,EAAE,QAAQ,MAAM,KAAM,EACtC,EAAG,EAAE,GAAG,EAAI,GAAI,EAAE,GAAG,EAAE,EAAE,IAAM,CACjC,GACC,GAAK,CAAC,EAAG,EAAG,KACb,GAAI,EAAE,eAAe,GAAI,CACvB,YAAI,YAAgB,EAAE,GAAG,YAAgB,EAAE,GAAG,EAAE,GAAe,MAAM,IAAI,EAAE,gCAAgC,YAC3G,GAAI,GAAG,EAAG,EAAG,GAAI,EAAE,GAAG,EAAE,eAAe,GAAI,MAAM,IAAI,EAAE,uFAAuF,OAC9I,EAAE,GAAG,EAAE,GAAK,CACd,MAAO,EAAE,GAAK,EAAG,EAAE,GAAG,GAAK,GAM7B,SAAS,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC/B,KAAK,KAAO,EAAG,KAAK,YAAc,EAAG,KAAK,EAAI,EAAG,KAAK,EAAI,EAAG,KAAK,EAAI,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAC5H,CACA,IAAI,GAAK,CAAC,EAAG,EAAG,KACd,KAAO,IAAM,GAAK,CAChB,IAAK,EAAE,GAAI,MAAM,IAAI,EAAE,gCAAgC,EAAE,4BAA4B,EAAE,QACvF,EAAI,EAAE,GAAG,GAAI,EAAI,EAAE,CACrB,CACA,OAAO,GACN,GAAM,IACP,GAAU,OAAN,EAAY,MAAO,OACvB,IAAI,SAAW,EACf,MAAa,WAAN,GAAwB,UAAN,GAAuB,aAAN,EAAmB,EAAE,WAAa,GAAK,GAEnF,SAAS,GAAG,EAAG,GACb,GAAU,OAAN,EAAY,CACd,GAAI,KAAK,GAAI,MAAM,IAAI,EAAE,uBAAuB,KAAK,QACrD,OAAO,CACT,CACA,IAAK,EAAE,EAAG,MAAM,IAAI,EAAE,gBAAgB,GAAG,YAAY,KAAK,QAC1D,IAAK,EAAE,EAAE,EAAG,MAAM,IAAI,EAAE,mDAAmD,KAAK,QAChF,OAAO,GAAG,EAAE,EAAE,EAAG,EAAE,EAAE,EAAE,EAAG,KAAK,EACjC,CACA,SAAS,GAAG,EAAG,GACb,GAAU,OAAN,EAAY,CACd,GAAI,KAAK,GAAI,MAAM,IAAI,EAAE,uBAAuB,KAAK,QACrD,GAAI,KAAK,GAAI,CACX,IAAI,EAAI,KAAK,KACb,OAAa,OAAN,GAAc,EAAE,KAAK,KAAK,EAAG,GAAI,CAC1C,CACA,OAAO,CACT,CACA,IAAK,IAAM,EAAE,EAAG,MAAM,IAAI,EAAE,gBAAgB,GAAG,YAAY,KAAK,QAChE,IAAK,EAAE,EAAE,EAAG,MAAM,IAAI,EAAE,mDAAmD,KAAK,QAChF,IAAK,KAAK,IAAM,EAAE,EAAE,EAAE,GAAI,MAAM,IAAI,EAAE,mCAAmC,EAAE,EAAE,EAAI,EAAE,EAAE,EAAE,KAAO,EAAE,EAAE,EAAE,0BAA0B,KAAK,QACnI,GAAI,EAAI,GAAG,EAAE,EAAE,EAAG,EAAE,EAAE,EAAE,EAAG,KAAK,GAAI,KAAK,GAAI,CAC3C,YAAI,EAAE,EAAE,EAAc,MAAM,IAAI,EAAE,mDAClC,OAAQ,KAAK,IACX,KAAK,EACH,GAAI,EAAE,EAAE,IAAM,KACT,MAAM,IAAI,EAAE,mCAAmC,EAAE,EAAE,EAAI,EAAE,EAAE,EAAE,KAAO,EAAE,EAAE,EAAE,0BAA0B,KAAK,QAD1F,EAAI,EAAE,EAAE,EAE5B,MACF,KAAK,EACH,EAAI,EAAE,EAAE,EACR,MACF,KAAK,EACH,GAAI,EAAE,EAAE,IAAM,KAAM,EAAI,EAAE,EAAE,MACvB,CACH,IAAI,EAAI,EAAE,QACV,EAAI,KAAK,GAAG,EAAG,QAAS,EAAE,YAAkB,OAAN,GAAc,EAAE,KAAK,KAAK,EAAG,EACrE,CACA,MACF,QACE,MAAM,IAAI,EAAE,+BAElB,CACA,OAAO,CACT,CACA,SAAS,GAAG,EAAG,GACb,GAAU,OAAN,EAAY,CACd,GAAI,KAAK,GAAI,MAAM,IAAI,EAAE,uBAAuB,KAAK,QACrD,OAAO,CACT,CACA,IAAK,EAAE,EAAG,MAAM,IAAI,EAAE,gBAAgB,GAAG,YAAY,KAAK,QAC1D,IAAK,EAAE,EAAE,EAAG,MAAM,IAAI,EAAE,mDAAmD,KAAK,QAChF,GAAI,EAAE,EAAE,EAAE,GAAI,MAAM,IAAI,EAAE,mCAAmC,EAAE,EAAE,EAAE,0BAA0B,KAAK,QAClG,OAAO,GAAG,EAAE,EAAE,EAAG,EAAE,EAAE,EAAE,EAAG,KAAK,EACjC,CACA,IAAI,GAAK,CAAC,EAAG,EAAG,IAAM,IAAM,EAAI,WAAI,EAAE,GAAgD,QAAzB,EAAI,GAAG,EAAG,EAAG,EAAE,IAAvB,KAA+C,EAAE,GAAG,GAAK,GAAK,GAIhH,GAAK,CAAC,EAAG,KACV,IAAK,EAAE,IAAM,EAAE,EAAG,MAAM,IAAI,EAAG,4CAC/B,KAAM,EAAE,KAAO,EAAE,EAAG,MAAM,IAAI,EAAG,oDACjC,OAAO,EAAE,MAAQ,CAAE,MAAO,GAAK,GAAE,OAAO,OAAO,EAAG,CAAE,EAAG,CAAE,MAAO,EAAG,eAAU,EAE/E,SAAS,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACxC,KAAK,KAAO,EAAG,KAAK,EAAI,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,GAAK,EAAG,KAAK,EAAI,EAAG,YAAK,EAAE,EAAe,KAAK,EAAI,IAAM,KAAK,EAAI,EAAI,GAAK,GAAI,KAAK,EAAI,KACrN,CACA,IAGG,GAHC,GAAK,CAAC,EAAG,EAAG,KACd,IAAK,EAAE,eAAe,GAAI,MAAM,IAAI,EAAG,gDACvC,EAAE,GAAG,YAAgB,EAAe,EAAE,GAAG,EAAE,GAAK,GAAK,EAAE,GAAK,EAAG,EAAE,GAAG,GAAK,IACpE,GAAI,CAAC,EAAG,KACb,EAAI,EAAE,GACN,IAAI,EAAI,GAAG,IAAI,GACf,GAAgB,mBAAL,EAAiB,MAAM,IAAI,EAAE,2CAA2C,MAAM,KACzF,OAAO,GAET,MAAM,WAAW,OAEjB,IAAI,GAAM,IACR,EAAI,GAAG,GACP,IAAI,EAAI,EAAE,GACV,OAAO,GAAE,GAAI,GACZ,GAAK,CAAC,EAAG,KAIV,IAAI,EAAI,GAAI,EAAI,GAChB,MAAM,EAAE,kBAJC,EAAE,GACT,EAAE,IAAM,EAAE,KAAO,EAAG,GAAK,EAAG,GAAG,QAAQ,IAAM,EAAE,KAAK,GAAI,EAAE,OAC5D,IAEoB,IAAI,GAAG,GAAG,MAAQ,EAAE,IAAI,IAAI,KAAK,CAAC,SACrD,GAAK,CAAC,EAAG,KACV,QAAS,EAAI,GAAI,EAAI,EAAG,EAAI,EAAG,IAAK,EAAE,KAAK,EAAE,EAAI,EAAI,GAAK,IAC1D,OAAO,GAET,SAAS,GAAG,GACV,QAAS,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,GAAa,OAAT,EAAE,aAAe,EAAE,GAAG,EAAc,SAC3E,QACF,CACA,SAAS,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GACzB,IAAI,EAAI,EAAE,OACV,GAAI,EAAI,EAAG,MAAM,IAAI,EAAE,kFACvB,IAAI,EAAa,OAAT,EAAE,IAAqB,OAAN,EAAY,EAAI,GAAG,GAC5C,GAAK,EAAE,GAAG,GACV,IAAI,EAAI,EAAE,GAAI,EAAI,EAAE,GACpB,IAAK,EAAI,CAAC,EAAG,EAAI,EAAG,EAAG,EAAI,EAAE,EAAE,KAAK,GAAyB,GAAE,EAAE,KAAK,IAAK,EAAI,EAAG,EAAI,IAAK,EAAG,EAAI,EAAE,GAAI,EAAE,KAAK,EAAE,EAAE,KAAK,IACxH,IAAK,EAAG,IAAK,EAAI,EAAI,EAAI,EAAG,EAAI,EAAE,SAAU,EAAc,OAAX,EAAE,GAAG,GAAc,EAAE,KAAK,EAAE,GAAG,GAC9E,IAAK,EAAI,GAAG,GAAI,EAAI,EAAE,OAAS,EAAG,EAAI,GAAI,EAAI,CAAC,MAAO,GAAK,EAAE,KAAK,aAAc,EAAI,EAAG,EAAI,IAAK,EAAG,EAAE,KAAK,MAAM,KAAM,EAAE,KAAK,MAAM,UACnI,EAAI,EAAE,KAAK,KAAM,EAAI,EAAE,KAAK,KAAM,EAAI,oBAAoB,SAC3D,IAAM,GAAK,2BAEV,IAAI,EAAI,EAAI,cAAgB,OAAQ,EAAI,qFAAqF,MAAM,KACnI,IAAK,IAAM,GAAK,oCAAoC,eACpD,EAAI,EAAG,EAAI,IAAK,EAAG,CACjB,IAAI,EAAI,QAAQ,QAChB,GAAK,UAAU,YAAY,KAAK,SAAS,QAC5C,EAAE,KAAK,EACN,CACA,GAAI,IAAM,GAAK,EAAI,YAAc,IAAM,WAAW,QACnD,EAAG,GAAK,sCAEF,IAAK,EAAI,EAAI,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,EAAU,IAAN,EAAU,YAAc,OAAS,EAAI,GAAK,QAAoB,OAAX,EAAE,GAAG,IAAe,GAAK,GAAG,UAAU,QAC1I,EAAE,KAAK,GAAG,WACT,OAAO,IAAM,GAAK,6CAElB,EAAI,IAAI,SAAS,EAAG,EAAI,MAApB,IACF,GAAI,GAAG,EAAG,EACd,CACA,QAmJG,GAnJM,GAAM,IAEb,MAAM,GADN,EAAI,EAAE,QACM,QAAQ,KACpB,WAAO,EAAW,EAAI,EAAE,MAAM,EAAG,IAChC,GAAK,GAAI,GAAI,CAAC,EAAG,EAAC,CAAI,EAAG,KAAM,KAAO,KAAO,GAAI,GAAM,IACxD,EAAI,GAAoB,KAAb,GAAE,EAAI,KAAa,GAAE,UAAa,GAAG,KAAK,KACpD,GAAM,IACP,IAAK,EAAG,MAAM,IAAI,EAAE,oCAAoC,KACxD,OAAO,GAAE,IACR,GAAM,IACP,OAAQ,GACN,YACE,OAAO,EACT,KAAK,KACH,OAAO,EACT,OACE,OAAO,EACT,OACE,OAAO,EACT,QACE,MAAM,EAAI,GAAG,OAAS,GAAE,OACxB,OAAO,GAAE,GAAK,EAAG,GAAE,EAAI,GAAK,EAAG,IAElC,GAAK,CAAE,KAAM,kBAAmB,EAAI,IACrC,IAAI,EAAI,GAAG,GACX,OAAO,GAAG,GAAI,GACb,EAAG,CAAC,EAAG,IAAM,GAAG,GAAI,EAAG,EAAG,EAAG,MAAQ,GAAK,CAAC,EAAG,EAAG,KAClD,OAAQ,GACN,KAAK,EACH,OAAO,EAAI,SAAS,GAClB,OAAO,KAAK,EAAE,EAAG,GACnB,EAAI,SAAS,GACX,OAAO,KAAK,EAAE,EAAE,GAClB,EACF,KAAK,EACH,OAAO,EAAI,SAAS,GAClB,OAAO,KAAK,EAAE,EAAE,GAAK,GACvB,EAAI,SAAS,GACX,OAAO,KAAK,EAAE,EAAE,GAAK,GACvB,EACF,KAAK,EACH,OAAO,EAAI,SAAS,GAClB,OAAO,KAAK,EAAE,EAAE,GAAK,GACvB,EAAI,SAAS,GACX,OAAO,KAAK,EAAE,EAAE,GAAK,GACvB,EACF,QACE,MAAM,IAAI,UAAU,0BAA0B,OAAO,OAExD,GAAK,CAAC,EAAG,KACV,IAAI,EAAI,EAAE,GACV,YAAI,EAAc,MAAM,EAAI,GAAG,sBAAsB,GAAG,KAAM,IAAI,EAAE,GACpE,OAAO,GACN,GAAK,CAAC,EAAG,KACV,OAAQ,GACN,KAAK,EACH,OAAO,SAAS,GACd,OAAO,KAAK,EAAE,EAAG,GAAK,GACxB,EACF,KAAK,EACH,OAAO,SAAS,GACd,OAAO,KAAK,EAAE,EAAG,GAAK,GACxB,EACF,QACE,MAAM,IAAI,UAAU,wBAAwB,OAAO,OAEtD,GAAK,OAAO,OAAO,CAAE,aAAgB,IAAK,GAAI,CAAC,EAAG,EAAG,KACtD,IAAI,EAAI,EACR,KAAM,EAAI,GAAI,OAAO,EACrB,IAAI,EAAI,EACR,EAAI,EAAI,EAAI,EACZ,QAAS,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,CACjC,IAAI,EAAI,EAAE,YAAY,GACtB,GAAI,KAAO,EAAG,CACZ,GAAI,GAAK,EAAG,MACZ,EAAE,KAAO,CACX,SAAW,MAAQ,EAAG,CACpB,GAAI,EAAI,GAAK,EAAG,MAChB,EAAE,KAAO,IAAM,GAAK,EAAG,EAAE,KAAO,IAAU,GAAJ,CACxC,SAAW,OAAS,EAAG,CACrB,GAAI,EAAI,GAAK,EAAG,MAChB,EAAE,KAAO,IAAM,GAAK,GAAI,EAAE,KAAO,IAAM,GAAK,EAAI,GAAI,EAAE,KAAO,IAAU,GAAJ,CACrE,KAAO,CACL,GAAI,EAAI,GAAK,EAAG,MAChB,EAAE,KAAO,IAAM,GAAK,GAAI,EAAE,KAAO,IAAM,GAAK,GAAK,GAAI,EAAE,KAAO,IAAM,GAAK,EAAI,GAAI,EAAE,KAAO,IAAU,GAAJ,EAAQ,GAC1G,CACF,CACA,OAAO,EAAE,GAAK,EAAG,EAAI,GACpB,GAAM,IACP,QAAS,EAAI,EAAG,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,CACxC,IAAI,EAAI,EAAE,WAAW,GACrB,KAAO,EAAI,IAAM,MAAQ,EAAI,GAAK,EAAI,OAAS,GAAK,OAAS,GAAK,GAAK,IAAK,GAAK,GAAK,CACxF,CACA,OAAO,GACN,GAAK,IAAI,YAAe,GAAK,CAAC,EAAG,EAAG,EAAG,KACxC,GAAI,EAAI,EAAI,EAAG,EAAG,OAAO,EACzB,KAAO,EAAE,MAAQ,GAAK,MAAQ,EAC9B,OAAO,GACN,GAAK,IAAI,YAAY,YAAa,GAAK,CAAC,EAAG,EAAG,KAAO,IAAM,EAAG,GAAG,OAAO,EAAE,SAAS,EAAG,GAAG,EAAG,EAAG,EAAI,EAAG,MAAO,GAAK,CAAC,EAAG,EAAG,KAC1H,GAAI,IAAM,EAAI,YAAa,EAAI,EAAG,OAAO,EAEzC,IAAI,EAAI,EACR,GAFA,GAAK,GAEG,EAAI,EAAE,OAAS,EAAI,EAAI,EAAE,OACjC,QAAS,EAAI,EAAG,EAAI,IAAK,EAAG,EAAE,GAAK,GAAK,EAAE,WAAW,GAAI,GAAK,EAC9D,OAAO,EAAE,GAAK,GAAK,EAAG,EAAI,GACzB,GAAM,GAAM,EAAI,EAAE,OAAQ,GAAK,CAAC,EAAG,EAAG,KACvC,IAAI,EAAI,GACR,IAAM,EACN,QAAS,EAAI,IAAK,GAAK,EAAI,GAAI,IAAK,CAClC,IAAI,EAAI,EAAE,EAAI,GACd,IAAK,IAAM,EAAG,MACd,GAAK,OAAO,cAAc,EAC5B,CACA,OAAO,GACN,GAAK,CAAC,EAAG,EAAG,KACb,GAAI,IAAM,EAAI,YAAa,EAAI,EAAG,OAAO,EACzC,IAAI,EAAI,EACR,EAAI,EAAI,EAAI,EACZ,QAAS,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,CACjC,IAAI,EAAI,EAAE,YAAY,GACtB,GAAI,MAAQ,GAAK,IAAK,EAAE,GAAK,GAAK,GAAG,GAAK,GAAO,EAAI,EAAG,KAC1D,CACA,OAAO,EAAE,GAAK,GAAK,EAAG,EAAI,GACzB,GAAM,IACP,QAAS,EAAI,EAAG,EAAI,EAAG,EAAI,EAAE,SAAU,EAAG,MAAQ,EAAE,YAAY,IAAM,IAAK,GAAK,EAChF,OAAO,GACN,GAAK,GAML,GAAK,CAAC,EAAG,EAAG,KACb,IAAI,EAAI,GACR,OAAO,EAAI,EAAE,EAAG,GAAI,EAAE,SAAW,EAAE,GAAK,GAAK,GAAG,IAAK,GACpD,GAAK,GAAI,GAAM,IAChB,IAAI,EAAI,GAAG,GACX,gBAAO,EAAe,EAAE,GAAK,GAC5B,GAAK,GAAI,GAAK,KACf,IAAK,GAAI,CACP,IAA0N,EAAtN,EAAI,CAAE,KAAM,WAAY,QAAS,WAAY,KAAM,IAAK,IAAK,IAAK,KAAM,iBAAkB,MAA2B,iBAAb,WAAyB,UAAU,UAAY,KAAK,QAAQ,IAAK,KAAO,SAAU,EAAG,GAAK,kBACtM,IAAK,KAAK,YAAI,GAAG,UAAuB,EAAE,GAAK,EAAE,GAAK,GAAG,GACzD,IAAI,EAAI,GACR,IAAK,KAAK,EAAG,EAAE,KAAK,GAAG,KAAK,EAAE,MAC9B,GAAK,CACP,CACA,OAAO,IACF,GAAK,CAAC,KAAM,GAAI,IAAK,GAAI,IAAI,WAAW,KAAM,GAAI,GAAI,GAAK,KAAK,GAAG,GAAE,GAAK,IAAK,GAAK,GAAG,GAAE,GAAK,IAAK,GAAG,GAAE,GAAK,IAAK,GAAK,GAC9H,GAAE,IAAM,GAAI,GAAE,IAAM,SAClB,IAAI,EAAI,GAAG,UACX,OAAO,OAAO,EAAG,CAAE,UAAW,SAAS,GACrC,KAAM,gBAAgB,IAAM,aAAa,IAAK,SAC9C,IAAI,EAAI,KAAK,EAAE,EAAE,EAAG,EAAI,KAAK,EAAE,EAC/B,EAAE,EAAI,EAAE,EACR,IAAI,EAAI,EAAE,EAAE,EAAE,EACd,IAAK,EAAI,EAAE,EAAE,EAAG,EAAE,GAAK,EAAI,EAAE,GAAG,GAAI,EAAI,EAAE,EAC1C,KAAO,EAAE,GAAK,EAAI,EAAE,GAAG,GAAI,EAAI,EAAE,EACjC,OAAO,IAAM,GAAK,IAAM,CAC1B,EAAG,MAAO,WACR,GAAI,KAAK,EAAE,GAAK,EAAG,MAAO,KAAK,EAAE,GAAI,OAAO,KAAK,EAAE,MAAM,OAAS,EAAG,KACrE,IAAI,EAAI,GAAG,EAAI,OAAQ,EAAI,EAAE,OAAQ,EAAI,OAAO,eAAe,MAAO,EAAI,KAAK,EAC/E,OAAO,EAAI,EAAE,EAAE,KAAK,EAAG,EAAG,CAAE,EAAG,CAAE,MAAO,CAAE,MAAO,EAAE,MAAO,GAAI,EAAE,GAAI,GAAI,EAAE,GAAI,EAAG,EAAE,EAAG,EAAG,EAAE,EAAG,EAAG,EAAE,EAAG,EAAG,EAAE,QAAa,EAAE,MAAM,OAAS,EAAG,EAAE,EAAE,MAAS,CAC3J,EAAG,SACD,GAAI,KAAK,EAAE,GAAK,EAAG,MAAO,KAAK,EAAE,KAAO,KAAK,EAAE,GAAI,MAAM,IAAI,EAAE,yCAC/D,GAAG,MACH,IAAI,EAAI,KAAK,IACX,EAAE,MAAM,MAAyB,IAAlB,EAAE,MAAM,QAAgB,EAAE,EAAI,EAAE,EAAE,EAAE,EAAE,GAAK,EAAE,EAAE,EAAE,EAAE,EAAE,IAAK,KAAK,EAAE,KAAO,KAAK,EAAE,SAAY,KAAK,EAAE,SACrH,EAAG,UAAW,WACZ,OAAQ,KAAK,EAAE,CACjB,EAAG,YAAa,WACd,GAAI,KAAK,EAAE,GAAK,EAAG,MAAO,KAAK,EAAE,KAAO,KAAK,EAAE,GAAI,MAAM,IAAI,EAAE,yCAC/D,OAAO,KAAK,EAAE,MAAS,IACzB,IACA,MAAM,EAAI,OAAO,QACjB,IAAM,EAAE,GAAK,EAAE,OAChB,EA3BmB,GA2Bd,OAAO,OAAO,GAAG,UAAW,CAAE,EAAA,CAAG,GACrC,OAAO,KAAK,KAAO,EAAI,KAAK,GAAG,IAAK,CACtC,EAAG,EAAA,CAAG,GACJ,IAAI,EACY,OAAf,EAAI,KAAK,IAAc,EAAE,KAAK,KAAM,EACvC,EAAG,EAAG,EAAG,EAAG,SAAS,GACnB,SAAS,IACP,OAAO,KAAK,GAAK,GAAG,KAAK,EAAE,EAAG,CAAE,EAAG,KAAK,GAAI,EAAG,EAAG,EAAG,KAAM,EAAG,IAAO,GAAG,KAAK,EAAE,EAAG,CAAE,EAAG,KAAM,EAAG,GAClG,CACA,IAAI,EAAI,KAAK,GAAG,GAChB,IAAK,EAAG,OAAO,KAAK,GAAG,GAAI,KAC3B,IAAI,IAhQuH,EAAG,KAC9H,YAAI,EAAc,MAAM,IAAI,EAAE,+BAC9B,KAAO,EAAE,GAAK,EAAI,EAAE,GAAG,GAAI,EAAI,EAAE,EACjC,OAAO,GAAG,EAAE,EA6PR,CAAO,KAAK,EAAG,GACnB,YAAI,EACF,OAA2B,IAApB,EAAE,EAAE,MAAM,OAAe,EAAE,EAAE,EAAI,EAAG,EAAE,EAAE,EAAI,EAAG,EAAE,UAAY,EAAI,EAAE,QAAS,KAAK,GAAG,GAAI,GACjG,GAAI,EAAI,KAAK,EAAE,GAAG,KAAI,EAAI,GAAG,IAAQ,OAAO,EAAE,KAAK,MACnD,EAAI,KAAK,GAAK,EAAE,GAAK,EAAE,YACvB,IAAI,EAAI,GAAG,EAAG,KAAK,EAAG,EAAE,GACxB,OAAa,OAAN,EAAa,EAAE,KAAK,MAAQ,KAAK,GAAK,GAAG,EAAE,EAAE,EAAG,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,KAAM,EAAG,IAAO,GAAG,EAAE,EAAE,EAAG,CAAE,EAAG,EAAG,EAAG,GAC/G,IAAM,EAAE,QAAU,EAAK,EAAE,OAAQ,EAAE,WAAa,EAAI,EAAE,UAAW,EAAE,aAAe,EAAK,EAAE,YAAa,EAAE,cAAgB,EAAI,EAAE,aAC9H,IAAI,GAAI,GAAI,GAAG,GAAK,CAAE,EAAG,IAAM,EAAG,IAAK,EAAI,IACzC,IAAI,EAAI,EAAG,UACJ,EAAG,GACV,IAAI,EAAI,EAAE,GAAI,EAAI,EAAE,EAAG,EAAI,EAAE,GAAI,EAAI,EAAE,KAAK,GAAM,EAAE,KAAI,OAAO,EAAE,KAAK,GAAM,EAAE,MAC9E,EAAE,CAAC,GAAI,GAAI,IACT,IAAI,EAAI,GACR,OAAO,EAAE,UAAS,EAAG,KACnB,IAAI,EAAI,EAAE,GAAI,EAAI,EAAE,GAAI,EAAI,EAAE,GAAI,EAAI,EAAE,EAAI,EAAE,QAAS,EAAI,EAAE,GAAI,EAAI,EAAE,GACvE,EAAE,EAAE,IAAM,CAAE,KAAO,GAAM,EAAE,EAAE,EAAE,EAAG,IAAK,MAAO,CAAC,EAAG,KAChD,IAAI,EAAI,GACR,EAAE,EAAG,EAAG,EAAE,EAAE,EAAG,IAAK,EAAG,IACtB,SAAU,EAAE,GAAG,SAAU,IAC1B,CAAC,CAAE,KAAM,EAAE,KAAM,EAAI,IACvB,IAAY,EAAR,EAAI,GACR,IAAK,KAAK,EAAG,EAAE,GAAK,EAAE,GAAG,KAAK,GAC9B,OAAO,EAAE,GAAI,GACZ,EAAG,CAAC,EAAG,KACR,QAAS,KAAK,EAAG,KAAM,KAAK,KAAK,EAAE,GAAG,SAAW,MAAM,IAAI,UAAU,mBAAmB,MACxF,IAAI,EAAI,IACR,IAAK,KAAK,EAAG,EAAE,GAAG,MAAM,EAAG,EAAE,IAC7B,OAAa,OAAN,GAAc,EAAE,KAAK,EAAG,GAAI,GAClC,EAAG,EAAG,EAAG,GAAI,KAEjB,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,KACjB,EAAI,EAAE,GACN,IAAI,EAAK,GAAM,EACf,GAFU,EAAU,KAAN,EAEP,CACL,MAAM,EAAI,EAAI,EACd,EAAK,GAAM,OAAO,QAAQ,EAAG,GAAI,EAAI,EAAE,EACzC,CACA,EAAE,EAAG,CAAE,KAAM,EAAG,EAAG,EAAG,EAAG,CAAC,EAAG,KAAmB,iBAAL,IAAkB,EAAI,OAAO,IAAK,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,QACpG,EAAG,CAAC,EAAG,EAAG,EAAG,KACJ,EAAE,EAAG,CAAE,KAAjB,EAAI,EAAE,GAAoB,EAAG,SAAS,GACpC,QAAS,CACX,EAAG,EAAG,SAAS,EAAG,GAChB,OAAO,EAAI,EAAI,CACjB,EAAG,EAAG,SAAS,GACb,OAAO,KAAK,EAAE,EAAE,GAClB,EAAG,EAAG,QACL,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KACzC,EAAI,EAAE,GAAI,EAAI,GAAE,EAAG,GAAI,IAAM,EAAI,GAAE,EAAG,IAAK,IAAM,EAAI,GAAE,EAAG,IAAK,EAAI,GAAE,EAAG,GACxE,IA1XO,EAEH,EAwXA,EAvXG,KADH,GADJ,GADO,EA0XI,GAzXL,QAAQ,iBAAkB,MACtB,WAAW,KACH,IAAM,EAAI,IAAI,IAAM,EAwXtC,GAAG,cACD,GACE,oBAAoB,yBACpB,CAAC,GAEL,IAAI,EAAE,CAAC,EAAG,EAAG,GAAI,EAAI,CAAC,GAAK,IAAK,IAC9B,GAAI,EAAI,EAAE,GAAI,EACZ,IAAI,EAAI,EAAE,EAAG,EAAI,EAAE,OAChB,EAAI,GAAG,UACZ,EAAI,GAAG,eAAe,GACpB,GAAI,OAAO,eAAe,QAAU,EAAG,MAAM,IAAI,EAAE,0BAA0B,KAC7E,YAAI,EAAE,EAAc,MAAM,IAAI,EAAE,GAAG,mCACnC,IAAI,EAAK,EAAE,EAAE,EAAG,QAChB,YAAI,EAAe,MAAM,IAAI,EAAE,2BAA2B,wCAAwC,EAAG,uBAAuB,OAAO,KAAK,EAAE,GAAG,mCAC7I,OAAO,EAAG,MAAM,KAAM,EACxB,IACA,IAAI,EAAI,OAAO,OAAO,EAAG,CAAE,YAAa,CAAE,MAAO,KACjD,EAAE,UAAY,EACd,IAEM,EAFF,EAAI,IAAI,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAChC,SAAE,KAEH,EAAI,EAAE,GAAG,KAAO,EAAE,GAAK,IAAK,EAAE,EAAE,GAAG,KAAK,IAEpC,EAAI,IAAI,GAAG,EAAG,MAAG,GAAI,GAAS,EAAI,IAAI,GAAG,EAAI,IAAK,MAAG,GAAI,GAAS,EAAI,IAAI,GAAG,EAAI,UAAW,MAAG,GAAI,GAAS,GAAG,GAAK,CAAE,YAAa,EAAG,GAAI,GAAK,GAAG,EAAG,GAAI,CAAC,EAAG,EAAG,EAAE,KAE1K,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,KACpB,IAAI,EAAI,GAAG,EAAG,GACd,EAAI,GAAE,EAAG,GAAI,EAAE,GAAI,CAAC,IAAK,IAEvB,IAAI,EAAI,gBADR,EAAI,EAAE,IACmB,OACzB,YAAI,EAAE,EAAE,IAAiB,EAAE,EAAE,EAAI,aAAK,EAAE,EAAE,EAAE,EAAI,GAAe,MAAM,IAAI,EAAE,8EAA8E,EAAI,iBAAiB,EAAE,2GAChL,OAAO,EAAE,EAAE,EAAE,EAAI,GAAK,KACpB,GAAG,oBAAoB,EAAE,4BAA6B,IACrD,EAAE,GAAI,GAAI,IAAO,EAAE,OAAO,EAAG,EAAG,MAAO,EAAE,EAAE,EAAE,EAAI,GAAK,GAAG,EAAG,EAAG,KAAM,EAAG,GAAI,MAAM,EAAE,KAExF,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAC7B,IAAI,EAAI,GAAG,EAAG,GACd,EAAI,EAAE,GAAI,EAAI,GAAG,GAAI,EAAI,GAAE,EAAG,GAAI,EAAE,GAAI,CAAC,IAAK,IAC5C,SAAS,IACP,GAAG,eAAe,yBAA0B,EAC9C,CAEA,IAAI,EAAI,IADR,EAAI,EAAE,IACO,QAAQ,IACrB,EAAE,WAAW,QAAU,EAAI,OAAO,EAAE,UAAU,KAAM,GAAK,EAAE,EAAE,GAAG,KAAK,GACrE,IAAI,EAAI,EAAE,EAAE,EAAG,EAAI,EAAE,GACrB,gBAAO,YAAgB,EAAE,GAAgB,EAAE,YAAc,EAAE,MAAQ,EAAE,KAAO,EAAI,GAAK,EAAE,GAAK,EAAI,EAAG,EAAE,UAAY,EAAE,KAAM,EAAE,GAAK,IAAM,GACpI,EACA,EACA,GACC,EAAE,GAAG,EAAE,EAAI,GAAK,GAAI,EAAE,GAAI,GAAI,IAAO,EAAI,GAAG,EAAG,EAAG,EAAG,EAAG,EAAG,YAAI,EAAE,GAAG,GAAgB,EAAE,GAAK,EAAI,EAAG,EAAE,GAAK,GAAK,EAAE,GAAG,EAAE,EAAI,GAAK,EAAG,MAAM,EAAE,KAE7I,EAAI,GAAM,EAAE,EAAG,IAAK,EAAG,CAAC,EAAG,EAAG,EAAG,KAClC,SAAS,IACT,CACA,EAAI,EAAE,GAAI,EAAE,OAAS,GAAI,EAAE,EAAG,CAAE,KAAM,EAAG,YAAa,EAAG,EAAG,SAAS,GACnE,OAAO,KAAK,YAAY,OAAO,EACjC,EAAG,EAAG,CAAC,EAAG,IAAM,EAAE,MAAO,EAAG,GAAG,EAAG,EAAG,GAAI,EAAG,OAAS,GAAG,EAAG,IAC1D,EAAG,CAAC,EAAG,EAAG,KACX,IAAI,EAAI,GAAG,EAAG,QACd,EAAI,EAAE,GAAI,EAAI,EAAE,YAAa,EAAI,OAAO,OAAO,EAAE,YAAY,UAAW,CAAE,MAAO,CAAE,MAAO,GAAK,YAAa,CAAE,MAAO,GAAG,GAAG,EAAE,QAAQ,gBACrI,OAAS,EAAE,OAAO,GAAK,EAAG,EAAE,GAAK,GAChC,EAAG,CAAC,EAAG,EAAG,KACD,EAAE,EAAG,CAAE,KAAjB,EAAI,EAAE,GAAoB,EAAI,GAAM,EAAG,EAAG,CAAC,EAAG,IAAM,EAAG,EAAG,GAAG,EAAG,GAAI,EAAG,QACtE,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KACvB,IAAI,EAAI,GAAG,EAAG,GACd,EAAI,EAAE,GAAI,EAAI,GAAG,GAAI,EAAI,GAAE,EAAG,GAAI,GAAG,cACnC,GAAG,eAAe,yBAA0B,EAC9C,GAAG,EAAI,GAAI,EAAE,GAAI,GAAI,IAAO,EAAI,CAAC,EAAE,GAAI,MAAM,OAAO,EAAE,MAAM,IAAK,GAAG,EAAG,GAAG,EAAG,EAAG,KAAM,EAAG,EAAG,GAAI,EAAI,GAAI,OACvG,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,KACjB,EAAI,EAAE,GACN,IAAI,EAAK,GAAM,EACf,GAAU,IAAN,EAAS,CACX,IAAI,EAAI,GAAK,EAAI,EACjB,EAAK,GAAM,GAAK,IAAM,EAAG,EAAI,EAAE,EACjC,CACA,EAAE,EAAG,CAAE,KAAM,EAAG,EAAG,EAAG,EAAG,CAAC,EAAG,IAAM,EAAG,EAAG,EAAG,EAAG,EAAS,IAAN,GAAU,EAAG,QAC9D,EAAG,CAAC,EAAG,EAAG,KACX,SAAS,EAAE,GACT,OAAO,IAAI,EAAE,EAAG,OAAQ,EAAE,EAAI,GAAK,GAAI,EAAE,GAAK,GAChD,CACA,IAAI,EAAI,CACN,UACA,WACA,WACA,YACA,WACA,YACA,aACA,aACA,cACA,gBACA,GACQ,EAAE,EAAG,CAAE,KAAjB,EAAI,EAAE,GAAoB,EAAG,EAAG,EAAG,GAAK,CAAE,OAAI,EAC7C,EAAI,IACL,EAAE,EAAG,KACJ,EAAG,CAAC,EAAG,KACE,EAAE,EAAG,CAAE,KAAjB,EAAI,EAAE,GAAoB,CAAA,CAAE,GAC1B,IAAI,GAAK,EAAI,EAAI,GAAK,GAAG,OAAO,EAAE,SAAS,EAAG,GAAG,EAAG,EAAG,EAAE,GAAK,SAAY,GAC1E,OAAO,GAAE,GAAI,CACf,EAAG,CAAA,CAAE,EAAG,GACN,aAAa,cAAgB,EAAI,IAAI,WAAW,IAChD,IAAI,EAAgB,iBAAL,EACf,KAAM,GAAK,YAAY,OAAO,IAA6B,GAAvB,EAAE,mBAAyB,MAAM,IAAI,EAAE,yCAC3E,IAAI,EAAI,EAAI,GAAG,GAAK,EAAE,OAAQ,EAAI,GAAG,EAAI,EAAI,GAAI,EAAI,EAAI,EACzD,OAAO,EAAE,GAAK,GAAK,EAAG,EAAI,GAAE,EAAG,EAAG,EAAI,GAAK,EAAE,IAAI,EAAG,GAAU,OAAN,GAAc,EAAE,KAAK,GAAG,GAAI,CACtF,EAAG,EAAG,EAAG,CAAA,CAAE,GACT,GAAE,EACJ,KACC,EAAG,CAAC,EAAG,EAAG,KACX,GAAI,EAAI,EAAE,GAAU,IAAN,EACZ,IAAI,EAAI,GAAI,EAAI,GAAI,EAAI,QACrB,EAAI,GAAI,EAAI,GAAI,EAAI,GACzB,EAAE,EAAG,CAAE,KAAM,EAAG,EAAI,IAClB,IAAI,EAAI,EAAE,EAAI,EAAG,EAAE,GAAK,GAAK,MAC7B,OAAO,GAAE,GAAI,GACZ,EAAG,CAAC,EAAG,KACR,GAAgB,iBAAL,EAAe,MAAM,IAAI,EAAE,6CAA6C,KACnF,IAAI,EAAI,EAAE,GAAI,EAAI,GAAG,EAAI,EAAI,GAC7B,OAAO,EAAE,GAAK,GAAK,EAAI,EAAG,EAAE,EAAG,EAAI,EAAG,EAAI,GAAU,OAAN,GAAc,EAAE,KAAK,GAAG,GAAI,GACzE,EAAG,EAAG,CAAA,CAAE,GACT,GAAE,EACJ,KACC,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,KACpB,EAAG,GAAK,CAAE,KAAM,EAAE,GAAI,GAAI,GAAE,EAAG,GAAI,EAAG,GAAE,EAAG,GAAI,GAAI,KAClD,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,KAChC,EAAG,GAAG,GAAG,KAAK,CACZ,GAAI,EAAE,GACN,GAAI,EACJ,GAAI,GAAE,EAAG,GACT,GAAI,EACJ,GAAI,EACJ,GAAI,GAAE,EAAG,GACT,GAAI,KAEL,EAAG,CAAC,EAAG,KACE,EAAE,EAAG,CAAE,MAAQ,KAAzB,EAAI,EAAE,GAA4B,EAAG,OAClC,EAAG,UAEL,EAAG,CAAC,EAAG,EAAG,KACX,IAAK,KAAM,KAtPJ,EAAG,KACV,QAAS,EAAI,MAAM,GAAI,EAAI,EAAG,EAAI,IAAK,EAAG,EAAE,GAAK,GAAG,EAAE,EAAI,EAAI,GAAK,GAAI,aAAa,KACpF,OAAO,CAAC,EAoPG,CAAQ,EAAG,GACtB,EAAI,EAAE,EAAE,KAAK,GACb,IAAI,EAAI,EAAE,KAAK,GAAM,EAAE,EAAE,KAAK,KAC9B,IACA,IA7PgB,EACZ,EA4PA,EAAI,CAAE,QAAS,IACnB,OAAQ,EAAI,EAAE,MAAK,EAAG,KACpB,IAAI,EAAI,aAAa,IACrB,OAAO,EAAE,GAAK,EAAG,GAAG,SAAS,EAAI,IAAM,EAAI,EAAI,KAAK,IAClD,GACF,KAAK,EACH,IAAI,EAAI,kBACR,MACF,KAAK,EACH,EAAI,wBACJ,MACF,KAAK,EACH,EAAI,GACJ,MACF,KAAK,EACH,EAAE,kBAAoB,GAAI,EAAI,iDAElC,OAAO,GAAK,IAAI,KAAM,EAAE,KAAO,EAAE,aAAe,EAAG,EAAE,kBAAoB,GAAI,EAAI,0DAA0D,MAAO,EAAI,mEACtJ,SACE,EAAI,IAAI,SAAS,OAAO,KAAK,GAAI,EAA7B,IAAmC,OAAO,OAAO,IAAK,EAAI,iBAAiB,EAAE,KAAK,GAAM,EAAE,cAAa,EAAE,QAhR/F,EAgR2G,GAAG,EAAG,GA/Q7H,EAAI,GAAG,OACJ,GAAG,KAAK,GAAI,CA8Q8G,EAChI,EAAG,GAAI,EAAG,CAAC,EAAG,EAAG,EAAG,EAAG,IAAM,GAAG,GAAG,EAAG,EAAG,EAAG,GAAI,EAAI,IACrD,IAAI,EAAI,GAAG,GACX,EAAG,GAAI,GAAG,IACT,EAAG,CAAC,EAAG,EAAG,EAAG,KACd,IAAI,GAAI,IAAqB,MAAQ,cAAe,EAAI,IAAI,KAAK,EAAG,EAAG,GAAG,oBAC1E,EAAI,IAAI,KAAK,EAAG,EAAG,GAAG,oBAAqB,EAAE,GAAK,GAAK,GAAK,KAAK,IAAI,EAAG,GAAI,EAAE,GAAK,KAAO,GAAK,GAG5F,GAHgG,EAAK,IACtG,IAAI,EAAI,KAAK,IAAI,GACjB,MAAO,MAAM,GAAK,EAAI,IAAM,MAAM,OAAO,KAAK,MAAM,EAAI,KAAK,SAAS,EAAG,OAAO,OAAO,EAAI,IAAI,SAAS,EAAG,SACpG,GAAI,EAAI,EAAE,GAAI,EAAI,GAAK,GAAE,EAAG,EAAG,IAAK,GAAE,EAAG,EAAG,MAAQ,GAAE,EAAG,EAAG,IAAK,GAAE,EAAG,EAAG,MACjF,EAAI,IACL,IAAI,EAAI,EAAE,OACV,GAAc,YAAV,KAAO,GAAmB,SAC9B,QAAS,EAAI,EAAG,GAAK,EAAG,GAAK,EAAG,CAC9B,IAAI,EAAI,GAAK,EAAI,GAAM,GACvB,EAAI,KAAK,IAAI,EAAG,EAAI,WACpB,EAAG,CACD,GAAK,KAAK,IAAI,WAAY,MAAQ,KAAK,KAAK,KAAK,IAAI,EAAG,GAAK,QAAU,EAAG,OAAO,WAAa,OAAS,MAAQ,EAC/G,IACE,EAAG,KAAK,GAAI,IACZ,IAAI,EAAI,EACR,MAAM,CACR,OACA,CACA,QACF,CACA,GAAI,EAAG,QACT,CACA,UACC,EAAG,CAAC,EAAG,KACR,IAAkB,EAAd,EAAI,EAAG,EAAI,EACf,IAAK,KAAK,KAAM,CACd,IAAI,EAAI,EAAI,EACZ,EAAE,EAAI,GAAK,GAAK,EAAG,GAAK,GAAE,EAAG,EAAG,KAAS,EAAG,GAAK,CACnD,CACA,OAAO,GACN,EAAG,CAAC,EAAG,KACR,IAAI,EAAI,KAER,QAAS,KADT,EAAE,GAAK,GAAK,EAAE,OAAQ,EAAI,EACZ,GAAG,GAAK,GAAG,GAAK,EAC9B,OAAO,EAAE,GAAK,GAAK,EAAG,GACrB,EAAG,IAAM,GAAI,EAAG,WACjB,OAAO,EACT,EAAG,EAAG,CAAC,EAAG,EAAG,EAAG,KACd,QAAS,EAAI,EAAG,EAAI,EAAG,EAAI,EAAG,IAAK,CACjC,IAAI,EAAI,EAAE,GAAK,GAAI,EAAI,EAAE,EAAI,GAAK,GAClC,GAAK,EACL,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,CAC1B,IAAI,EAAI,EAAG,EAAI,EAAE,EAAI,GAAI,EAAI,GAAG,GAC1B,IAAN,GAAiB,KAAN,GAAY,EAAU,IAAN,EAAU,EAAK,EAAG,EAAI,GAAG,EAAG,GAAgF,EAA5E,EAAI,GAAG,OAAO,EAAE,OAAS,EAAE,SAAS,EAAG,GAAK,IAAI,WAAW,EAAE,MAAM,EAAG,MAAY,EAAE,OAAS,GAAK,EAAE,KAAK,EACtK,CACA,GAAK,CACP,CACA,OAAO,EAAE,GAAK,GAAK,EAAG,IACnB,0BACH,IAAI,EACJ,SAAS,EAAE,GACT,IAAI,EACJ,OAAO,GAAI,EAAE,QAAS,EAAK,GAAE,EAAG,IAAM,GAAK,GAAE,EAAU,IAAP,EAAI,IAAU,EAAG,EAAE,QAAU,GAAK,EAAE,EAAG,EAAE,MAAQ,GAAI,EAAE,EAAG,IAAuC,OAAjC,EAAI,EAAE,yBAAmC,EAAE,KAAK,EAAG,GAAS,GAAL,GAAU,IAAM,EAAI,EAAG,EAAI,KAAM,KAAM,EAChN,CACA,IAAuC,OAAjC,EAAI,EAAE,yBAAmC,EAAE,KAAK,EAAG,GACzD,IAAI,EAAI,CAAE,EAAG,IACb,OAAO,EAAE,gBAAkB,IAAI,SAAS,IACtC,EAAE,gBAAgB,IAAI,EAAG,KACvB,EAAE,EAAE,GAAG,GACP,KACE,IAAO,GA7rBN,IACP,GAAI,EAAG,OAAO,EAAI,OAAO,KAAK,EAAG,UAAW,IAAI,WAAW,EAAE,OAAQ,EAAE,WAAY,EAAE,QACrF,QAAS,EAAG,EAAG,EAAI,EAAG,EAAI,EAAG,EAAI,EAAE,OAAQ,EAAI,IAAI,YAAY,EAAI,GAAK,IAAkB,KAAZ,EAAE,EAAI,KAA0B,KAAZ,EAAE,EAAI,KAAa,EAAI,EAAG,GAAK,EAAG,GAAK,EAAG,EAAI,GAAE,EAAE,WAAW,EAAI,IAAK,EAAI,GAAE,EAAE,WAAW,EAAI,IAAK,EAAE,GAAK,GAAE,EAAE,WAAW,KAAO,EAAI,GAAK,EAAG,EAAE,EAAI,GAAK,GAAK,EAAI,GAAK,EAAG,EAAE,EAAI,GAAK,GAAK,EAAI,GAAE,EAAE,WAAW,EAAI,IAChT,OAAO,CAAC,EA0rBK,CAAQ,6lrNAA8lrN,wBArsBnmrN,GAChB,OAVF,eAAkB,GAChB,IAAI,EAAI,EACR,IACE,IAAI,uBATU,GAChB,IAAK,YAAY,OAAO,GAAI,GAAI,GAAK,GAAM,EAAI,EAAI,IAAI,WAAW,OAC7D,KAAI,EACJ,KAAM,kDADC,EAAI,EAAE,EAC0C,CAC5D,OAAO,CACT,CAIQ,CAAa,GACjB,aAAa,YAAY,YAAY,EAAG,EAC1C,OAAS,GACP,EAAE,0CAA0C,KAAM,EAAG,EACvD,CACF,CAES,CAAG,EACZ,CAmsBqnrN,CAAY,IAAI,UACrorN,CAbK,GAiCL,GAAI,EAAE,QAAS,IAAyB,mBAAb,EAAE,UAA0B,EAAE,QAAU,CAAC,EAAE,UAAW,EAAI,EAAE,QAAQ,QAAU,EAAE,QAAQ,OAAV,GACzG,gBApBS,IACP,SAAS,IACP,IAAI,EACJ,GAAI,EAAE,cAAiB,EAAI,CACzB,GAAI,KAAS,GAAE,IAAmB,IAAG,GAAoC,OAA/B,EAAI,EAAE,uBAAiC,EAAE,KAAK,GAAI,EAAE,QAAS,IAAyB,mBAAb,EAAE,UAA0B,EAAE,QAAU,CAAC,EAAE,UAAW,EAAE,QAAQ,QAAU,CAC3L,IAAI,EAAI,EAAE,QAAQ,QAClB,EAAG,KAAK,EACV,CACA,EAAG,EACL,CACF,CACA,GAAI,EAAI,EAAG,EAAI,MACV,CACH,GAAI,EAAE,OAAQ,IAAwB,mBAAZ,EAAE,SAAyB,EAAE,OAAS,CAAC,EAAE,SAAU,EAAE,OAAO,QAAU,IAChG,EAAG,GAAK,EAAI,EAAI,EAAI,EAAK,EAAE,WAAa,EAAE,UAAU,cAAe,iBACjE,gBAAiB,EAAE,UAAU,KAAK,GAAI,GAAG,GACxC,IAAM,GACX,CACF,CAEA,GAAa,EAAS,EAAQ,IAAI,UAAS,EAAG,KAC5C,EAAK,EAAG,EAAK,CAAC,GAElB,CACK,MAAC,GAAI,CAAC,EAAG,EAAG,EAAK,GAAM,KAC1B,MAAM,EAAI,EAAE,SAAS,GAAI,EAAI,EAAE,OAC/B,OAAO,IAAI,aAAa,EAAE,QAAQ,OAAQ,EAAG,GAAG,IAAI,IACnD,GAAM,GAAM,GAAK,EAAI,KAAK,KAAK,IAAK,GAAM,GAAO,GAAM,EAAI,EAAI,GAoB/D,GAAK,MAAO,EAAG,KAChB,IAAI,EACJ,MAAM,QAAU,KAAM,EAAI,aAAa,WAAa,EAAI,IAAI,WAAW,GACvE,IAAI,EAAI,KACR,IACE,GAAI,EAAI,EAAE,QACR,WAAW,kBAAoB,EAAE,QAC1B,OAAN,EACD,MAAM,IAAI,MAAM,4BAClB,EAAE,OAAO,IAAI,EAAG,EAAI,WAAW,mBAC/B,MAAM,EAAI,EAAE,kBAAgE,OAA7C,EAAyB,GAAE,sBAAkC,EAAE,mBAAqB,eAAgB,EAAI,EAAE,SAAS,EAAG,EAAE,OAAQ,CAC7J,iBAAkB,IAChB,IAhCqE,EAAG,EAAG,KACjF,MAAM,EAA0B,GAAE,kBAAqB,KACvD,MAAO,CACL,UAAW,EAAE,UACb,SAAU,EAAE,SACZ,YAAa,EAAE,YACf,UAAW,GAAE,EAAG,EAAE,WAClB,OAAQ,GAAE,EAAG,EAAE,OAAQ,KAAK,KAC5B,UAAW,GAAE,EAAG,EAAE,WAClB,OAAQ,GAAE,EAAG,EAAE,OAAQ,IACvB,OAAQ,GACN,EACA,EAAE,OACF,GAAG,IAGL,GAAI,GAAE,EAAG,EAAE,IACZ,EAeK,CACF,EACA,EACA,GAEF,OAnBQ,EAmBK,GAnBR,EAmBK,GAlBV,MAAM,EAAE,SAAS,EAAE,YAAa,EAAE,MAAM,EAAE,SAAS,EAAE,SAAU,EAAE,MAAM,EAAE,SAAS,EAAE,YAAa,EAAE,MAAM,EAAE,SAAS,EAAE,SAAU,EAAE,MAAM,EAAE,SAAS,EAAE,SAAU,EAAE,MAAM,EAAE,SAAS,EAAE,KAkBnK,CACnB,OAAS,GACP,MAAM,CACR,SACQ,OAAN,GAAc,EAAE,MAAM,EACxB,CALE,IAnBK,EAAG,CAwBV,EAC6E,GAAqB,OAAO,OAAuB,OAAO,eAAe,CACtJ,UAAW,MACV,OAAO,YAAa,CAAE,MAAO,YAAA,GAAA,yt2P,2dCtzBhC,MAAM,GACJ,WAAA,CAAY,EAAY,GACtB,KAAK,WAAa,EAClB,KAAK,SAAW,EACZ,KAAK,YAAY,UACnB,KAAK,WAAW,eAAS,CAAS,KAAM,0CAK1C,IACE,KAAK,OAAS,IAAI,GAClB,KAAK,YAAc,EACnB,KAAK,gBAAkB,IAAI,IAC3B,KAAK,OAAO,UAAa,IACvB,MAAM,GAAE,EAAE,IAAE,EAAG,IAAE,EAAG,GAAE,EAAE,GAAE,EAAE,MAAE,GAAU,EAAE,MAAQ,GAC5C,EAAK,KAAK,gBAAgB,IAAI,GAC/B,IACL,KAAK,gBAAgB,OAAO,GACxB,EAAO,EAAG,OAAO,IAAI,MAAM,IAC1B,EAAG,QAAQ,CAAE,MAAK,MAAK,KAAI,SAElC,KAAK,OAAO,QAAW,IAErB,UAAW,CAAG,KAAO,KAAK,gBACxB,EAAG,OAAO,aAAe,MAAQ,EAAM,IAAI,MAAM,OAAO,KAE1D,KAAK,gBAAgB,QAEzB,OAEE,KAAK,aACP,CACF,CAEA,WAAA,CAAY,EAAa,EAAe,EAAc,GACpD,OAAO,IAAI,eAAe,EAAS,WAC3B,UACN,KAAK,WAAW,MACd,EACA,UACA,IACE,IACE,MAAM,QAAa,QAAe,EAAM,GAExC,EAAQ,EACV,OAAS,GACP,EAAO,EACT,KAED,GAAQ,EAAO,IACjB,GAEL,CAEA,OAAA,CAAgB,EAAM,GACpB,GAAG,EACD,OAAO,QAAkB,GAE3B,MAAM,EAAS,EAAK,OACd,EAAO,EAAO,KACd,EAAM,QAAe,GAC3B,MAAkB,QAAd,GAAK,KAAuB,QAAgB,EAAQ,EAAK,GAC3C,QAAd,GAAK,KAAuB,QAAgB,EAAQ,EAAM,EAAK,GACjD,UAAd,GAAK,KAAyB,QAAkB,IAEhD,EAAK,QAAO,EAAK,MAAS,IAAI,EAAM,UACxC,EAAK,MAAM,MAAQ,EAAK,MACjB,EAAK,MACd,CAGA,GAAU,GACR,IAAK,GAAM,OAAQ,OAAO,KAC1B,QAAS,EAAI,EAAG,EAAI,EAAK,OAAO,OAAQ,IAAK,CAC3C,MAAM,EAAO,EAAK,OAAO,GACzB,QAAS,EAAI,EAAG,GAAK,EAAK,YAAY,QAAU,GAAI,IAAK,CACvD,MAAM,EAAO,EAAK,WAAW,GACvB,EAAM,GAAM,WAClB,GACE,GAAK,qCACL,OAAO,UAAU,EAAI,oCAAoC,YAEzD,MAAO,CAAE,KAAM,EAAG,KAAM,EAAG,KAAM,MAAO,GAAI,EAAI,oCAAoC,YACtF,GAAI,GAAK,uBAAwB,MAAO,CAAE,KAAM,EAAG,KAAM,EAAG,KAAM,OAClE,GAAI,GAAK,aAAc,MAAO,CAAE,KAAM,EAAG,KAAM,EAAG,KAAM,QAC1D,CACF,CACA,OAAO,IACT,CAEA,OAAA,CAAiB,EAAQ,EAAK,GAG5B,IAAI,QAAW,EAAO,cAAc,aAAc,EAAI,IAItD,GAHI,GAAI,QAAQ,aAAY,EAAK,EAAG,OAAO,MAAM,EAAG,WAAY,EAAG,WAAa,EAAG,aAG/E,KAAK,OAAQ,CACf,MAAM,EAAQ,KAAK,cACb,EAAI,IAAI,UAAS,EAAS,KAC9B,KAAK,gBAAgB,IAAI,EAAO,CAAE,UAAS,UAAS,IAEtD,IAGE,KAAK,OAAO,YAAY,CAAE,GAAI,EAAO,GAAI,YAAa,IAAK,GAAM,CAAC,GACpE,OAAS,GAGP,MADA,KAAK,gBAAgB,OAAO,GACtB,CACR,CACA,MAAM,IAAE,EAAG,IAAE,EAAG,GAAE,EAAE,GAAE,SAAa,EAC7B,EAAY,IAAI,aAAa,GAC7B,EAAS,IAAI,aAAa,GAC1B,EAAO,IAAI,aAAa,GACxB,EAAO,IAAI,aAAa,GACxB,EAAU,IAAI,EAAM,gBAAgB,EAAW,GAC/C,EAAU,IAAI,EAAM,gBAAgB,EAAQ,GAC5C,EAAW,IAAI,EAAM,gBAAgB,EAAM,GAC3C,EAAW,IAAI,EAAM,gBAAgB,EAAM,GAEjD,OADA,EAAK,MAAM,UAAU,GAAM,EAAE,SAAW,EAAE,YACnC,CACL,gBACA,UAAW,EACX,OAAQ,EACR,KAAM,EACN,KAAM,EAEV,CAEA,MAAM,QAAW,GAAQ,EAAI,CAAC,iBAAkB,QAC1C,EAAI,EAAG,WAAa,EAAG,UAAU,OAAS,EAC1C,EAAY,IAAI,aAAa,EAAG,WAChC,EAAM,EAAG,QAAU,EAAG,MACtB,EAAO,EAAG,QAAU,EAAG,SAAW,EAAG,UACrC,EAAS,IAAI,aAAiB,EAAJ,GAChC,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,CAC1B,MAAM,EAAI,EAAQ,EAAJ,EAAQ,GACpB,EAAI,EAAQ,EAAJ,EAAQ,GAChB,EAAI,EAAQ,EAAJ,EAAQ,GACZ,EAAI,EAAO,QAAkB,EAAK,IAAM,GACvC,EAAI,EAAI,GAAM,QAA2B,EAAG,EAAG,GACtD,EAAO,IAAI,CAAC,EAAI,EAAI,EAAI,GAAQ,EAAJ,EAC9B,CACA,MAAM,EAAM,EAAG,WAAa,EAAG,YACzB,EAAM,EAAG,QAAU,EAAG,MACtB,EAAM,QAAsB,EAAK,GACjC,EAAU,IAAI,EAAM,gBAAgB,EAAW,GAC/C,EAAU,IAAI,EAAM,gBAAgB,EAAQ,GAC5C,EAAW,IAAI,EAAM,gBAAgB,EAAI,GAAI,GAC7C,EAAW,IAAI,EAAM,gBAAgB,EAAI,GAAI,GAEnD,OADA,EAAK,MAAM,UAAU,GAAM,EAAE,SAAW,EAAE,YACnC,CACL,gBACA,UAAW,EACX,OAAQ,EACR,KAAM,EACN,KAAM,EAEV,CAEA,OAAA,CAAiB,EAAQ,EAAM,EAAK,GAClC,MAAM,EAAO,EAAK,OAAO,EAAI,MAAM,WAAW,EAAI,MAC5C,EAAS,UACb,MAAM,EAAM,EAAK,aAAa,GAC9B,OAAI,OAAO,UAAU,GAAa,EAAO,cAAc,WAAY,GAC5D,MAIT,IAAI,QAAe,EAAO,YAC1B,IAAK,EAAQ,OAAO,QAAkB,GACtC,IAAI,QAAe,EAAO,WACtB,QAAgB,EAAO,mBAAuB,EAAO,aACrD,QAAgB,EAAO,gBAAoB,EAAO,UAGtD,MAAM,EAAS,GAAQ,OAAS,EAAO,OAAO,MAAM,EAAO,WAAY,EAAO,WAAa,EAAO,YAAc,KAC1G,EAAS,GAAQ,OAAS,EAAO,OAAO,MAAM,EAAO,WAAY,EAAO,WAAa,EAAO,YAAc,KAC1G,EAAS,GAAQ,OAAS,EAAO,OAAO,MAAM,EAAO,WAAY,EAAO,WAAa,EAAO,YAAc,KAC1G,EAAS,GAAQ,OAAS,EAAO,OAAO,MAAM,EAAO,WAAY,EAAO,WAAa,EAAO,YAAc,KAEhH,GAAI,KAAK,OAAQ,CACf,MAAM,EAAQ,KAAK,cACb,EAAI,IAAI,UAAS,EAAS,KAC9B,KAAK,gBAAgB,IAAI,EAAO,CAAE,UAAS,UAAS,IAEtD,IACE,MAAM,EAAW,GACX,EAAU,CAAE,IAAK,EAAQ,IAAK,EAAQ,IAAK,EAAQ,IAAK,GAC1D,GAAQ,EAAS,KAAK,GACtB,GAAQ,EAAS,KAAK,GACtB,GAAQ,EAAS,KAAK,GACtB,GAAQ,EAAS,KAAK,GAC1B,KAAK,OAAO,YAAY,CAAE,GAAI,EAAO,GAAI,YAAa,WAAW,EACnE,OAAS,GAEP,MADA,KAAK,gBAAgB,OAAO,GACtB,CACR,CACA,MAAM,IAAE,EAAG,IAAE,EAAG,GAAE,EAAE,GAAE,SAAa,EAC7B,EAAY,IAAI,aAAa,GAC7B,EAAS,IAAI,aAAa,GAC1B,EAAO,IAAI,aAAa,GACxB,EAAO,IAAI,aAAa,GACxB,EAAU,IAAI,EAAM,gBAAgB,EAAW,GAC/C,EAAU,IAAI,EAAM,gBAAgB,EAAQ,GAC5C,EAAW,IAAI,EAAM,gBAAgB,EAAM,GAC3C,EAAW,IAAI,EAAM,gBAAgB,EAAM,GAEjD,OADA,EAAK,MAAM,UAAU,GAAM,EAAE,SAAW,EAAE,YACnC,CACL,gBAAoB,UAAW,EAAS,OAAQ,EAAS,KAAM,EAAU,KAAM,EAEnF,CAGA,IAAI,EAAM,EACN,GAAK,SAAQ,EAAM,IAAI,aAAa,EAAI,OAAQ,EAAI,WAAwB,EAAZ,EAAI,QAExE,IAAI,EAAM,EACN,GAAK,SAAQ,EAAM,IAAI,aAAa,EAAI,OAAQ,EAAI,YAAa,EAAI,UAAY,GAAK,EAAI,QAE9F,IAAI,EAAM,EACN,EAAM,EACN,GAAK,SAAQ,EAAM,IAAI,aAAa,EAAI,OAAQ,EAAI,WAAwB,EAAZ,EAAI,QACpE,GAAK,SAAQ,EAAM,IAAI,aAAa,EAAI,OAAQ,EAAI,WAAwB,EAAZ,EAAI,QAExE,MAAM,EAAI,EAAI,OAAS,EACjB,EAAS,IAAI,aAAiB,EAAJ,GAChC,GAAI,EAAK,CACP,MAAM,EAAS,EAAI,SAAe,EAAJ,EAAQ,EAAI,EAC1C,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,CAC1B,MAAM,EAAI,EAAI,EAAI,EAAS,GAAI,EAAI,EAAI,EAAI,EAAS,GAAI,EAAI,EAAI,EAAI,EAAS,IACtE,EAAI,EAAI,GAAM,QAA2B,EAAG,EAAG,GACtD,EAAO,IAAI,CAAC,EAAI,EAAI,EAAe,IAAX,EAAe,EAAI,EAAI,EAAS,GAAK,GAAQ,EAAJ,EACnE,CACF,MACE,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,EAAO,IAAI,CAAC,EAAG,EAAG,EAAG,GAAQ,EAAJ,GAGvD,MAAM,EAAM,QAAsB,EAAK,GAEjC,EAAU,IAAI,EAAM,gBAAgB,EAAK,GACzC,EAAU,IAAI,EAAM,gBAAgB,EAAQ,GAC5C,EAAW,IAAI,EAAM,gBAAgB,EAAI,GAAI,GAC7C,EAAW,IAAI,EAAM,gBAAgB,EAAI,GAAI,GAGnD,OADA,EAAK,MAAM,UAAU,GAAM,EAAE,SAAW,EAAE,YACnC,CACL,gBAAoB,UAAW,EAAS,OAAQ,EAAS,KAAM,EAAU,KAAM,EAEnF,CAEA,OAAA,CAAmB,GACjB,MACM,EADU,EAAK,MAAM,SAAS,GAClB,SACZ,EAAY,EAAE,WAAW,SACzB,EAAS,EAAE,WAAW,MACtB,EAAO,EAAE,WAAW,OAAS,EAAE,WAAW,MAC1C,EAAO,EAAE,WAAW,OAAS,EAAE,WAAW,MAGhD,OADA,EAAK,MAAM,UAAU,GAAM,EAAE,SAAW,EAAE,YACnC,CACL,gBAAoB,UAAW,EAAW,OAAQ,EAAQ,KAAM,EAAM,KAAM,EAGhF,CAEA,GAAiB,EAAK,GACpB,MAAM,GAAK,GAAK,QAAU,GAAK,EACzB,EAAK,IAAI,aAAiB,EAAJ,GACtB,EAAK,IAAI,aAAiB,EAAJ,GACtB,EAAI,IAAI,aAAa,GAC3B,QAAS,EAAI,EAAG,EAAI,EAAG,IAAK,CAC1B,MAAM,EAAI,EAAM,EAAQ,EAAJ,EAAQ,GAAK,EAAG,EAAI,EAAM,EAAQ,EAAJ,EAAQ,GAAK,EAAG,EAAI,EAAM,EAAQ,EAAJ,EAAQ,GAAK,EAAG,EAAI,EAAM,EAAQ,EAAJ,EAAQ,GAAK,EACrH,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAAG,EAAK,EAAI,EAC/G,EAAE,GAAK,EAAI,GAAK,EAAK,GAAK,EAAE,GAAK,GAAK,EAAK,GAAK,EAAE,GAAK,GAAK,EAAK,GACjE,EAAE,GAAK,GAAK,EAAK,GAAK,EAAE,GAAK,EAAI,GAAK,EAAK,GAAK,EAAE,GAAK,GAAK,EAAK,GACjE,EAAE,GAAK,GAAK,EAAK,GAAK,EAAE,GAAK,GAAK,EAAK,GAAK,EAAE,GAAK,EAAI,GAAK,EAAK,GAEjE,MAAM,EAAK,KAAK,IAAI,MAAsB,EAAW,EAAa,EAAJ,EAAQ,GAAK,GACrE,EAAK,KAAK,IAAI,MAAsB,EAAW,EAAa,EAAJ,EAAQ,GAAK,GACrE,EAAK,KAAK,IAAI,MAAsB,EAAW,EAAa,EAAJ,EAAQ,GAAK,GACrE,EAAM,EAAK,EAAI,EAAM,EAAK,EAAI,EAAM,EAAK,EAEzC,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAC5D,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAC5D,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAC5D,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAC5D,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAC5D,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAAM,EAAE,GAAK,EAAE,GAAK,EAE5D,EAAQ,EAAJ,EACV,EAAG,EAAI,GAAK,EAAK,EAAG,EAAI,GAAK,EAAK,EAAG,EAAI,GAAK,EAC9C,EAAG,EAAI,GAAK,EAAK,EAAG,EAAI,GAAK,EAAK,EAAG,EAAI,GAAK,CAChD,CACA,MAAO,CAAE,KAAI,KACf,CAEA,GAAa,GACX,OAAK,OAAO,SAAS,GACjB,GAAK,GAAK,GAAK,EAAU,EACzB,GAAK,GAAK,GAAK,KAAO,KAAK,IAAI,EAAI,KAAK,MAAM,IAAM,KAAa,EAAI,IACrE,GAAK,GAAK,GAAK,OAAS,KAAK,IAAI,EAAI,KAAK,MAAM,IAAM,KAAa,EAAI,MACpE,KAAK,IAAI,EAAG,KAAK,IAAI,EAAG,IAJC,CAKlC,CAEA,GAAsB,EAAG,EAAG,GAC1B,MAAM,EAAQ,GAAM,GAAK,GAAK,GAAK,KAAO,KAAK,IAAI,EAAI,KAAK,MAAM,IAAM,KAClE,EAAS,GAAM,GAAK,GAAK,GAAK,OAAS,KAAK,IAAI,EAAI,KAAK,MAAM,IAAM,KACrE,EAAO,GAAO,GAAK,OAAU,EAAI,MAAQ,KAAK,KAAK,EAAI,MAAS,MAAO,KACvE,EAAW,GAAM,KAAK,IAAI,EAAG,KAAK,IAAI,EAAG,IAE/C,IAAI,EAAK,EAAG,EAAK,EAAG,EAAK,EAEzB,KAAI,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAAK,GAEpD,GAAI,EAAK,IAAM,EAAK,IAAM,EAAK,GACpC,EAAK,EAAI,IAAK,EAAK,EAAI,IAAK,EAAK,EAAI,YAC5B,EAAM,IAAM,EAAM,IAAM,EAAM,GACvC,EAAK,EAAI,MAAO,EAAK,EAAI,MAAO,EAAK,EAAI,UACpC,CACL,MAAM,EAAM,GAAM,GAAM,mBAAsB,EAC9C,EAAK,EAAG,GAAI,EAAK,EAAG,GAAI,EAAK,EAAG,EAClC,CAGA,OADA,EAAK,EAAQ,GAAK,EAAK,EAAQ,GAAK,EAAK,EAAQ,GAC1C,CAAC,EAAI,GAAK,EAAI,GAAK,EAAI,GAChC,CAEA,KACE,OAAO,IAAI,SAAS,IAClB,MAAM,EAAI,kBACR,MAAM,EAAI,KAAK,WACT,EAAE,iBAAkB,EAAE,aAAkB,EAAE,gBAAiB,EAAE,aACjE,cAAc,GAAI,IACpB,GACC,GAAG,GAEV,EClOF,MAAM,WAAmB,SAOxB,WAAA,CAAa,GAEZ,MAAO,GAEP,KAAK,YAAc,KACnB,KAAK,WAAa,KAClB,KAAK,eAAiB,KAEtB,KAAK,gBAAkB,GAEvB,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAiC,EAE7C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAkC,EAE9C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA4B,EAExC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA0B,EAEtC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA0B,EAEtC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA6B,EAEzC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAoC,EAEhD,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA8B,EAE1C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA2B,EAEvC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAwC,EAEpD,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAgC,EAE5C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAmC,EAE/C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAkC,EAE9C,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAA4B,EAExC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAqB,EAEjC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAwB,EAEpC,IAEA,KAAK,mBAAqB,GAEzB,OAAO,IAAI,GAAuB,EAEnC,GAED,CAWA,IAAA,CAAM,EAAK,EAAQ,EAAY,GAE9B,MAAM,EAAQ,KAEd,IAAI,EAEJ,GAA2B,KAAtB,KAAK,aAET,EAAe,KAAK,qBAEK,KAAd,KAAK,KAAc,CAO9B,MAAM,EAAc,cAAY,eAAgB,GAChD,EAAe,cAAY,WAAY,EAAa,KAAK,KAE1D,MAEC,EAAe,cAAY,eAAgB,GAO5C,KAAK,QAAQ,UAAW,GAExB,MAAM,EAAW,SAAW,GAEtB,EAEJ,EAAS,GAIT,QAAQ,MAAO,GAIhB,EAAM,QAAQ,UAAW,GACzB,EAAM,QAAQ,QAAS,EAExB,EAEM,EAAS,IAAI,aAAY,KAAK,SAEpC,EAAO,QAAS,KAAK,MACrB,EAAO,gBAAiB,eACxB,EAAO,iBAAkB,KAAK,eAC9B,EAAO,mBAAoB,KAAK,iBAEhC,EAAO,KAAM,YAAgB,GAE5B,IAEC,EAAM,MAAO,EAAM,YAAyB,GAE3C,EAAQ,GAER,EAAM,QAAQ,QAAS,EAExB,GAAG,EAEJ,OAAU,GAET,EAAU,EAEX,CAED,GAAG,EAAY,EAEhB,CASA,cAAA,CAAgB,GAGf,OADA,KAAK,YAAc,EACZ,IAER,CASA,aAAA,CAAe,GAGd,OADA,KAAK,WAAa,EACX,IAER,CASA,iBAAA,CAAmB,GAGlB,OADA,KAAK,eAAiB,EACf,IAER,CAUA,QAAA,CAAU,GAQT,WANK,KAAK,gBAAgB,QAAS,IAElC,KAAK,gBAAgB,KAAM,GAIrB,IAER,CAQA,UAAA,CAAY,GAQX,WANK,KAAK,gBAAgB,QAAS,IAElC,KAAK,gBAAgB,OAAQ,KAAK,gBAAgB,QAAS,GAAY,GAIjE,IAER,CAUA,KAAA,CAAO,EAAM,EAAM,EAAQ,GAE1B,IAAI,EACJ,MAAM,EAAa,GACb,EAAU,GACV,EAAc,IAAI,YAExB,GAAqB,iBAAT,EAEX,EAAO,KAAK,MAAO,WAER,aAAgB,YAI3B,GAFc,EAAY,OAAQ,IAAI,WAAY,EAAM,EAAG,MAE5C,GAAgC,CAE9C,IAEC,EAAY,GAAW,iBAAoB,IAAI,GAAqB,EAErE,OAAU,GAGT,YADK,GAAU,EAAS,GAGzB,CAEA,EAAO,KAAK,MAAO,EAAY,GAAW,iBAAkB,QAE7D,MAEC,EAAO,KAAK,MAAO,EAAY,OAAQ,SAMxC,EAAO,EAIR,YAAK,EAAK,OAAuB,EAAK,MAAM,QAAS,GAAM,EAG1D,YADK,GAAU,EAAS,IAAI,MAAO,6EAKpC,MAAM,EAAS,IAAI,GAAY,EAAM,CAEpC,KAAM,GAAQ,KAAK,cAAgB,GACnC,YAAa,KAAK,YAClB,cAAe,KAAK,cACpB,QAAS,KAAK,QACd,WAAY,KAAK,WACjB,eAAgB,KAAK,iBAItB,EAAO,WAAW,iBAAkB,KAAK,eAEzC,QAAU,EAAI,EAAG,EAAI,KAAK,gBAAgB,OAAQ,IAAO,CAExD,MAAM,EAAS,KAAK,gBAAiB,GAAK,GAEnC,EAAO,MAAO,QAAQ,MAAO,wDAEpC,EAAS,EAAO,MAAS,EAMzB,EAAY,EAAO,QAEpB,CAEA,GAAK,EAAK,eAET,QAAU,EAAI,EAAG,EAAI,EAAK,eAAe,SAAW,EAAI,CAEvD,MAAM,EAAgB,EAAK,eAAgB,GACrC,EAAqB,EAAK,oBAAsB,GAEtD,OAAS,GAER,KAAK,GAAW,oBACf,EAAY,GAAkB,IAAI,GAClC,MAED,KAAK,GAAW,2BACf,EAAY,GAAkB,IAAI,GAAmC,EAAM,KAAK,aAChF,MAED,KAAK,GAAW,sBACf,EAAY,GAAkB,IAAI,GAClC,MAED,KAAK,GAAW,sBACf,EAAY,GAAkB,IAAI,GAClC,MAED,QAEM,EAAmB,QAAS,IAAmB,YAAK,EAAS,IAEjE,QAAQ,KAAM,wCAA0C,EAAgB,MAM5E,CAID,EAAO,cAAe,GACtB,EAAO,WAAY,GACnB,EAAO,MAAO,EAAQ,EAEvB,CAUA,UAAA,CAAY,EAAM,GAEjB,MAAM,EAAQ,KAEd,OAAO,IAAI,kBAAoB,EAAS,GAEvC,EAAM,MAAO,EAAM,EAAM,EAAS,EAEnC,GAED,EAMD,SAAS,KAER,IAAI,EAAU,GAEd,MAAO,CAEN,IAAK,SAAW,GAEf,OAAO,EAAS,EAEjB,EAEA,IAAK,SAAW,EAAK,GAEpB,EAAS,GAAQ,CAElB,EAEA,OAAQ,SAAW,UAEX,EAAS,EAEjB,EAEA,UAAW,WAEV,EAAU,EAEX,EAIF,CAMA,MAAM,GAAa,CAClB,gBAAiB,kBACjB,2BAA4B,6BAC5B,oBAAqB,sBACrB,wBAAyB,0BACzB,yBAA0B,2BAC1B,kBAAmB,oBACnB,oBAAqB,sBACrB,uBAAwB,yBACxB,2BAA4B,6BAC5B,0BAA2B,4BAC3B,yBAA0B,2BAC1B,oBAAqB,sBACrB,qBAAsB,uBACtB,mBAAoB,qBACpB,sBAAuB,wBACvB,sBAAuB,wBACvB,gCAAiC,kCACjC,mBAAoB,qBACpB,iBAAkB,mBAClB,iBAAkB,mBAClB,wBAAyB,0BACzB,wBAAyB,2BAU1B,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,oBAGvB,KAAK,MAAQ,CAAE,KAAM,GAAI,KAAM,GAEhC,CAEA,SAAA,GAEC,MAAM,EAAS,KAAK,OACd,EAAW,KAAK,OAAO,KAAK,OAAS,GAE3C,QAAU,EAAY,EAAG,EAAa,EAAS,OAAQ,EAAY,EAAY,IAAe,CAE7F,MAAM,EAAU,EAAU,GAErB,EAAQ,YACR,EAAQ,WAAY,KAAK,gBACzB,EAAQ,WAAY,KAAK,MAAO,OAEpC,EAAO,YAAa,KAAK,MAAO,EAAQ,WAAY,KAAK,MAAO,MAIlE,CAED,CAEA,UAAA,CAAY,GAEX,MAAM,EAAS,KAAK,OACd,EAAW,SAAW,EAC5B,IAAI,EAAa,EAAO,MAAM,IAAK,GAEnC,GAAK,EAAa,OAAO,EAEzB,MAAM,EAAO,EAAO,KAGd,IAFe,EAAK,YAAc,EAAK,WAAY,KAAK,OAAY,IAC7C,QAAU,IACX,GAC5B,IAAI,EAEJ,MAAM,EAAQ,IAAI,QAAO,mBAEpB,EAAS,OAAsB,EAAM,OAAQ,EAAS,MAAO,GAAK,EAAS,MAAO,GAAK,EAAS,MAAO,GAAK,wBAEjH,MAAM,WAAQ,EAAS,MAAsB,EAAS,MAAQ,EAE9D,OAAS,EAAS,MAEjB,IAAK,cACJ,EAAY,IAAI,mBAAkB,GAClC,EAAU,OAAO,SAAS,IAAK,EAAG,MAClC,EAAU,IAAK,EAAU,QACzB,MAED,IAAK,QACJ,EAAY,IAAI,aAAY,GAC5B,EAAU,SAAW,EACrB,MAED,IAAK,OACJ,EAAY,IAAI,YAAW,GAC3B,EAAU,SAAW,EAErB,EAAS,KAAO,EAAS,MAAQ,GACjC,EAAS,KAAK,wBAAiB,EAAS,KAAK,eAA+B,EAAS,KAAK,eAAiB,EAC3G,EAAS,KAAK,wBAAiB,EAAS,KAAK,eAA+B,EAAS,KAAK,eAAiB,KAAK,GAAK,EACrH,EAAU,MAAQ,EAAS,KAAK,eAChC,EAAU,SAAW,EAAM,EAAS,KAAK,eAAiB,EAAS,KAAK,eACxE,EAAU,OAAO,SAAS,IAAK,EAAG,MAClC,EAAU,IAAK,EAAU,QACzB,MAED,QACC,MAAM,IAAI,MAAO,4CAA8C,EAAS,MAkB1E,OAZA,EAAU,SAAS,IAAK,EAAG,EAAG,GAE9B,GAAwB,EAAW,YAE9B,EAAS,YAA0B,EAAU,UAAY,EAAS,WAEvE,EAAU,KAAO,EAAO,iBAAkB,EAAS,MAAU,SAAW,GAExE,EAAa,QAAQ,QAAS,GAE9B,EAAO,MAAM,IAAK,EAAU,GAErB,CAER,CAEA,aAAA,CAAe,EAAM,GAEpB,GAAc,UAAT,EAEL,OAAO,KAAK,WAAY,EAEzB,CAEA,oBAAA,CAAsB,GAErB,MAAM,EAAO,KACP,EAAS,KAAK,OAEd,EADO,EAAO,KACC,MAAO,GAEtB,GADa,EAAQ,YAAc,EAAQ,WAAY,KAAK,OAAY,IAClD,MAE5B,gBAAK,EAAkC,KAEhC,KAAK,WAAY,GAAa,eAAiB,GAErD,OAAO,EAAO,YAAa,EAAK,MAAO,EAAY,EAEpD,GAED,EAWD,MAAM,GAEL,WAAA,GAEC,KAAK,KAAO,GAAW,mBAExB,CAEA,eAAA,GAEC,OAAO,mBAER,CAEA,YAAA,CAAc,EAAgB,EAAa,GAE1C,MAAM,EAAU,GAEhB,EAAe,MAAQ,IAAI,QAAO,EAAK,EAAK,GAC5C,EAAe,QAAU,EAEzB,MAAM,EAAoB,EAAY,qBAEtC,GAAK,EAAoB,CAExB,GAAK,MAAM,QAAS,EAAkB,iBAAoB,CAEzD,MAAM,EAAQ,EAAkB,gBAEhC,EAAe,MAAM,OAAQ,EAAO,GAAK,EAAO,GAAK,EAAO,GAAK,wBACjE,EAAe,QAAU,EAAO,EAEjC,UAEK,EAAkB,kBAEtB,EAAQ,KAAM,EAAO,cAAe,EAAgB,MAAO,EAAkB,iBAAkB,kBAIjG,CAEA,OAAO,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,+BAExB,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAmB,EAAY,WAAY,KAAK,MAAO,iBAQ7D,YANK,QAEJ,EAAe,kBAAoB,GAI7B,QAAQ,SAEhB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,uBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MA0B/C,YAxBK,EAAU,kBAEd,EAAe,UAAY,EAAU,0BAIjC,EAAU,kBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,eAAgB,EAAU,4BAI1E,EAAU,2BAEd,EAAe,mBAAqB,EAAU,mCAI1C,EAAU,2BAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,wBAAyB,EAAU,qCAInF,EAAU,yBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,qBAAsB,EAAU,kCAE/E,EAAU,uBAAuB,OAAsB,CAE3D,MAAM,EAAQ,EAAU,uBAAuB,MAE/C,EAAe,qBAAuB,IAAI,UAAS,EAAO,EAE3D,CAID,OAAO,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,wBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAY,EAAY,WAAY,KAAK,MAI/C,OAFA,EAAe,oBAAa,EAAU,WAA2B,EAAU,WAAa,EAEjF,QAAQ,SAEhB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,yBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MA4C/C,gBA1CK,EAAU,oBAEd,EAAe,YAAc,EAAU,4BAInC,EAAU,oBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,iBAAkB,EAAU,8BAI5E,EAAU,iBAEd,EAAe,eAAiB,EAAU,yBAItC,EAAe,4BAEnB,EAAe,0BAA4B,CAAE,IAAK,eAI9C,EAAU,8BAEd,EAAe,0BAA2B,GAAM,EAAU,sCAItD,EAAU,8BAEd,EAAe,0BAA2B,GAAM,EAAU,sCAItD,EAAU,6BAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,0BAA2B,EAAU,8BAInF,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,mBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEhB,EAAe,WAAa,IAAI,QAAO,EAAG,EAAG,GAC7C,EAAe,eAAiB,EAChC,EAAe,MAAQ,EAEvB,MAAM,EAAY,EAAY,WAAY,KAAK,MAE/C,YAAK,EAAU,iBAAiC,CAE/C,MAAM,EAAc,EAAU,iBAC9B,EAAe,WAAW,OAAQ,EAAa,GAAK,EAAa,GAAK,EAAa,GAAK,uBAEzF,CAoBA,gBAlBK,EAAU,uBAEd,EAAe,eAAiB,EAAU,+BAItC,EAAU,mBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,gBAAiB,EAAU,kBAAmB,wBAIpF,IAAV,EAAU,uBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,oBAAqB,EAAU,wBAI7E,QAAQ,IAAK,EAErB,EAYD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,0BAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MAc/C,gBAZK,EAAU,qBAEd,EAAe,aAAe,EAAU,6BAIpC,EAAU,qBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,kBAAmB,EAAU,sBAI3E,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,oBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MAE/C,EAAe,mBAAY,EAAU,gBAAgC,EAAU,gBAAkB,WAE5F,EAAU,kBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,eAAgB,EAAU,mBAI/E,EAAe,oBAAsB,EAAU,qBAAuB,IAEtE,MAAM,EAAa,EAAU,kBAAoB,CAAE,EAAG,EAAG,GAGzD,OAFA,EAAe,kBAAmB,IAAI,SAAQ,OAAQ,EAAY,GAAK,EAAY,GAAK,EAAY,GAAK,wBAElG,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,iBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAY,EAAY,WAAY,KAAK,MAI/C,OAFA,EAAe,aAAM,EAAU,IAAoB,EAAU,IAAM,IAE5D,QAAQ,SAEhB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,sBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MAE/C,EAAe,2BAAoB,EAAU,eAA+B,EAAU,eAAiB,WAElG,EAAU,iBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,uBAAwB,EAAU,kBAIvF,MAAM,EAAa,EAAU,qBAAuB,CAAE,EAAG,EAAG,GAS5D,OARA,EAAe,eAAgB,IAAI,SAAQ,OAAQ,EAAY,GAAK,EAAY,GAAK,EAAY,GAAK,iCAEjG,EAAU,sBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,mBAAoB,EAAU,qBAAsB,mBAIlG,QAAQ,IAAK,EAErB,EAYD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,kBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MAU/C,OARA,EAAe,mBAAY,EAAU,WAA2B,EAAU,WAAa,WAElF,EAAU,aAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,UAAW,EAAU,cAInE,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,wBAExB,CAEA,eAAA,CAAiB,GAEhB,MACM,EADS,KAAK,OACO,KAAK,UAAW,GAE3C,OAAO,EAAY,YAAgB,EAAY,WAAY,KAAK,MAEzD,uBAFyE,IAIjF,CAEA,oBAAA,CAAsB,EAAe,GAEpC,MAAM,EAAS,KAAK,OACd,EAAc,EAAO,KAAK,UAAW,GAE3C,IAAO,EAAY,aAAgB,EAAY,WAAY,KAAK,MAE/D,OAAO,QAAQ,UAIhB,MAAM,EAAU,GAEV,EAAY,EAAY,WAAY,KAAK,MAoB/C,gBAlBK,EAAU,qBAEd,EAAe,WAAa,EAAU,6BAIlC,EAAU,qBAEd,EAAe,mBAAqB,EAAU,6BAI1C,EAAU,mBAEd,EAAQ,KAAM,EAAO,cAAe,EAAgB,gBAAiB,EAAU,oBAIzE,QAAQ,IAAK,EAErB,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,kBAExB,CAEA,WAAA,CAAa,GAEZ,MAAM,EAAS,KAAK,OACd,EAAO,EAAO,KAEd,EAAa,EAAK,SAAU,GAElC,IAAO,EAAW,aAAgB,EAAW,WAAY,KAAK,MAE7D,OAAO,KAIR,MAAM,EAAY,EAAW,WAAY,KAAK,MACxC,EAAS,EAAO,QAAQ,WAE9B,IAAO,EAAS,CAEf,GAAK,EAAK,oBAAsB,EAAK,mBAAmB,QAAS,KAAK,OAAU,EAE/E,MAAM,IAAI,MAAO,+EAKjB,OAAO,IAIT,CAEA,OAAO,EAAO,iBAAkB,EAAc,EAAU,OAAQ,EAEjE,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,gBAExB,CAEA,WAAA,CAAa,GAEZ,MAAM,EAAO,KAAK,KACZ,EAAS,KAAK,OACd,EAAO,EAAO,KAEd,EAAa,EAAK,SAAU,GAElC,IAAO,EAAW,aAAgB,EAAW,WAAY,GAExD,OAAO,KAIR,MAAM,EAAY,EAAW,WAAY,GACnC,EAAS,EAAK,OAAQ,EAAU,QAEtC,IAAI,EAAS,EAAO,cACpB,GAAK,EAAO,IAAM,CAEjB,MAAM,EAAU,EAAO,QAAQ,QAAQ,WAAY,EAAO,KACzC,OAAZ,IAAmB,EAAS,EAElC,CAEA,OAAO,EAAO,iBAAkB,EAAc,EAAU,OAAQ,EAEjE,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,OAAS,EACd,KAAK,KAAO,GAAW,gBAExB,CAEA,WAAA,CAAa,GAEZ,MAAM,EAAO,KAAK,KACZ,EAAS,KAAK,OACd,EAAO,EAAO,KAEd,EAAa,EAAK,SAAU,GAElC,IAAO,EAAW,aAAgB,EAAW,WAAY,GAExD,OAAO,KAIR,MAAM,EAAY,EAAW,WAAY,GACnC,EAAS,EAAK,OAAQ,EAAU,QAEtC,IAAI,EAAS,EAAO,cACpB,GAAK,EAAO,IAAM,CAEjB,MAAM,EAAU,EAAO,QAAQ,QAAQ,WAAY,EAAO,KACzC,OAAZ,IAAmB,EAAS,EAElC,CAEA,OAAO,EAAO,iBAAkB,EAAc,EAAU,OAAQ,EAEjE,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,KAAO,GAAW,wBACvB,KAAK,OAAS,CAEf,CAEA,cAAA,CAAgB,GAEf,MAAM,EAAO,KAAK,OAAO,KACnB,EAAa,EAAK,YAAa,GAErC,GAAK,EAAW,YAAc,EAAW,WAAY,KAAK,MAAS,CAElE,MAAM,EAAe,EAAW,WAAY,KAAK,MAE3C,EAAS,KAAK,OAAO,cAAe,SAAU,EAAa,QAC3D,EAAU,KAAK,OAAO,QAAQ,eAEpC,IAAO,IAAa,EAAQ,UAAY,CAEvC,GAAK,EAAK,oBAAsB,EAAK,mBAAmB,QAAS,KAAK,OAAU,EAE/E,MAAM,IAAI,MAAO,sFAKjB,OAAO,IAIT,CAEA,OAAO,EAAO,eAAiB,GAE9B,MAAM,EAAa,EAAa,YAAc,EACxC,EAAa,EAAa,YAAc,EAExC,EAAQ,EAAa,MACrB,EAAS,EAAa,WAEtB,EAAS,IAAI,WAAY,EAAK,EAAY,GAEhD,OAAK,EAAQ,sBAEL,EAAQ,sBAAuB,EAAO,EAAQ,EAAQ,EAAa,KAAM,EAAa,QAAS,eAAiB,GAEtH,OAAO,EAAI,MAEZ,IAKO,EAAQ,MAAM,iBAEpB,MAAM,EAAS,IAAI,YAAa,EAAQ,GAExC,OADA,EAAQ,iBAAkB,IAAI,WAAY,GAAU,EAAO,EAAQ,EAAQ,EAAa,KAAM,EAAa,QACpG,CAER,GAIF,GAED,CAEC,OAAO,IAIT,EAWD,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,KAAO,GAAW,wBACvB,KAAK,OAAS,CAEf,CAEA,cAAA,CAAgB,GAEf,MAAM,EAAO,KAAK,OAAO,KACnB,EAAU,EAAK,MAAO,GAE5B,IAAO,EAAQ,aAAgB,EAAQ,WAAY,KAAK,gBACvD,EAAQ,KAER,OAAO,KAIR,MAAM,EAAU,EAAK,OAAQ,EAAQ,MAIrC,UAAY,KAAa,EAAQ,WAEhC,GAAK,EAAU,OAAS,GAAgB,WACtC,EAAU,OAAS,GAAgB,gBACnC,EAAU,OAAS,GAAgB,uBACnC,EAAU,KAEX,OAAO,KAMT,MACM,EADe,EAAQ,WAAY,KAAK,MACX,WAI7B,EAAU,GACV,EAAa,GAEnB,UAAY,KAAO,EAElB,EAAQ,KAAM,KAAK,OAAO,cAAe,WAAY,EAAe,IAAQ,MAAM,IAEjF,EAAY,GAAQ,EACb,EAAY,OAMrB,OAAK,EAAQ,OAAS,EAEd,MAIR,EAAQ,KAAM,KAAK,OAAO,eAAgB,IAEnC,QAAQ,IAAK,GAAU,MAAM,IAEnC,MAAM,EAAa,EAAQ,MACrB,EAAS,EAAW,QAAU,EAAW,SAAW,CAAE,GACtD,EAAQ,EAAS,GAAI,MACrB,EAAkB,GAExB,UAAY,KAAQ,EAAS,CAG5B,MAAM,EAAI,IAAI,UACR,EAAI,IAAI,UACR,EAAI,IAAI,aACR,EAAI,IAAI,UAAS,EAAG,EAAG,GAEvB,EAAgB,IAAI,gBAAe,EAAK,SAAU,EAAK,SAAU,GAEvE,QAAU,EAAI,EAAG,EAAI,EAAO,IAEtB,EAAW,aAEf,EAAE,oBAAqB,EAAW,YAAa,GAI3C,EAAW,UAEf,EAAE,oBAAqB,EAAW,SAAU,GAIxC,EAAW,OAEf,EAAE,oBAAqB,EAAW,MAAO,GAI1C,EAAc,YAAa,EAAG,EAAE,QAAS,EAAG,EAAG,IAKhD,UAAY,KAAiB,EAE5B,GAAuB,aAAlB,EAA+B,CAEnC,MAAM,EAAO,EAAY,GACzB,EAAc,cAAgB,IAAI,2BAA0B,EAAK,MAAO,EAAK,SAAU,EAAK,WAE7F,KAA8B,gBAAlB,GACQ,aAAlB,GACkB,UAAlB,GAED,EAAK,SAAS,aAAc,EAAe,EAAY,IAOzD,WAAS,UAAU,KAAK,KAAM,EAAe,GAE7C,KAAK,OAAO,oBAAqB,GAEjC,EAAgB,KAAM,EAEvB,CAEA,OAAK,EAAW,SAEf,EAAW,QAEX,EAAW,OAAS,GAEb,GAID,EAAiB,EAAG,IAI7B,EAKD,MAAM,GAAgC,OAEhC,GAAuC,WAAvC,GAAwD,QAE9D,MAAM,GAEL,WAAA,CAAa,GAEZ,KAAK,KAAO,GAAW,gBACvB,KAAK,QAAU,KACf,KAAK,KAAO,KAEZ,MAAM,EAAa,IAAI,SAAU,EAAM,EAXF,IAY/B,EAAc,IAAI,YAQxB,GANA,KAAK,OAAS,CACb,MAAO,EAAY,OAAQ,IAAI,WAAY,EAAK,MAAO,EAAG,KAC1D,QAAS,EAAW,UAAW,MAC/B,OAAQ,EAAW,UAAW,OAG1B,KAAK,OAAO,QAAU,GAE1B,MAAM,IAAI,MAAO,qDAEX,GAAK,KAAK,OAAO,QAAU,EAEjC,MAAM,IAAI,MAAO,kDAIlB,MAAM,EAAsB,KAAK,OAAO,OA9BH,GA+B/B,EAAY,IAAI,SAAU,EA/BK,IAgCrC,IAAI,EAAa,EAEjB,KAAQ,EAAa,GAAsB,CAE1C,MAAM,EAAc,EAAU,UAAW,MACzC,GAAc,EAEd,MAAM,EAAY,EAAU,UAAW,MAGvC,GAFA,GAAc,EAET,IAAc,GAAoC,CAEtD,MAAM,EAAe,IAAI,WAAY,EA5CF,GA4CyC,EAAY,GACxF,KAAK,QAAU,EAAY,OAAQ,EAEpC,SAAY,IAAc,GAAmC,CAE5D,MAAM,EAjD6B,GAiDiB,EACpD,KAAK,KAAO,EAAK,MAAO,EAAY,EAAa,EAElD,CAIA,GAAc,CAEf,CAEA,GAAsB,OAAjB,KAAK,QAET,MAAM,IAAI,MAAO,4CAInB,EAWD,MAAM,GAEL,WAAA,CAAa,EAAM,GAElB,IAAO,EAEN,MAAM,IAAI,MAAO,uDAIlB,KAAK,KAAO,GAAW,2BACvB,KAAK,KAAO,EACZ,KAAK,YAAc,EACnB,KAAK,YAAY,SAElB,CAEA,eAAA,CAAiB,EAAW,GAE3B,MAAM,EAAO,KAAK,KACZ,EAAc,KAAK,YACnB,EAAkB,EAAU,WAAY,KAAK,MAAO,WACpD,EAAmB,EAAU,WAAY,KAAK,MAAO,WACrD,EAAoB,GACpB,EAAyB,GACzB,EAAmB,GAEzB,UAAY,KAAiB,EAAmB,CAE/C,MAAM,EAAqB,GAAY,IAAmB,EAAc,cAExE,EAAmB,GAAuB,EAAkB,EAE7D,CAEA,UAAY,KAAiB,EAAU,WAAa,CAEnD,MAAM,EAAqB,GAAY,IAAmB,EAAc,cAExE,YAAK,EAAkB,GAAgC,CAEtD,MAAM,EAAc,EAAK,UAAW,EAAU,WAAY,IACpD,EAAgB,GAAuB,EAAY,eAEzD,EAAkB,GAAuB,EAAc,KACvD,EAAwB,QAAuB,EAAY,UAE5D,CAED,CAEA,OAAO,EAAO,cAAe,aAAc,GAAkB,eAAiB,GAE7E,OAAO,IAAI,kBAAoB,EAAS,GAEvC,EAAY,gBAAiB,YAAuB,GAEnD,UAAY,KAAiB,EAAS,WAAa,CAElD,MAAM,EAAY,EAAS,WAAY,GACjC,EAAa,EAAwB,YAEtC,IAA2B,EAAU,WAAa,EAExD,CAEA,EAAS,EAEV,GAAG,EAAmB,EAAkB,uBAAsB,EAE/D,GAED,GAED,EAWD,MAAM,GAEL,WAAA,GAEC,KAAK,KAAO,GAAW,qBAExB,CAEA,aAAA,CAAe,EAAS,GAEvB,gBAAO,EAAU,UAA0B,EAAU,WAAa,EAAQ,kBACtE,EAAU,iBACV,EAAU,mBACV,EAAU,SAOd,EAAU,EAAQ,iBAEb,EAAU,WAEd,EAAQ,QAAU,EAAU,mBAIxB,EAAU,QAEd,EAAQ,OAAO,UAAW,EAAU,iBAIhC,EAAU,WAEd,EAAQ,SAAW,EAAU,eAIf,IAAV,EAAU,OAEd,EAAQ,OAAO,UAAW,EAAU,OAIrC,EAAQ,gBAED,CAER,EAWD,MAAM,GAEL,WAAA,GAEC,KAAK,KAAO,GAAW,qBAExB,EAUD,MAAM,WAAmC,cAExC,WAAA,CAAa,EAAoB,EAAc,EAAY,GAE1D,MAAO,EAAoB,EAAc,EAAY,EAEtD,CAEA,gBAAA,CAAkB,GAKjB,MAAM,EAAS,KAAK,aACnB,EAAS,KAAK,aACd,EAAY,KAAK,UACjB,EAAS,EAAQ,EAAY,EAAI,EAElC,QAAU,EAAI,EAAG,IAAM,EAAW,IAEjC,EAAQ,GAAM,EAAQ,EAAS,GAIhC,OAAO,CAER,CAEA,YAAA,CAAc,EAAI,EAAI,EAAG,GAExB,MAAM,EAAS,KAAK,aACd,EAAS,KAAK,aACd,EAAS,KAAK,UAEd,EAAmB,EAAT,EACV,EAAmB,EAAT,EAEV,EAAK,EAAK,EAEV,GAAM,EAAI,GAAO,EACjB,EAAK,EAAI,EACT,EAAM,EAAK,EAEX,EAAU,EAAK,EACf,EAAU,EAAU,EAEpB,KAAW,EAAM,EAAI,EACrB,EAAK,EAAM,EACX,EAAK,EAAI,EACT,EAAK,EAAK,EAAK,EAIrB,QAAU,EAAI,EAAG,IAAM,EAAQ,IAAO,CAErC,MAAM,EAAK,EAAQ,EAAU,EAAI,GAC3B,EAAK,EAAQ,EAAU,EAAI,GAAY,EACvC,EAAK,EAAQ,EAAU,EAAI,GAC3B,EAAK,EAAQ,EAAU,GAAM,EAEnC,EAAQ,GAAM,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,EAAK,CAElD,CAEA,OAAO,CAER,EAID,MAAM,GAAc,IAAI,aAExB,MAAM,WAA6C,GAElD,YAAA,CAAc,EAAI,EAAI,EAAG,GAExB,MAAM,EAAS,MAAM,aAAc,EAAI,EAAI,EAAG,GAI9C,OAFA,GAAY,UAAW,GAAS,YAAY,QAAS,GAE9C,CAER,EAWD,MAAM,GAAkB,CAWvB,OAAQ,EACR,MAAO,EACP,UAAW,EACX,WAAY,EACZ,UAAW,EACX,eAAgB,EAChB,aAAc,GAKT,GAAwB,CAC7B,KAAM,UACN,KAAM,WACN,KAAM,WACN,KAAM,YACN,KAAM,YACN,KAAM,cAGD,GAAgB,CACrB,KAAM,gBACN,KAAM,eACN,KAAM,6BACN,KAAM,4BACN,KAAM,4BACN,KAAM,4BAGD,GAAkB,CACvB,MAAO,sBACP,MAAO,yBACP,MAAO,kBAGF,GAAmB,CACxB,OAAU,EACV,KAAQ,EACR,KAAQ,EACR,KAAQ,EACR,KAAQ,EACR,KAAQ,EACR,KAAQ,IAGH,GAAa,CAClB,SAAU,WACV,OAAQ,SACR,QAAS,UACT,WAAY,KACZ,WAAY,MACZ,WAAY,MACZ,WAAY,MACZ,QAAS,QACT,UAAW,aACX,SAAU,aAGL,GAAkB,CACvB,MAAO,QACP,YAAa,WACb,SAAU,aACV,QAAS,yBAGJ,GAAgB,CACrB,mBAEA,OAAQ,oBACR,KAAM,uBAGD,GACG,SADH,GAEC,OAFD,GAGE,QA8BR,SAAS,GAAgC,EAAiB,EAAQ,GAIjE,UAAY,KAAQ,EAAU,oBAExB,EAAiB,KAErB,EAAO,SAAS,eAAiB,EAAO,SAAS,gBAAkB,GACnE,EAAO,SAAS,eAAgB,GAAS,EAAU,WAAY,GAMlE,CAQA,SAAS,GAAwB,EAAQ,YAEnC,EAAQ,SAEmB,iBAAnB,EAAQ,OAEnB,OAAO,OAAQ,EAAO,SAAU,EAAQ,QAIxC,QAAQ,KAAM,sDAAwD,EAAQ,QAMjF,CAkGA,SAAS,GAAoB,EAAM,GAIlC,GAFA,EAAK,8BAEA,EAAQ,QAEZ,QAAU,EAAI,EAAG,EAAK,EAAQ,QAAQ,OAAQ,EAAI,EAAI,IAErD,EAAK,sBAAuB,GAAM,EAAQ,QAAS,GAOrD,GAAK,EAAQ,QAAU,MAAM,QAAS,EAAQ,OAAO,aAAgB,CAEpE,MAAM,EAAc,EAAQ,OAAO,YAEnC,GAAK,EAAK,sBAAsB,SAAW,EAAY,OAAS,CAE/D,EAAK,sBAAwB,GAE7B,QAAU,EAAI,EAAG,EAAK,EAAY,OAAQ,EAAI,EAAI,IAEjD,EAAK,sBAAuB,EAAa,IAAQ,CAInD,MAEC,QAAQ,KAAM,uEAIhB,CAED,CAEA,SAAS,GAAoB,GAE5B,IAAI,EAEJ,MAAM,EAAiB,EAAa,YAAc,EAAa,WAAY,GAAW,4BActF,GAVC,EAFI,EAEU,SAAW,EAAe,WACpC,IAAM,EAAe,QACrB,IAAM,GAAqB,EAAe,YAIhC,EAAa,QAAU,IAAM,GAAqB,EAAa,YAAe,IAAM,EAAa,cAI3G,EAAa,QAEjB,QAAU,EAAI,EAAG,EAAK,EAAa,QAAQ,OAAQ,EAAI,EAAI,IAE1D,GAAe,IAAM,GAAqB,EAAa,QAAS,IAMlE,OAAO,CAER,CAEA,SAAS,GAAqB,GAE7B,IAAI,EAAgB,GAEpB,MAAM,EAAO,OAAO,KAAM,GAAa,OAEvC,QAAU,EAAI,EAAG,EAAK,EAAK,OAAQ,EAAI,EAAI,IAE1C,GAAiB,EAAM,GAAM,IAAM,EAAY,EAAM,IAAQ,IAI9D,OAAO,CAER,CAEA,SAAS,GAA6B,GAKrC,OAAS,GAER,KAAK,UACJ,OAAO,EAAI,IAEZ,KAAK,WACJ,OAAO,EAAI,IAEZ,KAAK,WACJ,OAAO,EAAI,MAEZ,KAAK,YACJ,OAAO,EAAI,MAEZ,QACC,MAAM,IAAI,MAAO,qEAIpB,CAYA,MAAM,GAAkB,IAAI,UAI5B,MAAM,GAEL,WAAA,CAAa,EAAO,GAAI,EAAU,IAEjC,KAAK,KAAO,EACZ,KAAK,WAAa,GAClB,KAAK,QAAU,GACf,KAAK,QAAU,EAGf,KAAK,MAAQ,IAAI,GAGjB,KAAK,aAAe,IAAI,IAGxB,KAAK,eAAiB,GAGtB,KAAK,UAAY,GAGjB,KAAK,UAAY,CAAE,KAAM,GAAI,KAAM,IACnC,KAAK,YAAc,CAAE,KAAM,GAAI,KAAM,IACrC,KAAK,WAAa,CAAE,KAAM,GAAI,KAAM,IAEpC,KAAK,YAAc,GACnB,KAAK,aAAe,GAGpB,KAAK,cAAgB,GAKrB,IAAI,KACA,KACA,KACA,KAEJ,UAAY,UAAc,IAAc,CAEvC,MAAM,EAAY,UAAU,UAE5B,OAAW,iCAAiC,KAAM,GAClD,MAAM,EAAc,EAAU,MAAO,kBACrC,EAAgB,GAAY,EAAc,SAAU,EAAa,GAAK,OAEtE,EAAY,EAAU,QAAS,cAC/B,EAAiB,EAAY,EAAU,MAAO,uBAAyB,KAExE,QAEY,kBAAsB,KAAiB,GAAY,EAAgB,IAAU,GAAa,EAAiB,GAEtH,KAAK,cAAgB,IAAI,gBAAe,KAAK,QAAQ,SAIrD,KAAK,cAAgB,IAAI,oBAAmB,KAAK,QAAQ,SAI1D,KAAK,cAAc,eAAgB,KAAK,QAAQ,aAChD,KAAK,cAAc,iBAAkB,KAAK,QAAQ,eAElD,KAAK,WAAa,IAAI,aAAY,KAAK,QAAQ,SAC/C,KAAK,WAAW,gBAAiB,eAEC,oBAA7B,KAAK,QAAQ,aAEjB,KAAK,WAAW,sBAIlB,CAEA,aAAA,CAAe,GAEd,KAAK,WAAa,CAEnB,CAEA,UAAA,CAAY,GAEX,KAAK,QAAU,CAEhB,CAEA,KAAA,CAAO,EAAQ,GAEd,MAAM,EAAS,KACT,EAAO,KAAK,KACZ,EAAa,KAAK,WAGxB,KAAK,MAAM,YACX,KAAK,UAAY,GAGjB,KAAK,qBAAuB,GAE3B,OAAO,EAAI,WAAa,EAAI,WAE7B,IAEA,QAAQ,IAAK,KAAK,qBAAuB,GAExC,OAAO,EAAI,YAAc,EAAI,YAE9B,KAAM,iBAEL,OAAO,QAAQ,IAAK,CAEnB,EAAO,gBAAiB,SACxB,EAAO,gBAAiB,aACxB,EAAO,gBAAiB,WAI1B,IAAI,eAAiB,GAEpB,MAAM,EAAS,CACd,MAAO,EAAc,GAAK,EAAK,OAAS,GACxC,OAAQ,EAAc,GACtB,WAAY,EAAc,GAC1B,QAAS,EAAc,GACvB,MAAO,EAAK,MACZ,OAAQ,EACR,SAAU,IAOX,OAJA,GAAgC,EAAY,EAAQ,GAEpD,GAAwB,EAAQ,GAEzB,QAAQ,IAAK,EAAO,qBAAuB,GAEjD,OAAO,EAAI,WAAa,EAAI,UAAW,EAExC,KAAM,iBAEL,UAAY,KAAS,EAAO,OAE3B,EAAM,oBAIP,EAAQ,EAET,GAED,IAAI,MAAO,EAEZ,CAOA,SAAA,GAEC,MAAM,EAAW,KAAK,KAAK,OAAS,GAC9B,EAAW,KAAK,KAAK,OAAS,GAC9B,EAAW,KAAK,KAAK,QAAU,GAIrC,QAAU,EAAY,EAAG,EAAa,EAAS,OAAQ,EAAY,EAAY,IAAe,CAE7F,MAAM,EAAS,EAAU,GAAY,OAErC,QAAU,EAAI,EAAG,EAAK,EAAO,OAAQ,EAAI,EAAI,IAE5C,EAAU,EAAQ,IAAM,SAI1B,CAIA,QAAU,EAAY,EAAG,EAAa,EAAS,OAAQ,EAAY,EAAY,IAAe,CAE7F,MAAM,EAAU,EAAU,YAErB,EAAQ,OAEZ,KAAK,YAAa,KAAK,UAAW,EAAQ,eAKrC,EAAQ,OAEZ,EAAU,EAAQ,MAAO,wBAAgB,IAMtC,EAAQ,QAEZ,KAAK,YAAa,KAAK,YAAa,EAAQ,OAI9C,CAED,CAeA,WAAA,CAAa,EAAO,YAEd,aAEA,EAAM,KAAM,KAEhB,EAAM,KAAM,GAAU,EAAM,KAAM,GAAU,GAI7C,EAAM,KAAM,KAEb,CAWA,WAAA,CAAa,EAAO,EAAO,GAE1B,GAAK,EAAM,KAAM,IAAW,EAAI,OAAO,EAEvC,MAAM,EAAM,EAAO,QAIb,EAAiB,CAAE,EAAU,KAElC,MAAM,EAAW,KAAK,aAAa,IAAK,GACvB,MAAZ,GAEJ,KAAK,aAAa,IAAK,EAAO,GAI/B,UAAc,EAAG,KAAW,EAAS,SAAS,UAE7C,EAAgB,EAAO,EAAM,SAAU,KAUzC,OAJA,EAAgB,EAAQ,GAExB,EAAI,MAAQ,aAAiB,EAAM,KAAM,KAElC,CAER,CAEA,UAAA,CAAY,GAEX,MAAM,EAAa,OAAO,OAAQ,KAAK,SACvC,EAAW,KAAM,MAEjB,QAAU,EAAI,EAAG,EAAI,EAAW,OAAQ,IAAO,CAE9C,MAAM,EAAS,EAAM,EAAY,IAEjC,GAAK,EAAS,OAAO,CAEtB,CAEA,OAAO,IAER,CAEA,UAAA,CAAY,GAEX,MAAM,EAAa,OAAO,OAAQ,KAAK,SACvC,EAAW,QAAS,MAEpB,MAAM,EAAU,GAEhB,QAAU,EAAI,EAAG,EAAI,EAAW,OAAQ,IAAO,CAE9C,MAAM,EAAS,EAAM,EAAY,IAE5B,GAAS,EAAQ,KAAM,EAE7B,CAEA,OAAO,CAER,CAUA,aAAA,CAAe,EAAM,GAEpB,MAAM,EAAW,EAAO,IAAM,EAC9B,IAAI,EAAa,KAAK,MAAM,IAAK,GAEjC,IAAO,EAAa,CAEnB,OAAS,GAER,IAAK,QACJ,EAAa,KAAK,UAAW,GAC7B,MAED,IAAK,OACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,UAAY,EAAI,SAAU,EAEtC,IACA,MAED,IAAK,OACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,UAAY,EAAI,SAAU,EAEtC,IACA,MAED,IAAK,WACJ,EAAa,KAAK,aAAc,GAChC,MAED,IAAK,aACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,gBAAkB,EAAI,eAAgB,EAElD,IACA,MAED,IAAK,SACJ,EAAa,KAAK,WAAY,GAC9B,MAED,IAAK,WACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,cAAgB,EAAI,aAAc,EAE9C,IACA,MAED,IAAK,UACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,aAAe,EAAI,YAAa,EAE5C,IACA,MAED,IAAK,OACJ,EAAa,KAAK,SAAU,GAC5B,MAED,IAAK,YACJ,EAAa,KAAK,qBAAuB,GAExC,OAAO,EAAI,eAAiB,EAAI,cAAe,EAEhD,IACA,MAED,IAAK,SACJ,EAAa,KAAK,WAAY,GAC9B,MAED,QAOC,GANA,EAAa,KAAK,qBAAuB,GAExC,OAAO,GAAO,MAAQ,EAAI,eAAiB,EAAI,cAAe,EAAM,EAErE,KAEO,EAEN,MAAM,IAAI,MAAO,iBAAmB,GAQvC,KAAK,MAAM,IAAK,EAAU,EAE3B,CAEA,OAAO,CAER,CASA,eAAA,CAAiB,GAEhB,IAAI,EAAe,KAAK,MAAM,IAAK,GAEnC,IAAO,EAAe,CAErB,MAAM,EAAS,KACT,EAAO,KAAK,KAAM,GAAkB,SAAT,EAAkB,KAAO,OAAW,GAErE,EAAe,QAAQ,IAAK,EAAK,cAAgB,EAAK,GAErD,OAAO,EAAO,cAAe,EAAM,EAEpC,KAEA,KAAK,MAAM,IAAK,EAAM,EAEvB,CAEA,OAAO,CAER,CASA,UAAA,CAAY,GAEX,MAAM,EAAY,KAAK,KAAK,QAAS,GAC/B,EAAS,KAAK,WAEpB,GAAK,EAAU,MAA2B,gBAAnB,EAAU,KAEhC,MAAM,IAAI,MAAO,qBAAuB,EAAU,KAAO,kCAK1D,YAAK,EAAU,KAAqC,IAAhB,EAEnC,OAAO,QAAQ,QAAS,KAAK,WAAY,GAAW,iBAAkB,MAIvE,MAAM,EAAU,KAAK,QAErB,OAAO,IAAI,kBAAoB,EAAS,GAEvC,EAAO,KAAM,cAAY,WAAY,EAAU,IAAK,EAAQ,MAAQ,qBAEnE,EAAQ,IAAI,MAAO,4CAA8C,EAAU,IAAM,MAElF,GAED,GAED,CASA,cAAA,CAAgB,GAEf,MAAM,EAAgB,KAAK,KAAK,YAAa,GAE7C,OAAO,KAAK,cAAe,SAAU,EAAc,QAAS,eAAiB,GAE5E,MAAM,EAAa,EAAc,YAAc,EACzC,EAAa,EAAc,YAAc,EAC/C,OAAO,EAAO,MAAO,EAAY,EAAa,EAE/C,GAED,CASA,YAAA,CAAc,GAEb,MAAM,EAAS,KACT,EAAO,KAAK,KAEZ,EAAc,KAAK,KAAK,UAAW,GAEzC,QAAiB,IAAZ,EAAY,qBAA4B,EAAY,OAAuB,CAE/E,MAAM,EAAW,GAAkB,EAAY,MACzC,EAAa,GAAuB,EAAY,eAChD,OAAa,EAAY,WAEzB,EAAQ,IAAI,EAAY,EAAY,MAAQ,GAClD,OAAO,QAAQ,QAAS,IAAI,kBAAiB,EAAO,EAAU,GAE/D,CAEA,MAAM,EAAqB,GAmB3B,gBAjBK,EAAY,WAEhB,EAAmB,KAAM,KAAK,cAAe,aAAc,EAAY,aAIvE,EAAmB,KAAM,eAIrB,EAAY,SAEhB,EAAmB,KAAM,KAAK,cAAe,aAAc,EAAY,OAAO,QAAQ,aACtF,EAAmB,KAAM,KAAK,cAAe,aAAc,EAAY,OAAO,OAAO,cAI/E,QAAQ,IAAK,GAAqB,eAAiB,GAEzD,MAAM,EAAa,EAAa,GAE1B,EAAW,GAAkB,EAAY,MACzC,EAAa,GAAuB,EAAY,eAGhD,EAAe,EAAW,kBAC1B,EAAY,EAAe,EAC3B,EAAa,EAAY,YAAc,EACvC,WAAa,EAAY,WAA2B,EAAK,YAAa,EAAY,YAAa,kBAC/F,OAAa,EAAY,WAC/B,IAAI,EAAO,EAGX,GAAK,GAAc,IAAe,EAAY,CAI7C,MAAM,EAAU,KAAK,MAAO,EAAa,GACnC,EAAa,qBAAuB,EAAY,WAAa,IAAM,EAAY,cAAgB,IAAM,EAAU,IAAM,EAAY,MACvI,IAAI,EAAK,EAAO,MAAM,IAAK,GAEpB,IAEN,EAAQ,IAAI,EAAY,EAAY,EAAU,EAAY,EAAY,MAAQ,EAAa,GAG3F,EAAK,IAAI,oBAAmB,EAAO,EAAa,GAEhD,EAAO,MAAM,IAAK,EAAY,IAI/B,EAAkB,IAAI,6BAA4B,EAAI,EAAY,EAAa,EAAe,EAAc,EAE7G,MAIE,EAFmB,OAAf,EAEI,IAAI,EAAY,EAAY,MAAQ,GAIpC,IAAI,EAAY,EAAY,EAAY,EAAY,MAAQ,GAIrE,EAAkB,IAAI,kBAAiB,EAAO,EAAU,GAKzD,YAAK,EAAY,OAAuB,CAEvC,MAAM,EAAkB,GAAiB,OACnC,EAAoB,GAAuB,EAAY,OAAO,QAAQ,eAEtE,EAAoB,EAAY,OAAO,QAAQ,YAAc,EAC7D,EAAmB,EAAY,OAAO,OAAO,YAAc,EAE3D,EAAgB,IAAI,EAAmB,EAAa,GAAK,EAAmB,EAAY,OAAO,MAAQ,GACvG,EAAe,IAAI,EAAY,EAAa,GAAK,EAAkB,EAAY,OAAO,MAAQ,GAEhF,OAAf,IAGJ,EAAkB,IAAI,kBAAiB,EAAgB,MAAM,QAAS,EAAgB,SAAU,EAAgB,aAKjH,EAAgB,cAEhB,QAAU,EAAI,EAAG,EAAK,EAAc,OAAQ,EAAI,EAAI,IAAO,CAE1D,MAAM,EAAQ,EAAe,GAM7B,GAJA,EAAgB,KAAM,EAAO,EAAc,EAAI,IAC1C,GAAY,GAAI,EAAgB,KAAM,EAAO,EAAc,EAAI,EAAW,IAC1E,GAAY,GAAI,EAAgB,KAAM,EAAO,EAAc,EAAI,EAAW,IAC1E,GAAY,GAAI,EAAgB,KAAM,EAAO,EAAc,EAAI,EAAW,IAC1E,GAAY,EAAI,MAAM,IAAI,MAAO,oEAEvC,CAEA,EAAgB,WAAa,CAE9B,CAEA,OAAO,CAER,GAED,CASA,WAAA,CAAa,GAEZ,MAAM,EAAO,KAAK,KACZ,EAAU,KAAK,QAEf,EADa,EAAK,SAAU,GACH,OACzB,EAAY,EAAK,OAAQ,GAE/B,IAAI,EAAS,KAAK,cAElB,GAAK,EAAU,IAAM,CAEpB,MAAM,EAAU,EAAQ,QAAQ,WAAY,EAAU,KACrC,OAAZ,IAAmB,EAAS,EAElC,CAEA,OAAO,KAAK,iBAAkB,EAAc,EAAa,EAE1D,CAEA,gBAAA,CAAkB,EAAc,EAAa,GAE5C,MAAM,EAAS,KACT,EAAO,KAAK,KAEZ,EAAa,EAAK,SAAU,GAC5B,EAAY,EAAK,OAAQ,GAEzB,GAAa,EAAU,KAAO,EAAU,YAAe,IAAM,EAAW,QAE9E,GAAK,KAAK,aAAc,GAGvB,OAAO,KAAK,aAAc,GAI3B,MAAM,EAAU,KAAK,gBAAiB,EAAa,GAAS,eAAiB,GAE5E,EAAQ,SAER,EAAQ,KAAO,EAAW,MAAQ,EAAU,MAAQ,GAE9B,KAAjB,EAAQ,MAAwC,iBAAlB,EAAU,UAAoB,EAAU,IAAI,WAAY,iBAE1F,EAAQ,KAAO,EAAU,KAI1B,MACM,GADW,EAAK,UAAY,IACR,EAAW,UAAa,GAUlD,OARA,EAAQ,UAAY,GAAe,EAAQ,YAAe,eAC1D,EAAQ,UAAY,GAAe,EAAQ,YAAe,2BAC1D,EAAQ,MAAQ,GAAiB,EAAQ,QAAW,iBACpD,EAAQ,MAAQ,GAAiB,EAAQ,QAAW,iBACpD,EAAQ,iBAAoB,EAAQ,qBAAuB,EAAQ,YAAc,iBAAiB,EAAQ,YAAc,eAExH,EAAO,aAAa,IAAK,EAAS,CAAE,SAAU,IAEvC,CAER,IAAI,kBAEH,OAAO,IAER,IAIA,OAFA,KAAK,aAAc,GAAa,EAEzB,CAER,CAEA,eAAA,CAAiB,EAAa,GAE7B,MACM,EAAO,KAAK,KACZ,EAAU,KAAK,QAErB,YAAK,KAAK,YAAa,GAEtB,OAAO,KAAK,YAAa,GAAc,MAAQ,GAAa,EAAQ,UAIrE,MAAM,EAAY,EAAK,OAAQ,GAEzB,EAAM,KAAK,KAAO,KAAK,UAE7B,IAAI,EAAY,EAAU,KAAO,GAC7B,KAEJ,YAAK,EAAU,WAId,EArBc,KAqBK,cAAe,aAAc,EAAU,YAAa,eAAiB,GAEvF,KACA,MAAM,EAAO,IAAI,KAAM,CAAE,GAAc,CAAE,KAAM,EAAU,WAEzD,OADA,EAAY,EAAI,gBAAiB,GAC1B,CAER,iBAEM,IAAK,EAAU,IAErB,MAAM,IAAI,MAAO,2BAA6B,EAAc,kCAI7D,MAAM,EAAU,QAAQ,QAAS,GAAY,eAAiB,GAE7D,OAAO,IAAI,kBAAoB,EAAS,GAEvC,IAAI,EAAS,OAER,EAAO,sBAEX,EAAS,SAAW,GAEnB,MAAM,EAAU,IAAI,UAAS,GAC7B,EAAQ,eAER,EAAS,EAEV,GAID,EAAO,KAAM,cAAY,WAAY,EAAW,EAAQ,MAAQ,SAAmB,EAEpF,GAED,IAAI,eAAiB,GA/yBvB,IAA8B,EA6zB3B,WAVK,GAEJ,EAAI,gBAAiB,GAItB,GAAwB,EAAS,GAEjC,EAAQ,SAAS,SAAW,EAAU,YA3zBX,EA2zB4C,EAAU,KAzzB1E,OAAQ,kBAAqB,GAA4C,IAAvC,EAAI,OAAQ,sBAAsC,aACxF,EAAI,OAAQ,iBAAoB,GAA4C,IAAvC,EAAI,OAAQ,sBAAsC,aACvF,EAAI,OAAQ,iBAAoB,GAA4C,IAAvC,EAAI,OAAQ,sBAAsC,aAErF,aAuzBE,CAER,IAAI,gBAAkB,GAGrB,MADA,QAAQ,MAAO,0CAA4C,GACrD,CAEP,IAGA,OADA,KAAK,YAAa,GAAgB,EAC3B,CAER,CAYA,aAAA,CAAe,EAAgB,EAAS,EAAQ,GAE/C,MAAM,EAAS,KAEf,OAAO,KAAK,cAAe,UAAW,EAAO,OAAQ,eAAiB,GAErE,IAAO,EAAU,OAAO,KASxB,YAPK,EAAO,UAA0B,EAAO,SAAW,KAEvD,EAAU,EAAQ,SACV,QAAU,EAAO,UAIrB,EAAO,WAAY,GAAW,uBAA0B,CAE5D,MAAM,WAAY,EAAO,WAA2B,EAAO,WAAY,GAAW,8BAElF,GAAK,EAAY,CAEhB,MAAM,EAAgB,EAAO,aAAa,IAAK,GAC/C,EAAU,EAAO,WAAY,GAAW,uBAAwB,cAAe,EAAS,GACxF,EAAO,aAAa,IAAK,EAAS,EAEnC,CAED,CAUA,gBARK,IAEJ,EAAQ,WAAa,GAItB,EAAgB,GAAY,EAErB,CAER,GAED,CAYA,mBAAA,CAAqB,GAEpB,MAAM,EAAW,EAAK,SACtB,IAAI,EAAW,EAAK,SAEpB,MAAM,WAAwB,EAAS,WAAW,QAC5C,WAAkB,EAAS,WAAW,MACtC,WAAiB,EAAS,WAAW,OAE3C,GAAK,EAAK,SAAW,CAEpB,MAAM,EAAW,kBAAoB,EAAS,KAE9C,IAAI,EAAiB,KAAK,MAAM,IAAK,GAE9B,IAEN,EAAiB,IAAI,iBACrB,WAAS,UAAU,KAAK,KAAM,EAAgB,GAC9C,EAAe,MAAM,KAAM,EAAS,OACpC,EAAe,IAAM,EAAS,IAC9B,EAAe,mBAEf,KAAK,MAAM,IAAK,EAAU,IAI3B,EAAW,CAEZ,SAAY,EAAK,OAAS,CAEzB,MAAM,EAAW,qBAAuB,EAAS,KAEjD,IAAI,EAAe,KAAK,MAAM,IAAK,GAE5B,IAEN,EAAe,IAAI,oBACnB,WAAS,UAAU,KAAK,KAAM,EAAc,GAC5C,EAAa,MAAM,KAAM,EAAS,OAClC,EAAa,IAAM,EAAS,IAE5B,KAAK,MAAM,IAAK,EAAU,IAI3B,EAAW,CAEZ,CAGA,GAAK,GAAyB,GAAmB,EAAiB,CAEjE,IAAI,EAAW,kBAAoB,EAAS,KAAO,IAE9C,IAAwB,GAAY,wBACpC,IAAkB,GAAY,kBAC9B,IAAiB,GAAY,iBAElC,IAAI,EAAiB,KAAK,MAAM,IAAK,GAE9B,IAEN,EAAiB,EAAS,QAErB,IAAkB,EAAe,iBACjC,IAAiB,EAAe,gBAEhC,IAGC,EAAe,cAAc,EAAe,YAAY,OACxD,EAAe,uBAAuB,EAAe,qBAAqB,QAIhF,KAAK,MAAM,IAAK,EAAU,GAE1B,KAAK,aAAa,IAAK,EAAgB,KAAK,aAAa,IAAK,KAI/D,EAAW,CAEZ,CAEA,EAAK,SAAW,CAEjB,CAEA,eAAA,GAEC,OAAO,sBAER,CASA,YAAA,CAAc,GAEb,MAAM,EAAS,KACT,EAAO,KAAK,KACZ,EAAa,KAAK,WAClB,EAAc,EAAK,UAAW,GAEpC,IAAI,EACJ,MAAM,EAAiB,GAGjB,EAAU,GAEhB,IAJ2B,EAAY,YAAc,IAI5B,GAAW,qBAAwB,CAE3D,MAAM,EAAe,EAAY,GAAW,qBAC5C,EAAe,EAAa,kBAC5B,EAAQ,KAAM,EAAa,aAAc,EAAgB,EAAa,GAEvE,KAAO,CAKN,MAAM,EAAoB,EAAY,sBAAwB,GAK9D,GAHA,EAAe,MAAQ,IAAI,QAAO,EAAK,EAAK,GAC5C,EAAe,QAAU,EAEpB,MAAM,QAAS,EAAkB,iBAAoB,CAEzD,MAAM,EAAQ,EAAkB,gBAEhC,EAAe,MAAM,OAAQ,EAAO,GAAK,EAAO,GAAK,EAAO,GAAK,wBACjE,EAAe,QAAU,EAAO,EAEjC,UAEK,EAAkB,kBAEtB,EAAQ,KAAM,EAAO,cAAe,EAAgB,MAAO,EAAkB,iBAAkB,mBAIhG,EAAe,mBAAY,EAAkB,eAA+B,EAAkB,eAAiB,EAC/G,EAAe,mBAAY,EAAkB,gBAAgC,EAAkB,gBAAkB,WAE5G,EAAkB,2BAEtB,EAAQ,KAAM,EAAO,cAAe,EAAgB,eAAgB,EAAkB,2BACtF,EAAQ,KAAM,EAAO,cAAe,EAAgB,eAAgB,EAAkB,4BAIvF,EAAe,KAAK,qBAAuB,GAE1C,OAAO,EAAI,iBAAmB,EAAI,gBAAiB,EAEpD,IAEA,EAAQ,KAAM,QAAQ,IAAK,KAAK,qBAAuB,GAEtD,OAAO,EAAI,sBAAwB,EAAI,qBAAsB,EAAe,EAE7E,KAED,MAEK,EAAY,cAEhB,EAAe,KAAO,cAIvB,MAAM,EAAY,EAAY,WAAa,GAqB3C,GAnBK,IAAc,IAElB,EAAe,eAGf,EAAe,gBAIf,EAAe,eAEV,IAAc,KAElB,EAAe,mBAAY,EAAY,YAA4B,EAAY,YAAc,cAM1F,EAAY,eAA+B,IAAiB,sBAEhE,EAAQ,KAAM,EAAO,cAAe,EAAgB,YAAa,EAAY,gBAE7E,EAAe,YAAc,IAAI,UAAS,EAAG,YAExC,EAAY,cAAc,OAAsB,CAEpD,MAAM,EAAQ,EAAY,cAAc,MAExC,EAAe,YAAY,IAAK,EAAO,EAExC,CAgBD,YAZK,EAAY,kBAAkC,IAAiB,sBAEnE,EAAQ,KAAM,EAAO,cAAe,EAAgB,QAAS,EAAY,4BAEpE,EAAY,iBAAiB,WAEjC,EAAe,eAAiB,EAAY,iBAAiB,oBAM1D,EAAY,gBAAgC,IAAiB,oBAAoB,CAErF,MAAM,EAAiB,EAAY,eACnC,EAAe,UAAW,IAAI,SAAQ,OAAQ,EAAgB,GAAK,EAAgB,GAAK,EAAgB,GAAK,uBAE9G,CAQA,gBANK,EAAY,iBAAiC,IAAiB,qBAElE,EAAQ,KAAM,EAAO,cAAe,EAAgB,cAAe,EAAY,gBAAiB,mBAI1F,QAAQ,IAAK,GAAU,iBAE7B,MAAM,EAAW,IAAI,EAAc,GAUnC,OARK,EAAY,OAAO,EAAS,KAAO,EAAY,MAEpD,GAAwB,EAAU,GAElC,EAAO,aAAa,IAAK,EAAU,CAAE,UAAW,IAE3C,EAAY,YAAa,GAAgC,EAAY,EAAU,GAE7E,CAER,GAED,CASA,gBAAA,CAAkB,GAEjB,MAAM,EAAgB,kBAAgB,iBAAkB,GAAgB,IAExE,OAAK,KAAiB,KAAK,cAEnB,EAAgB,OAAW,KAAK,cAAe,IAItD,KAAK,cAAe,GAAkB,EAE/B,EAIT,CAWA,cAAA,CAAgB,GAEf,MAAM,EAAS,KACT,EAAa,KAAK,WAClB,EAAQ,KAAK,eAEnB,SAAS,EAAsB,GAE9B,OAAO,EAAY,GAAW,4BAC5B,gBAAiB,EAAW,GAC5B,eAAiB,GAEjB,OAAO,GAAwB,EAAU,EAAW,EAErD,GAEF,CAEA,MAAM,EAAU,GAEhB,QAAU,EAAI,EAAG,EAAK,EAAW,OAAQ,EAAI,EAAI,IAAO,CAEvD,MAAM,EAAY,EAAY,GACxB,EAAW,GAAoB,GAG/B,EAAS,EAAO,GAEtB,GAAK,EAGJ,EAAQ,KAAM,EAAO,aAEf,CAEN,IAAI,EAKH,EAHI,EAAU,YAAc,EAAU,WAAY,GAAW,4BAG3C,EAAsB,GAKtB,GAAwB,IAAI,iBAAkB,EAAW,GAK5E,EAAO,GAAa,CAAE,UAAW,EAAW,QAAS,GAErD,EAAQ,KAAM,EAEf,CAED,CAEA,OAAO,QAAQ,IAAK,EAErB,CASA,QAAA,CAAU,GAET,MAAM,EAAS,KACT,EAAO,KAAK,KACZ,EAAa,KAAK,WAElB,EAAU,EAAK,OAAQ,GACvB,EAAa,EAAQ,WAErB,EAAU,GAEhB,QAAU,EAAI,EAAG,EAAK,EAAW,OAAQ,EAAI,EAAI,IAAO,CAEvD,MAAM,WAAW,EAAY,GAAI,oBA7gDJ,EA8gDH,KAAK,OA5gDJ,kBAE5B,kBAA6B,IAAI,uBAAsB,CACtD,MAAO,SACP,SAAU,EACV,UAAW,EACX,UAAW,EACX,eACA,aACA,KAAM,eAKD,EAAwB,iBA+/C1B,KAAK,cAAe,WAAY,EAAY,GAAI,UAEnD,EAAQ,KAAM,EAEf,CAnhDF,IAAgC,EAuhD9B,OAFA,EAAQ,KAAM,EAAO,eAAgB,IAE9B,QAAQ,IAAK,GAAU,eAAiB,GAE9C,MAAM,EAAY,EAAQ,MAAO,EAAG,EAAQ,OAAS,GAC/C,EAAa,EAAS,EAAQ,OAAS,GAEvC,EAAS,GAEf,QAAU,EAAI,EAAG,EAAK,EAAW,OAAQ,EAAI,EAAI,IAAO,CAEvD,MAAM,EAAW,EAAY,GACvB,EAAY,EAAY,GAI9B,IAAI,EAEJ,MAAM,EAAW,EAAW,GAE5B,GAAK,EAAU,OAAS,GAAgB,WACtC,EAAU,OAAS,GAAgB,gBACnC,EAAU,OAAS,GAAgB,uBACnC,EAAU,KAGX,OAAO,EAAQ,cACZ,IAAI,cAAa,EAAU,GAC3B,IAAI,OAAM,EAAU,QAElB,EAAK,eAGT,EAAK,uBAID,EAAU,OAAS,GAAgB,eAEvC,EAAK,SAAW,GAAqB,EAAK,SAAU,yBAEzC,EAAU,OAAS,GAAgB,eAE9C,EAAK,SAAW,GAAqB,EAAK,SAAU,gCAI1C,EAAU,OAAS,GAAgB,MAE9C,EAAO,IAAI,eAAc,EAAU,WAExB,EAAU,OAAS,GAAgB,WAE9C,EAAO,IAAI,OAAM,EAAU,WAEhB,EAAU,OAAS,GAAgB,UAE9C,EAAO,IAAI,WAAU,EAAU,OAEzB,IAAK,EAAU,OAAS,GAAgB,OAM9C,MAAM,IAAI,MAAO,iDAAmD,EAAU,MAJ9E,EAAO,IAAI,SAAQ,EAAU,EAM9B,CAEK,OAAO,KAAM,EAAK,SAAS,iBAAkB,OAAS,GAE1D,GAAoB,EAAM,GAI3B,EAAK,KAAO,EAAO,iBAAkB,EAAQ,MAAU,QAAU,GAEjE,GAAwB,EAAM,GAEzB,EAAU,YAAa,GAAgC,EAAY,EAAM,GAE9E,EAAO,oBAAqB,GAE5B,EAAO,KAAM,EAEd,CAEA,QAAU,EAAI,EAAG,EAAK,EAAO,OAAQ,EAAI,EAAI,IAE5C,EAAO,aAAa,IAAK,EAAQ,GAAK,CACrC,OAAQ,EACR,WAAY,IAKd,GAAuB,IAAlB,EAAO,OAIX,OAFK,EAAQ,YAAa,GAAgC,EAAY,EAAQ,GAAK,GAE5E,EAAQ,GAIhB,MAAM,EAAQ,IAAI,QAEb,EAAQ,YAAa,GAAgC,EAAY,EAAO,GAE7E,EAAO,aAAa,IAAK,EAAO,CAAE,OAAQ,IAE1C,QAAU,EAAI,EAAG,EAAK,EAAO,OAAQ,EAAI,EAAI,IAE5C,EAAM,IAAK,EAAQ,IAIpB,OAAO,CAER,GAED,CASA,UAAA,CAAY,GAEX,IAAI,EACJ,MAAM,EAAY,KAAK,KAAK,QAAS,GAC/B,EAAS,EAAW,EAAU,MAEpC,GAAO,EAqBP,MAdwB,gBAAnB,EAAU,KAEd,EAAS,IAAI,oBAAmB,YAAU,SAAU,EAAO,MAAQ,EAAO,aAAe,EAAG,EAAO,OAAS,EAAG,EAAO,MAAQ,KAEhG,iBAAnB,EAAU,OAErB,EAAS,IAAI,sBAAsB,EAAO,KAAM,EAAO,KAAM,EAAO,MAAQ,EAAO,KAAM,EAAO,MAAO,EAAO,OAI1G,EAAU,OAAO,EAAO,KAAO,KAAK,iBAAkB,EAAU,OAErE,GAAwB,EAAQ,GAEzB,QAAQ,QAAS,GAnBvB,QAAQ,KAAM,+CAqBhB,CASA,QAAA,CAAU,GAET,MAAM,EAAU,KAAK,KAAK,MAAO,GAE3B,EAAU,GAEhB,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAO,OAAQ,EAAI,EAAI,IAEpD,EAAQ,KAAM,KAAK,iBAAkB,EAAQ,OAAQ,KActD,gBAVK,EAAQ,oBAEZ,EAAQ,KAAM,KAAK,cAAe,WAAY,EAAQ,sBAItD,EAAQ,KAAM,MAIR,QAAQ,IAAK,GAAU,eAAiB,GAE9C,MAAM,EAAsB,EAAQ,MAC9B,EAAa,EAKb,EAAQ,GACR,EAAe,GAErB,QAAU,EAAI,EAAG,EAAK,EAAW,OAAQ,EAAI,EAAI,IAAO,CAEvD,MAAM,EAAY,EAAY,GAE9B,GAAK,EAAY,CAEhB,EAAM,KAAM,GAEZ,MAAM,EAAM,IAAI,UAEa,OAAxB,GAEJ,EAAI,UAAW,EAAoB,MAAW,GAAJ,GAI3C,EAAa,KAAM,EAEpB,MAEC,QAAQ,KAAM,mDAAoD,EAAQ,OAAQ,GAIpF,CAEA,OAAO,IAAI,WAAU,EAAO,EAE7B,GAED,CASA,aAAA,CAAe,GAEd,MAAM,EAAO,KAAK,KACZ,EAAS,KAET,EAAe,EAAK,WAAY,GAChC,EAAgB,EAAa,KAAO,EAAa,KAAO,aAAe,EAEvE,EAAe,GACf,EAAwB,GACxB,EAAyB,GACzB,EAAkB,GAClB,EAAiB,GAEvB,QAAU,EAAI,EAAG,EAAK,EAAa,SAAS,OAAQ,EAAI,EAAI,IAAO,CAElE,MAAM,EAAU,EAAa,SAAU,GACjC,EAAU,EAAa,SAAU,EAAQ,SACzC,EAAS,EAAQ,OACjB,EAAO,EAAO,KACd,WAAQ,EAAa,WAA2B,EAAa,WAAY,EAAQ,OAAU,EAAQ,MACnG,WAAS,EAAa,WAA2B,EAAa,WAAY,EAAQ,QAAW,EAAQ,gBAEtG,EAAO,OAEZ,EAAa,KAAM,KAAK,cAAe,OAAQ,IAC/C,EAAsB,KAAM,KAAK,cAAe,WAAY,IAC5D,EAAuB,KAAM,KAAK,cAAe,WAAY,IAC7D,EAAgB,KAAM,GACtB,EAAe,KAAM,GAEtB,CAEA,OAAO,QAAQ,IAAK,CAEnB,QAAQ,IAAK,GACb,QAAQ,IAAK,GACb,QAAQ,IAAK,GACb,QAAQ,IAAK,GACb,QAAQ,IAAK,KAEV,eAAiB,GAEpB,MAAM,EAAQ,EAAc,GACtB,EAAiB,EAAc,GAC/B,EAAkB,EAAc,GAChC,EAAW,EAAc,GACzB,EAAU,EAAc,GAExB,EAAS,GAEf,QAAU,EAAI,EAAG,EAAK,EAAM,OAAQ,EAAI,EAAI,IAAO,CAElD,MAAM,EAAO,EAAO,GACd,EAAgB,EAAgB,GAChC,EAAiB,EAAiB,GAClC,EAAU,EAAU,GACpB,EAAS,EAAS,GAExB,YAAK,EAAqB,SAErB,EAAK,cAET,EAAK,eAIN,MAAM,EAAgB,EAAO,uBAAwB,EAAM,EAAe,EAAgB,EAAS,GAEnG,GAAK,EAEJ,QAAU,EAAI,EAAG,EAAI,EAAc,OAAQ,IAE1C,EAAO,KAAM,EAAe,GAM/B,CAEA,MAAM,EAAY,IAAI,gBAAe,SAA0B,GAI/D,OAFA,GAAwB,EAAW,GAE5B,CAER,GAED,CAEA,cAAA,CAAgB,GAEf,MAAM,EAAO,KAAK,KACZ,EAAS,KACT,EAAU,EAAK,MAAO,GAE5B,gBAAK,EAAQ,KAA4B,KAElC,EAAO,cAAe,OAAQ,EAAQ,MAAO,eAAiB,GAEpE,MAAM,EAAO,EAAO,YAAa,EAAO,UAAW,EAAQ,KAAM,GAmBjE,gBAhBK,EAAQ,SAEZ,EAAK,mBAAqB,GAEzB,GAAO,EAAE,OAET,QAAU,EAAI,EAAG,EAAK,EAAQ,QAAQ,OAAQ,EAAI,EAAI,IAErD,EAAE,sBAAuB,GAAM,EAAQ,QAAS,EAIlD,IAIM,CAER,GAED,CASA,QAAA,CAAU,GAET,MACM,EAAS,KAET,EAHO,KAAK,KAGG,MAAO,GAEtB,EAAc,EAAO,iBAAkB,GAEvC,EAAe,GACf,EAAc,EAAQ,UAAY,GAExC,QAAU,EAAI,EAAG,EAAK,EAAY,OAAQ,EAAI,EAAI,IAEjD,EAAa,KAAM,EAAO,cAAe,OAAQ,EAAa,KAI/D,MAAM,WAAkB,EAAQ,KAC7B,QAAQ,QAAS,MACjB,EAAO,cAAe,OAAQ,EAAQ,MAEzC,OAAO,QAAQ,IAAK,CACnB,EACA,QAAQ,IAAK,GACb,IACG,eAAiB,GAEpB,MAAM,EAAO,EAAS,GAChB,EAAW,EAAS,GACpB,EAAW,EAAS,GAER,OAAb,GAIJ,EAAK,mBAAqB,GAElB,EAAK,eAEZ,EAAK,KAAM,EAAU,GAEtB,IAID,QAAU,EAAI,EAAG,EAAK,EAAS,OAAQ,EAAI,EAAI,IAE9C,EAAK,IAAK,EAAU,IAIrB,OAAO,CAER,GAED,CAIA,gBAAA,CAAkB,GAEjB,MAAM,EAAO,KAAK,KACZ,EAAa,KAAK,WAClB,EAAS,KAKf,YAAK,KAAK,UAAW,GAEpB,OAAO,KAAK,UAAW,GAIxB,MAAM,EAAU,EAAK,MAAO,GAGtB,EAAW,EAAQ,KAAO,EAAO,iBAAkB,EAAQ,MAAS,GAEpE,EAAU,GAEV,EAAc,EAAO,qBAAuB,GAEjD,OAAO,EAAI,gBAAkB,EAAI,eAAgB,EAElD,IAqHA,OAnHK,GAEJ,EAAQ,KAAM,YAIV,EAAQ,QAEZ,EAAQ,KAAM,EAAO,cAAe,SAAU,EAAQ,QAAS,eAAiB,GAE/E,OAAO,EAAO,YAAa,EAAO,YAAa,EAAQ,OAAQ,EAEhE,KAID,EAAO,qBAAuB,GAE7B,OAAO,EAAI,sBAAwB,EAAI,qBAAsB,EAE9D,IAAI,kBAAoB,GAEvB,EAAQ,KAAM,EAEf,IAEA,KAAK,UAAW,GAAc,QAAQ,IAAK,GAAU,eAAiB,GAErE,IAAI,EAqBJ,GAhBC,OAFI,EAAQ,OAEL,IAAI,OAEA,EAAQ,OAAS,EAErB,IAAI,QAEmB,IAAnB,EAAQ,OAEZ,EAAS,GAIT,IAAI,WAIP,IAAS,EAAS,GAEtB,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAQ,EAAI,EAAI,IAE7C,EAAK,IAAK,EAAS,IAiBrB,GAXK,EAAQ,OAEZ,EAAK,SAAS,KAAO,EAAQ,KAC7B,EAAK,KAAO,GAIb,GAAwB,EAAM,GAEzB,EAAQ,YAAa,GAAgC,EAAY,EAAM,YAEvE,EAAQ,OAAuB,CAEnC,MAAM,EAAS,IAAI,UACnB,EAAO,UAAW,EAAQ,QAC1B,EAAK,aAAc,EAEpB,eAEM,EAAQ,aAEZ,EAAK,SAAS,UAAW,EAAQ,sBAI7B,EAAQ,UAEZ,EAAK,WAAW,UAAW,EAAQ,mBAI/B,EAAQ,OAEZ,EAAK,MAAM,UAAW,EAAQ,OAMhC,GAAO,EAAO,aAAa,IAAK,IAIzB,YAAK,EAAQ,MAAsB,EAAO,UAAU,KAAM,EAAQ,MAAS,EAAI,CAErF,MAAM,EAAU,EAAO,aAAa,IAAK,GACzC,EAAO,aAAa,IAAK,EAAM,IAAK,GAErC,OAPC,EAAO,aAAa,IAAK,EAAM,IAWhC,OAFA,EAAO,aAAa,IAAK,GAAO,MAAQ,EAEjC,CAER,IAEO,KAAK,UAAW,EAExB,CASA,SAAA,CAAW,GAEV,MAAM,EAAa,KAAK,WAClB,EAAW,KAAK,KAAK,OAAQ,GAC7B,EAAS,KAIT,EAAQ,IAAI,QACb,EAAS,OAAO,EAAM,KAAO,EAAO,iBAAkB,EAAS,OAEpE,GAAwB,EAAO,GAE1B,EAAS,YAAa,GAAgC,EAAY,EAAO,GAE9E,MAAM,EAAU,EAAS,OAAS,GAE5B,EAAU,GAEhB,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAQ,EAAI,EAAI,IAE7C,EAAQ,KAAM,EAAO,cAAe,OAAQ,EAAS,KAItD,OAAO,QAAQ,IAAK,GAAU,eAAiB,GAE9C,QAAU,EAAI,EAAG,EAAK,EAAM,OAAQ,EAAI,EAAI,IAE3C,EAAM,IAAK,EAAO,IAsCnB,OAFA,EAAO,cA9BsB,IAE5B,MAAM,EAAsB,IAAI,IAEhC,UAAc,EAAK,KAAW,EAAO,cAE/B,aAAe,YAAY,aAAe,YAE9C,EAAoB,IAAK,EAAK,GAkBhC,OAZA,EAAK,UAAY,IAEhB,MAAM,EAAW,EAAO,aAAa,IAAK,GAEzB,MAAZ,GAEJ,EAAoB,IAAK,EAAM,EAEhC,IAIM,CAAmB,EAIpB,CAAmC,GAEnC,CAER,GAED,CAEA,sBAAA,CAAwB,EAAM,EAAe,EAAgB,EAAS,GAErE,MAAM,EAAS,GAET,EAAa,EAAK,KAAO,EAAK,KAAO,EAAK,KAC1C,EAAc,GAoBpB,IAAI,EAEJ,OApBK,GAAiB,EAAO,QAAW,GAAgB,QAEvD,EAAK,mBAAqB,GAEpB,EAAO,uBAEX,EAAY,KAAM,EAAO,KAAO,EAAO,KAAO,EAAO,KAIvD,IAIA,EAAY,KAAM,GAMV,GAAiB,EAAO,OAEhC,KAAK,GAAgB,QAEpB,EAAqB,sBACrB,MAED,KAAK,GAAgB,SAEpB,EAAqB,0BACrB,MAED,KAAK,GAAgB,YACrB,KAAK,GAAgB,MAEpB,EAAqB,sBACrB,MAED,QAKG,EADI,IAFG,EAAe,SAGD,sBAKA,sBASzB,MAAM,WAAgB,EAAQ,cAA8B,GAAe,EAAQ,eAAkB,oBAG/F,EAAc,KAAK,sBAAuB,GAEhD,QAAU,EAAI,EAAG,EAAK,EAAY,OAAQ,EAAI,EAAI,IAAO,CAExD,MAAM,EAAQ,IAAI,EACjB,EAAa,GAAM,IAAM,GAAiB,EAAO,MACjD,EAAc,MACd,EACA,GAI8B,gBAA1B,EAAQ,eAEZ,KAAK,mCAAoC,GAI1C,EAAO,KAAM,EAEd,CAEA,OAAO,CAER,CAEA,qBAAA,CAAuB,GAEtB,IAAI,EAAc,EAAS,MAE3B,GAAK,EAAS,WAAa,CAE1B,MAAM,EAAQ,GAA6B,EAAY,aACjD,EAAS,IAAI,aAAc,EAAY,QAE7C,QAAU,EAAI,EAAG,EAAK,EAAY,OAAQ,EAAI,EAAI,IAEjD,EAAQ,GAAM,EAAa,GAAM,EAIlC,EAAc,CAEf,CAEA,OAAO,CAER,CAEA,kCAAA,CAAoC,GAEnC,EAAM,kBAAoB,SAAkD,GAQ3E,OAAO,IAFmB,gBAAgB,0BAA4B,GAAuC,IAEjF,KAAK,MAAO,KAAK,OAAQ,KAAK,eAAiB,EAAG,EAE/E,EAGA,EAAM,kBAAkB,4CAEzB,EAiID,SAAS,GAAwB,EAAU,EAAc,GAExD,MAAM,EAAa,EAAa,WAE1B,EAAU,GAEhB,SAAS,EAAyB,EAAe,GAEhD,OAAO,EAAO,cAAe,WAAY,GACvC,eAAiB,GAEjB,EAAS,aAAc,EAAe,EAEvC,GAEF,CAEA,UAAY,KAAqB,EAAa,CAE7C,MAAM,EAAqB,GAAY,IAAuB,EAAkB,cAG3E,KAAsB,EAAS,YAEpC,EAAQ,KAAM,EAAyB,EAAY,GAAqB,GAEzE,CAEA,YAAK,EAAa,UAA2B,EAAS,MAAQ,CAE7D,MAAM,EAAW,EAAO,cAAe,WAAY,EAAa,SAAU,eAAiB,GAE1F,EAAS,SAAU,EAEpB,IAEA,EAAQ,KAAM,EAEf,CAYA,OAVK,kBAAgB,oBAAsB,wBAAwB,YAAa,GAE/E,QAAQ,KAAM,qEAAqE,kBAAgB,qCAIpG,GAAwB,EAAU,YApKX,EAAU,EAAc,GAE/C,MAAM,EAAa,EAAa,WAE1B,EAAM,IAAI,OAEhB,YAAK,EAAW,SAkCf,OAlCwC,CAExC,MAAM,EAAW,EAAO,KAAK,UAAW,EAAW,UAE7C,EAAM,EAAS,IACf,EAAM,EAAS,IAIrB,YAAK,YAAqB,EAmBzB,YAFA,QAAQ,KAAM,uEAVd,GALA,EAAI,IACH,IAAI,UAAS,EAAK,GAAK,EAAK,GAAK,EAAK,IACtC,IAAI,UAAS,EAAK,GAAK,EAAK,GAAK,EAAK,KAGlC,EAAS,WAAa,CAE1B,MAAM,EAAW,GAA6B,GAAuB,EAAS,gBAC9E,EAAI,IAAI,eAAgB,GACxB,EAAI,IAAI,eAAgB,EAEzB,CAUF,CAMA,MAAM,EAAU,EAAa,QAE7B,YAAK,EAAwB,CAE5B,MAAM,EAAkB,IAAI,UACtB,EAAS,IAAI,UAEnB,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAQ,EAAI,EAAI,IAAO,CAEpD,MAAM,EAAS,EAAS,GAExB,YAAK,EAAO,SAAyB,CAEpC,MAAM,EAAW,EAAO,KAAK,UAAW,EAAO,UACzC,EAAM,EAAS,IACf,EAAM,EAAS,IAIrB,YAAK,YAAqB,EAAoB,CAQ7C,GALA,EAAO,KAAM,KAAK,IAAK,KAAK,IAAK,EAAK,IAAO,KAAK,IAAK,EAAK,MAC5D,EAAO,KAAM,KAAK,IAAK,KAAK,IAAK,EAAK,IAAO,KAAK,IAAK,EAAK,MAC5D,EAAO,KAAM,KAAK,IAAK,KAAK,IAAK,EAAK,IAAO,KAAK,IAAK,EAAK,MAGvD,EAAS,WAAa,CAE1B,MAAM,EAAW,GAA6B,GAAuB,EAAS,gBAC9E,EAAO,eAAgB,EAExB,CAMA,EAAgB,IAAK,EAEtB,MAEC,QAAQ,KAAM,sEAIhB,CAED,CAGA,EAAI,eAAgB,EAErB,CAEA,EAAS,YAAc,EAEvB,MAAM,EAAS,IAAI,SAEnB,EAAI,UAAW,EAAO,QACtB,EAAO,OAAS,EAAI,IAAI,WAAY,EAAI,KAAQ,EAEhD,EAAS,eAAiB,CAE3B,CAwDmC,CAEnB,EAAU,EAAc,GAEhC,QAAQ,IAAK,GAAU,iBAE7B,gBAAO,EAAa,QAApB,SA55EwB,EAAU,EAAS,GAE5C,IAAI,KACA,KACA,KAEJ,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAQ,EAAI,EAAI,IAAO,CAEpD,MAAM,EAAS,EAAS,GAMxB,YAJK,EAAO,WAAyB,WAAmB,IACnD,EAAO,SAAuB,WAAiB,IAC/C,EAAO,UAAwB,MAE/B,GAAoB,GAAkB,EAAgB,KAE5D,CAEA,IAAO,IAAsB,IAAoB,EAAgB,OAAO,QAAQ,QAAS,GAEzF,MAAM,EAA2B,GAC3B,EAAyB,GACzB,EAAwB,GAE9B,QAAU,EAAI,EAAG,EAAK,EAAQ,OAAQ,EAAI,EAAI,IAAO,CAEpD,MAAM,EAAS,EAAS,GAExB,GAAK,EAAmB,CAEvB,MAAM,WAAkB,EAAO,SAC5B,EAAO,cAAe,WAAY,EAAO,UACzC,EAAS,WAAW,SAEvB,EAAyB,KAAM,EAEhC,CAEA,GAAK,EAAiB,CAErB,MAAM,WAAkB,EAAO,OAC5B,EAAO,cAAe,WAAY,EAAO,QACzC,EAAS,WAAW,OAEvB,EAAuB,KAAM,EAE9B,CAEA,GAAK,EAAgB,CAEpB,MAAM,WAAkB,EAAO,QAC5B,EAAO,cAAe,WAAY,EAAO,SACzC,EAAS,WAAW,MAEvB,EAAsB,KAAM,EAE7B,CAED,CAEA,OAAO,QAAQ,IAAK,CACnB,QAAQ,IAAK,GACb,QAAQ,IAAK,GACb,QAAQ,IAAK,KACV,eAAiB,GAEpB,MAAM,EAAiB,EAAW,GAC5B,EAAe,EAAW,GAC1B,EAAc,EAAW,GAO/B,OALK,IAAmB,EAAS,gBAAgB,SAAW,GACvD,IAAiB,EAAS,gBAAgB,OAAS,GACnD,IAAgB,EAAS,gBAAgB,MAAQ,GACtD,EAAS,wBAEF,CAER,GAED,CA60EE,CACoB,EAAU,EAAa,QAAS,GACjD,CAEJ,GAED,CC/vJA,MAAM,GAAa,IAAI,QAkCvB,MAAM,WAAoB,SAOzB,WAAA,CAAa,GAEZ,MAAO,GAEP,KAAK,YAAc,GACnB,KAAK,cAAgB,GACrB,KAAK,cAAgB,KACrB,KAAK,eAAiB,KAEtB,KAAK,YAAc,EACnB,KAAK,WAAa,GAClB,KAAK,iBAAmB,EACxB,KAAK,gBAAkB,GAEvB,KAAK,oBAAsB,CAC1B,SAAU,WACV,OAAQ,SACR,MAAO,QACP,GAAI,aAEL,KAAK,sBAAwB,CAC5B,SAAU,eACV,OAAQ,eACR,MAAO,eACP,GAAI,eAGN,CAQA,cAAA,CAAgB,GAIf,OAFA,KAAK,YAAc,EAEZ,IAER,CAQA,gBAAA,CAAkB,GAIjB,OAFA,KAAK,cAAgB,EAEd,IAER,CASA,cAAA,CAAgB,GAIf,OAFA,KAAK,YAAc,EAEZ,IAER,CAWA,IAAA,CAAM,EAAK,EAAQ,EAAY,GAE9B,MAAM,EAAS,IAAI,aAAY,KAAK,SAEpC,EAAO,QAAS,KAAK,MACrB,EAAO,gBAAiB,eACxB,EAAO,iBAAkB,KAAK,eAC9B,EAAO,mBAAoB,KAAK,iBAEhC,EAAO,KAAM,GAAO,IAEnB,KAAK,MAAO,EAAQ,EAAQ,EAAS,GAEnC,EAAY,EAEhB,CASA,KAAA,CAAO,EAAQ,EAAQ,EAAU,QAEhC,KAAK,gBAAiB,EAAQ,EAAQ,KAAM,KAAM,iBAAgB,GAAU,MAAO,EAEpF,CAIA,eAAA,CAAiB,EAAQ,EAAU,EAAc,EAAgB,EAAmB,uBAAsB,EAAU,QAEnH,MAAM,EAAa,CAClB,aAAc,GAAgB,KAAK,oBACnC,eAAgB,GAAkB,KAAK,sBACvC,eAAiB,EACjB,iBAAkB,GAGnB,OAAO,KAAK,eAAgB,EAAQ,GAAa,KAAM,GAAW,MAAO,EAE1E,CAEA,cAAA,CAAgB,EAAQ,GAEvB,MAAM,EAAU,KAAK,UAAW,GAIhC,GAAK,GAAW,IAAK,GAAW,CAE/B,MAAM,EAAa,GAAW,IAAK,GAEnC,GAAK,EAAW,MAAQ,EAEvB,OAAO,EAAW,QAEZ,GAA2B,IAAtB,EAAO,WAMlB,MAAM,IAAI,MAET,gHAOH,CAIA,IAAI,EACJ,MAAM,EAAS,KAAK,mBACd,EAAW,EAAO,WAIlB,EAAkB,KAAK,WAAY,EAAQ,GAC/C,MAAQ,IAER,EAAS,EAEF,IAAI,UAAW,EAAS,KAE9B,EAAO,WAAY,GAAW,CAAE,UAAS,UAEzC,EAAO,YAAa,CAAE,KAAM,SAAU,GAAI,EAAQ,aAAY,UAAU,CAAE,GAAU,OAOrF,MAAQ,GAAa,KAAK,gBAAiB,EAAQ,YA0BrD,OAtBA,EACE,YAAO,IACP,WAEK,GAAU,GAEd,KAAK,aAAc,EAAQ,EAI5B,IAKF,GAAW,IAAK,EAAQ,CAEvB,IAAK,EACL,QAAS,IAIH,CAER,CAEA,eAAA,CAAiB,GAEhB,MAAM,EAAW,IAAI,iBAEhB,EAAa,OAEjB,EAAS,SAAU,IAAI,kBAAiB,EAAa,MAAM,MAAO,IAInE,QAAU,EAAI,EAAG,EAAI,EAAa,WAAW,OAAQ,IAAO,CAE3D,MAAM,KAAE,EAAI,MAAE,EAAK,SAAE,EAAQ,OAAE,EAAM,iBAAE,GAAqB,EAAa,WAAY,GAErF,IAAI,EAEJ,GAAK,IAAa,EAEjB,EAAY,IAAI,kBAAiB,EAAO,OAElC,CAEN,MAAM,EAAS,IAAI,oBAAmB,EAAO,GAE7C,EAAY,IAAI,6BAA4B,EAAQ,EAAU,EAE/D,CAEc,UAAT,IAEJ,KAAK,wBAAyB,EAAW,GAEzC,EAAU,aAAe,aAAiB,eAI3C,EAAS,aAAc,EAAM,EAE9B,CAEA,OAAO,CAER,CAEA,uBAAA,CAAyB,EAAW,GAOnC,GAAK,IAAoB,iBAAiB,OAE1C,MAAM,EAAS,IAAI,QAEnB,QAAU,EAAI,EAAG,EAAK,EAAU,MAAO,EAAI,EAAI,IAE9C,EAAO,oBAAqB,EAAW,GACvC,kBAAgB,oBAAqB,EAAQ,kBAC7C,EAAU,OAAQ,EAAG,EAAO,EAAG,EAAO,EAAG,EAAO,EAIlD,CAEA,YAAA,CAAc,EAAK,GAElB,MAAM,EAAS,IAAI,aAAY,KAAK,SAKpC,OAJA,EAAO,QAAS,KAAK,aACrB,EAAO,gBAAiB,GACxB,EAAO,mBAAoB,KAAK,iBAEzB,IAAI,UAAW,EAAS,KAE9B,EAAO,KAAM,EAAK,SAAoB,EAAQ,GAIhD,CAEA,OAAA,GAIC,OAFA,KAAK,eAEE,IAER,CAEA,YAAA,GAEC,GAAK,KAAK,eAAiB,OAAO,KAAK,eAEvC,MAAM,EAA+B,iBAAhB,aAAwD,OAA5B,KAAK,cAAc,KAC9D,EAAmB,GAsCzB,OApCK,EAEJ,EAAiB,KAAM,KAAK,aAAc,mBAAoB,UAI9D,EAAiB,KAAM,KAAK,aAAc,wBAAyB,SACnE,EAAiB,KAAM,KAAK,aAAc,qBAAsB,iBAIjE,KAAK,eAAiB,QAAQ,IAAK,GACjC,MAAQ,IAER,MAAM,EAAY,EAAW,GAEtB,IAEN,KAAK,cAAc,WAAa,EAAW,IAI5C,MAAM,EAAK,GAAY,WAEjB,EAAO,CACZ,sBACA,EACA,GACA,eACA,EAAG,UAAW,EAAG,QAAS,KAAQ,EAAG,EAAG,YAAa,OACpD,KAAM,MAER,KAAK,gBAAkB,IAAI,gBAAiB,IAAI,KAAM,CAAE,IAAU,IAI7D,KAAK,cAEb,CAEA,UAAA,CAAY,EAAQ,GAEnB,OAAO,KAAK,eAAe,WAE1B,GAAK,KAAK,WAAW,OAAS,KAAK,YAAc,CAEhD,MAAM,EAAS,IAAI,OAAQ,KAAK,iBAEhC,EAAO,WAAa,GACpB,EAAO,WAAa,GACpB,EAAO,UAAY,EAEnB,EAAO,YAAa,CAAE,KAAM,OAAQ,cAAe,KAAK,gBAExD,EAAO,UAAY,SAAW,GAE7B,MAAM,EAAU,EAAE,KAElB,OAAS,EAAQ,MAEhB,IAAK,SACJ,EAAO,WAAY,EAAQ,IAAK,QAAS,GACzC,MAED,IAAK,QACJ,EAAO,WAAY,EAAQ,IAAK,OAAQ,GACxC,MAED,QACC,QAAQ,MAAO,2CAA6C,EAAQ,KAAO,KAI9E,EAEA,KAAK,WAAW,KAAM,EAEvB,MAEC,KAAK,WAAW,eAAiB,EAAG,GAEnC,OAAO,EAAE,UAAY,EAAE,aAAkB,CAE1C,IAID,MAAM,EAAS,KAAK,WAAY,KAAK,WAAW,OAAS,GAGzD,OAFA,EAAO,WAAY,GAAW,EAC9B,EAAO,WAAa,EACb,CAAM,GAIf,CAEA,YAAA,CAAc,EAAQ,GAErB,EAAO,WAAa,EAAO,WAAY,UAChC,EAAO,WAAY,UACnB,EAAO,WAAY,EAE3B,CAEA,KAAA,GAEC,QAAQ,IAAK,cAAe,KAAK,WAAW,KAAO,GAAY,EAAO,YAEvE,CAEA,OAAA,GAEC,QAAU,EAAI,EAAG,EAAI,KAAK,WAAW,SAAW,EAE/C,KAAK,WAAY,GAAI,YAYtB,OARA,KAAK,WAAW,OAAS,EAEK,KAAzB,KAAK,iBAET,IAAI,gBAAiB,KAAK,iBAIpB,IAER,EAMD,SAAS,KAER,IAAI,EACA,EAkKJ,SAAS,EAAiB,EAAO,EAAS,EAAe,EAAe,EAAY,GAEnF,MAAM,EAAQ,EAAc,aACtB,EAAW,EAAU,iBACrB,WAyDoB,EAAO,GAEjC,OAAS,GAER,KAAK,aAAc,OAAO,EAAM,WAChC,KAAK,UAAW,OAAO,EAAM,QAC7B,KAAK,WAAY,OAAO,EAAM,SAC9B,KAAK,WAAY,OAAO,EAAM,SAC9B,KAAK,WAAY,OAAO,EAAM,SAC9B,KAAK,YAAa,OAAO,EAAM,UAC/B,KAAK,YAAa,OAAO,EAAM,UAIjC,CAvEO,CAAkC,EAAO,GAGzC,EAAgB,EAAW,EAAW,kBACtC,EAAiD,EAAjC,KAAK,KAAM,EAAgB,GAE3C,EAAY,EAAgB,EAAW,kBAEvC,EAAgB,EAAQ,EACxB,EAAgB,EAAQ,EAExB,EAAM,EAAM,QAAS,GAC3B,EAAQ,kCAAmC,EAAe,EAAW,EAAe,EAAe,GAEnG,MAAM,EAAW,IAAI,EAAY,EAAM,QAAQ,OAAQ,EAAK,EAAgB,EAAW,mBACvF,IAAI,EAEJ,GAAK,IAAkB,EAItB,EAAW,EAAS,YAEd,CAIN,EAAW,IAAI,EAAY,EAAgB,EAAW,mBAEtD,IAAI,EAAY,EAEhB,QAAU,EAAI,EAAG,EAAK,EAAS,OAAQ,EAAI,EAAI,IAAO,CAErD,QAAU,EAAI,EAAG,EAAI,EAAU,IAE9B,EAAU,EAAY,GAAM,EAAU,EAAI,EAAW,GAItD,GAAa,CAEd,CAED,CAIA,OAFA,EAAM,MAAO,GAEN,CACN,KAAM,EACN,MAAO,EACP,SAAU,EACV,MAAO,EACP,OAAQ,EAGV,CA3NA,UAAY,SAAW,GAEtB,MAAM,EAAU,EAAE,KAElB,OAAS,EAAQ,MAEhB,IAAK,OACJ,EAAgB,EAAQ,cACxB,EAAiB,IAAI,kBAAoB,GAExC,EAAc,eAAiB,SAAW,GAGzC,EAAS,CAAE,MAAO,GAEnB,EAEA,mBAAoB,EAErB,IACA,MAED,IAAK,SACJ,MAAM,EAAS,EAAQ,OACjB,EAAa,EAAQ,WAC3B,EAAe,MAAQ,IAEtB,MAAM,EAAQ,EAAO,MACf,EAAU,IAAI,EAAM,QAE1B,IAEC,MAAM,WA2Bc,EAAO,EAAS,EAAO,GAE/C,MAAM,EAAe,EAAW,aAC1B,EAAiB,EAAW,eAElC,IAAI,EACA,EAEJ,MAAM,EAAe,EAAQ,uBAAwB,GAErD,GAAK,IAAiB,EAAM,gBAE3B,EAAgB,IAAI,EAAM,KAC1B,EAAiB,EAAQ,kBAAmB,EAAO,EAAM,WAAY,OAE/D,IAAK,IAAiB,EAAM,YAOlC,MAAM,IAAI,MAAO,gDALjB,EAAgB,IAAI,EAAM,WAC1B,EAAiB,EAAQ,wBAAyB,EAAO,EAAM,WAAY,EAM5E,CAEA,IAAO,EAAe,MAA8B,IAAtB,EAAc,IAE3C,MAAM,IAAI,MAAO,uCAAyC,EAAe,aAI1E,MAAM,EAAW,CAAE,MAAO,KAAM,WAAY,IAG5C,UAAY,KAAiB,EAAe,CAE3C,MAAM,EAAgB,KAAM,EAAgB,IAE5C,IAAI,EACA,EAMJ,GAAK,EAAW,aAEf,EAAc,EAAc,GAC5B,EAAY,EAAQ,uBAAwB,EAAe,OAErD,CAIN,GAFA,EAAc,EAAQ,eAAgB,EAAe,EAAO,EAAc,UAErE,EAAsB,SAE3B,EAAY,EAAQ,aAAc,EAAe,EAElD,CAEA,MAAM,EAAkB,EAAiB,EAAO,EAAS,EAAe,EAAe,EAAe,GAE/E,UAAlB,IAEJ,EAAgB,iBAAmB,EAAW,kBAI/C,EAAS,WAAW,KAAM,EAE3B,CAGK,WAAiB,EAAM,kBAE3B,EAAS,eAUW,EAAO,EAAS,GAErC,MACM,EAAwB,EADb,EAAc,YAEzB,EAA0B,EAAb,EAEb,EAAM,EAAM,QAAS,GAC3B,EAAQ,wBAAyB,EAAe,EAAY,GAC5D,MAAM,EAAQ,IAAI,YAAa,EAAM,QAAQ,OAAQ,EAAK,GAAa,QAGvE,OAFA,EAAM,MAAO,GAEN,CAAE,MAAO,EAAO,SAAU,EAElC,CAvBW,CAAqB,EAAO,EAAS,IAI/C,EAAM,QAAS,GAER,CAER,CA/GW,CAA2B,EAAO,EAAS,IAAI,UAAW,GAAU,GAEpE,EAAU,EAAS,WAAW,KAAO,GAAU,EAAK,MAAM,SAE3D,EAAS,OAAQ,EAAQ,KAAM,EAAS,MAAM,MAAM,QAEzD,KAAK,YAAa,CAAE,KAAM,SAAU,GAAI,EAAQ,GAAI,YAAY,EAEjE,OAAU,GAET,QAAQ,MAAO,GAEf,KAAK,YAAa,CAAE,KAAM,QAAS,GAAI,EAAQ,GAAI,MAAO,EAAM,SAEjE,SAEC,EAAM,QAAS,EAEhB,KAOJ,CAoLD,CC3tBO,MAAM,GAOZ,WAAA,CAAa,EAAO,GAQnB,KAAK,KAAO,EAOZ,KAAK,MAAQ,GAOb,KAAK,QAAU,GAOf,KAAK,eAAiB,GAOtB,KAAK,aAAe,EAOpB,KAAK,cAAgB,IAEtB,CAEA,WAAA,CAAa,GAEZ,IAAO,KAAK,QAAS,GAAa,CAEjC,MAAM,EAAS,KAAK,gBACpB,EAAO,iBAAkB,UAAW,KAAK,WAAW,KAAM,KAAM,IAChE,KAAK,QAAS,GAAa,CAE5B,CAED,CAEA,cAAA,GAEC,QAAU,EAAI,EAAG,EAAI,KAAK,KAAM,IAC/B,KAAS,KAAK,aAAiB,GAAK,GAAQ,OAAO,EAEpD,QAED,CAEA,UAAA,CAAY,EAAU,GAErB,MAAM,EAAU,KAAK,eAAgB,GAGrC,GAFA,GAAW,EAAS,GAEf,KAAK,MAAM,OAAS,CAExB,MAAM,QAAE,EAAO,IAAE,EAAG,SAAE,GAAa,KAAK,MAAM,QAC9C,KAAK,eAAgB,GAAa,EAClC,KAAK,QAAS,GAAW,YAAa,EAAK,EAE5C,MAEC,KAAK,cAAgB,GAAK,CAI5B,CAOA,gBAAA,CAAkB,GAEjB,KAAK,cAAgB,CAEtB,CAOA,cAAA,CAAgB,GAEf,KAAK,KAAO,CAEb,CAUA,WAAA,CAAa,EAAK,GAEjB,OAAO,IAAI,SAAW,IAErB,MAAM,EAAW,KAAK,sBAEjB,GAEJ,KAAK,YAAa,GAClB,KAAK,cAAgB,GAAK,EAC1B,KAAK,eAAgB,GAAa,EAClC,KAAK,QAAS,GAAW,YAAa,EAAK,IAI3C,KAAK,MAAM,KAAM,CAAE,UAAS,MAAK,YAElC,GAIF,CAMA,OAAA,GAEC,KAAK,QAAQ,SAAW,GAAY,EAAO,cAC3C,KAAK,eAAe,OAAS,EAC7B,KAAK,QAAQ,OAAS,EACtB,KAAK,MAAM,OAAS,EACpB,KAAK,aAAe,CAErB,ECpKI,MAAkT,GAAG,EAAoB,GAAG,GAAG,GAAG,GAAqB,GAAG,GAA+D,GAAG,GAAqB,GAAG,GAAyG,GAAG,GAA2B,GAAG,GAAyD,GAAG,GAAe,GAAG,IAAkB,GAAG,IAAuC,GAAG,IAAwF,GAAG,IAAI,GAAG,IAAqD,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAkB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAkB,GAAG,IAAI,GAAG,IAAW,GAAG,IAAyB,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAAI,GAAG,IAA8C,GAAG,IAAI,GAAG,IAA8Q,GAAG,UAAU,GAAG,WAAuC,GAAG,WAAW,GAAG,WAAuC,GAAG,UAAoD,GAAG,WAAgiB,MAAM,GAAG,WAAA,CAAY,EAAE,EAAE,EAAE,GAAG,KAAK,iBAAiB,KAAK,qBAAqB,KAAK,eAAe,KAAK,UAAU,IAAI,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,KAAK,cAAc,EAAE,KAAK,QAAQ,CAAC,CAAC,UAAA,GAAa,MAAM,EAAE,KAAK,UAAU,SAAS,KAAK,SAAS,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,WAAA,GAAc,MAAM,EAAE,KAAK,UAAU,UAAU,KAAK,QAAQ,KAAK,eAAe,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,WAAA,GAAc,MAAM,EAAE,KAAK,UAAU,UAAU,KAAK,QAAQ,KAAK,eAAe,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,WAAA,GAAc,MAAM,EAAE,KAAK,UAAU,UAAU,KAAK,QAAQ,KAAK,eAAe,WAAM,KAAK,UAAU,UAAU,KAAK,QAAQ,EAAE,KAAK,eAAe,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,UAAA,GAAa,MAAM,EAAE,KAAK,UAAU,SAAS,KAAK,QAAQ,KAAK,eAAe,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,eAAA,CAAgB,GAAG,MAAM,EAAE,IAAI,WAAW,KAAK,UAAU,OAAO,KAAK,UAAU,WAAW,KAAK,QAAQ,GAAG,OAAO,KAAK,SAAS,EAAE,CAAC,CAAC,KAAA,CAAM,GAAG,OAAO,KAAK,SAAS,EAAE,IAAI,CAAC,KAAA,CAAM,EAAE,EAAE,GAAG,MAAM,EAAE,KAAK,QAAQ,IAAI,EAAE,EAAE,KAAK,KAAK,UAAU,SAAS,KAAK,WAAW,GAAG,EAAE,GAAG,IAAI,KAAK,UAAU,OAAO,EAAE,GAAG,KAAK,UAAU,IAAI,WAAW,KAAK,UAAU,OAAO,KAAK,UAAU,WAAW,EAAE,EAAE,EAAO,MAAwB,GAAG,CAAC,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAqD,SAAS,GAAG,GAAG,OAAM,IAAK,aAAa,OAAO,EAAE,CCA91G,IAAI,GAAE,GAAE,GAAE,MAAM,GAAE,CAAC,IAAI,CAAC,gCAAgC,SAAS,GAAG,GAAE,IAAI,WAAW,GAAE,QAAQ,OAAO,OAAO,IAAI,MAAM,GAAE,IAAA,GAAO,OAAO,KAAI,UAAsB,MAApB,IAA0B,MAAM,gCAAgC,IAAG,MAAK,GAAG,EAAE,gBAAe,MAAK,GAAG,YAAY,YAAY,EAAE,MAAI,KAAK,KAAK,OAAO,YAAY,YAAY,OAAO,KAAK,GAAE,UAAU,IAAG,KAAK,KAAK,OAAO,GAAE,CAAC,KAAA,CAAM,GAAG,GAAE,EAAE,SAAS,GAAE,IAAI,gCAAgC,EAAE,CAAC,MAAA,CAAO,EAAE,EAAE,GAAG,IAAI,GAAE,MAAM,IAAI,MAAM,+CAA+C,MAAM,EAAE,EAAE,WAAW,EAAE,GAAE,QAAQ,OAAO,GAAG,GAAE,IAAI,EAAE,GAAG,EAAE,GAAG,OAAO,GAAE,QAAQ,0BAA0B,EAAE,IAAI,MAAM,EAAE,GAAE,QAAQ,OAAO,GAAG,EAAE,GAAE,QAAQ,gBAAgB,EAAE,EAAE,EAAE,GAAG,EAAE,GAAE,MAAM,EAAE,EAAE,GAAG,OAAO,GAAE,QAAQ,KAAK,GAAG,GAAE,QAAQ,KAAK,GAAG,CAAC,EAAE,MAAM,GAAE,mksCCmIzuB,kBAAgB,OAAQ,kBC3B5B,MAAM,GAAa,IAAI,QAEvB,IAEI,GAFA,GAAiB,EA+BrB,MAAM,WAAmB,SAOxB,WAAA,CAAa,GAEZ,MAAO,GAEP,KAAK,eAAiB,GACtB,KAAK,iBAAmB,KACxB,KAAK,kBAAoB,KAEzB,KAAK,WAAa,IAAI,GACtB,KAAK,gBAAkB,GACvB,KAAK,aAAe,YAER,eAAmB,KAE9B,QAAQ,KAEP,iIAOH,CAUA,iBAAA,CAAmB,GAIlB,OAFA,KAAK,eAAiB,EAEf,IAER,CAQA,cAAA,CAAgB,GAIf,OAFA,KAAK,WAAW,eAAgB,GAEzB,IAER,CAWA,wBAAA,CAA0B,GAMzB,OAJA,QAAQ,KAAM,gJAER,EAAS,OAER,KAAK,cAAe,EAE5B,CASA,aAAA,CAAe,GA6Cd,WA3CK,EAAS,iBAEb,KAAK,aAAe,CACnB,cAAe,EAAS,WAAY,4BACpC,oBACA,cAAe,EAAS,WAAY,4BACpC,cAAe,EAAS,WAAY,4BACpC,aAAc,EAAS,WAAY,4BACnC,cAAe,EAAS,WAAY,0BACpC,eAAgB,EAAS,WAAY,+BAKtC,KAAK,aAAe,CACnB,cAAe,EAAS,WAAW,IAAK,iCACxC,iBAAkB,EAAS,WAAW,IAAK,kCACvC,EAAS,WAAW,IAAK,iCAAkC,uBAAuB,SAAU,OAChG,cAAe,EAAS,WAAW,IAAK,iCACxC,cAAe,EAAS,WAAW,IAAK,gCACxC,aAAc,EAAS,WAAW,IAAK,iCACvC,cAAe,EAAS,WAAW,IAAK,gCACxC,eAAgB,EAAS,WAAW,IAAK,mCACrC,EAAS,WAAW,IAAK,iDAGlB,UAAc,KACzB,UAAU,SAAS,QAAS,UAAa,GAAK,UAAU,UAAU,QAAS,YAAe,GAC1F,KAAK,aAAa,eAAiB,KAAK,aAAa,eACrD,KAAK,aAAa,eAAiB,KAAK,aAAa,eAOrD,KAAK,aAAa,iBAClB,KAAK,aAAa,mBAMb,IAER,CAIA,IAAA,GAEC,IAAO,KAAK,kBAAoB,CAG/B,MAAM,EAAW,IAAI,aAAY,KAAK,SACtC,EAAS,QAAS,KAAK,gBACvB,EAAS,mBAAoB,KAAK,iBAClC,MAAM,EAAY,EAAS,UAAW,uBAGhC,EAAe,IAAI,aAAY,KAAK,SAC1C,EAAa,QAAS,KAAK,gBAC3B,EAAa,gBAAiB,eAC9B,EAAa,mBAAoB,KAAK,iBACtC,MAAM,EAAgB,EAAa,UAAW,yBAE9C,KAAK,kBAAoB,QAAQ,IAAK,CAAE,EAAW,IACjD,QAAU,EAAW,MAErB,MAAM,EAAK,GAAW,YAAY,WAE5B,EAAO,CACZ,kBACA,uBAAyB,KAAK,UAAW,GAAW,cACpD,qBAAuB,KAAK,UAAW,GAAW,YAClD,2BAA6B,KAAK,UAAW,GAAW,kBACxD,sBAAwB,KAAK,UAAW,GAAW,aACnD,4BACA,EACA,eACA,EAAG,UAAW,EAAG,QAAS,KAAQ,EAAG,EAAG,YAAa,OACpD,KAAM,MAER,KAAK,gBAAkB,IAAI,gBAAiB,IAAI,KAAM,CAAE,KACxD,KAAK,iBAAmB,EAExB,KAAK,WAAW,uBAEf,MAAM,EAAS,IAAI,OAAQ,KAAK,iBAC1B,EAAmB,KAAK,iBAAiB,MAAO,GAItD,OAFA,EAAO,YAAa,CAAE,KAAM,OAAQ,OAAQ,KAAK,aAAc,oBAAoB,CAAE,IAE9E,CAAM,GAEX,IAIA,GAAiB,GAIrB,QAAQ,KAEP,uJAOF,IAED,CAEA,OAAO,KAAK,iBAEb,CAWA,IAAA,CAAM,EAAK,EAAQ,EAAY,GAE9B,GAA2B,OAAtB,KAAK,aAET,MAAM,IAAI,MAAO,+EAIlB,MAAM,EAAS,IAAI,aAAY,KAAK,SAEpC,EAAO,QAAS,KAAK,MACrB,EAAO,eAAgB,KAAK,aAC5B,EAAO,mBAAoB,KAAK,iBAChC,EAAO,iBAAkB,KAAK,eAC9B,EAAO,gBAAiB,eAExB,EAAO,KAAM,GAAO,IAEnB,KAAK,MAAO,EAAQ,EAAQ,EAAS,GAEnC,EAAY,EAEhB,CAUA,KAAA,CAAO,EAAQ,EAAQ,GAEtB,GAA2B,OAAtB,KAAK,aAET,MAAM,IAAI,MAAO,+EAMlB,GAAK,GAAW,IAAK,GAIpB,OAFmB,GAAW,IAAK,GAEjB,QAAQ,KAAM,GAAS,MAAO,GAIjD,KAAK,eAAgB,GACnB,MAAQ,GAAa,EAAS,EAAQ,GAAY,OAClD,MAAO,EAEV,CAEA,kBAAA,CAAoB,EAAiB,GAEpC,MAAQ,KAAM,EAAW,MAAE,EAAO,MAAM,MAAE,EAAK,MAAE,EAAK,OAAE,EAAM,OAAE,EAAM,KAAE,EAAI,SAAE,IAAe,EAE7F,GAAqB,UAAhB,EAA0B,OAAO,QAAQ,OAAQ,GAEtD,IAAI,EAEJ,GAA6B,IAAxB,EAAU,UAEd,EAAU,IAAI,wBAAuB,EAAO,EAAQ,OAE9C,CAEN,MAAM,EAAU,EAAO,GAAI,QAE3B,EAAU,EAAU,WAAa,EAC9B,IAAI,yBAAwB,EAAS,EAAO,EAAQ,EAAU,WAAY,EAAQ,GAClF,IAAI,oBAAmB,EAAS,EAAO,EAAQ,EAAQ,EAE3D,CAUA,OARA,EAAQ,UAA0C,IAA9B,EAAO,GAAI,QAAQ,OAAe,eAAe,2BACrE,EAAQ,UAAY,eACpB,EAAQ,mBAER,EAAQ,eACR,EAAQ,WAAa,GAAiB,GACtC,EAAQ,oBHxboE,EGwb5C,GAEzB,CAER,CAQA,oBAAA,CAAsB,EAAQ,EAAS,IAEtC,MAAM,WHtc+iH,GAAG,MAAM,EAAE,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,GAAG,QAAQ,GAAG,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,MAAM,GAAG,KAAK,EAAE,MAAM,GAAG,IAAI,MAAM,IAAI,MAAM,+BAA+B,MAAM,EAAE,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,WAAW,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,uBAAuB,EAAE,OAAO,GAAG,qBAAqB,CAAC,CAAC,SAAS,EAAE,eAAe,EAAE,cAAc,EAAE,WAAW,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,EAAE,oBAAoB,CAAC,EAAE,EAAE,EAAE,GAAG,WAAW,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,QAAQ,KAAK,SAAS,GAAG,WAAW,MAAM,EAAE,GAAG,YAAY,kBAAkB,EAAE,IAAI,GAAG,EAAE,GAAG,OAAO,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,YAAY,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,UAAU,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,uBAAuB,EAAE,cAAc,MAAM,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,KAAK,IAAI,EAAE,WAAW,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,GAAG,OAAO,EAAE,MAAM,QAAQ,EAAE,EAAE,EAAE,KAAK,IAAI,EAAE,WAAW,GAAG,EAAE,EAAE,IAAI,EAAE,OAAO,KAAK,CAAC,UAAU,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,cAAc,EAAE,eAAe,uBAAuB,EAAE,gBAAgB,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,CAAC,SAAS,EAAE,eAAe,EAAE,cAAc,EAAE,WAAW,EAAE,aAAa,eAAe,EAAE,aAAa,iBAAiB,EAAE,aAAa,MAAM,EAAE,aAAa,oBAAoB,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,WAAW,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,QAAQ,IAAI,GAAG,EAAE,EAAE,GAAG,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,UAAU,EAAE,cAAc,UAAU,EAAE,aAAa,YAAY,EAAE,aAAa,eAAe,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,aAAa,EAAE,cAAc,YAAY,OAAO,kBAAkB,YAAY,OAAO,mBAAmB,GAAG,EAAE,aAAa,EAAE,YAAY,EAAE,aAAa,EAAE,YAAY,EAAE,eAAe,EAAE,YAAY,EAAE,cAAc,EAAE,YAAY,EAAE,eAAe,EAAE,QAAQ,GAAG,CAAC,CAAC,EAAE,qBAAqB,OAAO,EAAE,EAAE,qBAAqB,KAAK,GAAG,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,KAAK,EAAE,QAAQ,GAAG,CAAC,MAAM,EAAE,EAAE,cAAc,EAAE,EAAE,MAAM,GAAG,EAAE,GAAG,GAAG,GAAG,EAAE,SAAS,GAAG,EAAE,gBAAgB,EAAE,EAAE,WAAW,GAAG,EAAE,MAAM,SAAS,CAAC,MAAM,EAAE,GAAG,EAAE,SAAS,IAAI,EAAE,SAAS,GAAG,EAAE,UAAU,EAAE,EAAE,YAAY,MAAM,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,GAAG,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,EAAE,cAAc,EAAE,GAAG,QAAQ,EAAE,EAAE,EAAE,KAAK,IAAI,EAAE,WAAW,GAAG,EAAE,EAAE,IAAI,EAAE,KAAK,CAAC,WAAW,EAAE,cAAc,mBAAmB,EAAE,cAAc,mBAAmB,EAAE,cAAc,qBAAqB,EAAE,cAAc,qBAAqB,EAAE,gBAAgB,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,EAAE,IAAI,WAAW,EAAE,OAAO,EAAE,WAAW,EAAE,GAAG,OAAO,EAAE,WAAW,CAAC,cAAc,EAAE,cAAc,EAAE,WAAW,EAAE,cAAc,EAAE,cAAc,EAAE,WAAW,EAAE,aAAa,GAAG,CAAC,CGscvxN,CAAkB,IAAI,WAAY,IAOlC,EAAa,EAAU,WAAa,IACa,MAAnD,EAAU,qBAAsB,GAAI,WAMxC,GHpd2Q,IGidnP,EAAU,YAC9B,GAAgB,KAAK,aAAa,kBAIrC,sBA0lB8B,GAEhC,MAAM,SAAE,GAAa,EAErB,YAAK,GAAY,GAEhB,MAAM,IAAI,MAAO,2CAA6C,GAa/D,IAAI,OAb2D,IAK1D,GAAU,IAEd,QAAQ,KAAM,mDAAqD,GH7jCrD,IGqkCV,EAAU,yBAEP,KAEN,GAAQ,IAAI,eAAS,IAEpB,MAAM,EAAO,IAAI,SACX,EAAK,OACX,EAAS,EAAM,KAMjB,QAAa,IAMd,MAAM,EAAU,GAEhB,QAAU,EAAa,EAAG,EAAa,EAAU,OAAO,OAAQ,IAAgB,CAE/E,MAAM,EAAa,KAAK,IAAK,EAAG,EAAU,YAAc,GAClD,EAAc,KAAK,IAAK,EAAG,EAAU,aAAe,GACpD,EAAa,EAAU,WAAa,KAAK,IAAK,EAAG,EAAU,YAAc,GAAe,EAExF,EAAQ,EAAU,OAAQ,GAEhC,IAAI,EAgBA,EAdJ,GHrmCM,IGqmCD,EAAU,uBAEd,EAAY,EAAM,cAEZ,IHzmCO,IGymCF,EAAU,uBAMrB,MAAM,IAAI,MAAO,yDAJjB,EAAY,EAAK,OAAQ,EAAM,UAAW,EAAM,uBAMjD,CAMC,EAFI,GAAU,KAAe,YAEtB,IAAI,aAEV,EAAU,OACV,EAAU,WACV,EAAU,WAAa,aAAa,mBAI1B,GAAU,KAAe,gBAE7B,IAAI,YAEV,EAAU,OACV,EAAU,WACV,EAAU,WAAa,YAAY,mBAIzB,GAAU,KAAe,uBAAuB,GAAU,KAAe,wBAE7E,IAAI,YAEV,EAAU,OACV,EAAU,WACV,EAAU,WAAa,YAAY,mBAM7B,EAIR,EAAQ,KAAM,CAEb,KAAM,EACN,MAAO,EACP,OAAQ,EACR,MAAO,GAIT,CAGA,MAAM,EAAsC,IAAzB,EAAU,YAAoB,EAAQ,OAAS,EAElE,IAAI,EAEJ,GAAK,GAAqB,IAAK,GAAY,IAE1C,EAAmC,IAAzB,EAAU,WACjB,IAAI,cAAa,EAAS,GAAI,KAAM,EAAU,WAAY,EAAU,aACpE,IAAI,gBAAe,EAAS,GAAI,KAAM,EAAU,WAAY,EAAU,YAAa,EAAU,YAChG,EAAQ,UAAY,EAAa,6BAA6B,gBAC9D,EAAQ,UAAY,gBACpB,EAAQ,gBAA2C,IAAzB,EAAU,eAE9B,CAEN,GAAK,EAAU,WAAa,EAAI,MAAM,IAAI,MAAO,6CAEjD,EAAU,IAAI,oBAAmB,EAAS,EAAU,WAAY,EAAU,aAC1E,EAAQ,UAAY,EAAa,2BAA2B,eAC5D,EAAQ,UAAY,cAErB,CAWA,OATA,EAAQ,QAAU,EAElB,EAAQ,KAAO,GAAU,GACzB,EAAQ,OAAS,GAAY,GAC7B,EAAQ,WAAa,GAAiB,GACtC,EAAQ,eAID,QAAQ,QAAS,EAEzB,CAjvBG,CAAyB,GAK1B,MAAM,EAAa,EACb,EAAiB,KAAK,OAAO,UAE3B,KAAK,WAAW,YAAa,CAAE,KAAM,YAAa,SAAQ,WAAY,GAAc,CAAE,MAE1F,MAAQ,GAAO,KAAK,mBAAoB,EAAE,KAAM,KAKpD,OAFA,GAAW,IAAK,EAAQ,CAAE,QAAS,IAE5B,CAER,CAMA,OAAA,GAEC,KAAK,WAAW,UACX,KAAK,iBAAkB,IAAI,gBAAiB,KAAK,iBAEtD,IAED,EAOD,GAAW,YAAc,CACxB,MAAO,EACP,MAAO,EACP,UAAW,GAIZ,GAAW,iBAAmB,CAC7B,KAAM,EACN,KAAM,EACN,IAAK,EACL,IAAK,EACL,IAAK,EACL,IAAK,EACL,mBAAoB,EACpB,OAAQ,EACR,aAAc,EACd,cAAe,EACf,SAAU,GACV,QAAS,GACT,4BAA6B,GAC7B,OAAQ,GACR,OAAQ,GACR,OAAQ,GACR,SAAU,GACV,KAAM,GACN,SAAU,GACV,UAAW,IAGZ,GAAW,aAAe,CACzB,WAAY,aACZ,qBAAsB,uBACtB,yBAA0B,2BAC1B,iBAAkB,mBAClB,qBAAsB,uBACtB,yBAA0B,2BAC1B,sBAAuB,wBACvB,gBAAiB,kBACjB,gBAAiB,kBACjB,wBAAyB,0BACzB,sBAAuB,yBAGxB,GAAW,WAAa,CACvB,iBAAkB,mBAClB,cAAe,gBACf,UAAW,aAKZ,GAAW,YAAc,WAExB,IAAI,EACA,EACA,EAEJ,MAAM,EAAe,cACf,EAAa,YACb,EAAmB,kBACnB,EAAc,aAEpB,KAAK,iBAAkB,oBAAsB,GAE5C,MAAM,EAAU,EAAE,KAElB,OAAS,EAAQ,MAEhB,IAAK,OACJ,EAAS,EAAQ,OA4BL,EA3BN,EAAQ,iBA6BhB,EAAoB,IAAI,SAAW,IAElC,EAAc,CAAE,aAAY,qBAAsB,GAClD,MAAO,EAAa,IAEjB,WAEH,EAAY,2BAEP,EAAY,UAEhB,QAAQ,KAAM,8DAEf,IAzCC,MAED,IAAK,YACJ,EAAkB,WAEjB,IAEC,MAAM,MAAE,EAAK,QAAE,EAAO,MAAE,EAAK,OAAE,EAAM,SAAE,EAAQ,OAAE,EAAM,KAAE,EAAI,SAAE,YAwChD,GAEnB,MAAM,EAAW,IAAI,EAAY,SAAU,IAAI,WAAY,IAE3D,SAAS,IAER,EAAS,QACT,EAAS,QAEV,CAEA,IAAO,EAAS,UAGf,MADA,IACM,IAAI,MAAO,wDAIlB,IAAI,EAEJ,GAAK,EAAS,UAEb,EAAc,EAAY,cAEf,EAAS,UAEpB,EAAc,EAAY,UAEpB,KAAK,EAAS,QAMpB,MAAM,IAAI,MAAO,4CAJjB,EAAc,EAAY,SAM3B,CAEA,MAAM,EAAQ,EAAS,WACjB,EAAS,EAAS,YAClB,EAAa,EAAS,aAAe,EACrC,EAAa,EAAS,YACtB,EAAY,EAAS,WACrB,EAAW,EAAS,cACpB,EAAW,EAAS,eAEpB,iBAAE,EAAgB,aAAE,EAAY,WAAE,YAgNX,EAAa,EAAO,EAAQ,GAEzD,MAAM,EAAU,EAAS,GAEzB,QAAU,EAAI,EAAG,EAAI,EAAQ,OAAQ,IAAO,CAE3C,MAAM,EAAM,EAAS,GAErB,KAAK,EAAI,IAAQ,EAAQ,EAAI,MACtB,EAAI,YAAY,SAAU,MAC5B,GAAY,EAAI,iBAAiB,OAAS,MAC1C,EAAI,iBAAuB,EAAc,IAAW,EAAc,IAMvE,MAAO,CAAE,iBAJgB,EAAI,iBAAkB,EAAW,EAAI,GAInC,aAHN,EAAI,aAAc,EAAW,EAAI,GAGb,WAFtB,EAAI,WAAY,GAIpC,CAEA,MAAM,IAAI,MAAO,2DAElB,CAvOyC,CAAoC,EAAa,EAAO,EAAQ,GAExG,IAAO,IAAW,IAAY,EAG7B,MADA,IACM,IAAI,MAAO,sCAIlB,IAAO,EAAS,mBAGf,MADA,IACM,IAAI,MAAO,8CAIlB,MAAM,EAAQ,GACR,EAAU,GAEhB,QAAU,EAAO,EAAG,EAAO,EAAW,IAAU,CAE/C,MAAM,EAAU,GAEhB,QAAU,EAAM,EAAG,EAAM,EAAY,IAAS,CAE7C,MAAM,EAAY,GAElB,IAAI,EAAU,EAEd,QAAU,EAAQ,EAAG,EAAQ,EAAY,IAAW,CAEnD,MAAM,EAAY,EAAS,kBAAmB,EAAK,EAAO,GAE5C,IAAT,GAAsB,IAAR,GAAuB,IAAV,GAAiB,EAAU,UAAY,GAAM,GAAK,EAAU,WAAa,GAAM,GAE9G,QAAQ,KAAM,sFAIV,EAAa,GAEjB,EAAW,EAAU,UACrB,EAAY,EAAU,aAOtB,EAAW,EAAU,MACrB,EAAY,EAAU,QAIvB,IAAI,EAAM,IAAI,WAAY,EAAS,8BAA+B,EAAK,EAAO,EAAG,IACjF,MAAM,EAAS,EAAS,eAAgB,EAAK,EAAK,EAAO,EAAM,EAAkB,MAAG,GAQpF,GANK,IAAe,EAAW,gBAE9B,EAAM,IAAI,YAAa,EAAI,OAAQ,EAAI,WAAY,EAAI,WAAa,YAAY,qBAI1E,EAGN,MADA,IACM,IAAI,MAAO,6CAIlB,EAAU,KAAM,EAEjB,CAEA,MAAM,EAAU,EAAQ,GAExB,EAAQ,KAAM,CAAE,KAAM,EAAS,MAAO,EAAU,OAAQ,IACxD,EAAQ,KAAM,EAAQ,OAEvB,CAEA,EAAM,KAAM,CAAE,UAAS,QAAO,SAAQ,OAAQ,EAAc,KAAM,GAEnE,CAIA,OAFA,IAEO,CAAE,QAAO,UAAS,QAAO,SAAQ,WAAU,WAAU,OAAQ,EAAc,KAAM,EAEzF,CA/KoE,CAAwB,EAAQ,QAE/F,KAAK,YAAa,CAAE,KAAM,YAAa,GAAI,EAAQ,GAAI,KAAM,CAAE,QAAO,QAAO,SAAQ,WAAU,SAAQ,OAAM,aAAc,EAE5H,OAAU,GAET,QAAQ,MAAO,GAEf,KAAK,YAAa,CAAE,KAAM,QAAS,GAAI,EAAQ,GAAI,MAAO,EAAM,SAEjE,KASJ,IAAe,CAFf,IA2KA,MAAM,EAAiB,CACtB,CACC,GAAI,gBACJ,YAAa,CAAE,EAAY,OAC3B,iBAAkB,CAAE,EAAiB,SAAU,EAAiB,UAChE,aAAc,CAAE,EAAa,qBAAsB,EAAa,sBAChE,WAAY,CAAE,EAAW,kBACzB,cAAe,IACf,cAAe,EACf,oBAED,CACC,GAAI,gBACJ,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,OAAQ,EAAiB,QAC9D,aAAc,CAAE,EAAa,iBAAkB,EAAa,kBAC5D,WAAY,CAAE,EAAW,kBACzB,cAAe,EACf,cAAe,EACf,oBAED,CACC,GAAI,eACJ,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,IAAK,EAAiB,KAC3D,aAAc,CAAE,EAAa,sBAAuB,EAAa,uBACjE,WAAY,CAAE,EAAW,kBACzB,cAAe,EACf,cAAe,EACf,oBAED,CACC,GAAI,gBACJ,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,KAAM,EAAiB,MAC5D,aAAc,CAAE,EAAa,gBAAiB,EAAa,sBAC3D,WAAY,CAAE,EAAW,kBACzB,cAAe,EACf,cAAe,EACf,oBAED,CACC,GAAI,gBACJ,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,MACrC,aAAc,CAAE,EAAa,iBAC7B,WAAY,CAAE,EAAW,kBACzB,cAAe,EACf,cAAe,EACf,oBAED,CACC,GAAI,iBACJ,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,aAAc,EAAiB,eACpE,aAAc,CAAE,EAAa,wBAAyB,EAAa,0BACnE,WAAY,CAAE,EAAW,kBACzB,cAAe,EACf,cAAe,EACf,oBAED,CACC,GAAI,gBACJ,YAAa,CAAE,EAAY,WAC3B,iBAAkB,CAAE,EAAiB,MACrC,aAAc,CAAE,EAAa,0BAC7B,WAAY,CAAE,EAAW,eACzB,YAAa,EACb,oBAKD,CACC,YAAa,CAAE,EAAY,MAAO,EAAY,OAC9C,iBAAkB,CAAE,EAAiB,OAAQ,EAAiB,QAC9D,aAAc,CAAE,EAAa,WAAY,EAAa,YACtD,WAAY,CAAE,EAAW,iBAAkB,EAAW,kBACtD,cAAe,IACf,cAAe,IACf,oBAED,CACC,YAAa,CAAE,EAAY,WAC3B,iBAAkB,CAAE,EAAiB,WACrC,aAAc,CAAE,EAAa,YAC7B,WAAY,CAAE,EAAW,eACzB,YAAa,IACb,qBAII,EAAU,CACf,CAAE,EAAY,OAAS,EACrB,QAAU,GAAS,EAAI,YAAY,SAAU,EAAY,SACzD,OAAQ,EAAG,IAAO,EAAE,cAAgB,EAAE,gBAExC,CAAE,EAAY,OAAS,EACrB,QAAU,GAAS,EAAI,YAAY,SAAU,EAAY,SACzD,OAAQ,EAAG,IAAO,EAAE,cAAgB,EAAE,gBAExC,CAAE,EAAY,WAAa,EACzB,QAAU,GAAS,EAAI,YAAY,SAAU,EAAY,aACzD,OAAQ,EAAG,IAAO,EAAE,YAAc,EAAE,eA4BvC,SAAS,EAAc,GAEtB,OAAK,GAAS,KAEL,EAAU,EAAQ,IAAyB,IAAV,CAE3C,CAQA,SAAS,EAAQ,GAEhB,GAAuB,IAAlB,EAAO,OAAe,OAAO,EAAQ,GAE1C,IAAI,EAAkB,EAEtB,QAAU,EAAI,EAAG,EAAI,EAAO,OAAQ,IAGnC,GADc,EAAQ,GACG,WAI1B,MAAM,EAAS,IAAI,WAAY,GAE/B,IAAI,EAAa,EAEjB,QAAU,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAO,CAE1C,MAAM,EAAQ,EAAQ,GACtB,EAAO,IAAK,EAAO,GAEnB,GAAc,EAAM,UAErB,CAEA,OAAO,CAER,CAED,EAKA,MAAM,GAAuB,IAAI,IAAK,CAAE,aAAY,YAAW,WAAU,cAEnE,GAAa,CAElB,CAAE,IAAiC,aACnC,CAAE,IAA2B,WAC7B,CAAE,IAAwB,YAE1B,CAAE,IAAiC,aACnC,CAAE,IAA2B,WAC7B,CAAE,IAAwB,YAE1B,CAAE,IAA2B,aAC7B,CAAE,IAA4B,aAC9B,CAAE,IAAuB,WACzB,CAAE,IAAwB,WAC1B,CAAE,IAAqB,YACvB,CAAE,IAAsB,YAExB,CAAE,IAAoC,YACtC,CAAE,IAAqC,YAEvC,CAAE,IAAsC,uBACxC,CAAE,IAAoC,kBACtC,CAAE,IAAiC,iBACnC,CAAE,IAAiC,wBACnC,CAAE,IAAoC,kBACtC,CAAE,IAAoC,yBAEtC,CAAE,IAAuC,uBACzC,CAAE,IAAiC,uBACnC,CAAE,IAAkC,uBACpC,CAAE,IAAuC,uBACzC,CAAE,IAAiC,uBACnC,CAAE,IAAkC,uBAEpC,CAAE,IAAiC,wBACnC,CAAE,IAAkC,wBACpC,CAAE,IAAgC,uBAClC,CAAE,IAAiC,uBAEnC,CAAE,IAA4B,wBAC9B,CAAE,IAA6B,wBAE/B,CAAE,IAA6B,0BAC/B,CAAE,IAA6B,mBAE/B,CAAE,IAA6B,gCAC/B,CAAE,IAA6B,yBAE/B,CAAE,IAA4B,mBAC9B,CAAE,IAA6B,mBAE/B,CAAE,IAAwC,2BAC1C,CAAE,IAAyC,2BAC3C,CAAE,IAAwC,2BAC1C,CAAE,IAAyC,4BAItC,GAAW,CAEhB,CAAE,IAAiC,YACnC,CAAE,IAA2B,YAC7B,CAAE,IAAwB,YAE1B,CAAE,IAAiC,gBACnC,CAAE,IAA2B,gBAC7B,CAAE,IAAwB,gBAE1B,CAAE,IAA2B,mBAC7B,CAAE,IAA4B,mBAC9B,CAAE,IAAuB,mBACzB,CAAE,IAAwB,mBAC1B,CAAE,IAAqB,mBACvB,CAAE,IAAsB,mBAExB,CAAE,IAAoC,sBACtC,CAAE,IAAqC,wBAEvC,CAAE,IAAsC,mBACxC,CAAE,IAAoC,mBACtC,CAAE,IAAiC,mBACnC,CAAE,IAAiC,mBACnC,CAAE,IAAoC,mBACtC,CAAE,IAAoC,mBAEtC,CAAE,IAAuC,gBACzC,CAAE,IAAiC,mBACnC,CAAE,IAAkC,mBACpC,CAAE,IAAuC,gBACzC,CAAE,IAAiC,mBACnC,CAAE,IAAkC,mBAEpC,CAAE,IAAiC,mBACnC,CAAE,IAAkC,mBACpC,CAAE,IAAgC,mBAClC,CAAE,IAAiC,mBAEnC,CAAE,IAA4B,mBAC9B,CAAE,IAA6B,mBAE/B,CAAE,IAA6B,mBAC/B,CAAE,IAA6B,mBAE/B,CAAE,IAA6B,mBAC/B,CAAE,IAA6B,mBAE/B,CAAE,IAA4B,mBAC9B,CAAE,IAA6B,mBAE/B,CAAE,IAAwC,mBAC1C,CAAE,IAAyC,mBAC3C,CAAE,IAAwC,mBAC1C,CAAE,IAAyC,oBA6J5C,SAAS,GAAiB,GAEzB,MAAM,EAAM,EAAU,qBAAsB,GAE5C,OH7sC0K,IG6sCrK,EAAI,eH7sCgF,IG+sCjF,EAAI,iBAA4C,iBAAiB,uBH/sCqI,KGitClM,EAAI,eHjtCyE,IGmtCjF,EAAI,iBDjrCsB,aAQM,qBF1C8H,IGqtC1J,EAAI,gBAMf,QAAQ,KAAM,mDAAoD,EAAI,mBAJ/D,eAST,CChuCA,eAAe,GAAsB,GACjC,MACM,EADW,EAAI,MAAM,KAAK,GACL,MAAM,KAAK,MAEhC,QAAiB,MAAM,GAC7B,IAAK,EAAS,GACV,MAAM,IAAI,MAAM,mBAAmB,MAAQ,EAAS,cAGxD,GAAkB,SAAd,EAAsB,CAEtB,MAAM,QAAa,EAAS,OAC5B,OAAO,kBAAkB,EAAM,GAAgB,GACnD,CACA,GAAkB,YAAd,EAGA,sBAgC2B,EAAQ,GACvC,MAAM,EAAW,IAAI,SAAS,GACxB,EAAiB,EAAS,aAAa,MACvC,EAAmB,EAAS,aAAa,OAGzC,EADY,GACU,OAAO,GAC7B,EAAc,GAAW,EAAK,EAAU,GAAM,EAC9C,EAAY,EAAc,OAAO,GAEjC,EAAa,EAAO,MALR,GAKyB,GACrC,GAAa,IAAI,aAAc,OAAO,GAAY,OAClD,EAAO,KAAK,MAAM,GAExB,IAAK,EAAK,QACN,MAAM,IAAI,MAAM,0BAGpB,MAAM,EAAsB,EAAK,QAAQ,WAAI,IACzC,GAAI,EAAE,IAAK,CACP,MAAM,EAAY,IAAI,IAAI,EAAE,IAAK,GAAS,KACpC,QAAiB,MAAM,GAC7B,IAAK,EAAS,GACV,MAAM,IAAI,MAAM,+BAA+B,MAAc,EAAS,cAE1E,OAAO,IAAI,iBAAiB,EAAS,cACzC,CAGI,OAAO,IAAI,WAAW,EAAO,MAAM,EAAa,GACpD,IAKJ,gBAGmB,EAAM,GACzB,SAAS,EAAY,EAAc,GAC/B,IAAK,EACD,MAAM,IAAI,MAAM,2BAEpB,GAAM,EAAa,SAAU,CACzB,GAA6B,GAAzB,EAAa,SACb,SAEJ,GAA6B,GAAzB,EAAa,SACb,QAER,CACA,GAA8B,MAA1B,EAAa,UACb,MAAM,IAAI,MAAM,gEAEpB,IAAK,EAAK,cAAgB,EAAK,YAAY,EAAa,WACpD,MAAM,IAAI,MAAM,2DAEpB,MAAM,EAAa,EAAK,YAAY,EAAa,WAEjD,OAGJ,SAAsB,EAAQ,EAAY,GACtC,MACM,EAAW,EAAQ,EACzB,OAAQ,EAFU,EAAa,KAAK,MAAM,EAAQ,KAErB,IACjC,CAPW,CAAa,EAAQ,EAAW,QAAS,EAAW,WAAY,EAC3E,CA0CA,MAAO,CAAE,gBAlCT,SAAyB,GAErB,IAAI,EAAQ,EAMZ,OAJI,EADW,MAAX,EAAQ,EACA,GAAqB,EAAQ,EAAG,EAAQ,EAAG,EAAQ,OAEnD,GAAmB,EAAQ,EAAG,EAAQ,EAAG,EAAQ,EAAG,EAAQ,OAEjE,EAAY,EAAK,iBAAkB,EAC9C,EAyB2C,mBAxB3C,SAA4B,GACxB,IAAI,EAAQ,EAER,EADW,MAAX,EAAQ,EACA,GAAqB,EAAQ,EAAG,EAAQ,EAAG,EAAQ,OAEnD,GAAmB,EAAQ,EAAG,EAAQ,EAAG,EAAQ,EAAG,EAAQ,OAExE,MAAM,EAAsB,GAI5B,OAHA,EAAK,oBAAoB,SAAQ,IAC7B,EAAoB,KAAK,EAAY,EAAc,GAAO,IAEvD,CACX,EAYmF,wBAXnF,SAAiC,GAC7B,IAAI,EAAQ,EAMZ,OAJI,EADW,MAAX,EAAQ,EACA,GAAqB,EAAQ,EAAG,EAAQ,GAExC,GAAmB,EAAQ,EAAG,EAAQ,EAAG,EAAQ,GAEtD,EAAY,EAAK,yBAA0B,EACtD,EAIJ,CApEI,CAAqB,QAFC,QAAQ,IAAI,GAGtC,CApEQ,OADqB,EAAS,cACK,GAAgB,IAEnD,MAAM,IAAI,MAAM,+BAA+B,IAEvD,CACA,SAAS,GAAgB,GACrB,MAAM,EAAW,EAAI,MAAM,KAAK,GAChC,OAAO,EAAS,UAAU,EAAG,EAAS,YAAY,KAAO,EAC7D,CAoIA,SAAS,GAAS,GAMd,OADqB,aADrB,EAAqB,YADrB,EAAqB,YADrB,EAAqB,WADrB,GAAK,OACK,GAAK,IACL,GAAK,IACL,GAAK,IACL,GAAK,EAEnB,CAEA,SAAS,GAAqB,EAAG,EAAG,GAChC,IAAI,EAAS,EAIb,OAHI,IACA,GAAU,KAAK,IAAI,EAAG,GAAS,GAAK,GAEjC,GAAU,GAAS,GAAM,GAAS,IAAM,EACnD,CAEA,SAAS,GAAS,GAMd,OADqB,YADrB,EAAqB,WADrB,EAAqB,WADrB,EAAsB,aADtB,GAAK,MACK,GAAK,KACL,GAAK,IACL,GAAK,IACL,GAAK,EAEnB,CAEA,SAAS,GAAmB,EAAG,EAAG,EAAG,GACjC,IAAI,EAAS,EAIb,OAHI,IACA,GAAU,KAAK,IAAI,EAAG,GAAS,GAAK,GAEjC,GAAU,GAAS,GAAM,GAAS,IAAM,EAAM,GAAS,IAAM,EACxE,CC5LA,MAAM,GAAa,IAAI,IAGvB,eAAe,GAAiB,EAAU,GACtC,IAAK,EAAS,OAAS,EAAS,KAAK,eACjC,OAAO,EAGX,IAAK,EAAS,KAAK,UAAY,EAAS,KAAK,SACzC,MAAM,IAAI,MAAM,2CAGpB,IAAI,KACA,EAAS,KAAK,eAAe,oBAC7B,EAAS,aAAe,EAAS,KAAK,eAAe,kBAAkB,eAE3E,IAAI,EAAqB,GACrB,EAAS,KAAK,eAAe,WACzB,EAAS,KAAK,eAAe,SAAS,IACtC,EAAqB,EAAS,KAAK,eAAe,SAAS,IACpD,EAAS,KAAK,eAAe,SAAS,MAC7C,EAAqB,EAAS,KAAK,eAAe,SAAS,MAInE,IAAI,EAAsB,GACtB,EAAS,KAAK,QACV,EAAS,KAAK,QAAQ,IACtB,EAAoB,KAAK,EAAS,KAAK,QAAQ,KACxC,EAAS,KAAK,QAAQ,KAC7B,EAAoB,KAAK,EAAS,KAAK,QAAQ,KAE5C,EAAS,KAAK,UACrB,EAAS,KAAK,SAAS,SAAQ,IACvB,EAAQ,IACR,EAAoB,KAAK,EAAQ,KAC1B,EAAQ,KACf,EAAoB,KAAK,EAAQ,IACrC,IAIR,MAAM,WA4Ne,GACrB,MAAM,EAAW,EAAI,MAAM,KAAK,GAChC,OAAO,EAAS,UAAU,EAAG,EAAS,YAAY,KAAO,EAC7D,CA/NU,CAA0B,GAEhC,IAAI,EACA,IACA,EAAa,EACR,QAAQ,UAAW,GACnB,QAAQ,MAAO,GACf,QAAQ,MAAO,IAEnB,IACD,EAAa,EACR,QAAQ,UAAW,GACnB,QAAQ,MAAO,GACf,QAAQ,MAAO,GACf,QAAQ,MAAO,IAGxB,MAAM,EAAgB,CAAE,MAAO,EAAG,EAAG,EAAG,EAAG,GACrC,EAAe,CAAE,MAAO,EAAG,EAAG,EAAG,EAAG,GACrC,IACD,EAAc,EAAI,EAClB,EAAa,EAAI,GAGrB,GAAW,IAAI,QAAkB,GAAsB,EAAU,IACjE,MAAM,EAAU,GAAW,IAAI,GACzB,EAAW,GACb,EAAQ,mBAAmB,IAC3B,EAAoB,SAAQ,IACxB,IAAI,EACA,IACA,EAAM,EACD,QAAQ,UAAW,EAAc,OACjC,QAAQ,MAAO,EAAc,GAC7B,QAAQ,MAAO,EAAc,IAEjC,IACD,EAAM,EACD,QAAQ,UAAW,EAAc,OACjC,QAAQ,MAAO,EAAc,GAC7B,QAAQ,MAAO,EAAc,GAC7B,QAAQ,MAAO,EAAc,IAEtC,EAAS,KAAK,CAAE,IAAK,GAAM,IAGnC,MAAM,EAAkB,CACpB,eAAgB,EAAS,KAAK,eAC9B,eAAgB,EAAS,KAAK,eAC9B,OAAQ,EAAS,KAAK,OACtB,cAAe,EACf,aAAc,EACd,QAAS,EACT,SAAU,EACV,YAAa,SACF,EAAc,IAG7B,MAAO,CACH,KAAM,GAKV,eAAe,EAAc,GACzB,MAAM,EAAW,GACjB,GAAI,EAAO,aAAa,OAAS,EAAS,KAAK,eAAe,gBAAkB,EAAG,OAAO,EAE1F,IAAK,EAAO,aAAa,MAAQ,GAAK,EAAS,KAAK,eAAe,eAAiB,EAAG,CAEnF,MAAM,EAAiB,GAAqB,EAAO,cAC7C,EAAkB,GAAqB,EAAO,eAC9C,EAAkB,GAAuB,EAAQ,EAAS,KAAK,eAAgB,GAErF,QAAS,EAAI,EAAG,EAAI,EAAe,OAAQ,IAAK,CAC5C,MAAM,EAAoB,EAAe,GACnC,EAAqB,EAAgB,GACvC,EAAO,QAAQ,wBAAwB,KAEnC,GACa,EACR,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,GAEtC,GACY,EACR,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,IAG1C,GAAW,IAAI,IAChB,GAAW,IAAI,QAAkB,GAAsB,EAAU,IAErE,MAAM,EAAa,GAAW,IAAI,GAC5B,EAAkB,CAAE,MAAO,EAAG,EAAG,EAAG,EAAG,GACxC,IAAQ,EAAgB,EAAI,GAEjC,MAAM,EAAW,GACb,EAAW,mBAAmB,IAC9B,EAAoB,SAAQ,IACxB,IAAI,EACA,IACA,EAAM,EACD,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,IAEtC,IAED,EAAM,EACD,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,IAE3C,EAAS,KAAK,CAAE,IAAK,GAAM,IAGnC,MAAM,EAAQ,CACV,eAAgB,EAAO,eAAiB,EACxC,eAAgB,EAAgB,GAChC,OAAQ,EAAS,KAAK,OACtB,cAAe,EACf,aAAc,EACd,QAAS,EACT,SAAU,EACV,YAAa,SACF,EAAc,IAG7B,EAAS,KAAK,EAClB,CACJ,KAAO,CACH,MAAM,EAAiB,GAAqB,EAAO,cAC7C,EAAkB,GAAqB,EAAO,eAC9C,EAAkB,GAAuB,EAAQ,EAAS,KAAK,eAAgB,GAErF,QAAS,EAAI,EAAG,EAAI,EAAe,OAAQ,IAAK,CAC5C,MAAM,EAAoB,EAAe,GACnC,EAAqB,EAAgB,GAC3C,IAAK,EAAO,QAAQ,gBAAgB,GAChC,SAEJ,MAAM,EAAW,GACX,EAAsB,EAAO,QAAQ,mBAAmB,GAC9D,QAAS,EAAI,EAAG,EAAI,EAAoB,OAAQ,IAAK,CACjD,IAAK,EAAoB,GAAI,SAC7B,MAAM,EAAqB,EAAoB,GAC/C,IAAI,EACA,IACA,EAAM,EACD,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,IAEtC,IACD,EAAM,EACD,QAAQ,UAAW,EAAmB,OACtC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,GAClC,QAAQ,MAAO,EAAmB,IAE3C,EAAS,KAAK,CAAE,IAAK,GACzB,CAGA,MAAM,EAAQ,CACV,eAAgB,EAAO,eAAiB,EACxC,eAAgB,EAAgB,GAChC,OAAQ,EAAS,KAAK,OACtB,cAAe,EACf,aAAc,EACd,QAAS,EAAO,QAChB,SAAU,EACV,YAAa,SACF,EAAc,IAG7B,EAAS,KAAK,EAClB,CACJ,CAEA,OAAO,EAAS,OAAO,EAAE,QAC7B,CAEJ,CAEA,SAAS,GAAqB,GAC1B,MAAM,MAAE,EAAK,EAAE,EAAC,EAAE,EAAC,EAAE,GAAM,EACrB,EAAY,EAAQ,EAC1B,IAAI,EAAW,GAwBf,OApBI,WAFA,EAEW,CACP,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,GACjC,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,GACrC,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAQ,GACzC,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAQ,IAItC,CACP,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAO,EAAO,EAAJ,GAC3C,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAO,EAAO,EAAJ,GAC/C,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,GAC/C,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,GACnD,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAQ,GACnD,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAQ,GACvD,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAO,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAQ,GACvD,CAAE,MAAO,EAAW,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAQ,EAAG,EAAO,EAAJ,EAAQ,IAI5D,CACX,CAOA,SAAS,GAAuB,EAAQ,EAAoB,GACxD,MAAM,EAAkB,GACxB,QAAS,EAAI,EAAG,EAAI,EAAU,OAAQ,IAClC,EAAgB,KAAK,GAAsB,EAAQ,EAAoB,EAAU,KAErF,OAAO,CACX,CAEA,SAAS,GAAsB,EAAQ,EAAoB,GACvD,GAAI,EAAmB,OACnB,gBAQa,EAAQ,EAAY,GAErC,MAAO,EAAM,EAAO,EAAM,EAAO,EAAW,GAAa,EAGnD,GAAS,EAAO,GAAS,GAAK,EAAQ,MACtC,GAAS,EAAQ,GAAU,GAAK,EAAQ,MACxC,EAAQ,EAAS,GAAK,EAAY,GAAc,GAAK,EAAQ,MAG7D,EAAU,EAAQ,EAAQ,EAAQ,EAClC,EAAW,EAAS,EAAQ,EAAQ,EACpC,EAAU,EAAU,EACpB,EAAW,EAAW,EAGtB,EAAe,EAAS,EAAY,EAAa,EAAQ,EAAQ,EAGvE,MAAO,CAAC,OAAO,CAAC,EAAS,EAAU,EAAS,EAAU,EAFjC,EAAS,EAAY,EAAe,GAG3D,CA5BM,CAAmB,EAAQ,EAAmB,OAAQ,GACnD,GAAI,EAAmB,IAC1B,gBA4BY,EAAQ,EAAK,GAE7B,MAAM,EAAS,EAAI,MAAM,EAAG,GACtB,EAAU,CACd,EAAI,MAAM,EAAG,GACb,EAAI,MAAM,EAAG,GACb,EAAI,MAAM,EAAG,KAIT,EAAI,EAAE,KAAK,IAAI,EAAE,EAAQ,OACzB,EAAe,CAAC,EAAG,EAAG,EAAS,EAAI,GAGnC,EAAa,EAAQ,MAAK,EAAQ,IAAU,EAAO,KAAI,GAAa,EAAY,EAAa,OAE7F,EAAS,CAAC,EAAO,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,GAAI,EAAO,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,GAAI,EAAO,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,GAAG,EAAQ,GAAG,IAW3K,MAAO,CAAC,IATU,CACd,EAAO,IAAgB,EAAV,EAAQ,EAAI,IAAI,EAAW,GAAG,GAAG,EAAW,GAAG,GAAG,EAAW,GAAG,IAC7E,EAAO,IAAgB,EAAV,EAAQ,EAAI,IAAI,EAAW,GAAG,GAAG,EAAW,GAAG,GAAG,EAAW,GAAG,IAC7E,EAAO,EAAO,GAAG,EAAO,IAAgB,EAAV,EAAQ,EAAI,IAAI,EAAW,GAAG,GAAG,EAAW,GAAG,GAAG,EAAW,GAAG,KAIzE,UAAU,GAGrC,CAxDM,CAAgB,EAAQ,EAAmB,IAAK,GAEhD,MAAM,IAAI,MAAM,mCAExB,aCvRC,IAcI,EAXA,EAAW,IAAI,WAAW,CAC7B,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,IAAK,IAAK,GAAI,GAAI,GACzI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,GAAI,MAGpG,GAA2B,iBAAhB,YACV,MAAO,CACN,cAMU,YAAY,qBAOR,GAEf,QADI,EAAS,IAAI,WAAW,OACnB,EAAI,EAAG,EAAI,QAAe,EAAG,CACrC,IAAI,EAAK,EAAK,WAAW,GACzB,EAAO,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,CAC1D,CACA,IAAI,EAAQ,EACZ,IAAS,EAAI,EAAG,EAAI,QAAe,EAClC,EAAO,KAAW,EAAO,GAAK,GAAK,EAAS,EAAO,IAAyB,IAAlB,EAAO,GAAK,IAAW,IAAS,GAE3F,OAAO,EAAO,OAAO,MAAM,EAAG,EAC/B,CAlBwB,CAfvB,yugBAeiD,IAAI,eAAe,IACpE,EAAW,EAAO,UACT,QAAQ,oBACjB,EAAS,QAAQ,4BAA4B,GAC7C,EAAS,QAAQ,2BAA2B,EAC7C,GA4LA,CDsED,GE1RA,IAAI,cAGH,IAKI,EAAW,IAAI,WAAW,CAC7B,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAAK,GAAI,EAAG,EAC3I,GAAI,EAAG,EAAG,GAAI,EAAG,IAAK,GAAI,GAAI,KAE3B,EAAW,IAAI,WAAW,CAC7B,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,IAAK,IAAK,GAAI,GAAI,GACzI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,GAAI,MAGpG,GAA2B,iBAAhB,YACV,MAAO,CACN,cAIF,IAEI,EAFA,EAAO,YAAY,SAAS,GAAY,EAjB3C,0khBAiB+D,EAnB/D,yxSAuBG,EAAQ,YAAY,YAAY,EAAM,IAAI,eAAe,IAC5D,EAAW,EAAO,UACT,QAAQ,mBAClB,IAEA,SAAS,EAAO,GAEf,QADI,EAAS,IAAI,WAAW,EAAK,QACxB,EAAI,EAAG,EAAI,EAAK,SAAU,EAAG,CACrC,IAAI,EAAK,EAAK,WAAW,GACzB,EAAO,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,CAC1D,CACA,IAAI,EAAQ,EACZ,IAAS,EAAI,EAAG,EAAI,EAAK,SAAU,EAClC,EAAO,KAAW,EAAO,GAAK,GAAK,EAAS,EAAO,IAAyB,IAAlB,EAAO,GAAK,IAAW,IAAS,GAE3F,OAAO,EAAO,OAAO,MAAM,EAAG,EAC/B,CAEA,SAAS,EAAO,EAAU,EAAK,EAAQ,EAAO,EAAM,EAAQ,GAC3D,IAAI,EAAO,EAAS,QAAQ,KACxB,EAAU,EAAQ,KAClB,EAAK,EAAK,EAAS,GACnB,EAAK,EAAK,EAAO,QACjB,EAAO,IAAI,WAAW,EAAS,QAAQ,OAAO,QAClD,EAAK,IAAI,EAAQ,GACjB,IAAI,EAAM,EAAI,EAAI,EAAO,EAAM,EAAI,EAAO,QAM1C,GALW,GAAP,GAAY,GACf,EAAO,EAAI,EAAQ,GAEpB,EAAO,IAAI,EAAK,SAAS,EAAI,EAAK,EAAQ,IAC1C,EAAK,EAAK,EAAK,IACJ,GAAP,EACH,MAAM,IAAI,MAAM,0BAA4B,EAE9C,CAEA,IAAI,EAAU,CACb,KAAM,GACN,WAAY,0BACZ,WAAY,2BACZ,YAAa,0BACb,MAAO,6BAGJ,EAAW,CACd,WAAY,6BACZ,UAAW,4BACX,QAAS,+BAGN,EAAU,GACV,EAAY,EAEhB,SAAS,EAAa,GACrB,IAAI,EAAS,CACZ,OAAQ,IAAI,OAAO,GACnB,QAAS,EACT,SAAU,IAWX,OARA,EAAO,OAAO,UAAY,SAAU,GACnC,IAAI,EAAO,EAAM,KAEjB,EAAO,SAAW,EAAK,MACvB,EAAO,SAAS,EAAK,IAAI,EAAK,QAAQ,EAAK,cACpC,EAAO,SAAS,EAAK,GAC7B,EAEO,CACR,CAiDA,SAAS,EAAc,GACtB,IAAI,EAAO,EAAM,KACjB,IAAK,EAAK,GACT,OAAO,KAAK,QAEb,KAAK,MAAM,eAAe,GACzB,IACC,IAAI,EAAS,IAAI,WAAW,EAAK,MAAQ,EAAK,MAC9C,EAAO,EAAU,EAAS,QAAQ,EAAK,MAAO,EAAQ,EAAK,MAAO,EAAK,KAAM,EAAK,OAAQ,EAAS,QAAQ,EAAK,SAChH,KAAK,YAAY,CAAE,GAAI,EAAK,GAAI,MAAO,EAAK,MAAO,OAAQ,UAAW,MAAO,GAAU,CAAC,EAAO,QAChG,OAAS,GACR,KAAK,YAAY,CAAE,GAAI,EAAK,GAAI,MAAO,EAAK,MAAO,OAAQ,SAAU,MAAO,GAC7E,CACD,GACD,CAEA,MAAO,CACN,MAAO,EACP,aACA,WAAY,SAAU,aAlEF,GAepB,QAdI,EACH,wDACA,IAAI,WAAW,GADf,4HAKA,EAAc,KACd,IACA,EAAO,WACP,EAAc,WAEX,EAAO,IAAI,KAAK,CAAC,GAAS,CAAE,KAAM,oBAClC,EAAM,IAAI,gBAAgB,GAErB,EAAI,EAAQ,OAAQ,EAAI,IAAS,EACzC,EAAQ,GAAK,EAAa,GAG3B,IAAS,EAAI,EAAO,EAAI,EAAQ,SAAU,EACzC,EAAQ,GAAG,OAAO,YAAY,IAG/B,EAAQ,OAAS,EAEjB,IAAI,gBAAgB,EACrB,CAwCuB,CACT,EACb,EACA,mBAAoB,SAAU,EAAQ,EAAO,EAAM,EAAQ,GAC1D,EAAO,EAAU,EAAS,QAAQ,2BAA4B,EAAQ,EAAO,EAAM,EAAQ,EAAS,QAAQ,EAAQ,IACrH,EACA,kBAAmB,SAAU,EAAQ,EAAO,EAAM,GACjD,EAAO,EAAU,EAAS,QAAQ,0BAA2B,EAAQ,EAAO,EAAM,EACnF,EACA,oBAAqB,SAAU,EAAQ,EAAO,EAAM,GACnD,EAAO,EAAU,EAAS,QAAQ,4BAA6B,EAAQ,EAAO,EAAM,EACrF,EACA,iBAAkB,SAAU,EAAQ,EAAO,EAAM,EAAQ,EAAM,GAC9D,EAAO,EAAU,EAAS,QAAQ,EAAS,IAAQ,EAAQ,EAAO,EAAM,EAAQ,EAAS,QAAQ,EAAQ,IAC1G,EACA,sBAAuB,SAAU,EAAO,EAAM,EAAQ,EAAM,GAC3D,OAAI,EAAQ,OAAS,WAtDD,EAAO,EAAM,EAAQ,EAAM,GAGhD,QAFI,EAAS,EAAQ,GAEZ,EAAI,EAAG,EAAI,EAAQ,SAAU,EACjC,EAAQ,GAAG,QAAU,EAAO,UAC/B,EAAS,EAAQ,IAInB,OAAO,IAAI,kBAAkB,EAAS,GACrC,IAAI,EAAO,IAAI,WAAW,GACtB,IAAO,EAEX,EAAO,SAAW,EAClB,EAAO,SAAS,GAAM,CAAE,QAAS,EAAS,OAAQ,GAClD,EAAO,OAAO,YAAY,CAAE,GAAI,EAAI,MAAO,EAAO,KAAM,EAAM,OAAQ,EAAM,KAAM,EAAM,OAAQ,GAAU,CAAC,EAAK,QACjH,GACD,CAqCuB,CACA,EAAO,EAAM,EAAQ,EAAS,GAAO,EAAQ,IAG3D,EAAM,iBACZ,IAAI,EAAS,IAAI,WAAW,EAAQ,GAEpC,OADA,EAAO,EAAU,EAAS,QAAQ,EAAS,IAAQ,EAAQ,EAAO,EAAM,EAAQ,EAAS,QAAQ,EAAQ,KAClG,CACR,GACD,EAED,CA/LG,IAAiB,WCGpB,IAGI,EAAW,IAAI,WAAW,CAC7B,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,IAAK,IAAK,GAAI,GAAI,GACzI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,GAAI,MAGpG,GAA2B,iBAAhB,YACV,MAAO,CACN,cAMU,YAAY,qBAKR,GAEf,QADI,EAAS,IAAI,WAAW,OACnB,EAAI,EAAG,EAAI,QAAe,EAAG,CACrC,IAAI,EAAK,EAAK,WAAW,GACzB,EAAO,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,CAC1D,CACA,IAAI,EAAQ,EACZ,IAAS,EAAI,EAAG,EAAI,QAAe,EAClC,EAAO,KAAW,EAAO,GAAK,GAAK,EAAS,EAAO,IAAyB,IAAlB,EAAO,GAAK,IAAW,IAAS,GAE3F,OAAO,EAAO,OAAO,MAAM,EAAG,EAC/B,CAhBwB,CAfvB,g4gCAeiD,IAAI,eAAe,GACzD,EAAO,SACT,QAAQ,mBAClB,GAqjBA,ED3kBoB,GCAG,WCGvB,IAGI,EAAW,IAAI,WAAW,CAC7B,GAAI,EAAG,GAAI,EAAG,EAAG,IAAK,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,GAAI,EAAG,IAAK,GAAI,EAAG,GAAI,IAAK,IAAK,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,IAAK,IAAK,GAAI,GAAI,GACzI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,GAAI,MAGpG,GAA2B,iBAAhB,YACV,MAAO,CACN,cAMU,YAAY,qBAKR,GAEf,QADI,EAAS,IAAI,WAAW,OACnB,EAAI,EAAG,EAAI,QAAe,EAAG,CACrC,IAAI,EAAK,EAAK,WAAW,GACzB,EAAO,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAK,CAC1D,CACA,IAAI,EAAQ,EACZ,IAAS,EAAI,EAAG,EAAI,QAAe,EAClC,EAAO,KAAW,EAAO,GAAK,GAAK,EAAS,EAAO,IAAyB,IAAlB,EAAO,GAAK,IAAW,IAAS,GAE3F,OAAO,EAAO,OAAO,MAAM,EAAG,EAC/B,CAhBwB,CAfvB,4laAeiD,IAAI,eAAe,GACzD,EAAO,SACT,QAAQ,mBAClB,GA4RA,CDlTuB,GEQxB,IAAI,GAAsB,EAW1B,MAAM,GAoBF,WAAA,CAAY,GAoBR,GAnBA,KAAK,oBAAqD,MAA/B,EAAQ,oBAAmC,EAAI,EAAQ,oBAClF,KAAK,QAA8B,MAAnB,EAAQ,QAAwB,EAAQ,QAAU,IAClE,KAAK,SAAW,EAAQ,SACxB,KAAK,eAAiB,IAAI,EAAM,QAChC,KAAK,eAAe,IAAI,EAAG,EAAG,EAAG,EAC7B,EAAG,KAAO,EACV,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,GACb,KAAK,eAAiB,IACtB,KAAK,MAAQ,EAAQ,MACf,IACF,KAAK,aAAe,EAAQ,aAC5B,KAAK,eAAiB,EAAQ,eACA,MAA1B,EAAQ,iBAA6B,KAAK,eAAiB,EAAQ,iBAI3E,KAAK,WAAa,IAAI,GACtB,KAAK,WAAW,UAAS,KAAa,KAAM,0CACtC,GAAa,EAAQ,YACvB,KAAK,WAAW,eAAe,EAAQ,aACvC,KAAK,sBACF,CACH,MAAM,EAAc,IAAI,GACxB,EAAY,eAAe,sDAC3B,KAAK,YAAc,EACnB,KAAK,WAAW,eAAe,GAC/B,KAAK,WAAW,iBACpB,CAEA,GAAM,GAAa,EAAQ,WACvB,KAAK,WAAW,cAAc,EAAQ,YACtC,KAAK,yBACI,GAAa,EAAQ,SAAU,CACxC,MAAM,EAAa,IAAI,GACvB,EAAW,kBAAkB,sDAAsD,cAAc,EAAQ,UACzG,KAAK,WAAa,EAClB,KAAK,WAAW,cAAc,GAC9B,KAAK,WAAW,gBACpB,CAEA,KAAK,WAAW,kBAAkB,IAClC,KAAK,qBAEL,KAAK,YAAc,IAAI,GAAY,KAAK,YACxC,KAAK,gBAAkB,IAAI,GAAgB,KAAK,WAAY,KAAK,UAEjE,KAAK,MAAQ,IAAI,GACjB,KAAK,SAAW,GAGhB,KAAK,MAAQ,GACb,KAAK,UAAY,GACjB,KAAK,UAAY,GACjB,KAAK,cAAgB,EAEzB,CAOA,MAAA,GAEI,MAAM,EAAO,KACT,GAAsB,EAAK,qBAC3B,EAAK,YAGT,EAAK,YAET,CAGA,iBAAA,CAAkB,GACd,KAAK,UAAU,QAAQ,EAC3B,CACA,SAAA,GAEI,EAAG,CACC,GAAiC,GAA7B,KAAK,cAAc,SACnB,KAAK,oBAC4B,GAA7B,KAAK,cAAc,QAAa,OAExC,KAAO,KAAK,cAAc,OAAS,GAAG,CAClC,MAAM,EAAe,KAAK,cAAc,QAClC,GAAgB,EAAa,oBAC/B,EAAa,YAErB,CACJ,OAAS,GAAsB,KAAK,oBAGxC,CACA,aAAA,CAAc,EAAO,EAAU,EAAK,EAAkB,EAAa,EAAO,GACtE,KAAK,MAAM,QAAQ,CAAC,EAAO,EAAU,EAAK,EAAkB,EAAa,EAAO,GACpF,CAEA,UAAA,GAII,IAH6B,GAAzB,KAAK,UAAU,QACf,KAAK,gBAEF,KAAK,UAAU,OAAS,GAAG,CAC9B,MAAM,EAAO,KAAK,UAAU,QAC5B,IAAK,EAAM,OACX,MAAM,EAAQ,EAAK,GACb,EAAW,EAAK,GAChB,EAAM,EAAK,GACX,EAAO,EAAM,IAAI,GAEjB,GAAU,EAAS,IACrB,OAAO,KAAK,EAAS,IAAM,SAAQ,IAC/B,MAAM,EAAW,EAAS,GAAK,GACzB,IACF,EAAM,IAAI,EAAK,EAAS,IAExB,EAAS,GAAK,GAAQ,KAC1B,GAMZ,CAuBJ,CAEA,iBAAA,GACI,IAAI,EAAmB,OAAO,kBAC1B,KACJ,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IACvC,KAAK,UAAU,GAAG,mBAIlB,KAAK,UAAU,GAAG,kBACnB,KAAK,cAAc,KAAK,KAAK,UAAU,OAAO,EAAG,GAAG,IAJpD,KAAK,UAAU,OAAO,EAAG,GAOjC,GAAI,KAAK,cAAc,OAAS,EAAG,OACnC,IAiBI,EAjBA,EAAe,EACf,EAAc,OAAO,iBACrB,KACJ,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IAAK,CAEjD,MAAM,EAAO,KAAK,UAAU,GAAG,mBAC3B,GAAQ,IACR,EAAmB,EACnB,EAAU,GAEd,EAAe,KAAK,IAAI,KAAK,UAAU,GAAG,OACD,aAArC,KAAK,UAAU,GAAG,iBAAkC,KAAK,UAAU,GAAG,MAAQ,IAC9E,EAAc,KAAK,UAAU,GAAG,MAChC,EAAc,EAGtB,CAOA,GALI,EAAe,EAAc,EAC7B,EAAc,KAAK,UAAU,OAAO,EAAa,GAAG,MAC7C,GAAW,IAClB,EAAc,KAAK,UAAU,OAAO,EAAS,GAAG,OAE9C,EAAa,CACf,KAAK,cAAc,KAAK,GACxB,MAAM,EAAW,EAAY,cAC7B,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IACxC,EAAS,KAAI,GAAK,EAAE,OAAM,SAAS,KAAK,UAAU,GAAG,OACrD,KAAK,cAAc,KAAK,KAAK,UAAU,OAAO,EAAG,GAAG,MAGhE,CACJ,CAEA,aAAA,GACI,IAAI,EAAmB,OAAO,kBAC1B,KACJ,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IAEnC,KAAK,MAAM,GAAG,IACf,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,EAAG,GAAG,IAGpD,KAAI,KAAK,UAAU,OAAS,GAA5B,CACA,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IAAK,CAC7C,MAAM,EAAO,KAAK,MAAM,GAAG,KAAO,KAAK,MAAM,GAAG,GAC5C,GAAQ,IACR,EAAmB,EACnB,EAAU,EAElB,CACA,GAAI,GAAW,EAAG,CACd,MAAM,EAAc,KAAK,MAAM,OAAO,EAAS,GAAG,MAClD,KAAK,UAAU,KAAK,GACpB,MAAM,EAAW,EAAY,KAC7B,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IACpC,EAAS,KAAI,GAAK,EAAE,OAAM,SAAS,KAAK,MAAM,GAAG,KACjD,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,EAAG,GAAG,MAGxD,CAjB+B,CAkBnC,CAiBA,GAAA,CAAI,EAAiB,EAAgB,EAAM,EAAU,EAAkB,EAAa,EAAO,EAAiB,EAAe,EAAc,EAAgB,GACrJ,MAAM,EAAO,KACP,EAAM,GAAc,GAEpB,EAAsB,IAAI,gBAOhC,GANA,EAAgB,OAAO,iBAAiB,cAC/B,EAAK,SAAS,IAAkD,GAA1C,OAAO,KAAK,EAAK,SAAS,IAAM,QACvD,EAAoB,MAAM,aAC9B,IAGC,EAAK,SAAS,UAAa,EAAK,SAAS,UAAa,EAAK,SAAS,UAAa,EAAK,SAAS,QAapG,GATK,EAAK,SAAS,KACf,EAAK,SAAS,GAAO,IAEnB,EAAK,SAAS,GAAK,IACrB,QAAQ,MAAM,sCAElB,EAAK,SAAS,GAAK,GAAkB,EAEhB,EAAK,MAAM,IAAI,GAEhC,KAAK,cAAc,EAAK,MAAO,EAAK,SAAU,EAAK,EAAkB,EAAa,EAAO,OAC/B,CAC1D,IAAI,EACA,EAAK,SAAS,SACd,EAAmB,KAGf,IAAI,EAMA,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EACN,OAAQ,EAAoB,SATxB,IACL,MAAM,EAAM,CAAE,OAAQ,EAAoB,SAazD,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GAER,MADA,QAAQ,MAAM,mCAAqC,GAC7C,IAAI,MAAM,kBAAkB,kCAAqC,EAAO,YAAY,EAAO,cAErG,OAAO,EAAO,aAAa,IAE5B,MAAK,GAEG,KAAK,YAAY,UAAU,GAAoB,IAAW,EAAK,aAAa,EAAM,EAAc,GAAK,EAAe,KAC5H,MAAK,IACJ,EAAK,MAAM,IAAI,EAAK,GACpB,KAAK,cAAc,EAAK,MAAO,EAAK,SAAU,EAAK,EAAkB,EAAa,EAAO,GACzF,EAAK,YAAY,IAClB,OAAO,IAAD,IAEN,cACC,IAAqB,KAItB,EAAK,SAAS,SAAW,EAAK,SAAS,SAC9C,EAAmB,KAGf,IAAI,EAMA,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EACN,OAAQ,EAAoB,SATxB,IACL,MAAM,EAAM,CAAE,OAAQ,EAAoB,SAazD,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GAER,MADA,QAAQ,MAAM,mCAAqC,GAC7C,IAAI,MAAM,kBAAkB,kCAAqC,EAAO,YAAY,EAAO,cAErG,OAAO,EAAO,aAAa,IAE5B,MAAK,GAEG,KAAK,gBAAgB,YAAY,EAAmB,EAAe,EAAc,KACzF,MAAK,IACC,EAAK,eACF,GACA,EAAK,aAAa,KAAK,gBAE3B,EAAK,UAAU,IAEP,EAAE,SACE,GACA,EAAE,aAAa,KAAK,gBAElB,EAAK,cACP,EAAK,aAAa,EAAG,IAGzB,EAAE,UAEI,EAAK,gBACP,EAAK,eAAe,EAAG,EAE/B,KAIR,EAAK,MAAM,IAAI,EAAK,GACpB,EAAK,cAAc,EAAK,MAAO,EAAK,SAAU,EAAK,EAAkB,EAAa,EAAO,GACzF,EAAK,YAAY,IAClB,OAAO,IAAD,IAEN,cACC,IAAqB,KAKtB,EAAK,SAAS,WACrB,EAAmB,KACf,IAAI,EAMA,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EACN,OAAQ,EAAoB,SATxB,IACL,MAAM,EAAM,CAAE,OAAQ,EAAoB,SAazD,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GAER,MADA,QAAQ,MAAM,mCAAqC,GAC7C,IAAI,MAAM,kBAAkB,kCAAqC,EAAO,YAAY,EAAO,cAErG,OAAO,EAAO,MAAM,IAErB,MAAK,GACG,GAAiB,EAAM,KAC/B,MAAK,IACJ,EAAK,MAAM,IAAI,EAAK,GACpB,EAAK,cAAc,EAAK,MAAO,EAAK,SAAU,GAC9C,EAAK,YAAY,IAClB,OAAO,IACN,QAAQ,MAAM,EAAC,IAChB,cACC,IAAqB,MAIjC,KAAK,kBAAkB,CACnB,iBAAoB,KACR,EAAgB,OAAO,WAAa,EAAK,SAAS,IAAQ,OAAO,KAAK,EAAK,SAAS,IAAM,OAAS,IAAM,EAAK,MAAM,IAAI,GAEpI,WAAc,EACd,iBAAoB,EACpB,YAAe,EACf,MAAS,EACT,gBAAmB,EACnB,KAAQ,GAEhB,MA9KI,QAAQ,MAAM,sEA+KtB,CAMA,KAAA,GACI,MAAM,EAAO,KAAK,eAClB,KAAK,eAAiB,EACtB,KAAK,aACL,KAAK,eAAiB,CAC1B,CAOA,UAAA,CAAW,EAAM,GACb,MAAM,EAAM,GAAc,GACpB,EAAO,KACP,EAAK,SAAS,IAChB,iBACQ,EAAK,UAAY,EAAK,SAAS,YACxB,EAAK,SAAS,GAAK,GAC1B,EAAK,aACT,GACD,EAAK,QAGhB,CAEA,OAAA,GACI,IAAI,EAAQ,KAAK,MAAM,OAEvB,IADA,KAAK,qBAAqB,GACW,OAA7B,EAAQ,EAAM,QAAQ,KAC1B,KAAK,qBAAqB,GAE9B,KAAK,MAAM,QACX,KAAK,aACL,KAAK,gBACD,KAAK,aAAa,KAAK,YAAY,UACnC,KAAK,YAAY,KAAK,WAAW,SACzC,CACA,UAAA,GACI,MAAM,EAAO,KAEb,IAAI,EAAI,EAER,KAAO,EAAK,MAAM,OAAS,EAAK,gBAAkB,EAAI,EAAK,MAAM,QAAQ,CACrE,IACA,MAAM,EAAQ,EAAK,MAAM,OACnB,EAAM,EAAK,SAAS,EAAM,KAC1B,IACE,OAAO,KAAK,GAAK,OAAS,GAC1B,EAAK,MAAM,OAAO,EAAM,KACxB,EAAK,MAAM,IAAI,EAAM,IAAK,EAAM,SAEhC,EAAK,MAAM,OAAO,EAAM,YACjB,EAAK,SAAS,EAAM,KAE3B,EAAK,qBAAqB,IAKtC,CACJ,CACA,oBAAA,CAAqB,GACZ,EAAM,QACP,EAAM,MAAM,cACZ,EAAM,MAAM,SACH,EAAM,MAAM,UACrB,EAAM,MAAM,UAAU,IAElB,GAAI,EAAE,SAEF,GAAI,EAAE,SAAS,OACX,QAAS,EAAI,EAAG,EAAI,EAAE,SAAS,SAAU,EACrC,EAAE,SAAS,GAAG,eAIlB,EAAE,SAAS,UAGf,EAAE,UAEF,EAAE,SAAS,SAEf,IAGZ,EAiBJ,SAAS,GAAc,GAKnB,QAHI,EAAQ,EAAU,MAAM,KACxB,EAAW,GACX,EAAS,EACJ,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACnC,IAAI,EAAO,EAAM,GACJ,MAAT,GAAyB,KAAT,GAAwB,OAAT,EAMnC,EAAS,KAAY,EALJ,OAAT,GAAiB,EAAS,GAC1B,GAKZ,CAEA,GAAe,IAAX,EACA,MAAO,IAGX,IAAI,EAAS,GACb,IAAS,EAAI,EAAG,EAAI,EAAQ,IACxB,GAAU,IAAM,EAAS,GAG7B,OAAO,CACX,CC5lBA,MAAM,GAAY,GAClB,QAAS,EAAI,EAAG,EAAI,MAAO,EACvB,GAAU,MAAM,EAAI,KAAO,SAAS,IAAI,MAAM,ICHlD,IAAI,GACJ,MAAM,GAAQ,IAAI,WAAW,ICA7B,GAAe,CAAE,kBADS,OAAW,KAAe,OAAO,YAAc,OAAO,WAAW,KAAK,SCGhG,SAAS,GAAI,EAAS,EAAK,GAEvB,MAAM,GADN,EAAU,GAAW,IACA,QAAU,EAAQ,oBFFvC,IAAK,GAAiB,CAClB,UAAW,OAAW,MAAgB,OAAO,gBACzC,MAAM,IAAI,MAAM,4GAEpB,GAAkB,OAAO,gBAAgB,KAAK,OAClD,CACA,OAAO,GAAgB,GAC3B,CEL2C,GACvC,GAAI,EAAK,OAAS,GACd,MAAM,IAAI,MAAM,qCAcpB,OAZA,EAAK,GAAgB,GAAV,EAAK,GAAa,GAC7B,EAAK,GAAgB,GAAV,EAAK,GAAa,aHLD,EAAK,EAAS,GAC1C,OAAQ,GAAU,EAAI,EAAS,IAC3B,GAAU,EAAI,EAAS,IACvB,GAAU,EAAI,EAAS,IACvB,GAAU,EAAI,EAAS,IACvB,IACA,GAAU,EAAI,EAAS,IACvB,GAAU,EAAI,EAAS,IACvB,IACA,GAAU,EAAI,EAAS,IACvB,GAAU,EAAI,EAAS,IACvB,IACA,GAAU,EAAI,EAAS,IACvB,GAAU,EAAI,EAAS,IACvB,IACA,GAAU,EAAI,EAAS,KACvB,GAAU,EAAI,EAAS,KACvB,GAAU,EAAI,EAAS,KACvB,GAAU,EAAI,EAAS,KACvB,GAAU,EAAI,EAAS,KACvB,GAAU,EAAI,EAAS,MAAM,aACrC,CGhBiC,CAWN,EAC3B,CACA,SAAS,GAAG,EAAS,EAAK,GACtB,OAAI,GAAO,aAAuB,EACvB,GAAO,aAEX,GAAI,EACf,KAAA,GAAA,GAAA,GAAA,cAAA,GAAA,OAAA,GCFA,SAAS,EAAW,GAClB,GAAoB,iBAAT,EACT,MAAM,IAAI,UAAU,mCAAqC,KAAK,UAAU,GAE5E,CAGA,SAAS,EAAqB,EAAM,GAMlC,QADI,EAJA,EAAM,GACN,EAAoB,EACpB,KACA,EAAO,EAEF,EAAI,EAAG,GAAK,EAAK,SAAU,EAAG,CACrC,GAAI,EAAI,EAAK,OACX,EAAO,EAAK,WAAW,OACpB,IAAa,KAAT,EACP,MAEA,EAAO,EAAE,CACX,GAAa,KAAT,EAAmB,CACrB,GAAI,IAAc,EAAI,GAAc,IAAT,EAEpB,GAAI,IAAc,EAAI,GAAc,IAAT,EAAY,CAC5C,GAAI,EAAI,OAAS,GAA2B,IAAtB,GAA8D,KAAnC,EAAI,WAAW,EAAI,OAAS,IAAsD,KAAnC,EAAI,WAAW,EAAI,OAAS,GAC1H,GAAI,EAAI,OAAS,EAAG,CAClB,IAAI,EAAiB,EAAI,YAAY,KACrC,GAAI,IAAmB,EAAI,OAAS,EAAG,MACjC,GACF,EAAM,GACN,EAAoB,GAGpB,GADA,EAAM,EAAI,MAAM,EAAG,IACK,OAAS,EAAI,EAAI,YAAY,KAEvD,EAAY,EACZ,EAAO,EACP,QACd,CACA,SAAoC,IAAf,EAAI,QAA+B,IAAf,EAAI,OAAc,CAC/C,EAAM,GACN,EAAoB,EACpB,EAAY,EACZ,EAAO,EACP,QACZ,CAEY,IACE,EAAI,OAAS,EACf,GAAO,MAEP,EAAM,KACR,EAAoB,EAE9B,MACY,EAAI,OAAS,EACf,GAAO,IAAM,EAAK,MAAM,EAAY,EAAG,GAEvC,EAAM,EAAK,MAAM,EAAY,EAAG,GAClC,EAAoB,EAAI,EAAY,EAEtC,EAAY,EACZ,EAAO,CACb,MAAwB,KAAT,QAAqB,IAC5B,EAEF,IAEN,CACE,OAAO,CACT,CAAA,GAAA,EAcA,IAAI,EAAQ,CAEV,QAAS,WAKP,QAFI,EAFA,EAAe,GACf,KAGK,EAAI,UAAU,OAAS,EAAG,QAAY,EAAkB,IAAK,CACpE,IAAI,EACA,GAAK,EACP,EAAO,UAAU,aAEb,IACF,EAAM,QAAQ,OAChB,EAAO,GAGT,EAAW,GAGS,IAAhB,EAAK,SAIT,EAAe,EAAO,IAAM,EAC5B,EAA0C,KAAvB,EAAK,WAAW,GACzC,CAQI,OAFA,EAAe,EAAqB,GAAe,GAE/C,EACE,EAAa,OAAS,EACjB,IAAM,EAEN,IACA,EAAa,OAAS,EACxB,EAEA,GAEb,EAEE,UAAW,SAAmB,GAG5B,GAFA,EAAW,GAES,IAAhB,EAAK,OAAc,MAAO,IAE9B,IAAI,EAAoC,KAAvB,EAAK,WAAW,GAC7B,EAAyD,KAArC,EAAK,WAAW,EAAK,OAAS,GAQtD,OAHoB,KAFpB,EAAO,EAAqB,GAAO,IAE1B,QAAiB,IAAY,EAAO,KACzC,EAAK,OAAS,GAAK,IAAmB,GAAQ,KAE9C,EAAmB,IAAM,EACtB,CACX,EAEE,WAAY,SAAoB,GAE9B,OADA,EAAW,GACJ,EAAK,OAAS,GAA4B,KAAvB,EAAK,WAAW,EAC9C,EAEE,KAAM,WACJ,GAAyB,IAArB,UAAU,OACZ,MAAO,IAET,QADI,EACK,EAAI,EAAG,EAAI,UAAU,SAAU,EAAG,CACzC,IAAI,EAAM,UAAU,GACpB,EAAW,GACP,EAAI,OAAS,aACX,EACF,EAAS,EAET,GAAU,IAAM,EAE1B,CACI,gBAAI,EACK,IACF,EAAM,UAAU,EAC3B,EAEE,SAAU,SAAkB,EAAM,GAShC,GARA,EAAW,GACX,EAAW,GAEP,IAAS,IAEb,EAAO,EAAM,QAAQ,OACrB,EAAK,EAAM,QAAQ,IAEF,MAAO,GAIxB,QADI,EAAY,EACT,EAAY,EAAK,QACa,KAA/B,EAAK,WAAW,KADY,GASlC,QALI,EAAU,EAAK,OACf,EAAU,EAAU,EAGpB,EAAU,EACP,EAAU,EAAG,QACa,KAA3B,EAAG,WAAW,KADU,GAW9B,QANI,EADQ,EAAG,OACK,EAGhB,EAAS,EAAU,EAAQ,EAAU,EACrC,KACA,EAAI,EACD,GAAK,IAAU,EAAG,CACvB,GAAI,IAAM,EAAQ,CAChB,GAAI,EAAQ,EAAQ,CAClB,GAAmC,KAA/B,EAAG,WAAW,EAAU,GAG1B,OAAO,EAAG,MAAM,EAAU,EAAI,GACzB,GAAU,IAAN,EAGT,OAAO,EAAG,MAAM,EAAU,EAEtC,MAAmB,EAAU,IACoB,KAAnC,EAAK,WAAW,EAAY,GAG9B,EAAgB,EACD,IAAN,IAGT,EAAgB,IAGpB,KACR,CACM,IAAI,EAAW,EAAK,WAAW,EAAY,GAE3C,GAAI,IADS,EAAG,WAAW,EAAU,GAEnC,MACoB,KAAb,IACP,EAAgB,EACxB,CAEI,IAAI,EAAM,GAGV,IAAK,EAAI,EAAY,EAAgB,EAAG,GAAK,IAAW,EAClD,IAAM,GAAkC,KAAvB,EAAK,WAAW,KAChB,IAAf,EAAI,OACN,GAAO,KAEP,GAAO,OAMb,OAAI,EAAI,OAAS,EACR,EAAM,EAAG,MAAM,EAAU,IAEhC,GAAW,EACoB,KAA3B,EAAG,WAAW,MACd,EACG,EAAG,MAAM,GAEtB,EAEE,UAAW,SAAmB,GAC5B,OAAO,CACX,EAEE,QAAS,SAAiB,GAExB,GADA,EAAW,GACS,IAAhB,EAAK,OAAc,MAAO,IAK9B,QAJI,EAAO,EAAK,WAAW,GACvB,EAAmB,KAAT,EACV,KACA,KACK,EAAI,EAAK,OAAS,EAAG,GAAK,IAAK,EAEtC,GAAa,MADb,EAAO,EAAK,WAAW,KAEnB,IAAK,EAAc,CACjB,EAAM,EACN,KACZ,OAGQ,KAIJ,WAAI,EAAmB,EAAU,IAAM,IACnC,GAAmB,IAAR,EAAkB,KAC1B,EAAK,MAAM,EAAG,EACzB,EAEE,SAAU,SAAkB,EAAM,GAChC,YAAI,GAAoC,iBAAR,EAAkB,MAAM,IAAI,UAAU,mCACtE,EAAW,GAEX,IAGI,EAHA,EAAQ,EACR,KACA,KAGJ,YAAI,GAAqB,EAAI,OAAS,GAAK,EAAI,QAAU,EAAK,OAAQ,CACpE,GAAI,EAAI,SAAW,EAAK,QAAU,IAAQ,EAAM,MAAO,GACvD,IAAI,EAAS,EAAI,OAAS,EACtB,KACJ,IAAK,EAAI,EAAK,OAAS,EAAG,GAAK,IAAK,EAAG,CACrC,IAAI,EAAO,EAAK,WAAW,GAC3B,GAAa,KAAT,GAGA,IAAK,EAAc,CACjB,EAAQ,EAAI,EACZ,KACd,WAEc,IAGF,KACA,EAAmB,EAAI,GAErB,GAAU,IAER,IAAS,EAAI,WAAW,IACpB,SAGJ,EAAM,IAKR,KACA,EAAM,GAIpB,CAGM,OADI,IAAU,EAAK,EAAM,OAA0B,IAAY,EAAM,EAAK,QACnE,EAAK,MAAM,EAAO,EAC/B,CACM,IAAK,EAAI,EAAK,OAAS,EAAG,GAAK,IAAK,EAClC,GAA2B,KAAvB,EAAK,WAAW,IAGhB,IAAK,EAAc,CACjB,EAAQ,EAAI,EACZ,KACd,WACqB,IAGX,KACA,EAAM,EAAI,GAId,WAAI,EAAmB,GAChB,EAAK,MAAM,EAAO,EAE/B,EAEE,QAAS,SAAiB,GACxB,EAAW,GAQX,QAPI,KACA,EAAY,EACZ,KACA,KAGA,EAAc,EACT,EAAI,EAAK,OAAS,EAAG,GAAK,IAAK,EAAG,CACzC,IAAI,EAAO,EAAK,WAAW,GAC3B,GAAa,KAAT,OASA,IAGF,KACA,EAAM,EAAI,GAEC,KAAT,OAEI,EACF,EAAW,EACY,IAAhB,IACP,EAAc,QACT,IAGT,eArBO,EAAc,CACjB,EAAY,EAAI,EAChB,KACZ,CAoBA,CAEI,WAAI,QAAmB,GAEH,IAAhB,GAEgB,IAAhB,GAAqB,IAAa,EAAM,GAAK,IAAa,EAAY,EACjE,GAEF,EAAK,MAAM,EAAU,EAChC,EAEE,OAAQ,SAAgB,GACtB,GAAmB,OAAf,GAA6C,iBAAf,EAChC,MAAM,IAAI,UAAU,0EAA4E,GAElG,OAtVE,GADgB,EAuVE,GAtVD,KAAO,EAAW,KACnC,EAAO,EAAW,OAAS,EAAW,MAAQ,KAAO,EAAW,KAAO,IACtE,EAGD,IAAQ,EAAW,KACd,EAAM,EAER,EA8UU,IA9UE,EALV,EAmVP,IAvVkB,EAChB,EACA,CAsVN,EAEE,MAAO,SAAe,GACpB,EAAW,GAEX,IAAI,EAAM,CAAE,KAAM,GAAI,IAAK,GAAI,KAAM,GAAI,IAAK,GAAI,KAAM,IACxD,GAAoB,IAAhB,EAAK,OAAc,OAAO,EAC9B,IAEI,EAFA,EAAO,EAAK,WAAW,GACvB,EAAsB,KAAT,EAEb,GACF,EAAI,KAAO,IACX,EAAQ,GAER,EAAQ,EAaV,QAXI,KACA,EAAY,EACZ,KACA,KACA,EAAI,EAAK,OAAS,EAIlB,EAAc,EAGX,GAAK,IAAS,EAEnB,GAAa,MADb,EAAO,EAAK,WAAW,SAUnB,IAGF,KACA,EAAM,EAAI,GAEC,KAAT,GAEI,MAAiB,EAAW,EAA2B,IAAhB,IAAmB,EAAc,QACnE,IAGX,eAlBO,EAAc,CACjB,EAAY,EAAI,EAChB,KACZ,CAwCI,WArBI,QAAmB,GAEP,IAAhB,GAEgB,IAAhB,GAAqB,IAAa,EAAM,GAAK,IAAa,EAAY,OAChE,IACiC,EAAI,KAAO,EAAI,KAAhC,IAAd,GAAmB,EAAkC,EAAK,MAAM,EAAG,GAAgC,EAAK,MAAM,EAAW,KAG7G,IAAd,GAAmB,GACrB,EAAI,KAAO,EAAK,MAAM,EAAG,GACzB,EAAI,KAAO,EAAK,MAAM,EAAG,KAEzB,EAAI,KAAO,EAAK,MAAM,EAAW,GACjC,EAAI,KAAO,EAAK,MAAM,EAAW,IAEnC,EAAI,IAAM,EAAK,MAAM,EAAU,IAG7B,EAAY,EAAG,EAAI,IAAM,EAAK,MAAM,EAAG,EAAY,GAAY,IAAY,EAAI,IAAM,KAElF,CACX,EAEE,IAAK,IACL,UAAW,IACX,MAAO,KACP,MAAO,aAGT,EAAM,MAAQ,EAEd,GAAiB,EDpfjB,GE5BA,SAAS,KACP,OAAO,GAAW,OAAO,OAAS,OAAO,OAAO,OAAS,SAAU,GACjE,QAAS,EAAI,EAAG,EAAI,UAAU,OAAQ,IAAK,CACzC,IAAI,EAAI,UAAU,GAClB,QAAS,KAAK,IAAM,GAAE,eAAe,KAAK,EAAG,KAAO,EAAE,GAAK,EAAE,GAC/D,CACA,OAAO,CACT,EAAG,GAAS,MAAM,KAAM,UAC1B,CCRO,IAAI,GAAiB,CAG1B,OAAQ,MAGR,OAAQ,MAER,OAAQ,SAER,OAAQ,SAGR,eAAgB,SAEhB,UAAW,GAKX,eAGA,WAAY,MCbd,SAAS,GAAgB,EAAQ,GAE/B,GAAI,GAAe,EAAQ,GACzB,OAAO,EAAO,GAEhB,KAA4B,mBAAjB,EAAO,KAiFU,EAjFmC,EAkF3D,OADgB,EAjFmC,IAkFkB,mBAAnB,EAAO,IAMzD,GAAe,EAAQ,IAAW,OAAO,gBAAkB,KAAU,OAAO,eAAe,KAK3F,GAAe,GAAmB,KAKlC,KAAU,OAAO,WAQjB,KAAU,SAAS,YAvGjB,IAAI,MAAM,0BAA4B,EAAO,KAF3C,IAAI,MAAM,yBAA2B,EAAO,mBADxB,IAiFR,EAAQ,CA7E9B,CA4BA,SAAS,GAAe,EAAQ,GAC9B,UAiFqB,EAjFF,EAkFM,iBAAX,GAAuB,GAAU,EAAO,cAAgB,QAlFvC,MAAM,QAAQ,MAKzC,GAAe,GAAsB,KAKrC,KAAQ,OAAO,WAQf,KAAQ,SAAS,YAlBrB,IAiFqB,CAxDvB,CA2DA,IAAI,GAAuB,CACzB,UACA,SAEE,GAAoB,CACtB,YACA,WACA,mBChIK,MAAM,GACX,WAAA,CAAY,GACV,KAAK,cAAgB,EACrB,KAAK,OAAO,UAAY,KAAK,OAC/B,CACA,IAAA,GACE,OAAO,OAAO,KAAK,KAAK,eAAe,QAAO,GAAO,KAAK,IAAI,KAAM,QACtE,CACA,GAAA,CAAI,GACF,OAAO,GAAgB,KAAK,cAAe,EAC7C,CACA,GAAA,CAAI,EAAK,GAEP,gBDOqB,EAAQ,EAAM,GAErC,GAAI,GAAe,EAAQ,GAEzB,OADA,EAAO,GAAQ,EACR,EAET,MAAM,IAAI,MAAM,0BAA4B,EAAO,IACrD,CCdI,CADgB,KAAK,cAAe,EAAK,GAClC,IACT,CACA,GAAA,CAAI,GACF,OAAO,GAAe,KAAK,cAAe,IAAQ,KAAO,KAAK,aAChE,CACA,OAAA,GACE,OAwFiB,EAxFE,KAAK,OAwFH,EAxFW,GAAO,CAAC,EAAK,KAAK,IAAI,IAyFjD,CACL,KAAM,KACJ,IAAI,EAAI,EAAG,OACX,OAAO,EAAE,KAAO,EAAI,CAClB,MAAO,EAAS,EAAE,OAClB,QAAM,GA9FV,IAwFiB,EAAI,CAvFvB,CACA,OAAA,CAAQ,GACN,QAAS,KAAO,KAAK,OACnB,EAAS,KAAK,IAAI,GAAM,EAAK,KAEjC,CACA,OAAO,GACD,GAAe,KAAK,cAAe,WAC9B,KAAK,cAAc,EAE9B,CACA,KAAA,GACE,QAAS,KAAO,KAAK,OACnB,KAAK,OAAO,EAEhB,CACA,QAAA,GACE,OAAO,OAAO,KAAK,KAAK,eAAe,MACzC,EClCK,SAAS,GAAS,GACvB,MAAoB,iBAAN,CAChB,CACO,SAAS,GAAY,GAC1B,SAAK,GAAkB,iBAAN,GAA2C,mBAAlB,EAAE,oBAGxC,EAAE,aAA2D,iBAA5B,EAAE,YAAY,gBAA0B,EAAE,YAAY,UAAU,aAG9D,mBAA5B,EAAE,YAAY,gBAA4B,EAAE,YAAY,UAAU,GAI/E,CACO,SAAS,GAAS,GACvB,MAAoB,iBAAN,CAChB,CACO,SAAS,GAAU,GACxB,OAAO,GAAkB,iBAAN,QAAkB,OAAO,eAAe,GAAG,aAChE,CACO,SAAS,GAAW,GACzB,OAAO,GAAkB,iBAAN,QAAkB,OAAO,eAAe,GAAG,aAA3C,CACrB,CACO,SAAS,GAAO,GACrB,OAAO,QAAK,EAAE,YAAY,UAAU,UACtC,CACO,SAAS,GAAS,GACvB,MAAoB,iBAAN,CAChB,CACO,IAAI,GAAU,MAAM,QACpB,SAAS,GAAS,GACvB,OAAO,QAAK,EAAE,YAAY,UAAU,YACtC,CAOO,SAAS,GAAa,GAC3B,OAAO,MAAM,QAAQ,IAAM,GAAS,EACtC,CACO,SAAS,GAAc,GAC5B,OAAO,GAAK,EAAE,oBAAiB,EAAE,YAAY,UAAU,YACzD,CACO,SAAS,GAAe,GAC7B,OAAO,GAAK,EAAE,qBAAkB,EAAE,YAAY,UAAU,YAC1D,CACO,SAAS,GAAQ,GACtB,OAAO,QAAK,EAAE,YAAY,UAAU,WACtC,CACO,SAAS,GAAQ,GACtB,OAAO,QAAK,EAAE,YAAY,UAAU,WACtC,CACO,SAAS,GAAU,GACxB,MAAoB,kBAAN,CAChB,CACO,SAAS,GAAY,GAC1B,OAAO,QAAK,EAAE,YAAY,UAAU,eACtC,CACO,SAAS,GAAO,GACrB,OAAO,QAAK,EAAE,YAAY,UAAU,UACtC,CACO,SAAS,GAAW,GACzB,MAAoB,mBAAN,CAChB,CACO,SAAS,GAAO,GACrB,OAAO,aAAa,IACtB,CACO,SAAS,GAAS,GACvB,OAAO,aAAa,MACtB,CACO,SAAS,GAAS,GACvB,SAAU,GAAkB,iBAAN,GAAkB,EAAE,cAAgB,QAAW,GAAU,IAAO,GAAW,GACnG,CAUO,SAAS,GAAM,GAGpB,QAAK,IAGE,aAAkB,KAAO,aAAkB,IAA2C,mBAAf,EAAO,KAA4C,mBAAf,EAAO,KAA6C,mBAAhB,EAAO,MAA6C,mBAAf,EAAO,IACpM,CAOO,SAAS,GAAO,GACrB,OAAa,OAAN,CACT,CACO,SAAS,GAAY,GAC1B,gBAAO,CACT,CACO,SAAS,GAAe,GAC7B,OAAO,QAAK,EAAE,qBAA2B,EAAE,YAAY,UAAU,UACnE,CACO,SAAS,GAAY,GAC1B,OAAO,QAAK,EAAE,kBAAwB,EAAE,YAAY,UAAU,UAChE,CACO,SAAS,GAAiB,GAC/B,OAAO,QAAK,EAAE,uBAA6B,EAAE,YAAY,UAAU,UACrE,CACO,SAAS,GAAY,GAC1B,OAAO,QAAK,EAAE,kBAAwB,EAAE,YAAY,UAAU,UAChE,CACO,SAAS,GAAkB,GAChC,OAAO,QAAK,EAAE,wBAA8B,EAAE,YAAY,UAAU,UACtE,CACO,SAAS,GAAe,GAC7B,OAAO,QAAK,EAAE,qBAA2B,EAAE,YAAY,UAAU,UACnE,CAeO,SAAS,GAAyB,GACvC,OAAO,QAAK,EAAE,+BAAqC,EAAE,YAAY,UAAU,UAC7E,CACO,SAAS,GAAe,GAC7B,OAAO,QAAK,EAAE,qBAA2B,EAAE,YAAY,UAAU,UACnE,CACO,SAAS,GAAY,GAC1B,OAAO,QAAK,EAAE,kBAAwB,EAAE,YAAY,UAAU,SAAhD,CAChB,CACO,SAAS,GAAO,GACrB,OAAO,QAAK,EAAE,aAAmB,EAAE,YAAY,UAAU,UAC3D,CACO,SAAS,GAAa,GAC3B,OAAO,QAAK,EAAE,mBAAyB,EAAE,YAAY,UAAU,UACjE,CACO,SAAS,GAAe,GAC7B,OAAO,QAAK,EAAE,qBAA2B,EAAE,YAAY,UAAU,UACnE,CACO,SAAS,GAAkB,GAChC,OAAO,QAAK,EAAE,wBAA8B,EAAE,YAAY,UAAU,UACtE,CACO,SAAS,GAAY,GAC1B,OAAO,IAAO,IAAF,EAAE,kBAAwB,EAAE,YAAY,UAAU,UAChE,CACO,SAAS,GAAiB,GAC/B,OAAO,QAAK,EAAE,uBAA6B,EAAE,YAAY,UAAU,UACrE,CACO,SAAS,GAAa,GAC3B,OAAO,QAAK,EAAE,eAAiD,IAAxB,EAAE,YAAY,UAAU,UACjE,CACO,SAAS,GAAQ,GACtB,OAAO,QAAK,EAAE,YAAY,UAAU,UAA7B,CACT,CACO,SAAS,GAAO,GACrB,IAAI,SAAW,EACf,MAAU,WAAN,EACQ,OAAN,EAAmB,OACnB,GAAY,GAAW,YACvB,EAAE,aAAe,EAAE,YAAY,KAAa,EAAE,YAAY,KACvD,SAEF,CACT,CCrLO,SAAS,GAAM,GACpB,IAAI,SAAc,EAGlB,GAAa,WAAT,GAA8B,WAAT,GAA8B,WAAT,GAA8B,YAAT,GAA/D,MAAqF,EACvF,OAAO,EAIT,GAAuB,mBAAZ,EAAE,MACX,OAAO,EAAE,QAIX,GAAI,MAAM,QAAQ,GAChB,OAAO,EAAE,cAAc,GACrB,OAAO,GAAM,EACf,IAEF,GAAI,aAAa,KAAM,OAAO,IAAI,KAAK,EAAE,WACzC,GAAI,GAAY,GAAI,OAAO,EAG3B,GAAI,GAAS,GACX,gBAesB,EAAQ,GAChC,IAAI,EAAQ,GACZ,QAAS,KAAO,EACV,GAAe,EAAQ,KACzB,EAAM,GAAO,EAAS,EAAO,KAGjC,OAAO,CACT,CAvBI,CAAiB,EAAG,IAEtB,GAAa,aAAT,EAEF,OAAO,EAET,MAAM,IAAI,UAAU,+CAA+C,OAAO,EAAG,KAC/E,CA0EO,SAAS,GAAgB,EAAG,GACjC,IAAI,EAAM,EAAG,EACb,GAAI,MAAM,QAAQ,GAAI,CAIpB,IAHK,MAAM,QAAQ,IAGf,EAAE,SAAW,EAAE,OACjB,SAEF,IAAK,EAAI,EAAG,EAAM,EAAE,OAAQ,EAAI,EAAK,IACnC,IAAK,GAAgB,EAAE,GAAI,EAAE,IAC3B,SAGJ,QACF,CAAO,GAAiB,mBAAN,EAChB,OAAO,IAAM,EACR,GAAI,aAAa,OAAQ,CAC9B,GAAI,MAAM,QAAQ,MAAQ,aAAa,QACrC,SAEF,IAAK,KAAQ,EAEX,KAAM,KAAQ,KAAO,GAAgB,EAAE,GAAO,EAAE,IAC9C,SAGJ,IAAK,KAAQ,EAEX,KAAM,KAAQ,GACZ,SAGJ,QACF,CACE,OAAO,IAAM,CAEjB,CAwGO,SAAS,GAAe,EAAQ,GACrC,OAAO,GAAU,OAAO,eAAe,KAAK,EAAQ,EACtD,CCnQO,ICGI,GAAS,SAAgB,GAClC,GAAI,EACF,MAAM,IAAI,MAAM,uPAElB,OAAO,OAAO,OAAO,GACvB,ECVA,SAAS,KACP,QACF,CACA,SAAS,KACP,QACF,CACA,SAAS,KAET,CDGA,GAAS,GAAQ,GAAgB,CAC/B,eDV0B,CAAC,SAAU,SCWrC,eDV0B,CAAC,SAAU,YAAa,cEMpD,MAAM,GAAqB,oCAw2D3B,YA9zDS,IAMP,SAAS,EAAc,GACrB,MAAoB,iBAAN,GAAwB,OAAN,GAAc,EAAE,cAAgB,MAClE,CACA,MAAM,EAAS,CAAC,CACd,KAAM,SACN,KAAM,SAAU,GACd,MAAoB,iBAAN,CAChB,GACC,CACD,KAAM,SACN,KAAM,SAAU,GACd,MAAoB,iBAAN,CAChB,GACC,CACD,KAAM,UACN,KAAM,SAAU,GACd,MAAoB,kBAAN,CAChB,GACC,CACD,KAAM,WACN,KAAM,SAAU,GACd,MAAoB,mBAAN,CAChB,GACC,CACD,KAAM,QACN,KAAM,MAAM,SACX,CACD,KAAM,OACN,KAAM,SAAU,GACd,OAAO,aAAa,IACtB,GACC,CACD,KAAM,SACN,KAAM,SAAU,GACd,OAAO,aAAa,MACtB,GACC,CACD,KAAM,SACN,KAAM,GACL,CACD,KAAM,OACN,KAAM,SAAU,GACd,OAAa,OAAN,CACT,GACC,CACD,KAAM,YACN,KAAM,SAAU,GACd,gBAAO,CACT,IAEI,EAAU,CACd,KAAM,MACN,KAAM,GACN,UAQF,IAAI,EACA,EAGA,EAAe,EAIf,EAAQ,CACV,YAAa,GAUf,SAAS,EAAS,GAChB,MAAM,EAAO,EAAQ,IAAI,GACzB,GAAI,EACF,OAAO,EAGT,IAAI,EAAU,iBAAmB,EAAW,IAC5C,MAAM,EAAO,EAAS,cACtB,IAAI,EACJ,IAAK,KAAa,EAChB,GAAI,EAAU,gBAAkB,EAAM,CACpC,GAAW,mBAAqB,EAAY,MAC5C,KACF,CAEF,MAAM,IAAI,UAAU,EACtB,CAeA,SAAS,EAAS,GAChB,IAAI,EAAa,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,MACrF,MAAM,EAAc,EAAa,EAAS,GAAY,MAAQ,EAAS,OACjE,EAAW,GACjB,QAAS,EAAI,EAAG,EAAI,EAAM,SAAU,EAAG,CACrC,IAAK,EAAM,IAA+B,iBAAlB,EAAM,GAAG,MAA8C,mBAAlB,EAAM,GAAG,KACpE,MAAM,IAAI,UAAU,kEAEtB,MAAM,EAAW,EAAM,GAAG,KAC1B,GAAI,EAAQ,IAAI,GACd,MAAM,IAAI,UAAU,wBAA0B,EAAW,KAE3D,EAAS,KAAK,GACd,EAAQ,IAAI,EAAU,CACpB,KAAM,EACN,KAAM,EAAM,GAAG,KACf,MAAO,EAAM,GAAG,MAChB,MAAO,EAAc,EACrB,cAAe,IAEnB,CAEA,MAAM,EAAgB,EAAS,MAAM,GACrC,EAAW,EAAS,MAAM,EAAG,GAAa,OAAO,GAAU,OAAO,GAElE,QAAS,EAAI,EAAc,EAAS,OAAQ,EAAI,EAAS,SAAU,EACjE,EAAQ,IAAI,EAAS,IAAI,MAAQ,CAErC,CAQA,SAAS,IACP,EAAU,IAAI,IACd,EAAW,GACX,EAAe,EACf,EAAS,CAAC,MACZ,CAuBA,SAAS,EAAc,GACrB,MAAM,EAAU,EAAS,QAAO,IAC9B,MAAM,EAAO,EAAQ,IAAI,GACzB,OAAQ,EAAK,OAAS,EAAK,KAAK,EAAM,IAExC,OAAI,EAAQ,OACH,EAEF,CAAC,MACV,CAOA,SAAS,EAAgB,GACvB,OAAO,GAA4B,mBAAX,GAAyB,uBAAwB,CAC3E,CAoCA,SAAS,EAAc,EAAI,EAAW,GACpC,IAAK,EAAgB,GACnB,MAAM,IAAI,UAAU,IAItB,MAAM,EAAQ,GAAW,EAAQ,MAE3B,EAAS,EADS,MAAM,QAAQ,GAAa,EAAU,KAAK,KAAO,GAEnE,EAAqB,EAAgB,GAG3C,IAAK,GAAS,KAAsB,EAAG,WAAY,CAEjD,MAAM,EAAQ,EAAG,mBAAmB,aAAa,IAAI,GACrD,GAAI,EACF,OAAO,CAEX,CAMA,MAAM,EAAU,EAAO,OACvB,IAAI,EAiCA,EAhCJ,GAAI,EAAO,CAET,IAAI,EACJ,IAAK,KAFL,EAAsB,GAET,EAAG,WACd,EAAoB,KAAK,EAAG,mBAAmB,aAAa,IAAI,GAEpE,MACE,EAAsB,EAAG,mBAAmB,WAE9C,QAAS,EAAI,EAAG,EAAI,IAAW,EAAG,CAChC,MAAM,EAAO,EAAO,GACd,EAAqB,GAC3B,IAAI,EACJ,IAAK,KAAe,EAAqB,CACvC,MAAM,EAAO,EAAgB,EAAY,OAAQ,GACjD,GAAK,KAAQ,EAAK,WAAc,EAAK,WAArC,CAGA,IAAK,EAAK,OAAQ,CAEhB,MAAM,EAAY,EAAa,GAC/B,GAAI,EAAK,MAAM,MAAK,IAAU,EAAU,IAAI,EAAM,QAChD,QAEJ,CAEA,EAAmB,KAAK,EATxB,CAUF,CAEA,GADA,EAAsB,EACa,IAA/B,EAAoB,OAAc,KACxC,CAGA,IAAK,KAAa,EAChB,GAAI,EAAU,OAAO,QAAU,EAC7B,OAAO,EAGX,MAAM,IAAI,UAAU,oCAAsC,EAAG,MAAQ,WAAa,IAAM,EAAgB,EAAQ,MAAQ,KAC1H,CA+DA,SAAS,EAAgB,GACvB,IAAI,EAAY,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,IACpF,OAAO,EAAO,KAAI,GAAK,EAAE,OAAM,KAAK,EACtC,CAOA,SAAS,EAAW,GAClB,MAAM,EAAqC,IAAzB,EAAM,QAAQ,OAE1B,GADS,EAAoB,EAAM,OAAS,EAAI,EAAM,MAAM,GAAK,MAA5C,GACJ,MAAM,KAAK,KAAI,GAAK,EAAS,EAAE,UACtD,IAAI,KACA,EAAY,EAAY,MAAQ,GAapC,MAAO,CACL,MAbiB,EAAS,cAAc,GAGxC,OAFA,EAAS,EAAK,OAAS,EACvB,GAAa,EAAK,KAAO,IAClB,CACL,KAAM,EAAK,KACX,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,WAAY,KACZ,mBAEJ,IAGE,KAAM,EAAU,MAAM,MAEtB,SACA,iBACA,YAEJ,CAQA,SAAS,EAAY,GACnB,MACM,WAmgBsB,GAC5B,GAAyB,IAArB,EAAU,OACZ,MAAO,GAET,MAAM,EAAQ,EAAU,IAAI,GACxB,EAAU,OAAS,GACrB,EAAM,OAAM,EAAI,IAAO,EAAG,MAAQ,EAAG,QAEvC,IAAI,EAAU,EAAM,GAAG,cACvB,GAAyB,IAArB,EAAU,OACZ,OAAO,EAET,EAAU,EAAQ,OAAO,IAGzB,MAAM,EAAa,IAAI,IAAI,GAC3B,QAAS,EAAI,EAAG,EAAI,EAAM,SAAU,EAAG,CACrC,IAAI,EACJ,IAAK,KAAY,EAAM,GAAG,cACnB,EAAW,IAAI,EAAS,QAC3B,EAAQ,KAAK,GACb,EAAW,IAAI,EAAS,MAG9B,CACA,OAAO,CACT,CA7hBQ,CADY,EAAM,MAAM,KAAI,GAAK,EAAE,QAEzC,IAAI,EAAS,EAAM,OACf,EAAU,EAAM,KACpB,MAAM,EAAmB,EAAoB,cAAc,GACzD,MAAM,EAAO,EAAS,EAAW,MAGjC,OAFA,EAAS,EAAK,OAAS,EACvB,GAAW,IAAM,EAAW,KACrB,CACL,KAAM,EAAW,KACjB,UAAW,EAAK,MAChB,KAAM,EAAK,KACX,MAAO,EAAK,MACZ,aACA,gBAAiB,EAAW,MAEhC,IACA,MAAO,CACL,MAAO,EAAM,MAAM,OAAO,GAC1B,KAAM,EACN,SACA,cAAe,EAAiB,OAAS,EACzC,UAAW,EAAM,UAErB,CASA,SAAS,EAAa,GAKpB,OAJK,EAAM,UACT,EAAM,QAAU,IAAI,IACpB,EAAM,MAAM,SAAQ,GAAQ,EAAM,QAAQ,IAAI,EAAK,SAE9C,EAAM,OACf,CASA,SAAS,EAAe,GACtB,MAAM,EAAS,GACf,GAA4B,iBAAjB,EACT,MAAM,IAAI,UAAU,8BAEtB,MAAM,EAAY,EAAa,OAC/B,GAAkB,KAAd,EACF,OAAO,EAET,MAAM,EAAY,EAAU,MAAM,KAClC,QAAS,EAAI,EAAG,EAAI,EAAU,SAAU,EAAG,CACzC,MAAM,EAAc,EAAW,EAAU,GAAG,QAC5C,GAAI,EAAY,WAAa,IAAM,EAAU,OAAS,EACpD,MAAM,IAAI,YAAY,8BAAgC,EAAU,GAA1C,0CAGxB,GAAiC,IAA7B,EAAY,MAAM,OACpB,OAAO,KAET,EAAO,KAAK,EACd,CACA,OAAO,CACT,CAOA,SAAS,EAAa,GACpB,MAAM,EAAQ,EAAK,GACnB,QAAO,GAAQ,EAAM,SACvB,CAQA,SAAS,EAAY,GACnB,GAAK,GAAgC,IAAvB,EAAM,MAAM,OAGnB,IAA2B,IAAvB,EAAM,MAAM,OACrB,OAAO,EAAS,EAAM,MAAM,GAAG,MAAM,KAChC,GAA2B,IAAvB,EAAM,MAAM,OAAc,CACnC,MAAM,EAAQ,EAAS,EAAM,MAAM,GAAG,MAAM,KACtC,EAAQ,EAAS,EAAM,MAAM,GAAG,MAAM,KAC5C,OAAO,SAAY,GACjB,OAAO,EAAM,IAAM,EAAM,EAC3B,CACF,CAAO,CAEL,MAAM,EAAQ,EAAM,MAAM,cAAc,GACtC,OAAO,EAAS,EAAK,MAAM,IAC7B,IACA,OAAO,SAAY,GACjB,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAI,EAAM,GAAG,GACX,SAGJ,QACF,CACF,EAtBE,OAAO,EAuBX,CAOA,SAAS,EAAa,GACpB,IAAI,EAAO,EAAO,EAClB,GAAI,EAAa,GAAS,CAExB,EAAQ,EAAQ,GAAQ,IAAI,GAC5B,MAAM,EAAW,EAAM,OACjB,EAAW,EAAY,EAAK,IAC5B,EAAgB,SAAU,GAC9B,QAAS,EAAI,EAAU,EAAI,EAAK,OAAQ,IACtC,IAAK,EAAS,EAAK,IACjB,SAGJ,QACF,EACA,OAAO,SAAkB,GACvB,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,IAAK,EAAM,GAAG,EAAK,IACjB,SAGJ,OAAO,EAAc,IAAS,EAAK,QAAU,EAAW,CAC1D,CACF,CAEE,OAAsB,IAAlB,EAAO,OACF,SAAkB,GACvB,OAAuB,IAAhB,EAAK,MACd,EAC2B,IAAlB,EAAO,QAChB,EAAQ,EAAY,EAAO,IACpB,SAAkB,GACvB,OAAO,EAAM,EAAK,KAAuB,IAAhB,EAAK,MAChC,GAC2B,IAAlB,EAAO,QAChB,EAAQ,EAAY,EAAO,IAC3B,EAAQ,EAAY,EAAO,IACpB,SAAkB,GACvB,OAAO,EAAM,EAAK,KAAO,EAAM,EAAK,KAAuB,IAAhB,EAAK,MAClD,IAGA,EAAQ,EAAO,IAAI,GACZ,SAAkB,GACvB,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,IAAK,EAAM,GAAG,EAAK,IACjB,SAGJ,OAAO,EAAK,SAAW,EAAM,MAC/B,EAGN,CAUA,SAAS,EAAgB,EAAQ,GAC/B,OAAO,EAAQ,EAAO,OAAS,EAAO,GAAS,EAAa,GAAU,EAAK,GAAU,IACvF,CAQA,SAAS,EAAkB,EAAQ,GACjC,MAAM,EAAQ,EAAgB,EAAQ,GACtC,OAAK,EAGE,EAAa,GAFX,IAAI,GAGf,CAOA,SAAS,EAAY,GACnB,OAA2B,OAApB,EAAK,qBAAuB,EAAK,UAC1C,CASA,SAAS,EAAoB,EAAY,GACvC,MAAM,EAAU,IAAI,IAQpB,OAPA,EAAW,SAAQ,IACjB,MAAM,EAAW,EAAkB,EAAU,OAAQ,GACrD,IAAI,EACJ,IAAK,KAAQ,EACX,EAAQ,IAAI,EACd,IAEK,EAAQ,IAAI,OAAS,CAAC,OAAS,MAAM,KAAK,EACnD,CAUA,SAAS,EAAY,EAAM,EAAM,GAC/B,IAAI,EAAK,EACT,MAAM,EAAQ,GAAQ,UAGtB,IACI,EADA,EAAqB,EAEzB,IAAK,EAAQ,EAAG,EAAQ,EAAK,OAAQ,IAAS,CAC5C,MAAM,EAAmB,GAQzB,GAPA,EAAmB,SAAQ,IACzB,MACM,EAAO,EADC,EAAgB,EAAU,OAAQ,KAE3C,EAAQ,EAAU,OAAO,QAAU,EAAa,EAAU,UAAY,EAAK,EAAK,KACnF,EAAiB,KAAK,EACxB,IAE8B,IAA5B,EAAiB,QAGnB,GADA,EAAW,EAAoB,EAAoB,GAC/C,EAAS,OAAS,EAAG,CACvB,MAAM,EAAc,EAAc,EAAK,IASvC,OARA,EAAM,IAAI,UAAU,2CAA6C,EAAQ,eAAiB,EAAS,KAAK,QAAU,aAAe,EAAY,KAAK,OAAS,YAAc,EAAQ,KACjL,EAAI,KAAO,CACT,SAAU,YACV,GAAI,EACJ,QACA,OAAQ,EACR,YAEK,CACT,OAEA,EAAqB,CAEzB,CAGA,MAAM,EAAU,EAAmB,cAAc,GAC/C,OAAO,EAAa,EAAU,QAAU,IAAW,EAAU,OAAO,MACtE,IACA,GAAI,EAAK,OAAS,KAAK,IAAI,MAAM,KAAM,GASrC,OARA,EAAW,EAAoB,EAAoB,GACnD,EAAM,IAAI,UAAU,iCAAmC,EAAQ,eAAiB,EAAS,KAAK,QAAU,YAAc,EAAK,OAAS,KACpI,EAAI,KAAO,CACT,SAAU,aACV,GAAI,EACJ,MAAO,EAAK,OACZ,YAEK,EAIT,MAAM,EAAY,KAAK,IAAI,MAAM,KAAM,GACvC,GAAI,EAAK,OAAS,EAQhB,OAPA,EAAM,IAAI,UAAU,kCAAoC,EAAQ,eAAiB,EAAY,aAAe,EAAK,OAAS,KAC1H,EAAI,KAAO,CACT,SAAU,cACV,GAAI,EACJ,MAAO,EAAK,OACZ,eAAgB,GAEX,EAIT,MAAM,EAAW,GACjB,QAAS,EAAI,EAAG,EAAI,EAAK,SAAU,EACjC,EAAS,KAAK,EAAc,EAAK,IAAI,KAAK,MAO5C,OALA,EAAM,IAAI,UAAU,sBAAwB,EAAS,KAAK,MAAQ,4DAA8D,EAAQ,KACxI,EAAI,KAAO,CACT,SAAU,WACV,OAAQ,GAEH,CACT,CAOA,SAAS,EAAmB,GAC1B,IAAI,EAAM,EAAS,OAAS,EAC5B,QAAS,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IAClC,EAAY,EAAM,MAAM,MAC1B,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,YAGvC,OAAO,CACT,CAQA,SAAS,EAAyB,GAChC,IAAI,EAAM,EAAe,EACzB,QAAS,EAAI,EAAG,EAAI,EAAM,MAAM,OAAQ,IACjC,EAAY,EAAM,MAAM,MAC3B,EAAM,KAAK,IAAI,EAAK,EAAM,MAAM,GAAG,kBAGvC,OAAO,CACT,CAUA,SAAS,EAAc,EAAQ,GAG7B,GAAI,EAAO,QACT,IAAK,EAAO,OACV,OAAO,UAEA,EAAO,OAChB,SAIF,GAAI,EAAO,WACT,IAAK,EAAO,UACV,OAAO,UAEA,EAAO,UAChB,SAIF,GAAI,EAAO,eACT,IAAK,EAAO,cACV,OAAO,UAEA,EAAO,cAChB,SAIF,MAAM,EAAW,EAAmB,GAAU,EAAmB,GACjE,GAAI,EAAW,EACb,SAEF,GAAI,EAAW,EACb,OAAO,EAIT,MAAM,EAAW,EAAyB,GAAU,EAAyB,GAC7E,OAAI,EAAW,KAGX,EAAW,EACN,EAIF,CACT,CAUA,SAAS,EAAkB,EAAY,GACrC,MAAM,EAAQ,EAAW,OACnB,EAAQ,EAAW,OACnB,EAAQ,EAAK,GACb,EAAQ,EAAK,GACb,EAAW,EAAa,GACxB,EAAW,EAAa,GAG9B,GAAI,GAAY,EAAM,QACpB,IAAK,IAAa,EAAM,OACtB,OAAO,UAEA,GAAY,EAAM,OAC3B,SAIF,IAEI,EAFA,EAAO,EACP,EAAQ,EAEZ,IAAK,KAAO,EACN,EAAI,UAAU,EACd,EAAI,iBAAiB,EAE3B,IAAI,EAAO,EACP,EAAQ,EACZ,IAAK,KAAO,EACN,EAAI,UAAU,EACd,EAAI,iBAAiB,EAE3B,GAAI,IAAS,EACX,OAAO,EAAO,EAIhB,GAAI,GAAY,EAAM,eACpB,IAAK,IAAa,EAAM,cACtB,OAAO,UAEA,GAAY,EAAM,cAC3B,SAIF,GAAI,IAAU,EACZ,OAAO,EAAQ,EAIjB,GAAI,GACF,IAAK,EACH,OAAO,UAEA,EACT,SAIF,MAAM,GAAmB,EAAM,OAAS,EAAM,SAAW,KAAgB,GACzE,GAAwB,IAApB,EACF,OAAO,EAOT,MAAM,EAAc,GACpB,IAcI,EAdA,EAAK,EACT,QAAS,EAAI,EAAG,EAAI,EAAM,SAAU,EAAG,CACrC,MAAM,EAAiB,EAAc,EAAM,GAAI,EAAM,IACrD,EAAY,KAAK,GACjB,GAAM,CACR,CACA,GAAW,IAAP,EACF,OAAO,EAQT,IAAK,KAAK,EACR,GAAU,IAAN,EACF,OAAO,EAKX,OAAO,CACT,CA8CA,SAAS,EAAyB,EAAQ,GACxC,IAAI,EAAY,EAIhB,GAAI,EAAO,MAAK,GAAK,EAAE,gBAAgB,CACrC,MAAM,EAAY,EAAa,GACzB,EAAsB,EAAO,IAAI,GACvC,EAAY,WACV,MAAM,EAAO,GACP,EAAO,EAAY,UAAU,OAAS,EAAI,UAAU,OAC1D,QAAS,EAAI,EAAG,EAAI,EAAM,IACxB,EAAK,GAAK,EAAoB,GAAG,UAAU,IAK7C,OAHI,IACF,EAAK,GAAQ,UAAU,GAAM,IAAI,EAAoB,KAEhD,EAAG,MAAM,KAAM,EACxB,CACF,CACA,IAAI,EAAe,EACnB,GAAI,EAAa,GAAS,CACxB,MAAM,EAAS,EAAO,OAAS,EAC/B,EAAe,WACb,OAAO,EAAU,MAAM,KAAM,EAAM,UAAW,EAAG,GAAQ,OAAO,CAAC,EAAM,UAAW,KACpF,CACF,CACA,OAAO,CACT,CAQA,SAAS,EAAqB,GAC5B,IAAI,EAAO,EAAO,EAAa,EAC/B,MAAM,EAAQ,GACR,EAAc,GASpB,OARA,EAAM,MAAM,kBAAkB,GACxB,EAAK,aACP,EAAM,KAAK,EAAS,EAAK,WAAW,MAAM,MAC1C,EAAY,KAAK,EAAK,WAAW,SAErC,IAGQ,EAAY,QAClB,KAAK,EACH,OAAO,SAAoB,GACzB,OAAO,CACT,EACF,KAAK,EAGH,OAFA,EAAQ,EAAM,GACd,EAAc,EAAY,GACnB,SAAoB,GACzB,OAAI,EAAM,GACD,EAAY,GAEd,CACT,EACF,KAAK,EAKH,OAJA,EAAQ,EAAM,GACd,EAAQ,EAAM,GACd,EAAc,EAAY,GAC1B,EAAc,EAAY,GACnB,SAAoB,GACzB,OAAI,EAAM,GACD,EAAY,GAEjB,EAAM,GACD,EAAY,GAEd,CACT,EACF,QACE,OAAO,SAAoB,GACzB,QAAS,EAAI,EAAG,EAAI,EAAY,OAAQ,IACtC,GAAI,EAAM,GAAG,GACX,OAAO,EAAY,GAAG,GAG1B,OAAO,CACT,EAEN,CAmBA,SAAS,EAAY,GAyCnB,gBAxCS,EAAa,EAAQ,EAAO,GACnC,GAAI,EAAQ,EAAO,OAAQ,CACzB,MAAM,EAAQ,EAAO,GACrB,IAAI,EAAkB,GACtB,GAAI,EAAM,UAAW,CAGnB,MAAM,EAAa,EAAM,MAAM,OAAO,GAClC,EAAW,OAAS,EAAM,MAAM,QAClC,EAAgB,KAAK,CACnB,MAAO,EACP,KAAM,MAAQ,EAAW,KAAI,GAAK,EAAE,OAAM,KAAK,KAC/C,OAAQ,EAAW,MAAK,GAAK,EAAE,QAC/B,iBACA,eAGJ,EAAgB,KAAK,EACvB,MAEE,EAAkB,EAAM,MAAM,cAAc,GAC1C,MAAO,CACL,MAAO,CAAC,GACR,KAAM,EAAK,KACX,OAAQ,EAAK,MACb,cAAe,EAAK,WACpB,aAEJ,IAIF,OA4ZW,EA5ZI,EA4ZC,EA5ZgB,SAAU,GACxC,OAAO,EAAa,EAAQ,EAAQ,EAAG,EAAY,OAAO,CAAC,IAC7D,EA2ZG,MAAM,UAAU,OAAO,MAAM,GAAI,EAAI,IAAI,GA1Z9C,CAEE,MAAO,CAAC,GAuZd,IAAiB,EAAK,CArZpB,CACA,CAAoB,EAAQ,EAAG,GACjC,CAQA,SAAS,EAAY,EAAS,GAC5B,MAAM,EAAK,KAAK,IAAI,EAAQ,OAAQ,EAAQ,QAC5C,QAAS,EAAI,EAAG,EAAI,EAAI,IAAK,CAC3B,MAAM,EAAW,EAAkB,EAAS,GACtC,EAAW,EAAkB,EAAS,GAC5C,IACI,EADA,KAEJ,IAAK,KAAQ,EACX,GAAI,EAAS,IAAI,GAAO,CACtB,KACA,KACF,CAEF,IAAK,EACH,QAEJ,CACA,MAAM,EAAO,EAAQ,OACf,EAAO,EAAQ,OACf,EAAa,EAAa,GAC1B,EAAa,EAAa,GAChC,OAAO,EAAa,EAAa,IAAS,EAAO,GAAQ,EAAO,EAAa,GAAQ,EAAO,IAAS,CACvG,CAiCA,SAAS,EAAmB,EAAY,EAAc,GACpD,MAAM,EAAqB,GAC3B,IAAI,EACJ,IAAK,KAAa,EAAY,CAC5B,IAAI,EAAa,EAAa,GAC9B,GAA0B,iBAAf,EACT,MAAM,IAAI,UAAU,2CAA6C,EAAY,KAG/E,GADA,EAAa,EAAa,GACA,mBAAf,EACT,SAEF,EAAmB,KAAK,EAC1B,CACA,OAAO,CACT,CA+EA,SAAS,EAAoB,EAAM,GAEjC,GADA,EAAM,cACuC,IAAzC,OAAO,KAAK,GAAkB,OAChC,MAAM,IAAI,YAAY,0BAEpB,EAAM,oCA5BoB,GAI9B,MAAM,EAAsB,4BAC5B,OAAO,KAAK,GAAe,SAAQ,IACjC,MAAM,EAAK,EAAc,GACzB,GAAI,EAAoB,KAAK,EAAG,YAC9B,MAAM,IAAI,YAAY,mIACxB,GAEJ,CAiBY,CACe,GAIzB,MAAM,EAAe,GACf,EAAoB,GACpB,EAAgB,GAChB,EAAwB,GAC9B,IAAI,EACJ,IAAK,KAAa,EAAkB,CAElC,IAAK,OAAO,UAAU,eAAe,KAAK,EAAkB,GAC1D,SAGF,MAAM,EAAS,EAAe,GAC9B,IAAK,EAAQ,SAEb,EAAa,kBAAkB,GAC7B,GAAI,EAAY,EAAI,GAClB,MAAM,IAAI,UAAU,2BAA6B,EAAgB,GAAM,UAAY,EAAgB,GAAU,KAEjH,IACA,EAAa,KAAK,GAElB,MAAM,EAAgB,EAAkB,OACxC,EAAkB,KAAK,EAAiB,IACxC,MAAM,EAAmB,EAAO,IAAI,GAEpC,IAAI,EACJ,IAAK,KAAM,EAAY,GAAmB,CACxC,MAAM,EAAS,EAAgB,GAC/B,EAAsB,KAAK,CACzB,OAAQ,EACR,KAAM,EACN,GAAI,IAEF,EAAG,OAAM,IAAM,EAAE,kBACnB,EAAc,GAAU,EAE5B,CACF,CACA,EAAsB,KAAK,GAG3B,MAAM,EArHR,SAA2B,EAAc,EAAc,GACrD,MAAM,EAAqC,EAnDvB,KAAI,GAClB,EAAc,GACT,EAAY,EAAG,YAAY,UAEhC,EAAU,GACL,EAAY,EAAG,QAAQ,WAAY,EAAG,QAAQ,UAEhD,IA6CH,EAAa,IAAI,MAAM,EAAkB,QAAQ,SACvD,IAAI,KACJ,KAAO,GAAgB,CACrB,KACA,IAAI,KACJ,QAAS,EAAI,EAAG,EAAI,EAAkB,SAAU,EAAG,CACjD,GAAI,EAAW,GAAI,SACnB,MAAM,EAAK,EAAkB,GAC7B,GAAI,EAAc,GAChB,EAAkB,GAAK,EAAG,YAAY,SAAS,GAE/C,EAAkB,GAAG,YAAc,EAAG,YACtC,EAAW,MACX,aACS,EAAU,GAAK,CACxB,MAAM,EAAqB,EAAmB,EAAG,QAAQ,WAAY,EAAmB,GACpF,GACF,EAAkB,GAAK,EAAG,QAAQ,SAAS,MAAM,KAAM,GAEvD,EAAkB,GAAG,QAAU,EAAG,QAClC,EAAW,MACX,MAEA,IAEJ,CACF,CACA,GAAI,GAAmB,EACrB,MAAM,IAAI,YAAY,yDAE1B,CACA,OAAO,CACT,CAmF4B,CAAkB,EAAmB,EAAe,IAG9E,IAAI,EACJ,IAAK,KAAK,EACJ,OAAO,UAAU,eAAe,KAAK,EAAe,KACtD,EAAc,GAAK,EAAkB,EAAc,KAGvD,MAAM,EAAa,GACb,EAAuB,IAAI,IACjC,IAAK,KAAK,EAIH,EAAqB,IAAI,EAAE,QAC9B,EAAE,GAAK,EAAkB,EAAE,IAC3B,EAAW,KAAK,GAChB,EAAqB,IAAI,EAAE,KAAM,IAKrC,MAAM,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAM,EAAW,IAAM,EAAW,GAAG,OAAO,QAAU,IAAM,EAAa,EAAW,GAAG,QACvF,EAAQ,GAAO,GAAO,GAAO,GAAO,GAAO,EAGjD,QAAS,EAAI,EAAG,EAAI,EAAW,SAAU,EACvC,EAAW,GAAG,KAAO,EAAa,EAAW,GAAG,QAElD,MAAM,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GACtD,EAAS,EAAM,EAAY,EAAW,GAAG,OAAO,IAAM,GAG5D,QAAS,EAAI,EAAG,EAAI,EAAW,SAAU,EACvC,EAAW,GAAG,eAAiB,EAAyB,EAAW,GAAG,OAAQ,EAAW,GAAG,IAE9F,MAAM,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAM,EAAM,EAAW,GAAG,eAAiB,GAC3C,EAAO,EAAM,EAAW,GAAG,OAAO,UAClC,EAAO,EAAM,EAAW,GAAG,OAAO,UAClC,GAAO,EAAM,EAAW,GAAG,OAAO,UAClC,GAAO,EAAM,EAAW,GAAG,OAAO,UAClC,GAAO,EAAM,EAAW,GAAG,OAAO,UAClC,GAAO,EAAM,EAAW,GAAG,OAAO,UAGlC,GAAS,EAAQ,EAAI,EACrB,GAAO,EAAW,OAElB,GAAQ,EAAW,KAAI,GAAK,EAAE,OAC9B,GAAM,EAAW,KAAI,GAAK,EAAE,iBAC5B,GAAU,WAGd,QAAS,EAAI,GAAQ,EAAI,GAAM,IAC7B,GAAI,GAAM,GAAG,WACX,OAAO,GAAI,GAAG,MAAM,KAAM,WAG9B,OAAO,EAAM,WAAW,EAAM,UAAW,EAC3C,EAIA,SAAS,GAAW,EAAM,GAGxB,OAAI,UAAU,SAAW,GAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAErB,UAAU,SAAW,GAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAErB,UAAU,SAAW,IAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAErB,UAAU,SAAW,IAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAErB,UAAU,SAAW,IAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAErB,UAAU,SAAW,IAAQ,EAAO,IAAS,EAAO,GAC/C,EAAI,MAAM,KAAM,WAElB,GAAQ,MAAM,KAAM,UAC7B,CAGA,IACE,OAAO,eAAe,GAAY,OAAQ,CACxC,MAAO,GAEX,OAIA,CAaA,OARA,GAAW,WAAa,EAIxB,GAAW,mBAAqB,CAC9B,aACA,aAAc,GAET,EACT,CAQA,SAAS,EAAY,EAAM,EAAM,GAC/B,MAAM,EAAY,EAAM,EAAM,EAChC,CAOA,SAAS,EAAQ,GACf,OAAO,EAAM,EAAK,EAAG,EAAI,OAAS,EACpC,CAOA,SAAS,EAAK,GACZ,OAAO,EAAI,EAAI,OAAS,EAC1B,CASA,SAAS,EAAM,EAAK,EAAO,GACzB,OAAO,MAAM,UAAU,MAAM,KAAK,EAAK,EAAO,EAChD,CAgDA,SAAS,EAAY,EAAY,GAC/B,MAAO,CACL,QAAS,CACP,aACA,YAGN,CAQA,SAAS,EAAY,GACnB,GAAwB,mBAAb,EACT,MAAM,IAAI,UAAU,gDAEtB,MAAO,CACL,YAAa,CACX,YAGN,CASA,SAAS,EAAU,GACjB,OAAO,GAA4C,iBAAvB,EAAW,SAAwB,MAAM,QAAQ,EAAW,QAAQ,aAAsD,mBAAhC,EAAW,QAAQ,QAC3I,CASA,SAAS,EAAc,GACrB,OAAO,GAAgD,iBAA3B,EAAW,aAAuE,mBAApC,EAAW,YAAY,QACnG,CAUA,SAAS,EAAU,EAAW,GAC5B,IAAK,EACH,OAAO,EAET,GAAI,GAAW,IAAY,EAAW,CACpC,MAAM,EAAM,IAAI,MAAM,0CAA4C,EAAY,aAAe,EAAU,KAKvG,MAJA,EAAI,KAAO,CACT,OAAQ,EACR,SAAU,GAEN,CACR,CACA,OAAO,CACT,CAQA,SAAS,EAAc,GACrB,IAAI,EACJ,UAAW,KAAO,EAGZ,OAAO,UAAU,eAAe,KAAK,EAAK,KAAS,EAAgB,EAAI,KAAuC,iBAAvB,EAAI,GAAK,aAClG,EAAO,EAAU,EAAM,EAAI,GAAK,OAGpC,OAAO,CACT,CASA,SAAS,EAAgB,EAAM,GAC7B,IAAI,EACJ,IAAK,KAAO,EACV,GAAI,OAAO,UAAU,eAAe,KAAK,EAAQ,GAAM,CACrD,GAAI,KAAO,GACL,EAAO,KAAS,EAAK,GAAM,CAC7B,MAAM,EAAM,IAAI,MAAM,cAAgB,EAAM,sBAM5C,MALA,EAAI,KAAO,CACT,UAAW,EACX,eAAgB,EAAO,GACvB,aAAc,EAAK,IAEf,CACR,CAGF,EAAK,GAAO,EAAO,EACrB,CAEJ,CA/8CA,IACA,EAAS,GA+8CT,MAAM,EAAY,EAwGlB,SAAS,EAAoB,GAC3B,IAAK,GAAyC,iBAApB,EAAW,MAA8C,iBAAlB,EAAW,IAAiD,mBAAvB,EAAW,QAC/G,MAAM,IAAI,UAAU,iFAEtB,GAAI,EAAW,KAAO,EAAW,KAC/B,MAAM,IAAI,YAAY,sCAAwC,EAAW,KAAO,eAEpF,CA4FA,OAnLA,EAAQ,SAAU,GAChB,MAAM,EAA6B,iBAAd,EAErB,IAAI,EAAO,EAAQ,EAAY,GAC/B,MAAM,EAAgB,GACtB,QAAS,EAHK,EAAQ,EAAI,EAGN,EAAI,UAAU,SAAU,EAAG,CAC7C,MAAM,EAAO,UAAU,GACvB,IACI,EADA,EAAkB,GAkBtB,GAhBoB,mBAAT,GACT,EAAW,EAAK,KACc,iBAAnB,EAAK,UAEd,EAAgB,EAAK,WAAa,EACzB,EAAgB,KAEzB,EAAkB,EAAK,aAEhB,EAAc,KAEvB,EAAkB,EACb,IACH,EAAW,EAAc,KAGe,IAAxC,OAAO,KAAK,GAAiB,OAAc,CAC7C,MAAM,EAAM,IAAI,UAAU,gCAAoC,EAApC,8FAK1B,MAJA,EAAI,KAAO,CACT,MAAO,EACP,SAAU,GAEN,CACR,CACK,IACH,EAAO,EAAU,EAAM,IAEzB,EAAgB,EAAe,EACjC,CACA,OAAO,EAAoB,GAAQ,GAAI,EACzC,EACA,EAAM,OAAS,EACf,EAAM,YAAc,EAAU,YAC9B,EAAM,WAAa,EACnB,EAAM,mBAAqB,EAC3B,EAAM,YAAc,EACpB,EAAM,MAAQ,EACd,EAAM,iBAhhDN,WACE,IAAI,EACJ,IAAK,KAAY,EACf,EAAQ,IAAI,GAAU,cAAgB,GAExC,EAAe,CACjB,EA2gDA,EAAM,SAAW,EACjB,EAAM,UAAY,EAClB,EAAM,QArMN,WACE,MAAM,EAAa,EAAQ,WAAW,KAAI,GAAK,EAAgB,EAAe,MACxE,EAAW,EAAK,WACtB,GAAwB,mBAAb,EACT,MAAM,IAAI,UAAU,+CAEtB,OAAO,EAAY,EAAY,EACjC,EA+LA,EAAM,YAAc,EACpB,EAAM,QA12CN,SAAiB,EAAO,GAEtB,MAAM,EAAO,EAAS,GACtB,GAAI,EAAK,KAAK,GACZ,OAAO,EAET,MAAM,EAAc,EAAK,cACzB,GAA2B,IAAvB,EAAY,OACd,MAAM,IAAI,MAAM,+BAAiC,EAAW,aAE9D,QAAS,EAAI,EAAG,EAAI,EAAY,OAAQ,IAEtC,GADiB,EAAS,EAAY,GAAG,MAC5B,KAAK,GAChB,OAAO,EAAY,GAAG,QAAQ,GAGlC,MAAM,IAAI,MAAM,kBAAoB,EAAQ,OAAS,EACvD,EA01CA,EAAM,cAAgB,EACtB,EAAM,KAt3CN,SAAc,EAAI,EAAW,GAC3B,OAAO,EAAc,EAAI,EAAW,GAAS,cAC/C,EAq3CA,EAAM,gBAAkB,EACxB,EAAM,6BAUN,EAAM,QAAU,SAAU,EAAM,GAC9B,IAAI,EAAS,WACT,GAA8B,EAAQ,IAAI,YAC5C,EAAS,UAEX,EAAM,SAAS,CAAC,GAAO,EACzB,EA0BA,EAAM,cAAgB,SAAU,GAC9B,IAAI,EAAU,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,CAChF,aAEF,EAAoB,GACpB,MAAM,EAAK,EAAS,EAAW,IACzB,EAAW,EAAG,cAAc,MAAK,GAAS,EAAM,OAAS,EAAW,OAC1E,GAAI,EAAU,CACZ,IAAI,IAAW,EAAQ,SAOrB,MAAM,IAAI,MAAM,uCAAyC,EAAW,KAAO,SAAW,EAAG,KAAO,KANhG,EAAM,iBAAiB,CACrB,KAAM,EAAS,KACf,GAAI,EAAW,GACf,QAAS,EAAS,SAKxB,CACA,EAAG,cAAc,KAAK,CACpB,KAAM,EAAW,KACjB,QAAS,EAAW,QACpB,MAAO,KAEX,EAUA,EAAM,eAAiB,SAAU,EAAa,GAC5C,EAAY,SAAQ,GAAc,EAAM,cAAc,EAAY,IACpE,EAWA,EAAM,iBAAmB,SAAU,GACjC,EAAoB,GACpB,MAAM,EAAK,EAAS,EAAW,IACzB,WArUa,EAAK,GACxB,QAAS,EAAI,EAAG,EAAI,EAAI,OAAQ,IAC9B,GAAI,EAAK,EAAI,IACX,OAAO,EAAI,EAIjB,CA8TQ,CAAiC,EAAG,eAAe,GAAK,EAAE,OAAS,EAAW,OACpF,IAAK,EACH,MAAM,IAAI,MAAM,iDAAmD,EAAW,KAAO,OAAS,EAAW,IAE3G,GAAI,EAAmB,UAAY,EAAW,QAC5C,MAAM,IAAI,MAAM,2DAElB,MAAM,EAAQ,EAAG,cAAc,QAAQ,GACvC,EAAG,cAAc,OAAO,EAAO,EACjC,EAYA,EAAM,QAAU,SAAU,EAAI,GAC5B,IAAK,EAAgB,GACnB,MAAM,IAAI,UAAU,IAEtB,MAAM,EAAO,EAAG,mBAAmB,WACnC,QAAS,EAAI,EAAG,EAAI,EAAK,SAAU,EACjC,GAAI,EAAK,GAAG,KAAK,GACf,OAAO,EAAK,GAGhB,OAAO,IACT,EACO,CACT,CACA,GCp1DO,SAAS,GAAQ,EAAM,EAAc,EAAQ,GAClD,SAAS,EAAgB,GAIvB,IAAI,WJsUoB,EAAQ,GAElC,QADI,EAAO,GACF,EAAI,EAAG,EAAI,EAAW,OAAQ,IAAK,CAC1C,IAAI,EAAM,EAAW,GACjB,EAAQ,EAAO,QACf,QACF,EAAK,GAAO,EAEhB,CACA,OAAO,CACT,CIhVQ,CAAmB,EAAO,EAAa,IAAI,KAE/C,gBA6E+B,EAAM,EAAc,GAGrD,IAFiB,EAAa,QAAO,aASF,EATsC,IAUlC,MAAlB,EAAW,IAVK,IASF,CATsC,IACxE,OAAM,YAAc,EAAM,KACV,CACf,IAAI,EAAsB,EAAa,QAAO,YAAc,EAAM,KAGlE,MAAM,IAAI,MAAM,2BAA4B,OAAO,EAAM,OAAU,kCAAkC,OAAO,EAAoB,KAAI,GAAK,IAAK,OAAO,EAAG,OAAO,KAAK,MAAO,KAC7K,CACF,CAtFI,CADmB,EAAM,EAAc,GAChC,EAAO,EAChB,CAOA,OANA,EAAgB,aAChB,EAAgB,GAAK,EACrB,EAAgB,aAAe,EAAa,QAAQ,OAChD,IACF,EAAgB,KAAO,GAElB,CACT,CAiFO,SAAS,GAAsB,GACpC,OAAO,GAAgC,MAAlB,EAAW,GAAa,EAAW,MAAM,GAAK,CACrE,CCrHO,SAAS,GAAU,GACxB,MAAqB,kBAAV,KAGJ,SAAS,IAAS,IAAU,KAAK,MAAM,EAChD,CAqHA,SAAS,GAAmB,EAAG,EAAM,GACnC,IAKI,EALW,CACb,EAAG,KACH,EAAG,KACH,GAAI,MAEgB,GAClB,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAM,IAAI,MAAM,kCAElB,IAAK,GAAU,GACb,MAAM,IAAI,MAAM,2BAElB,GAAI,EAAI,IAAM,EAAO,GAAK,GAAK,IAAM,IAAM,EAAO,IAChD,MAAM,IAAI,MAAM,8BAA8B,OAAO,EAAO,EAAG,QAAQ,OAAO,EAAO,EAAG,QAE1F,IAAK,GAAU,GACb,MAAM,IAAI,MAAM,4BAEd,EAAI,IACN,GAAQ,GAAK,GAEf,EAAS,IAAI,OAAO,EACtB,CACA,IAAI,EAAO,GAKX,OAJI,EAAI,IACN,GAAK,EACL,EAAO,KAEF,GAAG,OAAO,GAAM,OAAO,GAAQ,OAAO,EAAE,SAAS,IAAO,OAAO,EACxE,CAsFO,SAAS,GAAO,EAAO,GAC5B,GAAuB,mBAAZ,EAET,OAAO,EAAQ,GAIjB,GAAI,IAAU,IACZ,MAAO,WACF,GAAI,SACT,MAAO,YACF,GAAI,MAAM,GACf,MAAO,MAET,IAAI,SACF,EAAQ,UACR,EAAS,SACT,GACE,GAAuB,GAG3B,OAAQ,GACN,IAAK,QACH,gBA6JkB,EAAO,GAC7B,GAAI,MAAM,KAAW,SAAS,GAC5B,OAAO,OAAO,GAEhB,IAAI,EAAa,GAAY,GACzB,EAA+B,iBAAd,EAAyB,GAAY,EAAY,EAAW,SAAW,EAAI,GAAa,EACzG,EAAI,EAAQ,aACZ,EAAI,EAAQ,SAAW,EAGvB,EAAK,GAAK,GAAa,GACvB,SAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAK,EAAE,UAIxB,EAAI,IACN,EAAI,GAAW,EAAJ,GAAO,OAAO,GACzB,EAAI,GAIF,EAAI,EAAE,QACR,EAAE,OAAO,EAAG,EAAS,IAAN,EAAU,KAAO,KAE3B,EAAQ,KAAO,EAAE,KAAK,GAC/B,CAvLM,CAAe,EAAO,GACxB,IAAK,cACH,OAAO,GAAc,EAAO,GAC9B,IAAK,cACH,gBAwGwB,EAAO,GACnC,GAAI,MAAM,KAAW,SAAS,GAC5B,OAAO,OAAO,GAEhB,IACI,EAAU,GADF,GAAY,GACS,GAC7B,EAAI,EAAQ,SACZ,EAAI,EAAQ,aAGZ,EAAS,EAAI,GAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAC/D,GAAI,GAAS,GAEX,KAAO,EAAY,EAAE,QAAU,EAAI,EAAS,EAAI,EAAE,QAChD,EAAE,KAAK,QAMT,QADI,EAAe,KAAK,IAAI,EAAI,IAAW,EAAE,OAAS,GAC7C,EAAI,EAAG,EAAI,EAAc,IAChC,EAAE,KAAK,GASX,QAJI,EAAU,KAAK,IAAI,EAAI,GACvB,EAAa,EAGV,EAAU,GACf,IACA,IAKF,IAAI,EAAW,EAAE,MAAM,GAAY,KAAK,IACpC,EAAa,GAAS,IAAc,EAAS,QAAU,EAAS,MAAM,SAAW,IAAM,EAAW,GAClG,EAAM,EAAE,MAAM,EAAG,GAAY,KAAK,IAAM,EAAa,KAAO,GAAK,EAAI,IAAM,IAAM,EAAO,WAC5F,OAAO,EAAQ,KAAO,CACxB,CAjJM,CAAqB,EAAO,GAC9B,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,GACtC,IAAK,MACH,OAAO,GAAmB,EAAO,EAAG,GACtC,IAAK,MACH,OAAO,GAAmB,EAAO,GAAI,GACvC,IAAK,OAEH,gBAkNsB,EAAO,EAAW,GAC5C,GAAI,MAAM,KAAW,SAAS,GAC5B,OAAO,OAAO,GAIhB,IAAI,EAAW,GAAqE,GAAQ,aACxF,EAAW,GAAqE,GAAQ,SAAU,GAClG,EAAQ,GAAY,GACpB,EAAU,EAAY,GAAY,EAAO,GAAa,EAC1D,GAAI,EAAQ,SAAW,GAAY,EAAQ,UAAY,EAErD,OAAO,GAAc,EAAO,GAE5B,IAAI,EAAI,EAAQ,aACZ,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,UAKnC,EAAI,EAAE,OAAO,GAAM,EAAI,EAAE,OAAS,GAAK,EAAE,OAAS,EAAY,EAAY,EAAE,OAAS,KAIrF,IAAI,EAAM,EAAI,EAAI,EAAI,EAItB,OAHI,GAFJ,EAAI,IAAO,GAAG,OAAO,IAET,OAAS,GACnB,EAAE,OAAO,EAAM,EAAG,EAAG,KAEhB,EAAQ,KAAO,EAAE,KAAK,GAEjC,CApPM,CAAmB,EAAO,EAAW,GAAS,QAAQ,kCACpD,IAAI,EAAS,UAAU,GACnB,EAAI,UAAU,GAClB,MAAkB,MAAX,EAAiB,EAAS,EAAI,CACvC,IACF,QACE,MAAM,IAAI,MAAM,qBAAuB,EAAvB,oEAEtB,CAUO,SAAS,GAAuB,GAErC,IACI,EACA,EAFA,EAAW,OAGf,YAAI,EACF,GAAI,GAAS,GACX,EAAY,UACH,GAAY,GACrB,EAAY,EAAQ,eACf,KAAI,GAAS,GAelB,MAAM,IAAI,MAAM,+EAdZ,EAAQ,YACV,EAAY,GAAiB,EAAQ,gBACnC,MAAM,IAAI,MAAM,mDAAmD,cAGnE,EAAQ,WACV,EAAW,GAAiB,EAAQ,eAClC,MAAM,IAAI,MAAM,kDAAkD,KAGlE,EAAQ,WACV,EAAW,EAAQ,SAIvB,CAEF,MAAO,CACL,WACA,YACA,WAEJ,CAQO,SAAS,GAAY,GAE1B,IAAI,EAAQ,OAAO,GAAO,cAAc,MAAM,mCAC9C,IAAK,EACH,MAAM,IAAI,YAAY,kBAAoB,GAE5C,IAAI,EAAO,EAAM,GACb,EAAS,EAAM,GACf,EAAW,WAAW,EAAM,IAAM,KAClC,EAAM,EAAO,QAAQ,KACzB,QAAY,EAAa,EAAM,EAAI,EAAO,OAAS,EACnD,IAAI,EAAe,EAAO,QAAQ,IAAK,IACtC,QAAQ,gBAAiB,GAGxB,OADA,GAAY,EAAM,OACX,EACT,IAAG,QAAQ,MAAO,IACjB,MAAM,IAAI,cAAc,GACvB,OAAO,SAAS,EAClB,IAKA,OAJ4B,IAAxB,EAAa,SACf,EAAa,KAAK,GAClB,KAEK,CACL,OACA,eACA,WAEJ,CA2FO,SAAS,GAAc,EAAO,GACnC,GAAI,MAAM,KAAW,SAAS,GAC5B,OAAO,OAAO,GAIhB,IAAI,EAAQ,GAAY,GACpB,EAAU,EAAY,GAAY,EAAO,GAAa,EACtD,EAAI,EAAQ,aACZ,EAAI,EAAQ,SAGZ,EAAE,OAAS,IACb,EAAI,EAAE,OAAO,GAAM,EAAY,EAAE,UAInC,IAAI,EAAQ,EAAE,QACd,OAAO,EAAQ,KAAO,GAAS,EAAE,OAAS,EAAI,IAAM,EAAE,KAAK,IAAM,IAAM,KAAO,GAAK,EAAI,IAAM,IAAM,CACrG,CAwDO,SAAS,GAAY,EAAO,GAUjC,QARI,EAAU,CACZ,KAAM,EAAM,KACZ,aAAc,EAAM,aACpB,SAAU,EAAM,UAEd,EAAI,EAAQ,aAGT,GAAa,GAClB,EAAE,QAAQ,GACV,EAAQ,WACR,IAEF,GAAI,EAAE,OAAS,GACC,EAAE,OAAO,EAAW,EAAE,OAAS,GACjC,IAAM,EAAG,CACnB,IAAI,EAAI,EAAY,EAEpB,IADA,EAAE,KACc,KAAT,EAAE,IACP,EAAE,MACQ,IAAN,IACF,EAAE,QAAQ,GACV,EAAQ,WACR,KAGF,IADA,IAGJ,CAEF,OAAO,CACT,CAOA,SAAS,GAAM,GAEb,QADI,EAAM,GACD,EAAI,EAAG,EAAI,EAAQ,IAC1B,EAAI,KAAK,GAEX,OAAO,CACT,CAoCO,SAAS,GAAY,EAAG,GAC7B,IAAI,EAAS,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,KAC7E,EAAS,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EACjF,GAAI,GAAU,EACZ,MAAM,IAAI,MAAM,6CAElB,GAAI,EAAS,EACX,MAAM,IAAI,MAAM,yCAIlB,OAAI,MAAM,KAAM,MAAM,KAGjB,SAAS,IAAO,SAAS,GAG1B,IAAM,GAKH,KAAK,IAAI,EAAI,IAAM,KAAK,IAAI,EAAS,KAAK,IAAI,KAAK,IAAI,GAAI,KAAK,IAAI,IAAK,GAPvE,IAAM,EAQjB,CA8DA,SAAS,GAAiB,EAAO,GAC/B,OAAI,GAAS,GACJ,EACE,GAAY,GACd,EAAM,gBAEb,GAEJ,CACA,SAAS,GAAmB,EAAO,GACjC,OAAI,GAAS,GACJ,EACE,GAAY,GACd,EAAM,WAEN,CAEX,CCzqBA,IAAI,GAAgB,WAIlB,OADA,GAAgB,GAAc,OACvB,EACT,EAQW,GAA6B,GAAQ,QAP7B,CAAC,aAAc,WAAY,eAAgB,uBAO8B,GAC1F,IAAI,UACF,EAAS,QACT,EAAO,YACP,EAAW,SACX,GACE,EAIA,EAAQ,KAsXZ,OAjXA,EAAM,QACN,EAAM,SAAS,CAAC,CACd,KAAM,SACN,KAAM,IACL,CACD,KAAM,UACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,SACN,KAAM,IACL,CACD,KAAM,WACN,KAAM,IACL,CACD,KAAM,OACN,KAAM,IAOR,CACE,KAAM,aACN,KAAM,GAAK,IAAY,ypgBAAypgB,KAAK,IACprgB,CACD,KAAM,SACN,KAAM,IACL,CACD,KAAM,QACN,KAAM,IACL,CACD,KAAM,QACN,KAAM,IACL,CACD,KAAM,SACN,KAAM,IACL,CACD,KAAM,cACN,KAAM,IACL,CACD,KAAM,eACN,KAAM,IACL,CACD,KAAM,QACN,KAAM,IACL,CACD,KAAM,QACN,KAAM,IACL,CACD,KAAM,UACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,OACN,KAAM,IACL,CACD,KAAM,WACN,KAAM,IACL,CACD,KAAM,OACN,KAAM,IACL,CACD,KAAM,SACN,KAAM,IACL,CACD,KAAM,OACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,eACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,iBACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,kBACN,KAAM,IACL,CACD,KAAM,eACN,KAAM,IACL,CACD,KAAM,eACN,KAAM,IACL,CACD,KAAM,yBACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,OACN,KAAM,IACL,CACD,KAAM,aACN,KAAM,IACL,CACD,KAAM,eACN,KAAM,IACL,CACD,KAAM,kBACN,KAAM,IACL,CACD,KAAM,YACN,KAAM,IACL,CACD,KAAM,iBACN,KAAM,IACL,CACD,KAAM,aACN,KAAM,IACL,CACD,KAAM,MACN,KAAM,IACL,CACD,KAAM,SACN,KAAM,MAGR,EAAM,eAAe,CAAC,CACpB,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,GAMxB,GALK,GACH,GAAiB,GAIR,EDoYF,gBAAgB,QAAQ,OAAQ,IAC5C,QAAQ,aAAc,IACtB,OCtYmB,GACd,MAAM,IAAI,UAAU,uFAA8F,EAA9F,yDAEtB,OAAO,IAAI,EAAU,EACvB,GACC,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAe,GAEV,IAAI,EAAQ,EAAG,EACxB,GACC,CACD,KAAM,YACN,GAAI,UACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAe,GAEV,IAAI,EAAQ,EAAE,WAAY,EACnC,GACC,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,GACxB,GAAI,EAAI,OAAO,iBACb,MAAM,IAAI,UAAU,gGAAuG,EAAI,KAEjI,OAAO,OAAO,EAChB,GACC,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAiB,GAEZ,IAAI,EAAU,EAAE,WACzB,GACC,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAgB,GAEX,IAAI,EAAS,EACtB,GACC,CACD,KAAM,WACN,GAAI,YACJ,QAAS,SAAiB,GACxB,MAAM,IAAI,UAAU,4JACtB,GACC,CACD,KAAM,WACN,GAAI,UACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAe,GAEV,IAAI,EAAQ,EAAE,UAAW,EAClC,GACC,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,GACnB,GACH,GAAgB,GAElB,IAAI,EAAI,IAAI,EAAS,GACrB,GAAI,EAAE,YAAc,EAClB,MAAM,IAAI,UAAU,mGAA0G,EAA1G,uDAEtB,OAAO,CACT,GACC,CAQD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,GACxB,IAAI,EAAI,OAAO,GACf,GAAI,MAAM,GACR,MAAM,IAAI,MAAM,mBAAqB,EAAI,iBAE3C,OAAO,CACT,GACC,CACD,KAAM,SACN,GAAI,YACJ,QAAS,SAAiB,GACnB,GACH,GAAiB,GAEnB,IACE,OAAO,IAAI,EAAU,EACvB,OACE,MAAM,IAAI,MAAM,mBAAqB,EAAI,iBAC3C,CACF,GACC,CACD,KAAM,SACN,GAAI,SACJ,QAAS,SAAiB,GACxB,IACE,OAAO,OAAO,EAChB,OACE,MAAM,IAAI,MAAM,mBAAqB,EAAI,cAC3C,CACF,GACC,CACD,KAAM,SACN,GAAI,WACJ,QAAS,SAAiB,GACnB,GACH,GAAgB,GAElB,IACE,OAAO,IAAI,EAAS,EACtB,OACE,MAAM,IAAI,MAAM,mBAAqB,EAAI,gBAC3C,CACF,GACC,CACD,KAAM,SACN,GAAI,UACJ,QAAS,SAAiB,GACnB,GACH,GAAe,GAEjB,IACE,OAAO,IAAI,EAAQ,EACrB,OACE,MAAM,IAAI,MAAM,mBAAqB,EAAI,eAC3C,CACF,GACC,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,GACxB,OAAQ,CACV,GACC,CACD,KAAM,UACN,GAAI,YACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAiB,GAEZ,IAAI,GAAW,EACxB,GACC,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,GACxB,OAAO,QAAQ,EACjB,GACC,CACD,KAAM,UACN,GAAI,WACJ,QAAS,SAAiB,GAIxB,OAHK,GACH,GAAgB,GAEX,IAAI,GAAU,EACvB,GACC,CACD,KAAM,UACN,GAAI,SACJ,QAAS,SAAiB,GACxB,OAAO,OAAO,EAChB,GACC,CACD,KAAM,QACN,GAAI,SACJ,QAAS,SAAiB,GAIxB,OAHK,cAqDT,MAAM,IAAI,MAAM,sEAClB,CAtDW,GAGE,IAAI,EAAY,EACzB,GACC,CACD,KAAM,SACN,GAAI,QACJ,QAAS,SAAiB,GACxB,OAAO,EAAO,SAChB,KAOF,EAAM,WAAa,CAAC,EAAM,EAAM,KAC9B,IAAI,EAAa,EAAM,YAAY,EAAM,EAAM,GAC/C,GAAI,CAAC,YAAa,YAAY,SAAS,EAAW,KAAK,WAA6B,IAAhB,EAAK,QAAgB,GAAa,EAAK,KAE3G,EAAW,MAAK,IAAQ,EAAI,OAAO,SAAS,OAAO,CACjD,IAAI,EAAM,IAAI,UAAU,aAAa,OAAO,EAAM,4CAA8C,4CAA4C,OAAO,EAAM,QAEzJ,MADA,EAAI,KAAO,EAAW,KAChB,CACR,CACA,MAAM,GAOR,EAAM,WAAa,CAAC,EAAM,EAAM,KAC9B,IAAI,EAAa,EAAM,YAAY,EAAM,EAAM,GAC/C,GAAI,CAAC,YAAa,YAAY,SAAS,EAAW,KAAK,WAA6B,IAAhB,EAAK,QAAgB,GAAa,EAAK,KAE3G,EAAW,MAAK,IAAQ,EAAI,OAAO,SAAS,OAAO,CACjD,IAAI,EAAM,IAAI,UAAU,aAAa,OAAO,EAAM,4CAA8C,4CAA4C,OAAO,EAAM,QAEzJ,MADA,EAAI,KAAO,EAAW,KAChB,CACR,CACA,MAAM,GAED,CACT,IACA,SAAS,GAAiB,GACxB,MAAM,IAAI,MAAM,wBAAwB,OAAO,EAAG,oDACpD,CACA,SAAS,GAAe,GACtB,MAAM,IAAI,MAAM,wBAAwB,OAAO,EAAG,uDACpD,CAIA,SAAS,GAAgB,GACvB,MAAM,IAAI,MAAM,wBAAwB,OAAO,EAAG,mDACpD,CCxbA,IAkFE,GAAS,GAlFP,GAAY,KAId,GAAa,IAGb,GAAW,mBAGX,GAAO,qgCAGP,GAAK,qgCAIL,GAAW,CAOT,UAAW,GAiBX,SAAU,EAeV,OAAQ,EAIR,YAIA,SAAW,GAIX,MAAO,GAIP,KAAM,GAGN,WAQF,MAEA,GAAe,kBACf,GAAkB,GAAe,qBACjC,GAAyB,GAAe,2BACxC,GAAoB,GAAe,qBACnC,GAAM,mBAEN,GAAY,KAAK,MACjB,GAAU,KAAK,IAEf,GAAW,6CACX,GAAQ,yDACR,GAAU,gDACV,GAAY,qCAEZ,GAAO,IAIP,GAAiB,GAAK,OAAS,EAC/B,GAAe,GAAG,OAAS,EAG3B,EAAI,CAAE,YAAa,IAy1ErB,SAAS,GAAe,GACtB,IAAI,EAAG,EAAG,EACR,EAAkB,EAAE,OAAS,EAC7B,EAAM,GACN,EAAI,EAAE,GAER,GAAI,EAAkB,EAAG,CAEvB,IADA,GAAO,EACF,EAAI,EAAG,EAAI,EAAiB,KAE/B,EA12EO,GAy2EP,EAAK,EAAE,GAAK,IACM,UACX,GAAO,GAAc,IAC5B,GAAO,GAKT,EAj3ES,GAg3ET,GADA,EAAI,EAAE,IACG,IACS,UACX,GAAO,GAAc,GAC9B,SAAiB,IAAN,EACT,MAAO,IAIT,KAAO,EAAI,IAAO,GAAI,GAAK,GAE3B,OAAO,EAAM,CACf,CAGA,SAAS,GAAW,EAAG,EAAK,GAC1B,GAAI,MAAQ,GAAK,EAAI,GAAO,EAAI,EAC9B,MAAM,MAAM,GAAkB,EAElC,CAQA,SAAS,GAAoB,EAAG,EAAG,EAAI,GACrC,IAAI,EAAI,EAAG,EAAG,EAGd,IAAK,EAAI,EAAE,GAAI,GAAK,GAAI,GAAK,KAAM,EAwCnC,QArCM,EAAI,GACR,GAl5ES,EAm5ET,EAAK,IAEL,EAAK,KAAK,MAAM,EAAI,GAr5EX,GAs5ET,GAt5ES,GA45EX,EAAI,GAAQ,GA55ED,EA45EgB,GAC3B,EAAK,EAAE,GAAM,EAAI,EAEA,MAAb,EACE,EAAI,GACG,GAAL,EAAQ,EAAK,EAAK,IAAM,EACd,GAAL,IAAQ,EAAK,EAAK,GAAK,GAChC,EAAI,EAAK,GAAW,OAAN,GAAe,EAAK,GAAW,OAAN,GAAqB,KAAN,GAAqB,GAAN,GAErE,GAAK,EAAK,GAAK,EAAK,GAAK,GAAK,EAAK,GAAK,EAAK,GAAK,EAAI,KACnD,EAAE,EAAK,GAAK,EAAI,IAAM,IAAM,GAAQ,GAAI,EAAI,GAAK,IAC/C,GAAM,EAAI,GAAW,GAAN,MAAa,EAAE,EAAK,GAAK,EAAI,IAAM,GAGrD,EAAI,GACG,GAAL,EAAQ,EAAK,EAAK,IAAO,EACf,GAAL,EAAQ,EAAK,EAAK,IAAM,EACnB,GAAL,IAAQ,EAAK,EAAK,GAAK,GAChC,GAAK,GAAa,EAAK,IAAY,MAAN,IAAe,GAAa,EAAK,GAAW,MAAN,GAEnE,IAAM,GAAa,EAAK,IAAM,EAAK,GAAK,IACtC,GAAa,EAAK,GAAM,EAAK,GAAK,EAAI,KACrC,EAAE,EAAK,GAAK,EAAI,IAAO,IAAM,GAAQ,GAAI,EAAI,GAAK,EAIlD,CACT,CAMA,SAAS,GAAY,EAAK,EAAQ,GAOhC,QANI,EAEF,EADA,EAAM,CAAC,GAEP,EAAI,EACJ,EAAO,EAAI,OAEN,EAAI,GAAO,CAChB,IAAK,EAAO,EAAI,OAAQ,KAAS,EAAI,IAAS,EAE9C,IADA,EAAI,IAAM,GAAS,QAAQ,EAAI,OAAO,MACjC,EAAI,EAAG,EAAI,EAAI,OAAQ,IACtB,EAAI,GAAK,EAAU,SACT,IAAR,EAAI,EAAI,KAAe,EAAI,EAAI,GAAK,GACxC,EAAI,EAAI,IAAM,EAAI,GAAK,EAAU,EACjC,EAAI,IAAM,EAGhB,CAEA,OAAO,EAAI,SACb,CAh4EA,EAAE,cAAgB,EAAE,IAAM,WACxB,IAAI,EAAI,IAAI,KAAK,YAAY,MAE7B,OADI,EAAE,EAAI,IAAG,EAAE,EAAI,GACZ,GAAS,EAClB,EAQA,EAAE,KAAO,WACP,OAAO,GAAS,IAAI,KAAK,YAAY,MAAO,KAAK,EAAI,EAAG,EAC1D,EAWA,EAAE,UAAY,EAAE,MAAQ,SAAU,EAAK,GACrC,IACE,EAAI,KACJ,EAAO,EAAE,YAGX,GAFA,EAAM,IAAI,EAAK,GACf,EAAM,IAAI,EAAK,IACV,EAAI,IAAM,EAAI,EAAG,OAAO,IAAI,EAAK,KACtC,GAAI,EAAI,GAAG,GAAM,MAAM,MAAM,GAAkB,GAE/C,OADI,EAAE,IAAI,GACC,EAAI,EAAM,EAAE,IAAI,GAAO,EAAI,EAAM,IAAI,EAAK,EACvD,EAWA,EAAE,WAAa,EAAE,IAAM,SAAU,GAC/B,IAAI,EAAG,EAAG,EAAK,EACb,EAAI,KACJ,EAAK,EAAE,EACP,GAAM,EAAI,IAAI,EAAE,YAAY,IAAI,EAChC,EAAK,EAAE,EACP,EAAK,EAAE,EAGT,IAAK,IAAO,EACV,OAAQ,GAAO,EAAW,IAAO,EAAK,EAAK,IAAO,EAAK,GAAK,EAAK,EAAK,EAAI,KAAtD,IAItB,IAAK,EAAG,KAAO,EAAG,GAAI,OAAO,EAAG,GAAK,EAAK,EAAG,IAAM,EAAK,EAGxD,GAAI,IAAO,EAAI,OAAO,EAGtB,GAAI,EAAE,IAAM,EAAE,EAAG,OAAO,EAAE,EAAI,EAAE,EAAI,EAAK,EAAI,KAM7C,IAAK,EAAI,EAAG,GAJZ,EAAM,EAAG,SACT,EAAM,EAAG,QAGmB,EAAM,EAAK,EAAI,IAAK,EAC9C,GAAI,EAAG,KAAO,EAAG,GAAI,OAAO,EAAG,GAAK,EAAG,GAAK,EAAK,EAAI,KAIvD,OAAO,IAAQ,EAAM,EAAI,EAAM,EAAM,EAAK,EAAI,IAChD,EAgBA,EAAE,OAAS,EAAE,IAAM,WACjB,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,EAGF,EAAE,EAAE,IAET,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,KAAK,IAAI,EAAE,EAAG,EAAE,MA3L3B,EA4LX,EAAK,SAAW,EAEhB,WA2xEc,EAAM,GACpB,IAAI,EAAG,EAAK,EAEZ,GAAI,EAAE,SAAU,OAAO,GAMvB,EAAM,EAAE,EAAE,QACA,GAER,GAAK,EAAI,GAAQ,EADjB,EAAI,KAAK,KAAK,EAAM,KACI,YAExB,EAAI,GACJ,EAAI,gCAGN,EAAK,WAAa,EAElB,EAAI,GAAa,EAAM,EAAG,EAAE,MAAM,GAAI,IAAI,EAAK,IAG/C,QAAS,EAAI,EAAG,KAAM,CACpB,IAAI,EAAQ,EAAE,MAAM,GACpB,EAAI,EAAM,MAAM,GAAO,MAAM,GAAO,MAAM,GAAG,KAAK,EACpD,CAIA,OAFA,EAAK,WAAa,EAEX,CACT,CA1zEE,CAAW,EAAM,GAAiB,EAAM,IAExC,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,GAAqB,GAAZ,IAA6B,GAAZ,GAAgB,EAAE,MAAQ,EAAG,EAAI,OAZ9C,IAAI,EAAK,GAHZ,IAAI,EAAK,IAgB5B,EAmBA,EAAE,SAAW,EAAE,KAAO,WACpB,IAAI,EAAG,EAAG,EAAG,EAAG,EAAK,EAAG,EAAI,EAAG,EAAI,EACjC,EAAI,KACJ,EAAO,EAAE,YAEX,IAAK,EAAE,YAAc,EAAE,SAAU,OAAO,IAAI,EAAK,GAoCjD,IAnCA,OAGA,EAAI,EAAE,EAAI,GAAQ,EAAE,EAAI,EAAG,EAAI,KAIrB,KAAK,IAAI,IAAM,IAqBvB,EAAI,IAAI,EAAK,EAAE,aApBf,EAAI,GAAe,EAAE,IAIjB,IAHJ,EAAI,EAAE,GAGO,EAAE,OAAS,GAAK,KAAG,GAAW,GAAL,OAAU,EAAU,IAAM,MAChE,EAAI,GAAQ,EAAG,EAAI,GAGnB,EAAI,IAAW,EAAI,GAAK,IAAM,EAAI,IAAM,EAAI,KAAS,KASrD,EAAI,IAAI,EANN,EADE,GAAK,IACH,KAAO,GAEX,EAAI,EAAE,iBACA,MAAM,EAAG,EAAE,QAAQ,KAAO,GAAK,IAIrC,EAAI,EAAE,GAKV,GAAM,EAAI,EAAK,WAAa,IAW1B,GAJA,GADA,GADA,EAAI,GACG,MAAM,GAAG,MAAM,IACT,KAAK,GAClB,EAAI,GAAO,EAAQ,KAAK,GAAG,MAAM,GAAI,EAAQ,KAAK,GAAK,EAAK,EAAG,GAG3D,GAAe,EAAE,GAAG,MAAM,EAAG,MAAS,EAAI,GAAe,EAAE,IAAI,MAAM,EAAG,GAAK,CAK/E,GAAS,SAJT,EAAI,EAAE,MAAM,EAAK,EAAG,EAAK,MAIL,GAAY,QAAL,GAepB,EAIC,KAAO,EAAE,MAAM,IAAqB,KAAf,EAAE,OAAO,MAGlC,GAAS,EAAG,EAAI,EAAG,GACnB,GAAK,EAAE,MAAM,GAAG,MAAM,GAAG,GAAG,IAG9B,KACF,CAvBE,IAAK,IACH,GAAS,EAAG,EAAI,EAAG,GAEf,EAAE,MAAM,GAAG,MAAM,GAAG,GAAG,IAAI,CAC7B,EAAI,EACJ,KACF,CAGF,GAAM,EACN,EAAM,CAcV,CAKF,OAFA,MAEO,GAAS,EAAG,EAAG,EAAK,SAAU,EACvC,EAOA,EAAE,cAAgB,EAAE,GAAK,WACvB,IAAI,EACF,EAAI,KAAK,EACT,EAAI,IAEN,GAAI,EAAG,CAML,GAJA,EA5TS,IA2TT,EAAI,EAAE,OAAS,GACN,GAAU,KAAK,EA5Tf,IA+TT,EAAI,EAAE,GACC,KAAO,EAAI,IAAM,EAAG,GAAK,GAAI,IAChC,EAAI,IAAG,EAAI,EACjB,CAEA,OAAO,CACT,EAwBA,EAAE,UAAY,EAAE,IAAM,SAAU,GAC9B,OAAO,GAAO,KAAM,IAAI,KAAK,YAAY,GAC3C,EAQA,EAAE,mBAAqB,EAAE,SAAW,SAAU,GAC5C,IACE,EADM,KACG,YACX,OAAO,GAAS,GAFR,KAEkB,IAAI,EAAK,GAAI,EAAG,EAAG,GAAI,EAAK,UAAW,EAAK,SACxE,EAOA,EAAE,OAAS,EAAE,GAAK,SAAU,GAC1B,OAAuB,IAAhB,KAAK,IAAI,EAClB,EAQA,EAAE,MAAQ,WACR,OAAO,GAAS,IAAI,KAAK,YAAY,MAAO,KAAK,EAAI,EAAG,EAC1D,EAQA,EAAE,YAAc,EAAE,GAAK,SAAU,GAC/B,OAAO,KAAK,IAAI,GAAK,CACvB,EAQA,EAAE,qBAAuB,EAAE,IAAM,SAAU,GACzC,IAAI,EAAI,KAAK,IAAI,GACjB,OAAY,GAAL,GAAgB,IAAN,CACnB,EA4BA,EAAE,iBAAmB,EAAE,KAAO,WAC5B,IAAI,EAAG,EAAG,EAAI,EAAI,EAChB,EAAI,KACJ,EAAO,EAAE,YACT,EAAM,IAAI,EAAK,GAEjB,IAAK,EAAE,WAAY,OAAO,IAAI,EAAK,EAAE,EAAI,IAAQ,KACjD,GAAI,EAAE,SAAU,OAAO,EAEvB,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,KAAK,IAAI,EAAE,EAAG,EAAE,MAAQ,EAC9C,EAAK,SAAW,GAChB,EAAM,EAAE,EAAE,QAOA,GAER,GAAK,EAAI,GAAQ,EADjB,EAAI,KAAK,KAAK,EAAM,KACI,YAExB,EAAI,GACJ,EAAI,gCAGN,EAAI,GAAa,EAAM,EAAG,EAAE,MAAM,GAAI,IAAI,EAAK,OAM/C,QAHI,EACF,EAAI,EACJ,EAAK,IAAI,EAAK,GACT,KACL,EAAU,EAAE,MAAM,GAClB,EAAI,EAAI,MAAM,EAAQ,MAAM,EAAG,MAAM,EAAQ,MAAM,MAGrD,OAAO,GAAS,EAAG,EAAK,UAAY,EAAI,EAAK,SAAW,KAC1D,EAiCA,EAAE,eAAiB,EAAE,KAAO,WAC1B,IAAI,EAAG,EAAI,EAAI,EACb,EAAI,KACJ,EAAO,EAAE,YAEX,IAAK,EAAE,YAAc,EAAE,SAAU,OAAO,IAAI,EAAK,GAQjD,GANA,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,KAAK,IAAI,EAAE,EAAG,EAAE,MAAQ,EAC9C,EAAK,SAAW,GAChB,EAAM,EAAE,EAAE,QAEA,EACR,EAAI,GAAa,EAAM,EAAG,EAAG,UACxB,CAYL,GADA,EAAI,IAAM,KAAK,KAAK,IACZ,GAAK,GAAS,EAAJ,EAGlB,EAAI,GAAa,EAAM,EADvB,EAAI,EAAE,MAAM,EAAI,GAAQ,EAAG,IACE,MAO7B,QAJI,EACF,EAAK,IAAI,EAAK,GACd,EAAM,IAAI,EAAK,IACf,EAAM,IAAI,EAAK,IACV,KACL,EAAU,EAAE,MAAM,GAClB,EAAI,EAAE,MAAM,EAAG,KAAK,EAAQ,MAAM,EAAI,MAAM,GAAS,KAAK,KAE9D,CAKA,OAHA,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,GAAS,EAAG,EAAI,KACzB,EAmBA,EAAE,kBAAoB,EAAE,KAAO,WAC7B,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,WACH,EAAE,SAAiB,IAAI,EAAK,IAEhC,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,EACtB,EAAK,SAAW,EAET,GAAO,EAAE,OAAQ,EAAE,OAAQ,EAAK,UAAY,EAAI,EAAK,SAAW,IAR7C,IAAI,EAAK,EAAE,EASvC,EAsBA,EAAE,cAAgB,EAAE,KAAO,WACzB,IAAI,EAAI,KACN,EAAO,EAAE,YACT,EAAI,EAAE,MAAM,IAAI,GAChB,EAAK,EAAK,UACV,EAAK,EAAK,SAEZ,OAAI,MACW,IAAN,EAEH,EAAE,QAAU,GAAM,EAAM,EAAI,GAAM,IAAI,EAAK,GAE3C,IAAI,EAAK,KAGX,EAAE,SAAiB,GAAM,EAAM,EAAK,EAAG,GAAI,MAAM,KAIrD,EAAK,UAAY,EAAK,EACtB,EAAK,SAAW,EAGhB,EAAI,IAAI,EAAK,GAAG,MAAM,GAAG,IAAI,EAAE,KAAK,IAAI,OAAO,OAE/C,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,EAAE,MAAM,GACjB,EAsBA,EAAE,wBAA0B,EAAE,MAAQ,WACpC,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAI,EAAE,IAAI,GAAW,IAAI,EAAK,EAAE,GAAG,GAAK,EAAI,KACvC,EAAE,YAEP,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,KAAK,IAAI,KAAK,IAAI,EAAE,GAAI,EAAE,MAAQ,EACxD,EAAK,SAAW,EAChB,MAEA,EAAI,EAAE,MAAM,GAAG,MAAM,GAAG,OAAO,KAAK,GAEpC,MACA,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,EAAE,MAdiB,IAAI,EAAK,EAerC,EAmBA,EAAE,sBAAwB,EAAE,MAAQ,WAClC,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,YAAc,EAAE,SAAiB,IAAI,EAAK,IAEjD,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,EAAI,KAAK,IAAI,KAAK,IAAI,EAAE,GAAI,EAAE,MAAQ,EAC5D,EAAK,SAAW,EAChB,MAEA,EAAI,EAAE,MAAM,GAAG,KAAK,GAAG,OAAO,KAAK,GAEnC,MACA,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,EAAE,KACX,EAsBA,EAAE,yBAA2B,EAAE,MAAQ,WACrC,IAAI,EAAI,EAAI,EAAK,EACf,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,WACH,EAAE,GAAK,EAAU,IAAI,EAAK,EAAE,MAAM,GAAG,GAAK,EAAE,EAAI,EAAI,EAAE,SAAW,EAAI,MAEzE,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAM,EAAE,KAEJ,KAAK,IAAI,EAAK,GAAM,GAAK,EAAE,EAAI,EAAU,GAAS,IAAI,EAAK,GAAI,EAAI,OAEvE,EAAK,UAAY,EAAM,EAAM,EAAE,EAE/B,EAAI,GAAO,EAAE,KAAK,GAAI,IAAI,EAAK,GAAG,MAAM,GAAI,EAAM,EAAI,GAEtD,EAAK,UAAY,EAAK,EACtB,EAAK,SAAW,EAEhB,EAAI,EAAE,KAEN,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,EAAE,MAAM,MArBW,IAAI,EAAK,IAsBrC,EAwBA,EAAE,YAAc,EAAE,KAAO,WACvB,IAAI,EAAQ,EACV,EAAI,EACJ,EAAI,KACJ,EAAO,EAAE,YAEX,OAAI,EAAE,SAAiB,IAAI,EAAK,IAEhC,EAAI,EAAE,MAAM,IAAI,GAChB,EAAK,EAAK,UACV,EAAK,EAAK,cAEN,EAGQ,IAAN,IACF,EAAS,GAAM,EAAM,EAAK,EAAG,GAAI,MAAM,KAChC,EAAI,EAAE,EACN,GAIF,IAAI,EAAK,MAKlB,EAAK,UAAY,EAAK,EACtB,EAAK,SAAW,EAEhB,EAAI,EAAE,IAAI,IAAI,EAAK,GAAG,MAAM,EAAE,MAAM,IAAI,OAAO,KAAK,IAAI,OAExD,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,EAAE,MAAM,IACjB,EAqBA,EAAE,eAAiB,EAAE,KAAO,WAC1B,IAAI,EAAG,EAAG,EAAG,EAAG,EAAI,EAAG,EAAG,EAAK,EAC7B,EAAI,KACJ,EAAO,EAAE,YACT,EAAK,EAAK,UACV,EAAK,EAAK,SAEZ,GAAK,EAAE,WAOA,IAAI,EAAE,SACX,OAAO,IAAI,EAAK,GACX,GAAI,EAAE,MAAM,GAAG,IAAM,EAAK,GAAK,GAGpC,OAFA,EAAI,GAAM,EAAM,EAAK,EAAG,GAAI,MAAM,MAChC,EAAI,EAAE,EACD,CACT,KAbmB,CACjB,IAAK,EAAE,EAAG,OAAO,IAAI,EAAK,KAC1B,GAAI,EAAK,GAAK,GAGZ,OAFA,EAAI,GAAM,EAAM,EAAK,EAAG,GAAI,MAAM,KAChC,EAAI,EAAE,EACD,CAEX,CAmBA,IAXA,EAAK,UAAY,EAAM,EAAK,GAC5B,EAAK,SAAW,EAUX,EAFL,EAAI,KAAK,IAAI,GAAI,EA92BN,EA82BuB,EAAI,GAE1B,IAAK,EAAG,EAAI,EAAE,IAAI,EAAE,MAAM,GAAG,KAAK,GAAG,OAAO,KAAK,IAW7D,IATA,MAEA,EAAI,KAAK,KAAK,EAp3BH,GAq3BX,EAAI,EACJ,EAAK,EAAE,MAAM,GACb,EAAI,IAAI,EAAK,GACb,EAAK,OAGE,GAOL,GANA,EAAK,EAAG,MAAM,GACd,EAAI,EAAE,MAAM,EAAG,IAAI,GAAK,IAExB,EAAK,EAAG,MAAM,aACd,EAAI,EAAE,KAAK,EAAG,IAAI,GAAK,KAEjB,EAAE,GAAe,IAAK,EAAI,EAAG,EAAE,EAAE,KAAO,EAAE,EAAE,IAAM,MAO1D,OAJI,IAAG,EAAI,EAAE,MAAM,GAAM,EAAI,IAE7B,MAEO,GAAS,EAAG,EAAK,UAAY,EAAI,EAAK,SAAW,KAC1D,EAOA,EAAE,SAAW,WACX,QAAS,KAAK,CAChB,EAOA,EAAE,UAAY,EAAE,MAAQ,WACtB,QAAS,KAAK,GAAK,GAAU,KAAK,EA35BvB,GA25BuC,KAAK,EAAE,OAAS,CACpE,EAOA,EAAE,MAAQ,WACR,OAAQ,KAAK,CACf,EAOA,EAAE,WAAa,EAAE,MAAQ,WACvB,OAAO,KAAK,EAAI,CAClB,EAOA,EAAE,WAAa,EAAE,MAAQ,WACvB,OAAO,KAAK,EAAI,CAClB,EAOA,EAAE,OAAS,WACT,QAAS,KAAK,GAAmB,IAAd,KAAK,EAAE,EAC5B,EAOA,EAAE,SAAW,EAAE,GAAK,SAAU,GAC5B,OAAO,KAAK,IAAI,GAAK,CACvB,EAOA,EAAE,kBAAoB,EAAE,IAAM,SAAU,GACtC,OAAO,KAAK,IAAI,GAAK,CACvB,EAiCA,EAAE,UAAY,EAAE,IAAM,SAAU,GAC9B,IAAI,EAAU,EAAG,EAAa,EAAG,EAAK,EAAK,EAAI,EAC7C,EAAM,KACN,EAAO,EAAI,YACX,EAAK,EAAK,UACV,EAAK,EAAK,SAIZ,GAAY,MAAR,EACF,EAAO,IAAI,EAAK,IAChB,SACK,CAKL,GAHA,GADA,EAAO,IAAI,EAAK,IACP,EAGL,EAAK,EAAI,IAAM,IAAM,EAAE,IAAM,EAAK,GAAG,GAAI,OAAO,IAAI,EAAK,KAE7D,EAAW,EAAK,GAAG,GACrB,CAKA,GAHA,EAAI,EAAI,EAGJ,EAAI,EAAI,IAAM,IAAM,EAAE,IAAM,EAAI,GAAG,GACrC,OAAO,IAAI,EAAK,IAAM,EAAE,QAAuB,GAAT,EAAI,EAAS,IAAM,EAAI,EAAI,KAKnE,GAAI,EACF,GAAI,EAAE,OAAS,EACb,SACK,CACL,IAAK,EAAI,EAAE,GAAI,EAAI,IAAO,GAAI,GAAK,GACnC,EAAY,IAAN,CACR,CAyBF,GAtBA,MAEA,EAAM,GAAiB,EADvB,EAAK,EAnCK,GAqCV,EAAc,EAAW,GAAQ,EAAM,EAAK,IAAM,GAAiB,EAAM,GAmBrE,IAhBJ,EAAI,GAAO,EAAK,EAAa,EAAI,IAgBP,EAAG,EAAI,EAAI,GAEnC,MAEE,EAAM,GAAiB,EADvB,GAAM,IAEN,EAAc,EAAW,GAAQ,EAAM,EAAK,IAAM,GAAiB,EAAM,GACzE,EAAI,GAAO,EAAK,EAAa,EAAI,IAE5B,EAAK,EAGH,GAAe,EAAE,GAAG,MAAM,EAAI,EAAG,EAAI,IAAM,GAAK,OACnD,EAAI,GAAS,EAAG,EAAK,EAAG,IAG1B,KACF,QACO,GAAoB,EAAE,EAAG,GAAK,GAAI,IAK7C,OAFA,MAEO,GAAS,EAAG,EAAI,EACzB,EAgDA,EAAE,MAAQ,EAAE,IAAM,SAAU,GAC1B,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAK,EAAI,EAAI,EAAI,EAAI,EAAM,EAC5C,EAAI,KACJ,EAAO,EAAE,YAKX,GAHA,EAAI,IAAI,EAAK,IAGR,EAAE,IAAM,EAAE,EAab,OAVK,EAAE,GAAM,EAAE,EAGN,EAAE,EAAG,EAAE,GAAK,EAAE,EAKlB,EAAI,IAAI,EAAK,EAAE,GAAK,EAAE,IAAM,EAAE,EAAI,EAAI,KARzB,EAAI,IAAI,EAAK,KAUxB,EAIT,GAAI,EAAE,GAAK,EAAE,EAEX,OADA,EAAE,GAAK,EAAE,EACF,EAAE,KAAK,GAShB,GANA,EAAK,EAAE,EACP,EAAK,EAAE,EACP,EAAK,EAAK,UACV,EAAK,EAAK,UAGL,EAAG,KAAO,EAAG,GAAI,CAGpB,GAAI,EAAG,GAAI,EAAE,GAAK,EAAE,MAGf,KAAI,EAAG,GAIP,OAAO,IAAI,EAAY,IAAP,KAAgB,GAJrB,EAAI,IAAI,EAAK,EAIU,CAEvC,OAAO,GAAW,GAAS,EAAG,EAAI,GAAM,CAC1C,CAYA,GAPA,EAAI,GAAU,EAAE,EA9qCL,GA+qCX,EAAK,GAAU,EAAE,EA/qCN,GAirCX,EAAK,EAAG,QACR,EAAI,EAAK,EAGF,CAyBL,KAxBA,EAAO,EAAI,IAGT,EAAI,EACJ,GAAK,EACL,EAAM,EAAG,SAET,EAAI,EACJ,EAAI,EACJ,EAAM,EAAG,QAQP,GAFJ,EAAI,KAAK,IAAI,KAAK,KAAK,EArsCd,GAqsC8B,GAAO,KAG5C,EAAI,EACJ,EAAE,OAAS,GAIb,EAAE,UACG,EAAI,EAAG,KAAM,EAAE,KAAK,GACzB,EAAE,SAGJ,KAAO,CASL,KAHA,GAFA,EAAI,EAAG,SACP,EAAM,EAAG,WAEC,EAAM,GAEX,EAAI,EAAG,EAAI,EAAK,IACnB,GAAI,EAAG,IAAM,EAAG,GAAI,CAClB,EAAO,EAAG,GAAK,EAAG,GAClB,KACF,CAGF,EAAI,CACN,CAaA,IAXI,IACF,EAAI,EACJ,EAAK,EACL,EAAK,EACL,EAAE,GAAK,EAAE,GAGX,EAAM,EAAG,OAIJ,EAAI,EAAG,OAAS,EAAK,EAAI,IAAK,EAAG,EAAG,KAAS,EAGlD,IAAK,EAAI,EAAG,OAAQ,EAAI,GAAI,CAE1B,GAAI,IAAK,GAAK,EAAG,GAAI,CACnB,IAAK,EAAI,EAAG,GAAiB,IAAZ,IAAK,IAAW,EAAG,GAAK,GAAO,IAC9C,EAAG,GACL,EAAG,IAAM,EACX,CAEA,EAAG,IAAM,EAAG,EACd,CAGA,KAAqB,IAAd,IAAK,IAAa,EAAG,MAG5B,KAAiB,IAAV,EAAG,GAAU,EAAG,UAAW,EAGlC,OAAK,EAAG,IAER,EAAE,EAAI,EACN,EAAE,EAAI,GAAkB,EAAI,GAErB,GAAW,GAAS,EAAG,EAAI,GAAM,GALrB,IAAI,EAAY,IAAP,KAAgB,EAM9C,EA2BA,EAAE,OAAS,EAAE,IAAM,SAAU,GAC3B,IAAI,EACF,EAAI,KACJ,EAAO,EAAE,YAKX,OAHA,EAAI,IAAI,EAAK,IAGR,EAAE,IAAM,EAAE,GAAK,EAAE,IAAM,EAAE,EAAE,GAAW,IAAI,EAAK,MAG/C,EAAE,GAAK,EAAE,IAAM,EAAE,EAAE,GACf,GAAS,IAAI,EAAK,GAAI,EAAK,UAAW,EAAK,WAIpD,MAEmB,GAAf,EAAK,QAIP,EAAI,GAAO,EAAG,EAAE,MAAO,EAAG,EAAG,IAC3B,GAAK,EAAE,EAET,EAAI,GAAO,EAAG,EAAG,EAAG,EAAK,OAAQ,GAGnC,EAAI,EAAE,MAAM,GAEZ,MAEO,EAAE,MAAM,GACjB,EASA,EAAE,mBAAqB,EAAE,IAAM,WAC7B,OAAO,GAAmB,KAC5B,EAQA,EAAE,iBAAmB,EAAE,GAAK,WAC1B,OAAO,GAAiB,KAC1B,EAQA,EAAE,QAAU,EAAE,IAAM,WAClB,IAAI,EAAI,IAAI,KAAK,YAAY,MAE7B,OADA,EAAE,GAAK,EAAE,EACF,GAAS,EAClB,EAwBA,EAAE,KAAO,EAAE,IAAM,SAAU,GACzB,IAAI,EAAO,EAAG,EAAG,EAAG,EAAG,EAAK,EAAI,EAAI,EAAI,EACtC,EAAI,KACJ,EAAO,EAAE,YAKX,GAHA,EAAI,IAAI,EAAK,IAGR,EAAE,IAAM,EAAE,EAWb,OARK,EAAE,GAAM,EAAE,EAML,EAAE,IAAG,EAAI,IAAI,EAAK,EAAE,GAAK,EAAE,IAAM,EAAE,EAAI,EAAI,MANnC,EAAI,IAAI,EAAK,KAQxB,EAIT,GAAI,EAAE,GAAK,EAAE,EAEX,OADA,EAAE,GAAK,EAAE,EACF,EAAE,MAAM,GASjB,GANA,EAAK,EAAE,EACP,EAAK,EAAE,EACP,EAAK,EAAK,UACV,EAAK,EAAK,UAGL,EAAG,KAAO,EAAG,GAMhB,OAFK,EAAG,KAAI,EAAI,IAAI,EAAK,IAElB,GAAW,GAAS,EAAG,EAAI,GAAM,EAa1C,GAPA,EAAI,GAAU,EAAE,EA96CL,GA+6CX,EAAI,GAAU,EAAE,EA/6CL,GAi7CX,EAAK,EAAG,QACR,EAAI,EAAI,EAGD,CAuBL,IArBI,EAAI,GACN,EAAI,EACJ,GAAK,EACL,EAAM,EAAG,SAET,EAAI,EACJ,EAAI,EACJ,EAAM,EAAG,QAOP,GAFJ,GADA,EAAI,KAAK,KAAK,EAl8CL,IAm8CC,EAAM,EAAI,EAAI,EAAM,KAG5B,EAAI,EACJ,EAAE,OAAS,GAIb,EAAE,UACK,KAAM,EAAE,KAAK,GACpB,EAAE,SACJ,CAcA,KAZA,EAAM,EAAG,SACT,EAAI,EAAG,QAGO,IACZ,EAAI,EACJ,EAAI,EACJ,EAAK,EACL,EAAK,GAIF,EAAQ,EAAG,GACd,GAAS,IAAK,GAAK,EAAG,GAAK,EAAG,GAAK,GAAS,GAAO,EACnD,EAAG,IAAM,GAUX,IAPI,IACF,EAAG,QAAQ,KACT,GAKC,EAAM,EAAG,OAAqB,GAAb,IAAK,IAAY,EAAG,MAK1C,OAHA,EAAE,EAAI,EACN,EAAE,EAAI,GAAkB,EAAI,GAErB,GAAW,GAAS,EAAG,EAAI,GAAM,CAC1C,EASA,EAAE,UAAY,EAAE,GAAK,SAAU,GAC7B,IAAI,EACF,EAAI,KAEN,YAAI,GAAgB,MAAQ,GAAW,IAAN,GAAiB,IAAN,EAAS,MAAM,MAAM,GAAkB,GASnF,OAPI,EAAE,GACJ,EAAI,GAAa,EAAE,GACf,GAAK,EAAE,EAAI,EAAI,IAAG,EAAI,EAAE,EAAI,IAEhC,EAAI,IAGC,CACT,EAQA,EAAE,MAAQ,WACR,IAAI,EAAI,KACN,EAAO,EAAE,YAEX,OAAO,GAAS,IAAI,EAAK,GAAI,EAAE,EAAI,EAAG,EAAK,SAC7C,EAkBA,EAAE,KAAO,EAAE,IAAM,WACf,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,WACH,EAAE,SAAiB,IAAI,EAAK,IAEhC,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,KAAK,IAAI,EAAE,EAAG,EAAE,MA9iD3B,EA+iDX,EAAK,SAAW,EAEhB,WA67DY,EAAM,GAClB,IAAI,EACF,EAAM,EAAE,EAAE,OAEZ,GAAI,EAAM,EACR,OAAO,EAAE,SAAW,EAAI,GAAa,EAAM,EAAG,EAAG,GASnD,GADA,EAAI,IAAM,KAAK,KAAK,IACZ,GAAK,GAAS,EAAJ,EAGlB,EAAI,GAAa,EAAM,EADvB,EAAI,EAAE,MAAM,EAAI,GAAQ,EAAG,IACE,GAO7B,QAJI,EACF,EAAK,IAAI,EAAK,GACd,EAAM,IAAI,EAAK,IACf,EAAM,IAAI,EAAK,IACV,KACL,EAAS,EAAE,MAAM,GACjB,EAAI,EAAE,MAAM,EAAG,KAAK,EAAO,MAAM,EAAI,MAAM,GAAQ,MAAM,MAG3D,OAAO,CACT,CA39DE,CAAS,EAAM,GAAiB,EAAM,IAEtC,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,GAAS,GAAW,EAAI,EAAE,MAAQ,EAAG,EAAI,OAbtB,IAAI,EAAK,IAcrC,EAeA,EAAE,WAAa,EAAE,KAAO,WACtB,IAAI,EAAG,EAAG,EAAI,EAAG,EAAK,EACpB,EAAI,KACJ,EAAI,EAAE,EACN,EAAI,EAAE,EACN,EAAI,EAAE,EACN,EAAO,EAAE,YAGX,GAAU,IAAN,IAAY,IAAM,EAAE,GACtB,OAAO,IAAI,GAAM,GAAK,EAAI,KAAO,GAAK,EAAE,IAAM,IAAM,EAAI,EAAI,KAgC9D,IA7BA,MAOS,IAJT,EAAI,KAAK,MAAM,KAID,GAAK,OACjB,EAAI,GAAe,IAEZ,OAAS,GAAK,GAAK,IAAG,GAAK,KAClC,EAAI,KAAK,KAAK,GACd,EAAI,IAAW,EAAI,GAAK,IAAM,EAAI,GAAK,EAAI,GAS3C,EAAI,IAAI,EANN,EADE,GAAK,IACH,KAAO,GAEX,EAAI,EAAE,iBACA,MAAM,EAAG,EAAE,QAAQ,KAAO,GAAK,IAKvC,EAAI,IAAI,EAAK,EAAE,YAGjB,GAAM,EAAI,EAAK,WAAa,IAQ1B,GAHA,GADA,EAAI,GACE,KAAK,GAAO,EAAG,EAAG,EAAK,EAAG,IAAI,MAAM,IAGtC,GAAe,EAAE,GAAG,MAAM,EAAG,MAAS,EAAI,GAAe,EAAE,IAAI,MAAM,EAAG,GAAK,CAK/E,GAAS,SAJT,EAAI,EAAE,MAAM,EAAK,EAAG,EAAK,MAIL,GAAY,QAAL,GAepB,EAIC,KAAO,EAAE,MAAM,IAAqB,KAAf,EAAE,OAAO,MAGlC,GAAS,EAAG,EAAI,EAAG,GACnB,GAAK,EAAE,MAAM,GAAG,GAAG,IAGrB,KACF,CAvBE,IAAK,IACH,GAAS,EAAG,EAAI,EAAG,GAEf,EAAE,MAAM,GAAG,GAAG,IAAI,CACpB,EAAI,EACJ,KACF,CAGF,GAAM,EACN,EAAM,CAcV,CAKF,OAFA,MAEO,GAAS,EAAG,EAAG,EAAK,SAAU,EACvC,EAgBA,EAAE,QAAU,EAAE,IAAM,WAClB,IAAI,EAAI,EACN,EAAI,KACJ,EAAO,EAAE,YAEX,OAAK,EAAE,WACH,EAAE,SAAiB,IAAI,EAAK,IAEhC,EAAK,EAAK,UACV,EAAK,EAAK,SACV,EAAK,UAAY,EAAK,GACtB,EAAK,SAAW,GAEhB,EAAI,EAAE,OACJ,EAAI,EACN,EAAI,GAAO,EAAG,IAAI,EAAK,GAAG,MAAM,EAAE,MAAM,IAAI,OAAQ,EAAK,GAAI,GAE7D,EAAK,UAAY,EACjB,EAAK,SAAW,EAET,GAAqB,GAAZ,IAA6B,GAAZ,GAAgB,EAAE,MAAQ,EAAG,EAAI,OAfxC,IAAI,EAAK,IAgBrC,EAwBA,EAAE,MAAQ,EAAE,IAAM,SAAU,GAC1B,IAAI,EAAO,EAAG,EAAG,EAAG,EAAG,EAAI,EAAG,EAAK,EACjC,EAAI,KACJ,EAAO,EAAE,YACT,EAAK,EAAE,EACP,GAAM,EAAI,IAAI,EAAK,IAAI,EAKzB,GAHA,EAAE,GAAK,EAAE,IAGJ,GAAO,EAAG,IAAO,GAAO,EAAG,IAE9B,OAAO,IAAI,GAAM,EAAE,GAAK,IAAO,EAAG,KAAO,GAAM,IAAO,EAAG,KAAO,EAI5D,IAIC,GAAO,EAAqB,EAAN,EAAE,EAAZ,EAAE,EAAI,GAoBzB,IAjBA,EAAI,GAAU,EAAE,EAhvDL,GAgvDqB,GAAU,EAAE,EAhvDjC,IAivDX,EAAM,EAAG,SACT,EAAM,EAAG,UAIP,EAAI,EACJ,EAAK,EACL,EAAK,EACL,EAAK,EACL,EAAM,EACN,EAAM,GAIR,EAAI,GAEC,EADL,EAAK,EAAM,EACE,KAAM,EAAE,KAAK,GAG1B,IAAK,EAAI,IAAO,GAAK,GAAI,CAEvB,IADA,EAAQ,EACH,EAAI,EAAM,EAAG,EAAI,GACpB,EAAI,EAAE,GAAK,EAAG,GAAK,EAAG,EAAI,EAAI,GAAK,EACnC,EAAE,KAAO,EAAI,GAAO,EACpB,EAAQ,EAAI,GAAO,EAGrB,EAAE,IAAM,EAAE,GAAK,GAAS,GAAO,CACjC,CAGA,MAAQ,IAAI,IAAM,EAAE,MAQpB,OANI,IAAS,EACR,EAAE,QAEP,EAAE,EAAI,EACN,EAAE,EAAI,GAAkB,EAAG,GAEpB,GAAW,GAAS,EAAG,EAAK,UAAW,EAAK,UAAY,CACjE,EAaA,EAAE,SAAW,SAAU,EAAI,GACzB,OAAO,GAAe,KAAM,EAAG,EAAI,EACrC,EAaA,EAAE,gBAAkB,EAAE,KAAO,SAAU,EAAI,GACzC,IAAI,EAAI,KACN,EAAO,EAAE,YAGX,OADA,EAAI,IAAI,EAAK,YACT,EAAsB,GAE1B,GAAW,EAAI,EAAG,aAEd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,GAEhB,GAAS,EAAG,EAAK,EAAE,EAAI,EAAG,GACnC,EAWA,EAAE,cAAgB,SAAU,EAAI,GAC9B,IAAI,EACF,EAAI,KACJ,EAAO,EAAE,YAcX,gBAZI,EACF,EAAM,GAAe,OAErB,GAAW,EAAI,EAAG,aAEd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,GAGvB,EAAM,GADN,EAAI,GAAS,IAAI,EAAK,GAAI,EAAK,EAAG,MACJ,EAAK,IAG9B,EAAE,UAAY,EAAE,SAAW,IAAM,EAAM,CAChD,EAmBA,EAAE,QAAU,SAAU,EAAI,GACxB,IAAI,EAAK,EACP,EAAI,KACJ,EAAO,EAAE,YAgBX,YAdI,MACF,EAAM,GAAe,IAErB,GAAW,EAAI,EAAG,aAEd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,GAGvB,EAAM,GADN,EAAI,GAAS,IAAI,EAAK,GAAI,EAAK,EAAE,EAAI,EAAG,MACT,EAAK,EAAE,EAAI,IAKrC,EAAE,UAAY,EAAE,SAAW,IAAM,EAAM,CAChD,EAcA,EAAE,WAAa,SAAU,GACvB,IAAI,EAAG,EAAI,EAAI,EAAI,EAAG,EAAG,EAAG,EAAI,EAAI,EAAI,EAAG,EACzC,EAAI,KACJ,EAAK,EAAE,EACP,EAAO,EAAE,YAEX,IAAK,EAAI,OAAO,IAAI,EAAK,GAUzB,GARA,EAAK,EAAK,IAAI,EAAK,GACnB,EAAK,EAAK,IAAI,EAAK,GAInB,GADA,GADA,EAAI,IAAI,EAAK,IACP,EAAI,GAAa,GAAM,EAAE,EAAI,GAh6DxB,EAk6DX,EAAE,EAAE,GAAK,GAAQ,GAAI,EAAI,EAl6Dd,EAk6D6B,EAAI,GAEhC,MAAR,EAGF,EAAO,EAAI,EAAI,EAAI,MACd,CAEL,KADA,EAAI,IAAI,EAAK,IACN,SAAW,EAAE,GAAG,GAAK,MAAM,MAAM,GAAkB,GAC1D,EAAO,EAAE,GAAG,GAAM,EAAI,EAAI,EAAI,EAAM,CACtC,CAOA,IALA,MACA,EAAI,IAAI,EAAK,GAAe,IAC5B,EAAK,EAAK,UACV,EAAK,UAAY,EAj7DN,EAi7DU,EAAG,OAAoB,EAG1C,EAAI,GAAO,EAAG,EAAG,EAAG,EAAG,GAEH,IADpB,EAAK,EAAG,KAAK,EAAE,MAAM,KACd,IAAI,IACX,EAAK,EACL,EAAK,EACL,EAAK,EACL,EAAK,EAAG,KAAK,EAAE,MAAM,IACrB,EAAK,EACL,EAAK,EACL,EAAI,EAAE,MAAM,EAAE,MAAM,IACpB,EAAI,EAeN,OAZA,EAAK,GAAO,EAAK,MAAM,GAAK,EAAI,EAAG,EAAG,GACtC,EAAK,EAAG,KAAK,EAAG,MAAM,IACtB,EAAK,EAAG,KAAK,EAAG,MAAM,IACtB,EAAG,EAAI,EAAG,EAAI,EAAE,EAGhB,EAAI,GAAO,EAAI,EAAI,EAAG,GAAG,MAAM,GAAG,MAAM,IAAI,GAAO,EAAI,EAAI,EAAG,GAAG,MAAM,GAAG,OAAS,EAC7E,CAAC,EAAI,GAAM,CAAC,EAAI,GAEtB,EAAK,UAAY,EACjB,MAEO,CACT,EAaA,EAAE,cAAgB,EAAE,MAAQ,SAAU,EAAI,GACxC,OAAO,GAAe,KAAM,GAAI,EAAI,EACtC,EAmBA,EAAE,UAAY,SAAU,EAAG,GACzB,IAAI,EAAI,KACN,EAAO,EAAE,YAIX,GAFA,EAAI,IAAI,EAAK,GAEJ,MAAL,EAAW,CAGb,IAAK,EAAE,EAAG,OAAO,EAEjB,EAAI,IAAI,EAAK,GACb,EAAK,EAAK,QACZ,KAAO,CASL,GARA,EAAI,IAAI,EAAK,QACT,MACF,EAAK,EAAK,SAEV,GAAW,EAAI,EAAG,IAIf,EAAE,EAAG,OAAO,EAAE,EAAI,EAAI,EAG3B,IAAK,EAAE,EAEL,OADI,EAAE,IAAG,EAAE,EAAI,EAAE,GACV,CAEX,CAeA,OAZI,EAAE,EAAE,IACN,MACA,EAAI,GAAO,EAAG,EAAG,EAAG,EAAI,GAAG,MAAM,GACjC,MACA,GAAS,KAIT,EAAE,EAAI,EAAE,EACR,EAAI,GAGC,CACT,EAQA,EAAE,SAAW,WACX,OAAQ,IACV,EAaA,EAAE,QAAU,SAAU,EAAI,GACxB,OAAO,GAAe,KAAM,EAAG,EAAI,EACrC,EA8CA,EAAE,QAAU,EAAE,IAAM,SAAU,GAC5B,IAAI,EAAG,EAAG,EAAI,EAAG,EAAI,EACnB,EAAI,KACJ,EAAO,EAAE,YACT,IAAO,EAAI,IAAI,EAAK,IAGtB,KAAK,EAAE,GAAM,EAAE,GAAM,EAAE,EAAE,IAAO,EAAE,EAAE,IAAI,OAAO,IAAI,EAAK,IAAS,EAAG,IAIpE,IAFA,EAAI,IAAI,EAAK,IAEP,GAAG,GAAI,OAAO,EAKpB,GAHA,EAAK,EAAK,UACV,EAAK,EAAK,SAEN,EAAE,GAAG,GAAI,OAAO,GAAS,EAAG,EAAI,GAMpC,IAHA,EAAI,GAAU,EAAE,EAvnEL,KA0nEF,EAAE,EAAE,OAAS,IAAM,EAAI,EAAK,GAAK,EAAK,IAznE5B,iBA2nEjB,OADA,EAAI,GAAO,EAAM,EAAG,EAAG,GAChB,EAAE,EAAI,EAAI,IAAI,EAAK,GAAG,IAAI,GAAK,GAAS,EAAG,EAAI,GAMxD,IAHA,EAAI,EAAE,GAGE,EAAG,CAGT,GAAI,EAAI,EAAE,EAAE,OAAS,EAAG,OAAO,IAAI,EAAK,KAMxC,GAHc,EAAT,EAAE,EAAE,KAAc,EAAI,GAGhB,GAAP,EAAE,GAAoB,GAAV,EAAE,EAAE,IAAyB,GAAd,EAAE,EAAE,OAEjC,OADA,EAAE,EAAI,EACC,CAEX,CAcA,OAPA,EAAS,IADT,EAAI,IAAS,EAAG,KACD,SAAS,GAEpB,IAAI,EAAK,EAAI,IAAI,EADjB,GAAU,GAAM,KAAK,IAAI,KAAO,GAAe,EAAE,IAAM,KAAK,KAAO,EAAE,EAAI,KAMrE,EAAK,KAAO,GAAK,EAAI,EAAK,KAAO,EAAU,IAAI,EAAK,EAAI,EAAI,EAAI,EAAI,IAE5E,MACA,EAAK,SAAW,EAAE,EAAI,EAMtB,EAAI,KAAK,IAAI,IAAK,EAAI,IAAI,SAG1B,EAAI,GAAmB,EAAE,MAAM,GAAiB,EAAG,EAAK,IAAK,IAGvD,GAOA,IAJJ,EAAI,GAAS,EAAG,EAAK,EAAG,IAIE,EAAG,EAAI,KAC/B,EAAI,EAAK,IAMJ,IAHL,EAAI,GAAS,GAAmB,EAAE,MAAM,GAAiB,EAAG,EAAI,IAAK,GAAI,EAAI,EAAG,IAG1D,GAAG,MAAM,EAAK,EAAG,EAAK,IAAM,GAAK,OACrD,EAAI,GAAS,EAAG,EAAK,EAAG,KAK9B,EAAE,EAAI,EACN,MACA,EAAK,SAAW,EAET,GAAS,EAAG,EAAI,GACzB,EAcA,EAAE,YAAc,SAAU,EAAI,GAC5B,IAAI,EACF,EAAI,KACJ,EAAO,EAAE,YAcX,YAZI,MACF,EAAM,GAAe,EAAG,EAAE,GAAK,EAAK,UAAY,EAAE,GAAK,EAAK,WAE5D,GAAW,EAAI,EAAG,aAEd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,GAGvB,EAAM,GADN,EAAI,GAAS,IAAI,EAAK,GAAI,EAAI,GACN,GAAM,EAAE,GAAK,EAAE,GAAK,EAAK,SAAU,IAGtD,EAAE,UAAY,EAAE,SAAW,IAAM,EAAM,CAChD,EAiBA,EAAE,oBAAsB,EAAE,KAAO,SAAU,EAAI,GAC7C,IACE,EADM,KACG,YAYX,gBAVI,GACF,EAAK,EAAK,UACV,EAAK,EAAK,WAEV,GAAW,EAAI,EAAG,aAEd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,IAGlB,GAAS,IAAI,EAbZ,MAaqB,EAAI,EACnC,EAUA,EAAE,SAAW,WACX,IAAI,EAAI,KACN,EAAO,EAAE,YACT,EAAM,GAAe,EAAG,EAAE,GAAK,EAAK,UAAY,EAAE,GAAK,EAAK,UAE9D,OAAO,EAAE,UAAY,EAAE,SAAW,IAAM,EAAM,CAChD,EAOA,EAAE,UAAY,EAAE,MAAQ,WACtB,OAAO,GAAS,IAAI,KAAK,YAAY,MAAO,KAAK,EAAI,EAAG,EAC1D,EAQA,EAAE,QAAU,EAAE,OAAS,WACrB,IAAI,EAAI,KACN,EAAO,EAAE,YACT,EAAM,GAAe,EAAG,EAAE,GAAK,EAAK,UAAY,EAAE,GAAK,EAAK,UAE9D,OAAO,EAAE,QAAU,IAAM,EAAM,CACjC,EAkNA,IAAI,cAGF,SAAS,EAAgB,EAAG,EAAG,GAC7B,IAAI,EACF,EAAQ,EACR,EAAI,EAAE,OAER,IAAK,EAAI,EAAE,QAAS,KAClB,EAAO,EAAE,GAAK,EAAI,EAClB,EAAE,GAAK,EAAO,EAAO,EACrB,EAAQ,EAAO,EAAO,EAKxB,OAFI,GAAO,EAAE,QAAQ,GAEd,CACT,CAEA,SAAS,EAAQ,EAAG,EAAG,EAAI,GACzB,IAAI,EAAG,EAEP,GAAI,GAAM,EACR,EAAI,EAAK,EAAK,UAEd,IAAK,EAAI,EAAI,EAAG,EAAI,EAAI,IACtB,GAAI,EAAE,IAAM,EAAE,GAAI,CAChB,EAAI,EAAE,GAAK,EAAE,GAAK,KAClB,KACF,CAIJ,OAAO,CACT,CAEA,SAAS,EAAS,EAAG,EAAG,EAAI,GAI1B,QAHI,EAAI,EAGD,KACL,EAAE,IAAO,EACT,EAAI,EAAE,GAAM,EAAE,GAAM,EAAI,EACxB,EAAE,GAAM,EAAI,EAAO,EAAE,GAAM,EAAE,GAI/B,MAAQ,EAAE,IAAM,EAAE,OAAS,GAAI,EAAE,OACnC,CAEA,OAAO,SAAU,EAAG,EAAG,EAAI,EAAI,EAAI,GACjC,IAAI,EAAK,EAAG,EAAG,EAAG,EAAS,EAAM,EAAM,EAAO,EAAG,EAAI,EAAK,EAAM,EAAM,EAAI,EAAG,EAAI,EAAI,EACnF,EAAI,EACJ,EAAO,EAAE,YACT,EAAO,EAAE,GAAK,EAAE,EAAI,KACpB,EAAK,EAAE,EACP,EAAK,EAAE,EAGT,KAAK,GAAO,EAAG,IAAO,GAAO,EAAG,IAE9B,OAAO,IAAI,EACR,EAAE,GAAM,EAAE,IAAM,GAAK,GAAM,EAAG,IAAM,EAAG,GAAM,GAG9C,GAAe,GAAT,EAAG,KAAY,EAAY,EAAP,EAAW,EAAO,EAHQ,KAsBxD,IAhBI,GACF,EAAU,EACV,EAAI,EAAE,EAAI,EAAE,IAEZ,EAAO,GACP,EAvkFO,EAwkFP,EAAI,GAAU,EAAE,EAAI,GAAW,GAAU,EAAE,EAAI,IAGjD,EAAK,EAAG,OACR,EAAK,EAAG,OAER,GADA,EAAI,IAAI,EAAK,IACN,EAAI,GAIN,EAAI,EAAG,EAAG,KAAO,EAAG,IAAM,GAAI,KAanC,GAXI,EAAG,IAAM,EAAG,IAAM,IAAI,IAEhB,MAAN,GACF,EAAK,EAAK,EAAK,UACf,EAAK,EAAK,UAEV,EADS,EACJ,GAAM,EAAE,EAAI,EAAE,GAAK,EAEnB,EAGH,EAAK,EACP,EAAG,KAAK,GACR,SACK,CAOL,GAJA,EAAK,EAAK,EAAU,EAAI,EACxB,EAAI,EAGM,GAAN,EAAS,CAMX,IALA,EAAI,EACJ,EAAK,EAAG,GACR,KAGQ,EAAI,GAAM,IAAM,IAAM,IAC5B,EAAI,EAAI,GAAQ,EAAG,IAAM,GACzB,EAAG,GAAK,EAAI,EAAK,EACjB,EAAI,EAAI,EAAK,EAGf,EAAO,GAAK,EAAI,CAGlB,KAAO,CAiBL,KAdA,EAAI,GAAQ,EAAG,GAAK,GAAK,GAEjB,IACN,EAAK,EAAgB,EAAI,EAAG,GAC5B,EAAK,EAAgB,EAAI,EAAG,GAC5B,EAAK,EAAG,OACR,EAAK,EAAG,QAGV,EAAK,EAEL,GADA,EAAM,EAAG,MAAM,EAAG,IACP,OAGJ,EAAO,GAAK,EAAI,KAAU,GAEjC,EAAK,EAAG,SACL,QAAQ,GACX,EAAM,EAAG,GAEL,EAAG,IAAM,EAAO,KAAK,EAEzB,GACE,EAAI,GAGJ,EAAM,EAAQ,EAAI,EAAK,EAAI,IAGjB,GAGR,EAAO,EAAI,GACP,GAAM,IAAM,EAAO,EAAO,GAAQ,EAAI,IAAM,KAGhD,EAAI,EAAO,EAAM,GAUT,GACF,GAAK,IAAM,EAAI,EAAO,GAWf,IAHX,EAAM,EALN,EAAO,EAAgB,EAAI,EAAG,GAKV,EAJpB,EAAQ,EAAK,OACb,EAAO,EAAI,WAOT,IAGA,EAAS,EAAM,EAAK,EAAQ,EAAK,EAAI,EAAO,MAOrC,GAAL,IAAQ,EAAM,EAAI,GACtB,EAAO,EAAG,UAGZ,EAAQ,EAAK,QACD,GAAM,EAAK,QAAQ,GAG/B,EAAS,EAAK,EAAM,EAAM,OAGtB,IAIF,EAAM,EAAQ,EAAI,EAAK,EAHvB,EAAO,EAAI,SAMD,IACR,IAGA,EAAS,EAAK,EAAK,EAAO,EAAK,EAAI,EAAM,IAI7C,EAAO,EAAI,QACM,IAAR,IACT,IACA,EAAM,CAAC,IAIT,EAAG,KAAO,EAGN,GAAO,EAAI,GACb,EAAI,KAAU,EAAG,IAAO,GAExB,EAAM,CAAC,EAAG,IACV,EAAO,UAGD,IAAO,QAAU,IAAJ,EAAI,KAAkB,KAE7C,WAAO,EAAI,EACb,CAGK,EAAG,IAAI,EAAG,OACjB,CAGA,GAAe,GAAX,EACF,EAAE,EAAI,EACN,GAAU,MACL,CAGL,IAAK,EAAI,EAAG,EAAI,EAAG,GAAI,GAAK,GAAI,GAAK,GAAI,IACzC,EAAE,EAAI,EAAI,EAAI,EAAU,EAExB,GAAS,EAAG,EAAK,EAAK,EAAE,EAAI,EAAI,EAAI,EAAI,EAC1C,CAEA,OAAO,CACT,CACD,CArQG,GA4QH,SAAS,GAAS,EAAG,EAAI,EAAI,GAC5B,IAAI,EAAQ,EAAG,EAAG,EAAG,EAAI,EAAS,EAAG,EAAI,EACvC,EAAO,EAAE,YAGX,EAAK,GAAU,MAAN,EAAY,CAInB,KAHA,EAAK,EAAE,GAGE,OAAO,EAWhB,IAAK,EAAS,EAAG,EAAI,EAAG,GAAI,GAAK,GAAI,GAAK,GAAI,IAI9C,IAHA,EAAI,EAAK,GAGD,EACN,GAnyFO,EAoyFP,EAAI,EAIJ,GAHA,EAAI,EAAG,EAAM,IAGJ,GAAQ,GAAI,EAAS,EAAI,GAAK,GAAK,WAE5C,EAAM,KAAK,MAAM,EAAI,GA1yFd,MA2yFP,EAAI,EAAG,QACO,CACZ,IAAI,EASF,MAAM,EANN,KAAO,KAAO,GAAM,EAAG,KAAK,GAC5B,EAAI,EAAK,EACT,EAAS,EAET,GADA,GAnzFG,KAozFgB,CAIvB,KAAO,CAIL,IAHA,EAAI,EAAI,EAAG,GAGN,EAAS,EAAG,GAAK,GAAI,GAAK,GAAI,IAUnC,GAHA,GAJA,GA/zFK,KAm0Fc,GAGV,EAAI,EAAI,EAAI,GAAQ,GAAI,EAAS,EAAI,GAAK,GAAK,CAC1D,CAmBF,GAfA,EAAc,GAAe,EAAK,YAChC,EAAG,EAAM,KAAkB,EAAI,EAAI,EAAI,EAAI,GAAQ,GAAI,EAAS,EAAI,IAMtE,EAAU,EAAK,GACV,GAAM,KAAuB,GAAN,GAAW,IAAO,EAAE,EAAI,EAAI,EAAI,IACxD,EAAK,GAAW,GAAN,IAAkB,GAAN,GAAW,GAAqB,GAAN,IAG9C,EAAI,EAAI,EAAI,EAAI,EAAI,GAAQ,GAAI,EAAS,GAAK,EAAI,EAAG,EAAM,IAAM,GAAM,GACvE,IAAO,EAAE,EAAI,EAAI,EAAI,IAEvB,EAAK,IAAM,EAAG,GAgBhB,OAfA,EAAG,OAAS,EACR,GAGF,GAAM,EAAE,EAAI,EAGZ,EAAG,GAAK,GAAQ,IAl2FX,EAk2F2B,EAl2F3B,MAm2FL,EAAE,GAAK,GAAM,GAIb,EAAG,GAAK,EAAE,EAAI,EAGT,EAiBT,GAbS,GAAL,GACF,EAAG,OAAS,EACZ,EAAI,EACJ,MAEA,EAAG,OAAS,EAAM,EAClB,EAAI,GAAQ,GAp3FL,EAo3FoB,GAI3B,EAAG,GAAO,EAAI,GAAK,EAAI,GAAQ,GAAI,EAAS,GAAK,GAAQ,GAAI,GAAK,GAAK,EAAI,GAGzE,EACF,OAAS,CAGP,GAAW,GAAP,EAAU,CAGZ,IAAK,EAAI,EAAG,EAAI,EAAG,GAAI,GAAK,GAAI,GAAK,GAAI,IAEzC,IADA,EAAI,EAAG,IAAM,EACR,EAAI,EAAG,GAAK,GAAI,GAAK,GAAI,IAG1B,GAAK,IACP,EAAE,IACE,EAAG,IAAM,KAAM,EAAG,GAAK,IAG7B,KACF,CAEE,GADA,EAAG,IAAQ,EACP,EAAG,IAAQ,GAAM,MACrB,EAAG,KAAS,EACZ,EAAI,CAER,CAIF,IAAK,EAAI,EAAG,OAAoB,IAAZ,IAAK,IAAW,EAAG,KACzC,CAqBA,OAnBI,KAGE,EAAE,EAAI,EAAK,MAGb,EAAE,EAAI,KACN,EAAE,EAAI,KAGG,EAAE,EAAI,EAAK,OAGpB,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,KAKJ,CACT,CAGA,SAAS,GAAe,EAAG,EAAO,GAChC,IAAK,EAAE,WAAY,OAAO,GAAkB,GAC5C,IAAI,EACF,EAAI,EAAE,EACN,EAAM,GAAe,EAAE,GACvB,EAAM,EAAI,OAwBZ,OAtBI,GACE,IAAO,EAAI,EAAK,GAAO,EACzB,EAAM,EAAI,OAAO,GAAK,IAAM,EAAI,MAAM,GAAK,GAAc,GAChD,EAAM,IACf,EAAM,EAAI,OAAO,GAAK,IAAM,EAAI,MAAM,IAGxC,EAAM,GAAO,EAAE,EAAI,EAAI,IAAM,MAAQ,EAAE,GAC9B,EAAI,GACb,EAAM,KAAO,IAAe,EAAI,GAAK,EACjC,IAAO,EAAI,EAAK,GAAO,IAAG,GAAO,GAAc,KAC1C,GAAK,GACd,GAAO,GAAc,EAAI,EAAI,GACzB,IAAO,EAAI,EAAK,EAAI,GAAK,IAAG,EAAM,EAAM,IAAM,GAAc,OAE3D,EAAI,EAAI,GAAK,IAAK,EAAM,EAAI,MAAM,EAAG,GAAK,IAAM,EAAI,MAAM,IAC3D,IAAO,EAAI,EAAK,GAAO,IACrB,EAAI,IAAM,IAAK,GAAO,KAC1B,GAAO,GAAc,KAIlB,CACT,CAIA,SAAS,GAAkB,EAAQ,GACjC,IAAI,EAAI,EAAO,GAGf,IAAM,GAv9FK,EAu9FU,GAAK,GAAI,GAAK,GAAI,IACvC,OAAO,CACT,CAGA,SAAS,GAAQ,EAAM,EAAI,GACzB,GAAI,EAAK,GAKP,MAFA,MACI,IAAI,EAAK,UAAY,GACnB,MAAM,IAEd,OAAO,GAAS,IAAI,EAAK,IAAO,EAAI,KACtC,CAGA,SAAS,GAAM,EAAM,EAAI,GACvB,GAAI,EAAK,GAAc,MAAM,MAAM,IACnC,OAAO,GAAS,IAAI,EAAK,IAAK,EAAI,KACpC,CAGA,SAAS,GAAa,GACpB,IAAI,EAAI,EAAO,OAAS,EACtB,EAh/FS,EAg/FH,EAAe,EAKvB,GAHA,EAAI,EAAO,GAGJ,CAGL,KAAO,EAAI,IAAM,EAAG,GAAK,GAAI,IAG7B,IAAK,EAAI,EAAO,GAAI,GAAK,GAAI,GAAK,GAAI,GACxC,CAEA,OAAO,CACT,CAGA,SAAS,GAAc,GAErB,QADI,EAAK,GACF,KAAM,GAAM,IACnB,OAAO,CACT,CAUA,SAAS,GAAO,EAAM,EAAG,EAAG,GAC1B,IAAI,EACF,EAAI,IAAI,EAAK,GAIb,EAAI,KAAK,KAAK,EAthGL,EAshGqB,GAIhC,IAFA,QAES,CAOP,GANI,EAAI,GAEF,IADJ,EAAI,EAAE,MAAM,IACG,EAAG,KAAI,MAId,KADV,EAAI,GAAU,EAAI,IACL,CAGX,EAAI,EAAE,EAAE,OAAS,EACb,GAA0B,IAAX,EAAE,EAAE,MAAY,EAAE,EAAE,GACvC,KACF,CAGA,IADA,EAAI,EAAE,MAAM,IACD,EAAG,EAChB,CAIA,OAFA,MAEO,CACT,CAGA,SAAS,GAAM,GACb,OAA6B,EAAtB,EAAE,EAAE,EAAE,EAAE,OAAS,EAC1B,CAMA,SAAS,GAAS,EAAM,EAAM,GAK5B,QAJI,EAAG,EACL,EAAI,IAAI,EAAK,EAAK,IAClB,EAAI,IAEG,EAAI,EAAK,QAAS,CAIzB,KAHA,EAAI,IAAI,EAAK,EAAK,KAGX,EAAG,CACR,EAAI,EACJ,KACF,GAEA,EAAI,EAAE,IAAI,MAEA,GAAW,IAAN,GAAW,EAAE,IAAM,KAChC,EAAI,EAER,CAEA,OAAO,CACT,CAkCA,SAAS,GAAmB,EAAG,GAC7B,IAAI,EAAa,EAAO,EAAG,EAAK,EAAK,EAAG,EACtC,EAAM,EACN,EAAI,EACJ,EAAI,EACJ,EAAO,EAAE,YACT,EAAK,EAAK,SACV,EAAK,EAAK,UAGZ,IAAK,EAAE,IAAM,EAAE,EAAE,IAAM,EAAE,EAAI,GAE3B,OAAO,IAAI,EAAK,EAAE,EACb,EAAE,EAAE,GAAS,EAAE,EAAI,EAAI,EAAI,IAAlB,EACV,EAAE,EAAI,EAAE,EAAI,EAAI,EAAI,EAAI,KAa9B,IAVU,MAAN,GACF,MACA,EAAM,GAEN,EAAM,EAGR,EAAI,IAAI,EAAK,QAGN,EAAE,MAGP,EAAI,EAAE,MAAM,GACZ,GAAK,EAUP,IAJA,GADA,EAAQ,KAAK,IAAI,GAAQ,EAAG,IAAM,KAAK,KAAO,EAAI,EAAI,EAEtD,EAAc,EAAM,EAAM,IAAI,EAAK,GACnC,EAAK,UAAY,IAER,CAKP,GAJA,EAAM,GAAS,EAAI,MAAM,GAAI,EAAK,GAClC,EAAc,EAAY,QAAQ,GAG9B,IAFJ,EAAI,EAAI,KAAK,GAAO,EAAK,EAAa,EAAK,KAEtB,GAAG,MAAM,EAAG,KAAS,GAAe,EAAI,GAAG,MAAM,EAAG,GAAM,CAE7E,IADA,EAAI,EACG,KAAK,EAAM,GAAS,EAAI,MAAM,GAAM,EAAK,GAOhD,GAAU,MAAN,EAYF,OADA,EAAK,UAAY,EACV,EAVP,KAAI,EAAM,GAAK,GAAoB,EAAI,EAAG,EAAM,EAAO,EAAI,IAMzD,OAAO,GAAS,EAAK,EAAK,UAAY,EAAI,EAAI,OAL9C,EAAK,UAAY,GAAO,GACxB,EAAc,EAAM,EAAI,IAAI,EAAK,GACjC,EAAI,EACJ,GAQN,CAEA,EAAM,CACR,CACF,CAkBA,SAAS,GAAiB,EAAG,GAC3B,IAAI,EAAG,EAAI,EAAa,EAAG,EAAW,EAAK,EAAK,EAAG,EAAK,EAAI,EAC1D,EAAI,EAEJ,EAAI,EACJ,EAAK,EAAE,EACP,EAAO,EAAE,YACT,EAAK,EAAK,SACV,EAAK,EAAK,UAGZ,GAAI,EAAE,EAAI,IAAM,IAAO,EAAG,KAAO,EAAE,GAAc,GAAT,EAAG,IAAwB,GAAb,EAAG,OACvD,OAAO,IAAI,EAAK,IAAO,EAAG,QAAqB,GAAP,EAAE,EAAS,IAAM,EAAK,EAAI,GAcpE,GAXU,MAAN,GACF,MACA,EAAM,GAEN,EAAM,EAGR,EAAK,UAAY,GAnBP,GAqBV,GADA,EAAI,GAAe,IACZ,OAAO,KAEV,KAAK,IAAI,EAAI,EAAE,GAAK,OAqCtB,OAJA,EAAI,GAAQ,EAAM,EAAM,EAAG,GAAI,MAAM,EAAI,IACzC,EAAI,GAAiB,IAAI,EAAK,EAAK,IAAM,EAAE,MAAM,IAAK,EAzD9C,IAyD2D,KAAK,GACxE,EAAK,UAAY,EAEJ,MAAN,EAAa,GAAS,EAAG,EAAI,EAAI,OAAmB,EAxB3D,KAAO,EAAK,GAAW,GAAN,GAAiB,GAAN,GAAW,EAAE,OAAO,GAAK,GAGnD,GADA,EAAI,IADJ,EAAI,EAAE,MAAM,IACS,IACd,OAAO,GACd,IAiCJ,IA9BE,EAAI,EAAE,EAEF,EAAK,GACP,EAAI,IAAI,EAAK,KAAO,GACpB,KAEA,EAAI,IAAI,EAAK,EAAK,IAAM,EAAE,MAAM,IAepC,EAAK,EAKL,EAAM,EAAY,EAAI,GAAO,EAAE,MAAM,GAAI,EAAE,KAAK,GAAI,EAAK,GACzD,EAAK,GAAS,EAAE,MAAM,GAAI,EAAK,GAC/B,EAAc,IAEL,CAIP,GAHA,EAAY,GAAS,EAAU,MAAM,GAAK,EAAK,GAG3C,IAFJ,EAAI,EAAI,KAAK,GAAO,EAAW,IAAI,EAAK,GAAc,EAAK,KAEtC,GAAG,MAAM,EAAG,KAAS,GAAe,EAAI,GAAG,MAAM,EAAG,GAAM,CAc7E,GAbA,EAAM,EAAI,MAAM,GAIN,IAAN,IAAS,EAAM,EAAI,KAAK,GAAQ,EAAM,EAAM,EAAG,GAAI,MAAM,EAAI,MACjE,EAAM,GAAO,EAAK,IAAI,EAAK,GAAI,EAAK,GAQ1B,MAAN,EAWF,OADA,EAAK,UAAY,EACV,EAVP,IAAI,GAAoB,EAAI,EAAG,EA5F3B,GA4FwC,EAAI,GAM9C,OAAO,GAAS,EAAK,EAAK,UAAY,EAAI,EAAI,OAL9C,EAAK,UAAY,GA7Ff,GA8FF,EAAI,EAAY,EAAI,GAAO,EAAG,MAAM,GAAI,EAAG,KAAK,GAAI,EAAK,GACzD,EAAK,GAAS,EAAE,MAAM,GAAI,EAAK,GAC/B,EAAc,EAAM,CAQ1B,CAEA,EAAM,EACN,GAAe,CACjB,CACF,CAIA,SAAS,GAAkB,GAEzB,OAAO,OAAO,EAAE,EAAI,EAAE,EAAI,EAC5B,CAMA,SAAS,GAAa,EAAG,GACvB,IAAI,EAAG,EAAG,EAoBV,KAhBK,EAAI,EAAI,QAAQ,WAAY,EAAM,EAAI,QAAQ,IAAK,MAGnD,EAAI,EAAI,OAAO,OAAS,GAGvB,EAAI,IAAG,EAAI,GACf,IAAM,EAAI,MAAM,EAAI,GACpB,EAAM,EAAI,UAAU,EAAG,IACd,EAAI,IAGb,EAAI,EAAI,QAIL,EAAI,EAAyB,KAAtB,EAAI,WAAW,GAAW,KAGtC,IAAK,EAAM,EAAI,OAAoC,KAA5B,EAAI,WAAW,EAAM,KAAa,GAGzD,GAFA,EAAM,EAAI,MAAM,EAAG,GAEV,CAYP,GAXA,GAAO,EACP,EAAE,EAAI,EAAI,EAAI,EAAI,EAClB,EAAE,EAAI,GAMN,GAAK,EAAI,GA/2GA,EAg3GL,EAAI,IAAG,GAh3GF,GAk3GL,EAAI,EAAK,CAEX,IADI,GAAG,EAAE,EAAE,MAAM,EAAI,MAAM,EAAG,IACzB,GAp3GE,EAo3Ge,EAAI,GAAM,EAAE,EAAE,MAAM,EAAI,MAAM,EAAG,GAp3GhD,IAs3GP,EAt3GO,GAq3GP,EAAM,EAAI,MAAM,IACG,MACrB,MACE,GAAK,EAGP,KAAO,KAAM,GAAO,IACpB,EAAE,EAAE,MAAM,GAEN,KAGE,EAAE,EAAI,EAAE,YAAY,MAGtB,EAAE,EAAI,KACN,EAAE,EAAI,KAGG,EAAE,EAAI,EAAE,YAAY,OAG7B,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,IAIb,MAGE,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,GAGT,OAAO,CACT,CAMA,SAAS,GAAW,EAAG,GACrB,IAAI,EAAM,EAAM,EAAS,EAAG,EAAS,EAAK,EAAG,EAAI,EAEjD,GAAI,EAAI,QAAQ,SAEd,GADA,EAAM,EAAI,QAAQ,eAAgB,MAC9B,GAAU,KAAK,GAAM,OAAO,GAAa,EAAG,WAC/B,aAAR,GAA8B,QAAR,EAI/B,OAHM,IAAK,EAAE,EAAI,KACjB,EAAE,EAAI,IACN,EAAE,EAAI,KACC,EAGT,GAAI,GAAM,KAAK,GACb,EAAO,GACP,EAAM,EAAI,sBACD,GAAS,KAAK,GACvB,EAAO,MACF,KAAI,GAAQ,KAAK,GAGtB,MAAM,MAAM,GAAkB,GAF9B,EAAO,CAGT,CA+BA,KA5BA,EAAI,EAAI,OAAO,OAEP,GACN,GAAK,EAAI,MAAM,EAAI,GACnB,EAAM,EAAI,UAAU,EAAG,IAEvB,EAAM,EAAI,MAAM,GAMlB,GADA,EAAI,EAAI,QAAQ,OACD,EACf,EAAO,EAAE,YAEL,IAGF,GADA,GADA,EAAM,EAAI,QAAQ,IAAK,KACb,QACA,EAGV,EAAU,GAAO,EAAM,IAAI,EAAK,GAAO,EAAO,EAAJ,IAOvC,EAHL,GADA,EAAK,GAAY,EAAK,EAAM,KACpB,OAAS,EAGM,IAAV,EAAG,KAAY,EAAG,EAAG,MAClC,OAAI,EAAI,EAAU,IAAI,EAAW,EAAN,EAAE,IAC7B,EAAE,EAAI,GAAkB,EAAI,GAC5B,EAAE,EAAI,EACN,MAQI,IAAS,EAAI,GAAO,EAAG,EAAe,EAAN,IAGhC,IAAG,EAAI,EAAE,MAAM,KAAK,IAAI,GAAK,GAAK,GAAQ,EAAG,GAAK,GAAQ,IAAI,EAAG,KACrE,MAEO,EACT,CA0CA,SAAS,GAAa,EAAM,EAAG,EAAG,EAAG,GAChC,IAAC,EAAG,EAAG,EAAG,EAEX,EAAK,EAAK,UACV,EAAI,KAAK,KAAK,EAphHL,GA0hHX,IAJA,MACA,EAAK,EAAE,MAAM,GACb,EAAI,IAAI,EAAK,KAEJ,CAMP,GALA,EAAI,GAAO,EAAE,MAAM,GAAK,IAAI,EAAK,IAAM,KAAM,EAAI,GACjD,EAAI,EAAe,EAAE,KAAK,GAAK,EAAE,MAAM,GACvC,EAAI,GAAO,EAAE,MAAM,GAAK,IAAI,EAAK,IAAM,KAAM,EAAI,aACjD,EAAI,EAAE,KAAK,IAEL,EAAE,GAAe,CACrB,IAAK,EAAI,EAAG,EAAE,EAAE,KAAO,EAAE,EAAE,IAAM,MACjC,OAAI,EAAS,KACf,CAEA,EAAI,EACJ,EAAI,EACJ,EAAI,EACJ,EAAI,CAEN,CAKA,OAHA,MACA,EAAE,EAAE,OAAS,EAAI,EAEV,CACT,CAIA,SAAS,GAAQ,EAAG,GAElB,QADI,EAAI,IACC,GAAG,GAAK,EACjB,OAAO,CACT,CAIA,SAAS,GAAiB,EAAM,GAC9B,IAAI,EACF,EAAQ,EAAE,EAAI,EACd,EAAK,GAAM,EAAM,EAAK,UAAW,GACjC,EAAS,EAAG,MAAM,IAIpB,IAFA,EAAI,EAAE,OAEA,IAAI,GAER,OADA,GAAW,EAAQ,EAAI,EAChB,EAKT,IAFA,EAAI,EAAE,SAAS,IAET,SACJ,GAAW,EAAQ,EAAI,MAClB,CAIL,IAHA,EAAI,EAAE,MAAM,EAAE,MAAM,KAGd,IAAI,GAER,OADA,GAAW,GAAM,GAAM,EAAQ,EAAI,EAAM,EAAQ,EAAI,EAC9C,EAGT,GAAW,GAAM,GAAM,EAAQ,EAAI,EAAM,EAAQ,EAAI,CACvD,CAEA,OAAO,EAAE,MAAM,GAAI,KACrB,CAQA,SAAS,GAAe,EAAG,EAAS,EAAI,GACtC,IAAI,EAAM,EAAG,EAAG,EAAG,EAAK,EAAS,EAAK,EAAI,EACxC,EAAO,EAAE,YACT,WAAQ,EAWV,GATI,GACF,GAAW,EAAI,EAAG,aACd,EAAe,EAAK,EAAK,SACxB,GAAW,EAAI,EAAG,KAEvB,EAAK,EAAK,UACV,EAAK,EAAK,UAGP,EAAE,WAEA,CAoCL,IA3BI,GACF,EAAO,EACQ,IAAX,EACF,EAAU,EAAL,EAAS,EACM,GAAX,IACT,EAAU,EAAL,EAAS,IAGhB,EAAO,GAfT,GADA,EAAM,GAAe,IACb,QAAQ,OAsBP,IACP,EAAM,EAAI,QAAQ,IAAK,KACvB,EAAI,IAAI,EAAK,IACX,EAAI,EAAI,OAAS,EACnB,EAAE,EAAI,GAAY,GAAe,GAAI,GAAI,GACzC,EAAE,EAAI,EAAE,EAAE,QAIZ,EAAI,GADJ,EAAK,GAAY,EAAK,GAAI,IACb,OAGO,GAAb,IAAK,IAAY,EAAG,MAE3B,GAAK,EAAG,GAED,CAyBL,GAxBI,EAAI,EACN,MAEA,EAAI,IAAI,EAAK,IACX,EAAI,EACN,EAAE,EAAI,EAEN,GADA,EAAI,GAAO,EAAG,EAAG,EAAI,EAAI,EAAG,IACrB,EACP,EAAI,EAAE,EACN,EAAU,IAIZ,EAAI,EAAG,GACP,EAAI,EAAO,EACX,EAAU,YAAW,EAAG,EAAK,GAE7B,EAAU,EAAK,QACV,OAAgB,KAAoB,IAAP,GAAY,KAAQ,EAAE,EAAI,EAAI,EAAI,IAChE,EAAI,GAAK,IAAM,IAAa,IAAP,GAAY,GAAkB,IAAP,GAAyB,EAAb,EAAG,EAAK,IAChE,KAAQ,EAAE,EAAI,EAAI,EAAI,IAE1B,EAAG,OAAS,EAER,EAGF,OAAS,IAAK,GAAM,EAAO,GACzB,EAAG,GAAM,EACJ,MACD,EACF,EAAG,QAAQ,IAMjB,IAAK,EAAM,EAAG,QAAS,EAAG,EAAM,KAAM,GAGtC,IAAK,EAAI,EAAG,EAAM,GAAI,EAAI,EAAK,IAAK,GAAO,GAAS,OAAO,EAAG,IAG9D,GAAI,EAAO,CACT,GAAI,EAAM,EACR,GAAe,IAAX,GAA4B,GAAX,EAAc,CAEjC,IADA,EAAe,IAAX,EAAgB,EAAI,IACjB,EAAK,EAAM,EAAG,IAAO,GAAO,IAEnC,IAAK,GADL,EAAK,GAAY,EAAK,EAAM,IACd,QAAS,EAAG,EAAM,KAAM,GAGtC,IAAK,EAAI,EAAG,EAAM,KAAM,EAAI,EAAK,IAAK,GAAO,GAAS,OAAO,EAAG,GAClE,MACE,EAAM,EAAI,OAAO,GAAK,IAAM,EAAI,MAAM,GAI1C,EAAO,GAAO,EAAI,EAAI,IAAM,MAAQ,CACtC,SAAW,EAAI,EAAG,CAChB,OAAS,GAAI,EAAM,IAAM,EACzB,EAAM,KAAO,CACf,WACQ,EAAI,EAAK,IAAK,GAAK,EAAK,KAAO,GAAO,SACnC,EAAI,IAAK,EAAM,EAAI,MAAM,EAAG,GAAK,IAAM,EAAI,MAAM,GAE9D,MApEE,EAAM,EAAQ,OAAS,IAsEzB,GAAkB,IAAX,EAAgB,KAAkB,GAAX,EAAe,KAAkB,GAAX,EAAe,KAAO,IAAM,CAClF,MA/GE,EAAM,GAAkB,GAiH1B,OAAO,EAAE,EAAI,EAAI,IAAM,EAAM,CAC/B,CAIA,SAAS,GAAS,EAAK,GACrB,GAAI,EAAI,OAAS,EAEf,OADA,EAAI,OAAS,IAGjB,CAyDA,SAAS,GAAI,GACX,OAAO,IAAI,KAAK,GAAG,KACrB,CASA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAUA,SAAS,GAAM,GACb,OAAO,IAAI,KAAK,GAAG,OACrB,CAWA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,KAAK,EAC1B,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAUA,SAAS,GAAM,GACb,OAAO,IAAI,KAAK,GAAG,OACrB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAUA,SAAS,GAAM,GACb,OAAO,IAAI,KAAK,GAAG,OACrB,CA4BA,SAAS,GAAM,EAAG,GAChB,EAAI,IAAI,KAAK,GACb,EAAI,IAAI,KAAK,GACb,IAAI,EACF,EAAK,KAAK,UACV,EAAK,KAAK,SACV,EAAM,EAAK,EAkCb,OA/BK,EAAE,GAAM,EAAE,EAIH,EAAE,GAAM,EAAE,GAKV,EAAE,GAAK,EAAE,UACnB,EAAI,EAAE,EAAI,EAAI,GAAM,KAAM,EAAI,GAAM,IAAI,KAAK,IAC3C,EAAI,EAAE,GAGE,EAAE,GAAK,EAAE,UACnB,EAAI,GAAM,KAAM,EAAK,GAAG,MAAM,KAC5B,EAAI,EAAE,EAGC,EAAE,EAAI,GACf,KAAK,UAAY,EACjB,KAAK,SAAW,EAChB,EAAI,KAAK,KAAK,GAAO,EAAG,EAAG,EAAK,IAChC,EAAI,GAAM,KAAM,EAAK,GACrB,KAAK,UAAY,EACjB,KAAK,SAAW,EAChB,EAAI,EAAE,EAAI,EAAI,EAAE,MAAM,GAAK,EAAE,KAAK,IAElC,EAAI,KAAK,KAAK,GAAO,EAAG,EAAG,EAAK,KAvBhC,EAAI,GAAM,KAAM,EAAK,GAAG,MAAM,EAAE,EAAI,EAAI,IAAO,MAC7C,EAAI,EAAE,EALR,EAAI,IAAI,KAAK,KA8BR,CACT,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CASA,SAAS,GAAK,GACZ,OAAO,GAAS,EAAI,IAAI,KAAK,GAAI,EAAE,EAAI,EAAG,EAC5C,CAWA,SAAS,GAAM,EAAG,EAAK,GACrB,OAAO,IAAI,KAAK,GAAG,MAAM,EAAK,EAChC,CAqBA,SAAS,GAAO,GACd,IAAK,GAAsB,iBAAR,EAAkB,MAAM,MAAM,GAAe,mBAChE,IAAI,EAAG,EAAG,EACR,GAAkB,IAAJ,EAAI,SAClB,EAAK,CACH,YAAa,EAAG,GAChB,WAAY,EAAG,EACf,YAAa,GAAW,EACxB,WAAY,EAAG,GACf,OAAQ,EAAG,GACX,QAAS,GAAW,EACpB,SAAU,EAAG,GAGjB,IAAK,EAAI,EAAG,EAAI,EAAG,OAAQ,GAAK,EAE9B,GADI,EAAI,EAAG,GAAI,IAAa,KAAK,GAAK,GAAS,SAClC,KAAR,EAAI,EAAI,IAAgB,CAC3B,KAAI,GAAU,KAAO,GAAK,GAAK,EAAG,EAAI,IAAM,GAAK,EAAG,EAAI,IACnD,MAAM,MAAM,GAAkB,EAAI,KAAO,GADc,KAAK,GAAK,CAExE,CAIF,GADI,EAAI,SAAU,IAAa,KAAK,GAAK,GAAS,cAC7C,EAAI,EAAI,IAAgB,CAC3B,QAAI,QAAc,GAAqB,IAAN,GAAiB,IAAN,EAY1C,MAAM,MAAM,GAAkB,EAAI,KAAO,GAXzC,GAAI,EAAG,CACL,UAAW,OAAU,MAAe,SACjC,OAAO,kBAAmB,OAAO,YAGlC,MAAM,MAAM,IAFZ,KAAK,KAIT,MACE,KAAK,KAKX,CAEA,OAAO,IACT,CAUA,SAAS,GAAI,GACX,OAAO,IAAI,KAAK,GAAG,KACrB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAkNA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAUA,SAAS,GAAI,GACX,OAAO,IAAI,KAAK,GAAG,KACrB,CASA,SAAS,GAAM,GACb,OAAO,GAAS,EAAI,IAAI,KAAK,GAAI,EAAE,EAAI,EAAG,EAC5C,CAYA,SAAS,KACP,IAAI,EAAG,EACL,EAAI,IAAI,KAAK,GAIf,IAFA,MAEK,EAAI,EAAG,EAAI,UAAU,QAExB,IADA,EAAI,IAAI,KAAK,UAAU,OAChB,EAMI,EAAE,IACX,EAAI,EAAE,KAAK,EAAE,MAAM,SAPX,CACR,GAAI,EAAE,EAEJ,OADA,MACO,IAAI,KAAK,KAElB,EAAI,CACN,CAOF,OAFA,MAEO,EAAE,MACX,CAQA,SAAS,GAAkB,GACzB,OAAO,aAAe,IAAW,GAAO,EAAI,cAAgB,MAC9D,CAUA,SAAS,GAAG,GACV,OAAO,IAAI,KAAK,GAAG,IACrB,CAaA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAUA,SAAS,GAAM,GACb,OAAO,IAAI,KAAK,GAAG,IAAI,GACzB,CASA,SAAS,KACP,OAAO,GAAS,KAAM,aACxB,CASA,SAAS,KACP,OAAO,GAAS,KAAM,UAAW,EACnC,CAWA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAWA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAWA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAWA,SAAS,GAAO,GACd,IAAI,EAAG,EAAG,EAAG,EACX,EAAI,EACJ,EAAI,IAAI,KAAK,GACb,EAAK,GAOP,YALI,EAAe,EAAK,KAAK,UACxB,GAAW,EAAI,EAAG,IAEvB,EAAI,KAAK,KAAK,EAr9IH,GAu9IN,KAAK,OAIH,GAAI,OAAO,gBAGhB,IAFA,EAAI,OAAO,gBAAgB,IAAI,YAAY,IAEpC,EAAI,IACT,EAAI,EAAE,KAIG,MACP,EAAE,GAAK,OAAO,gBAAgB,IAAI,YAAY,IAAI,GAKlD,EAAG,KAAO,EAAI,QAKb,KAAI,OAAO,YAwBhB,MAAM,MAAM,IAnBZ,IAFA,EAAI,OAAO,YAAY,GAAK,GAErB,EAAI,IAGT,EAAI,EAAE,IAAM,EAAE,EAAI,IAAM,IAAM,EAAE,EAAI,IAAM,MAAmB,IAAX,EAAE,EAAI,KAAc,MAG7D,MACP,OAAO,YAAY,GAAG,KAAK,EAAG,IAK9B,EAAG,KAAK,EAAI,KACZ,GAAK,GAIT,EAAI,EAAI,CAGV,MA/CE,KAAO,EAAI,GAAI,EAAG,KAAuB,IAAhB,KAAK,SAAiB,EA2DjD,IATA,GA1gJW,GAygJX,EAAI,IAAK,KAIA,IACP,EAAI,GAAQ,GA9gJH,EA8gJkB,GAC3B,EAAG,IAAM,EAAI,EAAI,GAAK,GAIP,IAAV,EAAG,GAAU,IAAK,EAAG,MAG5B,GAAI,EAAI,EACN,EAAI,EACJ,EAAK,CAAC,OACD,CAIL,IAHA,KAGiB,IAAV,EAAG,GAAU,GA7hJX,EA6hJ0B,EAAG,QAGtC,IAAK,EAAI,EAAG,EAAI,EAAG,GAAI,GAAK,GAAI,GAAK,GAAI,IAGrC,EAniJK,IAmiJS,GAniJT,EAmiJyB,EACpC,CAKA,OAHA,EAAE,EAAI,EACN,EAAE,EAAI,EAEC,CACT,CAWA,SAAS,GAAM,GACb,OAAO,GAAS,EAAI,IAAI,KAAK,GAAI,EAAE,EAAI,EAAG,KAAK,SACjD,CAcA,SAAS,GAAK,GAEZ,OADA,EAAI,IAAI,KAAK,IACJ,EAAK,EAAE,EAAE,GAAK,EAAE,EAAI,EAAI,EAAE,EAAK,EAAE,GAAK,GACjD,CAUA,SAAS,GAAI,GACX,OAAO,IAAI,KAAK,GAAG,KACrB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CAWA,SAAS,GAAI,EAAG,GACd,OAAO,IAAI,KAAK,GAAG,IAAI,EACzB,CAYA,SAAS,KACP,IAAI,EAAI,EACN,EAAO,UACP,EAAI,IAAI,KAAK,EAAK,IAGpB,IADA,MACO,EAAE,KAAO,EAAI,EAAK,QAAS,EAAI,EAAE,KAAK,EAAK,IAGlD,OAFA,MAEO,GAAS,EAAG,KAAK,UAAW,KAAK,SAC1C,CAUA,SAAS,GAAI,GACX,OAAO,IAAI,KAAK,GAAG,KACrB,CAUA,SAAS,GAAK,GACZ,OAAO,IAAI,KAAK,GAAG,MACrB,CASA,SAAS,GAAM,GACb,OAAO,GAAS,EAAI,IAAI,KAAK,GAAI,EAAE,EAAI,EAAG,EAC5C,CAGA,EAAE,OAAO,IAAI,+BAAiC,EAAE,SAChD,EAAE,OAAO,aAAe,UAGjB,IAAI,GAAU,EAAE,qBAvnBd,EAAM,GACb,IAAI,EAAG,EAAG,EASV,SAAS,EAAQ,GACf,IAAI,EAAG,EAAG,EACR,EAAI,KAGN,KAAM,aAAa,GAAU,OAAO,IAAI,EAAQ,GAMhD,GAFA,EAAE,YAAc,EAEZ,GAAkB,GAuBpB,OAtBA,EAAE,EAAI,EAAE,OAEJ,IACG,EAAE,GAAK,EAAE,EAAI,EAAQ,MAGxB,EAAE,EAAI,IACN,EAAE,EAAI,MACG,EAAE,EAAI,EAAQ,MAGvB,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,KAEP,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EAAE,UAGZ,EAAE,EAAI,EAAE,EACR,EAAE,EAAI,EAAE,EAAI,EAAE,EAAE,QAAU,EAAE,IAQhC,GAAU,WAFV,SAAW,GAES,CAClB,GAAU,IAAN,EAIF,OAHA,EAAE,EAAI,EAAI,EAAI,KAAS,EACvB,EAAE,EAAI,OACN,EAAE,EAAI,CAAC,IAYT,GARI,EAAI,GACN,GAAK,EACL,EAAE,MAEF,EAAE,EAAI,EAIJ,MAAQ,GAAK,EAAI,IAAK,CACxB,IAAK,EAAI,EAAG,EAAI,EAAG,GAAK,GAAI,GAAK,GAAI,IAkBrC,YAhBI,GACE,EAAI,EAAQ,MACd,EAAE,EAAI,IACN,EAAE,EAAI,MACG,EAAI,EAAQ,MACrB,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,KAEP,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,KAGT,EAAE,EAAI,EACN,EAAE,EAAI,CAAC,IAIX,CAGA,OAAQ,EAAJ,GAAU,GACP,IAAG,EAAE,EAAI,KACd,EAAE,EAAI,SACN,EAAE,EAAI,OAID,GAAa,EAAG,EAAE,WAC3B,CAEA,GAAU,WAAN,EASF,OAR8B,MAAzB,EAAI,EAAE,WAAW,KACpB,EAAI,EAAE,MAAM,GACZ,EAAE,OAEQ,KAAN,IAAU,EAAI,EAAE,MAAM,IAC1B,EAAE,EAAI,GAGD,GAAU,KAAK,GAAK,GAAa,EAAG,GAAK,GAAW,EAAG,GAGhE,GAAU,WAAN,EAQF,OAPI,EAAI,GACN,GAAK,EACL,EAAE,MAEF,EAAE,EAAI,EAGD,GAAa,EAAG,EAAE,YAG3B,MAAM,MAAM,GAAkB,EAChC,CA2DA,GAzDA,EAAQ,UAAY,EAEpB,EAAQ,SAAW,EACnB,EAAQ,WAAa,EACrB,EAAQ,WAAa,EACrB,EAAQ,YAAc,EACtB,EAAQ,cAAgB,EACxB,EAAQ,gBAAkB,EAC1B,EAAQ,gBAAkB,EAC1B,EAAQ,gBAAkB,EAC1B,EAAQ,iBAAmB,EAC3B,EAAQ,OAAS,EAEjB,EAAQ,OAAS,EAAQ,IAAM,GAC/B,EAAQ,MAAQ,EAChB,EAAQ,UAAY,GAEpB,EAAQ,IAAM,GACd,EAAQ,KAAO,GACf,EAAQ,MAAQ,GAChB,EAAQ,IAAM,GACd,EAAQ,KAAO,GACf,EAAQ,MAAQ,GAChB,EAAQ,KAAO,GACf,EAAQ,MAAQ,GAChB,EAAQ,MAAQ,GAChB,EAAQ,KAAO,GACf,EAAQ,KAAO,GACf,EAAQ,MAAQ,GAChB,EAAQ,IAAM,GACd,EAAQ,KAAO,GACf,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,MAAQ,GAChB,EAAQ,MAAQ,GAChB,EAAQ,GAAK,GACb,EAAQ,IAAM,GACd,EAAQ,MAAQ,GAChB,EAAQ,KAAO,GACf,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,OAAS,GACjB,EAAQ,MAAQ,GAChB,EAAQ,KAAO,GACf,EAAQ,IAAM,GACd,EAAQ,KAAO,GACf,EAAQ,KAAO,GACf,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,IAAM,GACd,EAAQ,KAAO,GACf,EAAQ,MAAQ,YAEZ,IAAgB,EAAM,IACtB,QACE,EAAI,SAEN,IADA,EAAK,CAAC,YAAa,WAAY,WAAY,WAAY,OAAQ,OAAQ,SAAU,UAC5E,EAAI,EAAG,EAAI,EAAG,QAAc,EAAI,eAAe,EAAI,EAAG,QAAO,EAAI,GAAK,KAAK,IAMpF,OAFA,EAAQ,OAAO,GAER,CACT,CAwbuB,CAAoB,IAG3C,GAAO,IAAI,GAAQ,IACnB,GAAK,IAAI,GAAQ,IC7yJjB,IAEW,GAAsC,GAFtC,YACQ,CAAC,MAAO,WACkD,IAC3E,IAAI,GACF,EAAE,OACF,GACE,EACA,EAAY,GAAQ,MAAM,CAC5B,UAAW,EAAO,UAClB,OAAQ,GAAQ,SA0ClB,OAxCA,EAAU,UAAY,OAAO,OAAO,EAAU,WAK9C,EAAU,UAAU,KAAO,YAC3B,EAAU,UAAU,eAQpB,EAAU,UAAU,OAAS,WAC3B,MAAO,CACL,OAAQ,YACR,MAAO,KAAK,WAEhB,EAQA,EAAU,SAAW,SAAU,GAC7B,OAAO,IAAI,EAAU,EAAK,MAC5B,EACI,GAEF,EAAG,mBAAoB,EAAM,GACvB,EAAK,YAAc,EAAK,WAC1B,EAAU,OAAO,CACf,UAAW,EAAK,WAGtB,IAEK,CAAS,GACf,CACD,aCxBF,MAAM,GAAO,KAAK,MAAQ,SAAU,GAClC,OAAO,KAAK,IAAI,GAAK,KAAO,EAAI,EAAmC,IAA9B,KAAK,IAAI,GAAK,KAAK,KAAK,GAC/D,EAEM,GAAO,KAAK,MAAQ,SAAU,GAClC,OAAO,KAAK,IAAI,GAAK,KAAO,EAAmC,IAA9B,KAAK,IAAI,GAAK,KAAK,KAAK,GAC3D,EA6CM,GAAQ,SAAU,EAAG,GASzB,OAPA,EAAI,KAAK,IAAI,KACb,EAAI,KAAK,IAAI,OAGD,EAAG,GAAK,CAAC,EAAG,IAGpB,EAAI,IAAY,KAAK,KAAK,EAAI,EAAI,EAAI,IAG1C,GAAK,EACE,EAAI,KAAK,KAAK,EAAI,EAAI,GAC/B,EAEM,GAAc,WAClB,MAAM,YAAY,gBACpB,EASA,SAAS,GAAS,EAAG,GAEnB,MAAM,EAAK,KAAK,IAAI,GACd,EAAK,KAAK,IAAI,GAEpB,OAAU,IAAN,EACK,KAAK,IAAI,GAGR,IAAN,EACK,KAAK,IAAI,GAGd,EAAK,KAAQ,EAAK,IACa,GAA1B,KAAK,IAAI,EAAI,EAAI,EAAI,IAmC9B,GAAQ,GACR,GAAQ,GAED,GAAM,KAAK,IAAI,EAAI,EAAI,EAAI,GAAK,KAAK,IAC9C,CAEA,MAAM,GAAI,CAAE,GAAM,EAAG,GAAM,GACrB,GAAQ,SAAU,EAAG,GAEzB,MAAM,EAAI,GAEV,GAAI,QACF,EAAM,GACJ,EAAM,GAAI,eACP,IAAI,EACT,EAAM,GAAI,EACV,EAAM,GAAI,OAEV,cAAe,GAEb,IAAK,SAEH,GAAI,OAAQ,GAAK,OAAQ,EACvB,EAAM,GAAI,EAAM,GAChB,EAAM,GAAI,EAAM,QAAA,GACP,QAAS,GAAK,QAAS,EAAG,CACnC,IAAK,SAAS,EAAO,MAAM,SAAS,EAAO,KACzC,OAAO,EAAkB,SAE3B,EAAM,GAAI,EAAO,IAAI,KAAK,IAAI,EAAO,KACrC,EAAM,GAAI,EAAO,IAAI,KAAK,IAAI,EAAO,IACvC,SAAW,MAAO,GAAK,QAAS,EAAG,CACjC,IAAK,SAAS,EAAK,IAAM,SAAS,EAAO,KACvC,OAAO,EAAkB,SAE3B,EAAM,GAAI,EAAK,EAAI,KAAK,IAAI,EAAO,KACnC,EAAM,GAAI,EAAK,EAAI,KAAK,IAAI,EAAO,IACrC,MAAwB,IAAb,EAAE,QACX,EAAM,GAAI,EAAE,GACZ,EAAM,GAAI,EAAE,IAEZ,KAEF,MAEF,IAAK,SAEH,EAAM,GACN,EAAM,GAAI,EAEV,MAAM,EAAS,EAAE,QAAQ,KAAM,IAC5B,MAAM,yCACT,IAAI,EAAO,EACP,EAAQ,EAEG,OAAX,GACF,KAGF,QAAS,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CAEtC,MAAM,EAAI,EAAO,GAEP,MAAN,GAAmB,OAAN,GAAoB,OAAN,IAEd,MAAN,EACT,IACe,MAAN,EACT,IACe,MAAN,GAAmB,MAAN,GAElB,EAAO,IAAU,GACnB,KAGoB,MAAlB,EAAO,EAAI,IAAe,MAAM,EAAO,EAAI,IAI7C,EAAM,IAAK,YAAY,EAAQ,EAAI,IAAM,IAAM,MAH/C,EAAM,IAAK,YAAY,EAAQ,EAAI,IAAM,IAAM,EAAO,EAAI,IAC1D,KAIF,EAAO,EAAQ,KAIX,EAAO,IAAU,GAAK,MAAM,KAC9B,KAGoB,MAAlB,EAAO,EAAI,IAAgC,MAAlB,EAAO,EAAI,IACtC,EAAM,IAAK,YAAY,EAAQ,EAAI,IAAM,IAAM,GAC/C,KAEA,EAAM,IAAK,YAAY,EAAQ,EAAI,IAAM,IAAM,GAEjD,EAAO,EAAQ,GAEnB,CAGI,EAAO,EAAQ,GACjB,KAEF,MAEF,IAAK,SACH,EAAM,GAAI,EACV,EAAM,GAAI,EACV,MAEF,QACE,KAQN,OALI,MAAM,EAAM,KAAM,MAAM,EAAM,IAK3B,CACT,EAMA,SAAS,EAAQ,EAAG,GAElB,KAAM,gBAAgB,GACpB,OAAO,IAAI,EAAQ,EAAG,GAGxB,MAAM,EAAI,GAAM,EAAG,GAEnB,KAAS,GAAI,EAAM,GACnB,KAAS,GAAI,EAAM,EACrB,CAEA,EAAQ,UAAY,CAElB,GAAM,EACN,GAAM,EAON,KAAQ,WAEN,MAAM,EAAM,GAAM,KAAS,GAAG,KAAS,IAEvC,OAAO,IAAI,EACT,KAAS,GAAI,EACb,KAAS,GAAI,EACjB,EAOA,IAAO,SAAU,EAAG,GAElB,MAAM,EAAI,GAAM,EAAG,GAEb,EAAS,KAAiB,aAC1B,IAAW,SAAS,EAAM,KAAM,SAAS,EAAM,KAErD,OAAI,GAAU,EAER,GAAU,EAEL,EAAa,IAGf,EAAkB,SAGpB,IAAI,EACT,KAAS,GAAI,EAAM,GACnB,KAAS,GAAI,EAAM,GACvB,EAOA,IAAO,SAAU,EAAG,GAElB,MAAM,EAAI,GAAM,EAAG,GAEb,EAAS,KAAiB,aAC1B,IAAW,SAAS,EAAM,KAAM,SAAS,EAAM,KAErD,OAAI,GAAU,EAER,GAAU,EAEL,EAAa,IAGf,EAAkB,SAGpB,IAAI,EACT,KAAS,GAAI,EAAM,GACnB,KAAS,GAAI,EAAM,GACvB,EAOA,IAAO,SAAU,EAAG,GAElB,MAAM,EAAI,GAAM,EAAG,GAEb,EAAS,KAAiB,aAC1B,IAAW,SAAS,EAAM,KAAM,SAAS,EAAM,KAC/C,EAAyB,IAAf,KAAS,IAA0B,IAAf,KAAS,GACvC,EAAsB,IAAZ,EAAM,IAAuB,IAAZ,EAAM,GAGvC,OAAI,GAAU,GAAW,GAAU,EAC1B,EAAa,IAIlB,GAAU,EACL,EAAkB,SAIX,IAAZ,EAAM,IAA0B,IAAf,KAAS,GACrB,IAAI,EAAQ,KAAS,GAAI,EAAM,GAAG,GAGpC,IAAI,EACT,KAAS,GAAI,EAAM,GAAI,KAAS,GAAI,EAAM,GAC1C,KAAS,GAAI,EAAM,GAAI,KAAS,GAAI,EAAM,GAC9C,EAOA,IAAO,SAAU,EAAG,GAElB,MAAM,EAAI,GAAM,EAAG,GAEb,EAAS,KAAiB,aAC1B,IAAW,SAAS,EAAM,KAAM,SAAS,EAAM,KAC/C,EAAyB,IAAf,KAAS,IAA0B,IAAf,KAAS,GACvC,EAAsB,IAAZ,EAAM,IAAuB,IAAZ,EAAM,GAGvC,GAAI,GAAW,GAAW,GAAU,EAClC,OAAO,EAAa,IAItB,GAAI,GAAW,EACb,OAAO,EAAkB,SAI3B,GAAI,GAAW,EACb,OAAO,EAAc,KAGvB,GAAI,IAAM,EAAM,GAEd,OAAO,IAAI,EAAQ,KAAS,GAAI,EAAM,GAAG,KAAS,GAAI,EAAM,IAG9D,GAAI,KAAK,IAAI,EAAM,IAAK,KAAK,IAAI,EAAM,IAAI,CAEzC,MAAM,EAAI,EAAM,GAAI,EAAM,GACpB,EAAI,EAAM,GAAI,EAAI,EAAM,GAE9B,OAAO,IAAI,GACR,KAAS,GAAI,EAAI,KAAS,IAAK,GAC/B,KAAS,GAAI,EAAI,KAAS,IAAK,EAEpC,CAAO,CAEL,MAAM,EAAI,EAAM,GAAI,EAAM,GACpB,EAAI,EAAM,GAAI,EAAI,EAAM,GAE9B,OAAO,IAAI,GACR,KAAS,GAAI,KAAS,GAAI,GAAK,GAC/B,KAAS,GAAI,KAAS,GAAI,GAAK,EACpC,CACF,EAOA,IAAO,SAAU,EAAG,GAElB,MAAM,EAAI,GAAM,EAAG,GAEb,EAAyB,IAAf,KAAS,IAA0B,IAAf,KAAS,GAG7C,GAF4B,IAAZ,EAAM,IAAuB,IAAZ,EAAM,GAGrC,OAAO,EAAa,IAItB,GAAgB,IAAZ,EAAM,GAAS,CAEjB,GAAmB,IAAf,KAAS,IAAW,KAAS,GAAI,EAEnC,OAAO,IAAI,EAAQ,KAAK,IAAI,KAAS,GAAG,EAAM,IAAI,GAE7C,GAAmB,IAAf,KAAS,GAElB,QAAS,EAAM,GAAI,EAAI,GAAK,GAC1B,KAAK,EACH,OAAO,IAAI,EAAQ,KAAK,IAAI,KAAS,GAAG,EAAM,IAAI,GACpD,KAAK,EACH,OAAO,IAAI,EAAQ,EAAG,KAAK,IAAI,KAAS,GAAG,EAAM,KACnD,KAAK,EACH,OAAO,IAAI,GAAS,KAAK,IAAI,KAAS,GAAG,EAAM,IAAI,GACrD,KAAK,EACH,OAAO,IAAI,EAAQ,GAAI,KAAK,IAAI,KAAS,GAAG,EAAM,KAG1D,CAqBA,GAAI,GAAW,EAAM,GAAI,EACvB,OAAO,EAAc,KAGvB,MAAM,EAAM,KAAK,MAAM,KAAS,GAAG,KAAS,IACtC,EAAM,GAAS,KAAS,GAAG,KAAS,IAE1C,IAAI,EAAK,KAAK,IAAI,EAAM,GAAI,EAAM,EAAM,GAAI,GACxC,EAAK,EAAM,GAAI,EAAM,EAAM,GAAI,EACnC,OAAO,IAAI,EACT,EAAK,KAAK,IAAI,GACd,EAAK,KAAK,IAAI,GAClB,EAOA,KAAQ,WAEN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,EAEF,OAAI,GAAK,EACA,IAAI,EAAQ,KAAK,KAAK,GAAI,GAE1B,IAAI,EAAQ,EAAG,KAAK,MAAM,IAIrC,MAAM,EAAI,GAAM,EAAG,GAEnB,IAAI,EAAK,KAAK,KAAK,IAAO,EAAI,KAAK,IAAI,KACnC,EAAK,KAAK,IAAI,IAAM,EAAI,GAE5B,OAAI,GAAK,EACA,IAAI,EAAQ,EAAI,EAAI,GAAK,EAAK,GAE9B,IAAI,EAAQ,EAAI,EAAI,GAAK,EAAK,EAEzC,EAOA,IAAO,WAEL,MAAM,EAAK,KAAK,IAAI,KAAS,IAE7B,OAAmB,IAAf,KAAS,GACJ,IAAI,EAAQ,EAAI,GAElB,IAAI,EACT,EAAK,KAAK,IAAI,KAAS,IACvB,EAAK,KAAK,IAAI,KAAS,IAC3B,EAUA,MAAS,WAQP,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAO,IAAI,EACT,KAAK,MAAM,GAAK,KAAK,IAAI,YAviBP,GAEtB,MAAM,EAAI,KAAK,GAAK,EACpB,IAAK,EAAI,GAAK,EAAI,EAChB,OAAO,KAAK,IAAI,GAAK,EAevB,MAAM,EAAK,EAAI,EACf,OAAO,GACL,GACE,GACE,GACE,GACE,GACE,GACE,EAAK,cACH,EAAI,aACN,EAAI,WACN,EAAI,SACN,EAAI,OACN,EAAI,KACN,EAAI,IACN,GACN,CAogB+B,CAAW,GACpC,KAAK,IAAI,GAAK,KAAK,IAAI,GAC3B,EAOA,IAAO,WAEL,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAU,IAAN,GAAW,EAAI,EACV,IAAI,EAAQ,KAAK,IAAI,GAAI,GAG3B,IAAI,EACT,GAAS,EAAG,GACZ,KAAK,MAAM,EAAG,GAClB,EAOA,IAAO,WAEL,OAAO,GAAM,KAAS,GAAG,KAAS,GACpC,EAOA,IAAO,WAEL,OAAO,KAAK,MAAM,KAAS,GAAG,KAAS,GACzC,EAOA,IAAO,WAKL,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAO,IAAI,EACT,KAAK,IAAI,GAAK,GAAK,GACnB,KAAK,IAAI,GAAK,GAAK,GACvB,EAOA,IAAO,WAKL,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAO,IAAI,EACT,KAAK,IAAI,GAAK,GAAK,IAClB,KAAK,IAAI,GAAK,GAAK,GACxB,EAOA,IAAO,WAOL,MAAM,EAAI,EAAI,KAAS,GACjB,EAAI,EAAI,KAAS,GACjB,EAAI,KAAK,IAAI,GAAK,GAAK,GAE7B,OAAO,IAAI,EACT,KAAK,IAAI,GAAK,EACd,GAAK,GAAK,EACd,EAOA,IAAO,WAIL,MAAM,EAAI,EAAI,KAAS,GACjB,EAAI,EAAI,KAAS,GACjB,EAAI,KAAK,IAAI,GAAK,GAAK,GAE7B,OAAO,IAAI,GACR,KAAK,IAAI,GAAK,EACf,GAAK,GAAK,EACd,EAOA,IAAO,WAIL,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GACb,EAAI,GAAM,GAAK,EAAI,GAAK,GAAM,KAAK,IAAI,EAAI,GAEjD,OAAO,IAAI,EACT,KAAK,IAAI,GAAK,GAAK,GAAK,EACxB,KAAK,IAAI,GAAK,GAAK,GAAK,EAC5B,EAOA,IAAO,WAIL,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GACb,EAAI,GAAM,GAAK,EAAI,GAAK,GAAM,KAAK,IAAI,EAAI,GAEjD,OAAO,IAAI,EACT,KAAK,IAAI,GAAK,GAAK,GAAK,GACvB,KAAK,IAAI,GAAK,GAAK,GAAK,EAC7B,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEb,EAAK,IAAI,EACb,EAAI,EAAI,EAAI,EAAI,KACX,EAAI,GAAS,OAEd,EAAK,IAAI,EACb,EAAO,GAAI,EACX,EAAO,GAAI,GAAQ,MAErB,OAAO,IAAI,EAAQ,EAAO,IAAI,EAAO,GACvC,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEb,EAAK,IAAI,EACb,EAAI,EAAI,EAAI,EAAI,KACX,EAAI,GAAS,OAEd,EAAK,IAAI,EACb,EAAO,GAAI,EACX,EAAO,GAAI,GAAQ,MAErB,OAAO,IAAI,EAAQ,KAAK,GAAK,EAAI,EAAO,GAAG,EAAO,GACpD,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,EAAS,CAEX,GAAU,IAAN,EACF,OAAO,IAAI,EAAQ,EAAG,KAGxB,QAAI,EACF,OAAO,IAAI,EAAQ,OAEvB,CAEA,MAAM,EAAI,EAAI,GAAK,EAAM,IAAM,EAAM,GAE/B,EAAK,IAAI,GACZ,EAAI,EAAI,EAAI,EAAI,GAAK,KACjB,EAAI,GAAG,MAEd,OAAO,IAAI,MAAe,EAAO,GAAG,GAAM,EAAO,GACnD,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,EACF,OAAO,IAAI,EAAQ,KAAK,MAAM,EAAG,GAAI,GAGvC,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,OACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,MAC9B,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,GAAiB,IAAN,EACb,OAAO,IAAI,EAAQ,EAAG,KAGxB,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,OACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,MAC9B,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,GAAiB,IAAN,EACb,OAAO,IAAI,EAAQ,KAAK,GAAK,EAAG,KAGlC,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,OACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,MAC9B,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAO,IAAI,EACT,GAAK,GAAK,KAAK,IAAI,GACnB,GAAK,GAAK,KAAK,IAAI,GACvB,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,OAAO,IAAI,EACT,GAAK,GAAK,KAAK,IAAI,GACnB,GAAK,GAAK,KAAK,IAAI,GACvB,EAOA,KAAQ,WAIN,MAAM,EAAI,EAAI,KAAS,GACjB,EAAI,EAAI,KAAS,GACjB,EAAI,GAAK,GAAK,KAAK,IAAI,GAE7B,OAAO,IAAI,EACT,GAAK,GAAK,EACV,KAAK,IAAI,GAAK,EAClB,EAOA,KAAQ,WAIN,MAAM,EAAI,EAAI,KAAS,GACjB,EAAI,EAAI,KAAS,GACjB,EAAI,GAAK,GAAK,KAAK,IAAI,GAE7B,OAAO,IAAI,EACT,GAAK,GAAK,GACT,KAAK,IAAI,GAAK,EACnB,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GACb,EAAI,KAAK,IAAI,EAAI,GAAK,GAAK,EAAI,GAErC,OAAO,IAAI,KACJ,GAAK,GAAK,KAAK,IAAI,GAAK,EAC7B,EAAI,GAAK,GAAK,KAAK,IAAI,GAAK,EAChC,EAOA,KAAQ,WAIN,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GACb,EAAI,KAAK,IAAI,EAAI,GAAK,GAAK,EAAI,GAErC,OAAO,IAAI,EACT,EAAI,GAAK,GAAK,KAAK,IAAI,GAAK,KACvB,GAAK,GAAK,KAAK,IAAI,GAAK,EACjC,EAOA,MAAS,WAIP,IAAI,EAAM,KAAS,GACnB,KAAS,IAAK,KAAS,GACvB,KAAS,GAAI,EACb,MAAM,EAAM,KAAW,OAQvB,OANA,KAAS,IAAK,KAAS,GACvB,KAAS,GAAI,EACb,EAAM,EAAQ,GAEd,EAAQ,IAAK,EAAQ,GACrB,EAAQ,GAAI,EACL,CACT,EAOA,MAAS,WAIP,MAAM,EAAM,KAAW,OACvB,GAAI,EAAQ,IAAK,EAAG,CAClB,MAAM,EAAM,EAAQ,GACpB,EAAQ,IAAK,EAAQ,GACrB,EAAQ,GAAI,CACd,KAAO,CACL,MAAM,EAAM,EAAQ,GACpB,EAAQ,IAAK,EAAQ,GACrB,EAAQ,GAAI,CACd,CACA,OAAO,CACT,EAOA,MAAS,WAIP,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEb,EAAO,EAAI,GAAW,IAAN,EAChB,EAAW,EAAI,EACf,EAAU,EAAI,EACd,EAAI,EAAW,EAAW,EAAI,EAE9B,EAAW,IAAN,EACP,IAAI,GACH,EAAU,EAAW,EAAI,GAAK,GAC9B,EAAI,EAAW,EAAU,GAAK,GAC/B,IAAI,OACH,EAAa,EAAI,EAAK,EAChB,IAAN,EAAY,EAAI,EAAK,GAEpB,EAAO,EAAM,GAMnB,OALA,EAAM,GAAI,GAAS,EAAM,GAAG,EAAM,IAAK,EACvC,EAAM,GAAI,KAAK,MAAM,EAAM,GAAG,GAAQ,EAClC,IACF,EAAM,IAAK,EAAM,IAEZ,CACT,EAOA,MAAS,WAIP,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,GAAiB,IAAN,EACb,OAAO,IAAI,EAAQ,EAAG,KAAK,GAAK,GAGlC,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,QACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,OAC9B,EAOA,MAAS,WAIP,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAU,IAAN,EAEF,OAAO,IAAI,EACF,IAAN,EACG,KAAK,IAAI,EAAI,KAAK,KAAK,EAAI,EAAI,IAC/B,IAAU,GAGlB,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,QACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,OAC9B,EAOA,MAAS,WAIP,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEnB,GAAI,KAAa,SACf,OAAO,EAAkB,SAG3B,MAAM,EAAI,EAAI,EAAI,EAAI,EACtB,OAAc,IAAN,EACJ,IAAI,EACJ,EAAI,GACH,EAAI,GAAG,QACR,IAAI,EACG,IAAN,EAAW,EAAI,EAAI,EACb,IAAN,GAAY,EAAI,EAAI,GAAG,OAC9B,EAOA,QAAW,WAGT,GAAI,KAAa,SACf,OAAO,EAAkB,SAG3B,GAAI,KAAiB,aACnB,OAAO,EAAc,KAGvB,MAAM,EAAI,KAAS,GACb,EAAI,KAAS,GAEb,EAAI,EAAI,EAAI,EAAI,EAEtB,OAAO,IAAI,EAAQ,EAAI,GAAI,EAAI,EACjC,EAOA,UAAa,WAEX,OAAO,IAAI,EAAQ,KAAS,IAAI,KAAS,GAC3C,EAOA,IAAO,WAEL,OAAO,IAAI,GAAS,KAAS,IAAI,KAAS,GAC5C,EAOA,KAAQ,SAAU,GAIhB,OAFA,EAAS,KAAK,IAAI,GAAI,GAAU,GAEzB,IAAI,EACT,KAAK,KAAK,KAAS,GAAI,GAAU,EACjC,KAAK,KAAK,KAAS,GAAI,GAAU,EACrC,EAOA,MAAS,SAAU,GAIjB,OAFA,EAAS,KAAK,IAAI,GAAI,GAAU,GAEzB,IAAI,EACT,KAAK,MAAM,KAAS,GAAI,GAAU,EAClC,KAAK,MAAM,KAAS,GAAI,GAAU,EACtC,EAOA,MAAS,SAAU,GAIjB,OAFA,EAAS,KAAK,IAAI,GAAI,GAAU,GAEzB,IAAI,EACT,KAAK,MAAM,KAAS,GAAI,GAAU,EAClC,KAAK,MAAM,KAAS,GAAI,GAAU,EACtC,EASA,OAAU,SAAU,EAAG,GAErB,MAAM,EAAI,GAAM,EAAG,GAEnB,OAAO,KAAK,IAAI,EAAM,GAAI,KAAS,KAAM,EAAiB,SACxD,KAAK,IAAI,EAAM,GAAI,KAAS,KAAM,EAAiB,OACvD,EAOA,MAAS,WAEP,OAAO,IAAI,EAAQ,KAAS,GAAG,KAAS,GAC1C,EAOA,SAAY,WAEV,IAAI,EAAI,KAAS,GACb,EAAI,KAAS,GACb,EAAM,GAEV,OAAI,KAAY,QACP,MAGL,KAAiB,aACZ,YAGL,KAAK,IAAI,GAAK,EAAiB,UACjC,EAAI,GAGF,KAAK,IAAI,GAAK,EAAiB,UACjC,EAAI,GAII,IAAN,EACK,EAAM,GAGL,IAAN,GACF,GAAO,EACP,GAAO,IACH,EAAI,GACN,GAAK,EACL,GAAO,KAEP,GAAO,IAET,GAAO,KACE,EAAI,IACb,GAAK,EACL,GAAO,KAGL,IAAM,IACR,GAAO,GAEF,EAAM,KACf,EAOA,SAAY,WAEV,MAAO,CAAC,KAAS,GAAG,KAAS,GAC/B,EAOA,QAAW,WAET,OAAmB,IAAf,KAAS,GACJ,KAAS,GAEX,IACT,EAOA,MAAS,WACP,OAAO,MAAM,KAAS,KAAM,MAAM,KAAS,GAC7C,EAQA,OAAU,WACR,OAAsB,IAAf,KAAS,IAA0B,IAAf,KAAS,EACtC,EAQA,SAAY,WACV,OAAO,SAAS,KAAS,KAAM,SAAS,KAAS,GACnD,EAQA,WAAc,WACZ,OAAQ,KAAe,UACzB,GAGF,EAAc,KAAI,IAAI,EAAQ,EAAG,GACjC,EAAa,IAAI,IAAI,EAAQ,EAAG,GAChC,EAAW,EAAI,IAAI,EAAQ,EAAG,GAC9B,EAAY,GAAI,IAAI,EAAQ,KAAK,GAAI,GACrC,EAAW,EAAI,IAAI,EAAQ,KAAK,EAAG,GACnC,EAAkB,SAAI,IAAI,EAAQ,IAAU,KAC5C,EAAa,IAAI,IAAI,EAAQ,IAAK,KAClC,EAAiB,QAAI,MC33CrB,IAEW,GAAoC,GAFpC,UACQ,SAKjB,OAAO,eAAe,EAAS,OAAQ,CACrC,MAAO,YAET,EAAQ,UAAU,YAAc,EAChC,EAAQ,UAAU,KAAO,UACzB,EAAQ,UAAU,aAOlB,EAAQ,UAAU,OAAS,WACzB,MAAO,CACL,OAAQ,UACR,GAAI,KAAK,GACT,GAAI,KAAK,GAEb,EAOA,EAAQ,UAAU,QAAU,WAC1B,MAAO,CACL,EAAG,KAAK,MACR,IAAK,KAAK,MAEd,EAWA,EAAQ,UAAU,OAAS,SAAU,GACnC,IACI,EAAK,KAAK,GACV,EAAK,KAAK,GACV,EAAQ,GAAO,KAAK,GAAI,GACxB,EAAQ,GAAO,KAAK,GAAI,GAGxB,EAAY,GAAS,GAAW,EAAU,EAAU,EAAQ,UAAY,KAC5E,GAAkB,OAAd,EAAoB,CACtB,IAAI,EAAU,KAAK,IAAI,IAAK,GACxB,KAAK,IAAI,EAAK,GAAM,IACtB,EAAK,GAEH,KAAK,IAAI,EAAK,GAAM,IACtB,EAAK,EAET,CA6BA,OA5BW,IAAP,EAEI,EACU,IAAP,EAEE,IAAP,EACI,SACG,EACH,KAEA,EAAQ,IAIZ,EAAK,OACH,EACI,EAAQ,OAER,EAAQ,MAAQ,EAAM,UAAU,GAAK,IAGlC,IAAP,EACI,EAAQ,OAER,EAAQ,MAAQ,EAAQ,GAKtC,EAaA,EAAQ,UAAY,SAAU,GAC5B,OAAQ,UAAU,QAChB,KAAK,EAED,IAAI,EAAM,UAAU,GACpB,GAAmB,iBAAR,EACT,OAAO,EAAQ,GAEf,MAAM,IAAI,UAAU,kDAG1B,KAAK,EAED,IAAI,EAAI,UAAU,GACd,EAAM,UAAU,GACpB,GAAI,GAAS,GAAI,CAKf,GAJI,GAAO,IAAQ,EAAI,QAAQ,WAE7B,EAAM,EAAI,SAAS,QAEjB,GAAS,GACX,OAAO,IAAI,EAAQ,CACjB,IACA,QAGJ,MAAM,IAAI,UAAU,yCACtB,CACE,MAAM,IAAI,UAAU,6BAG1B,QACE,MAAM,IAAI,YAAY,mDAE5B,EACA,EAAQ,UAAU,QAAU,EAAQ,UAAU,SAU9C,EAAQ,SAAW,SAAU,GAC3B,OAAO,IAAI,EAAQ,EACrB,EAiBA,EAAQ,QAAU,SAAU,EAAG,GAC7B,OAAI,EAAE,GAAK,EAAE,GACJ,EAEL,EAAE,GAAK,EAAE,MAGT,EAAE,GAAK,EAAE,GACJ,EAEL,EAAE,GAAK,EAAE,MAGN,CACT,EACO,IACN,CACD,oBChKS,OAAW,MAAa,OAAS,SAAU,GAAK,GAAI,MAAM,GAAI,MAAM,IAAI,MAAM,IAAK,OAAO,CAAG,GAExG,MAAM,GAAS,OAAO,GAChB,GAAQ,OAAO,GACf,GAAQ,OAAO,GACf,GAAS,OAAO,GAChB,GAAQ,OAAO,IAQf,GAAI,CACR,EAAK,GACL,EAAK,GACL,EAAK,IAGP,SAAS,GAAO,EAAG,GAEjB,IACE,EAAI,OAAO,EACb,OACE,MAAM,IACR,CACA,OAAO,EAAI,CACb,CAEA,SAAS,GAAM,GACb,MAAoB,iBAAN,EAAiB,EAAI,KAAK,MAAM,EAChD,CAGA,SAAS,GAAY,EAAG,GAEtB,GAAI,IAAM,GACR,MAAM,KAGR,MAAM,EAAI,OAAO,OAAO,GAAS,WACjC,EAAK,EAAI,EAAI,IAAU,GAAQ,GAI/B,MAAM,EAAI,GAFV,EAAI,EAAI,IAAU,EAAI,EAEL,GAIjB,OAFA,EAAK,EAAI,EAAI,EACb,EAAK,EAAI,EAAI,EACN,CACT,CAEA,SAAS,GAAU,GAEjB,MAAM,EAAU,GAEhB,IAAI,EAAI,EACJ,EAAI,GACJ,EAAI,GAAS,GAEjB,KAAO,GAAK,GAAG,CAEb,KAAO,EAAI,IAAM,IACf,GAAK,EACL,EAAQ,IAAM,EAAQ,IAAM,IAAU,GAExC,GAAK,GAAQ,GAAQ,GACvB,CAQA,OANI,IAAM,EACJ,EAAI,IACN,EAAQ,IAAM,EAAQ,IAAM,IAAU,IAExC,EAAQ,IAAQ,EAAQ,IAAQ,IAAU,GAErC,CACT,CAEA,MAAM,GAAQ,SAAU,EAAI,GAE1B,IAAI,EAAI,GAAQ,EAAI,GAAO,EAAI,GAE/B,GAAI,QAEG,QAAI,MAAkB,CAE3B,GAAkB,iBAAP,EACT,EAAI,MACC,IAAI,MAAM,GACf,MAAM,KACD,GAAI,EAAK,GAAM,EACpB,MAAM,KAEN,EAAI,OAAO,EACb,CAEA,GAAkB,iBAAP,EACT,EAAI,MACC,IAAI,MAAM,GACf,MAAM,KACD,GAAI,EAAK,GAAM,EACpB,MAAM,KAEN,EAAI,OAAO,EACb,CAEA,EAAI,EAAI,CAEV,SAAyB,iBAAP,EAAiB,CACjC,GAAI,MAAO,GAAM,MAAO,EACtB,EAAI,OAAO,EAAM,GACjB,EAAI,OAAO,EAAM,GACb,MAAO,IACT,GAAK,OAAO,EAAM,SAAA,GACX,KAAK,EACd,EAAI,OAAO,EAAG,IACV,KAAK,IACP,EAAI,OAAO,EAAG,SACX,IAAkB,iBAAP,EAGhB,MAAM,KAFN,EAAI,CAGN,CACA,EAAI,EAAI,CACV,SAAyB,iBAAP,EAAiB,CAEjC,GAAI,MAAM,GACR,MAAM,KAQR,GALI,EAAK,IACP,GAAK,GACL,GAAM,GAGJ,EAAK,GAAM,EACb,EAAI,OAAO,OACN,CAEL,IAAI,EAAI,EAEJ,EAAI,EAAG,EAAI,EACX,EAAI,EAAG,EAAI,EAEX,EAAI,IASR,IAPI,GAAM,IACR,EAAI,IAAM,KAAK,MAAM,EAAI,KAAK,MAAM,IACpC,GAAM,GAKD,GAAK,GAAK,GAAK,GAAG,CACvB,IAAI,GAAK,EAAI,IAAM,EAAI,GAEvB,GAAI,IAAO,EAAG,CACR,EAAI,GAAK,GACX,EAAI,EAAI,EACR,EAAI,EAAI,GACC,EAAI,GACb,EAAI,EACJ,EAAI,IAEJ,EAAI,EACJ,EAAI,GAEN,KAEF,CAEM,EAAK,GACP,GAAK,EACL,GAAK,IAEL,GAAK,EACL,GAAK,GAGH,EAAI,GACN,EAAI,EACJ,EAAI,IAEJ,EAAI,EACJ,EAAI,EAGV,CACA,EAAI,OAAO,GAAK,OAAO,GACvB,EAAI,OAAO,EACb,CAEF,SAAyB,iBAAP,EAAiB,CAEjC,IAAI,EAAM,EAEN,EAAI,GAAQ,EAAI,GAAQ,EAAI,GAAQ,EAAI,GAAO,EAAI,GAEnD,EAAQ,EAAG,QAAQ,KAAM,IAAI,MAAM,UA8CvC,GA5Cc,OAAV,IAGe,MAAf,EAAM,IACR,GAAK,GACL,KACwB,MAAf,EAAM,IACf,IAGE,EAAM,SAAW,EAAM,EACzB,EAAI,GAAO,EAAM,KAAQ,GACG,MAAnB,EAAM,EAAM,IAA6B,MAAf,EAAM,IAEtB,MAAf,EAAM,KACR,EAAI,GAAO,EAAM,KAAQ,IAE3B,KAGI,EAAM,IAAM,EAAM,QAA6B,MAAnB,EAAM,EAAM,IAAiC,MAAnB,EAAM,EAAM,IAAiC,MAAnB,EAAM,EAAM,IAAiC,MAAnB,EAAM,EAAM,MACxH,EAAI,GAAO,EAAM,GAAM,GACvB,EAAI,IAAS,OAAO,EAAM,GAAK,QAC/B,MAIiB,MAAf,EAAM,IAAmC,MAAnB,EAAM,EAAM,IAA6B,MAAf,EAAM,IAAmC,MAAnB,EAAM,EAAM,MACpF,EAAI,GAAO,EAAM,EAAM,GAAI,GAC3B,EAAI,IAAS,OAAO,EAAM,EAAM,GAAG,QAAU,GAC7C,GAAO,IAGmB,MAAnB,EAAM,EAAM,IAAiC,MAAnB,EAAM,EAAM,IAC/C,EAAI,GAAO,EAAM,GAAM,GACvB,EAAI,GAAO,EAAM,EAAM,GAAI,IAC3B,GAAO,GACqB,MAAnB,EAAM,EAAM,IAAiC,MAAnB,EAAM,EAAM,KAC/C,EAAI,GAAO,EAAM,GAAM,GACvB,EAAI,GAAO,EAAM,EAAM,GAAI,GAC3B,EAAI,GAAO,EAAM,EAAM,GAAI,IAC3B,GAAO,KAGL,EAAM,QAAU,IAKlB,MAAM,KAJN,EAAI,EAAI,EACR,EACE,EAAI,EAAI,EAAI,EAAI,EAAI,CAK1B,KAAO,IAAkB,iBAAP,EAKhB,MAAM,KAJN,EAAI,EACJ,EAAI,EACJ,EAAI,EAGN,CAEA,GAAI,IAAM,GACR,MAAM,KAGR,GAAK,EAAI,EAAI,IAAU,GAAQ,GAC/B,GAAK,EAAI,EAAI,IAAU,EAAI,EAC3B,GAAK,EAAI,EAAI,IAAU,EAAI,CAC7B,EA4CA,SAAS,GAAW,EAAG,EAAG,GAExB,IAAI,EAAO,GACP,WA7CU,EAAG,EAAG,GAEpB,IAAI,EAAI,GACR,KAAO,EAAI,GAAQ,EAAK,EAAI,EAAK,EAAG,IAAM,GAEpC,EAAI,KACN,EAAK,EAAI,EAAK,GAGlB,OAAO,CACT,CAmCM,CAAc,GAAO,EAAK,GAE9B,QAAS,EAAI,EAAG,EAAI,IAAK,IAAK,CAG5B,GAAI,IAAS,EACX,OAAO,OAAO,GAEhB,EAAO,EAAO,GAAQ,EACtB,EAAO,EAAO,GAAQ,CACxB,CACA,OAAO,CACT,CAEA,SAAS,GAAI,EAAG,GAEd,IAAK,EACH,OAAO,EACT,IAAK,EACH,OAAO,EAET,OAAU,CAER,KADA,GAAK,GAEH,OAAO,EAET,KADA,GAAK,GAEH,OAAO,CACX,CACF,CASA,SAAS,GAAS,EAAG,GAInB,GAFA,GAAM,EAAG,KAEL,gBAAgB,IAMlB,OAAO,GAAY,GAAK,EAAI,GAAK,EAAG,GAAK,GALzC,EAAI,GAAI,GAAK,EAAG,GAAK,GACrB,KAAQ,EAAI,GAAK,EACjB,KAAQ,EAAI,GAAK,EAAI,EACrB,KAAQ,EAAI,GAAK,EAAI,CAIzB,CAEA,IAAI,GAAiB,WAAc,OAAO,IAAI,MAAM,mBAAqB,EACrE,GAAmB,WAAc,OAAO,IAAI,MAAM,mBAAqB,EACvE,GAAsB,WAAc,OAAO,IAAI,MAAM,6BAA+B,EAExF,GAAS,UAAY,CAEnB,EAAK,GACL,EAAK,GACL,EAAK,GAOL,IAAO,WAEL,OAAO,GAAY,KAAQ,EAAG,KAAQ,EACxC,EAOA,IAAO,WAEL,OAAO,IAAa,KAAQ,EAAI,KAAQ,EAAG,KAAQ,EACrD,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,GACL,KAAQ,EAAI,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,KAAQ,EAAI,GAAK,EAC3D,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,GACL,KAAQ,EAAI,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,KAAQ,EAAI,GAAK,EAC3D,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,GACL,KAAQ,EAAI,GAAK,EAAI,KAAQ,EAAI,GAAK,EACtC,KAAQ,EAAI,GAAK,EAErB,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,GACL,KAAQ,EAAI,GAAK,EAAI,KAAQ,EAAI,GAAK,EACtC,KAAQ,EAAI,GAAK,EAErB,EAOA,MAAS,WACP,OAAO,GAAY,KAAQ,EAAI,KAAQ,EAAG,KAAQ,EACpD,EAQA,IAAO,SAAU,EAAG,GAElB,YAAI,EACF,OAAO,GAAY,KAAQ,EAAI,KAAQ,EAAI,KAAQ,EAAG,IAIxD,GADA,GAAM,EAAG,GACL,KAAW,GAAK,EAAI,KAAQ,EAC9B,MAAM,KAcR,OAAO,GACL,KAAQ,GAAK,GAAK,EAAI,KAAQ,IAAM,GAAK,EAAI,KAAQ,GACrD,GAAK,EAAI,KAAQ,EACrB,EAOA,IAAO,SAAU,EAAG,GAOlB,OALA,GAAM,EAAG,GAKF,GAAY,GAAI,GAAK,EAAG,KAAQ,GAAK,GAAI,GAAK,EAAG,KAAQ,GAAI,GAAK,EAAI,KAAQ,EACvF,EAOA,IAAO,SAAU,EAAG,GAOlB,OALA,GAAM,EAAG,GAKL,GAAK,IAAM,IAAU,KAAQ,IAAM,GAC9B,GAAY,GAAQ,IAEtB,GAAY,GAAK,EAAI,KAAQ,EAAG,GAAI,GAAK,EAAG,KAAQ,GAAK,GAAI,GAAK,EAAG,KAAQ,GACtF,EAOA,QAAW,WACT,OAAO,GAAY,KAAQ,EAAI,KAAQ,EAAG,KAAQ,EACpD,EAOA,IAAO,SAAU,EAAG,GAMlB,GAJA,GAAM,EAAG,GAIL,GAAK,IAAM,GAEb,OAAI,GAAK,EAAI,GACJ,IAAa,KAAQ,EAAI,KAAQ,IAAM,GAAK,EAAG,KAAQ,GAAK,GAAK,GAEjE,IAAa,KAAQ,EAAI,KAAQ,IAAM,GAAK,EAAG,KAAQ,GAAK,GAAK,GAU5E,GAAI,KAAQ,EAAI,GAAQ,OAAO,KAG/B,IAAI,EAAI,GAAU,KAAQ,GACtB,EAAI,GAAU,KAAQ,GAGtB,EAAI,GACJ,EAAI,GACR,QAAS,KAAK,EACZ,GAAU,MAAN,EAAJ,CACA,GAAU,MAAN,EAAW,CACb,EAAI,GACJ,KACF,CAGA,GAFA,EAAE,IAAM,GAAK,EAET,EAAE,GAAK,GAAK,IAAM,GAEf,OAAO,KADZ,EAAE,IAAM,GAAK,EAEf,GAAK,OAAO,IAAM,EAAE,EAVL,CAajB,QAAS,KAAK,EACZ,GAAU,MAAN,EAAJ,CAGA,GAFA,EAAE,IAAM,GAAK,EAET,EAAE,GAAK,GAAK,IAAM,GAEf,OAAO,KADZ,EAAE,IAAM,GAAK,EAEf,GAAK,OAAO,IAAM,EAAE,EANL,CASjB,OAAI,GAAK,EAAI,GACJ,GAAY,EAAG,GAEjB,GAAY,EAAG,EACxB,EAOA,IAAO,SAAU,EAAG,GAIlB,GAFA,GAAM,EAAG,GAEL,KAAQ,GAAK,IAAU,GAAK,GAAK,GAAQ,OAAO,KAEpD,MAAM,EAAY,GAEZ,EAAc,GAAU,GAAK,GAC7B,EAAK,GAAU,GAAK,GAEpB,EAAgB,GAAU,KAAQ,GAClC,EAAK,GAAU,KAAQ,GAE7B,UAAW,KAAS,EAClB,EAAY,IAAU,EAAY,IAAU,IAAU,EAAG,GAE3D,UAAW,KAAS,EAClB,EAAc,IAAU,EAAc,IAAU,IAAU,EAAG,GAG/D,UAAW,KAAS,EACJ,MAAV,IACJ,EAAU,OAEZ,UAAW,KAAS,EACJ,MAAV,IACJ,EAAU,OAGZ,IAAI,EAAO,KACP,EAAO,KAGX,UAAW,KAAS,EAAW,CAE7B,MAAM,EAAe,EAAY,IAAU,GACrC,EAAiB,EAAc,IAAU,GAE/C,GAAI,IAAiB,GAAQ,CAC3B,GAAI,IAAmB,GACrB,OAAO,KAET,QACF,CAGA,IAAI,EAAO,EACP,EAAO,EAGX,MAAM,EAAW,GAAI,EAAM,GAK3B,GAJA,GAAQ,EACR,GAAQ,EAGK,OAAT,GAA0B,OAAT,EACnB,EAAO,EACP,EAAO,UACE,EAAO,GAAS,EAAO,EAChC,OAAO,IAEX,CAEA,OAAgB,OAAT,GAA0B,OAAT,EACpB,GAAY,EAAM,GAClB,IACN,EAOA,OAAU,SAAU,EAAG,GAGrB,OADA,GAAM,EAAG,GACF,KAAQ,EAAI,KAAQ,EAAI,GAAK,GAAM,GAAK,EAAI,GAAK,EAAI,KAAQ,CACtE,EAOA,GAAM,SAAU,EAAG,GAGjB,OADA,GAAM,EAAG,GACF,KAAQ,EAAI,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAI,KAAQ,CACpE,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,KAAQ,EAAI,KAAQ,EAAI,GAAK,GAAK,GAAK,EAAI,GAAK,EAAI,KAAQ,CACrE,EAOA,GAAM,SAAU,EAAG,GAGjB,OADA,GAAM,EAAG,GACF,KAAQ,EAAI,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAI,KAAQ,CACpE,EAOA,IAAO,SAAU,EAAG,GAGlB,OADA,GAAM,EAAG,GACF,KAAQ,EAAI,KAAQ,EAAI,GAAK,GAAK,GAAK,EAAI,GAAK,EAAI,KAAQ,CACrE,EAUA,QAAW,SAAU,EAAG,GAEtB,GAAM,EAAG,GACT,IAAI,EAAI,KAAQ,EAAI,KAAQ,EAAI,GAAK,EAAI,GAAK,EAAI,GAAK,EAAI,KAAQ,EAEnE,OAAQ,GAAS,IAAM,EAAI,GAC7B,EAOA,KAAQ,SAAU,GAIhB,OAFA,EAAS,IAAS,OAAO,GAAU,GAE5B,GAAY,GAAM,KAAQ,EAAI,EAAS,KAAQ,EAAI,KAAQ,IAC/D,EAAS,KAAQ,EAAI,KAAQ,EAAI,IAAU,KAAQ,GAAK,GAAS,GAAQ,IAC1E,EACJ,EAOA,MAAS,SAAU,GAIjB,OAFA,EAAS,IAAS,OAAO,GAAU,GAE5B,GAAY,GAAM,KAAQ,EAAI,EAAS,KAAQ,EAAI,KAAQ,IAC/D,EAAS,KAAQ,EAAI,KAAQ,EAAI,IAAU,KAAQ,EAAI,GAAS,GAAQ,IACzE,EACJ,EAOA,MAAS,SAAU,GAmBjB,OAjBA,EAAS,IAAS,OAAO,GAAU,GAiB5B,GAAY,GAAM,KAAQ,EAAI,EAAS,KAAQ,EAAI,KAAQ,GAChE,KAAQ,IAAM,KAAQ,GAAK,GAAS,GAAQ,IAAU,IAAS,EAAS,KAAQ,EAAI,KAAQ,GAAK,KAAQ,EAAI,GAAQ,IACrH,EACJ,EAOA,QAAW,SAAU,EAAG,GAStB,GAAM,EAAG,GAET,MAAM,EAAI,KAAQ,EAAI,GAAK,EACrB,EAAI,KAAQ,EAAI,GAAK,EACrB,EAAI,EAAI,EAGd,IAAI,EAAI,GAAM,EAAI,GAIlB,OAHI,EAAI,GAAK,GACX,IAEK,GAAY,KAAQ,EAAI,EAAI,GAAK,EAAG,GAAK,EAClD,EAOA,UAAa,SAAU,EAAG,GAGxB,OADA,GAAM,EAAG,OACE,GAAK,EAAI,KAAQ,IAAQ,KAAQ,EAAI,GAAK,GAAM,GAAK,EAAI,KAAQ,GAC9E,EAOA,QAAW,WAET,OAAO,OAAO,KAAQ,EAAI,KAAQ,GAAK,OAAO,KAAQ,EACxD,EAOA,SAAY,SAAU,GAEpB,IAAI,EAAI,KAAQ,EACZ,EAAI,KAAQ,EAEhB,EAAM,GAAO,GAEb,IAAI,WAvkBU,EAAG,GAEnB,KAAO,EAAI,KAAU,GACnB,GAAK,IAGP,KAAO,EAAI,KAAW,GACpB,GAAK,IAGP,GAAI,IAAM,GACR,OAAO,GAOT,IAAI,EAAM,GAAQ,EACd,EAAI,EAER,KAAO,IAAQ,GAAO,IAGpB,GAFA,EAAM,EAAM,GAAQ,EAEhB,EAvSc,IAwShB,OAAO,GAEX,OAAO,OAAO,EAChB,CA2iBQ,CAAkB,EAAG,GACrB,EAAS,GAAW,EAAG,EAAG,GAE1B,EAAM,KAAQ,EAAI,GAAS,IAAM,GAWrC,GARA,GAAO,GAAM,EAAI,GAEjB,GAAK,EACL,GAAK,GAED,IACF,GAAO,KAEL,EAAQ,CAEV,QAAS,EAAI,EAAQ,KACnB,GAAO,GAAM,EAAI,GACjB,GAAK,EACL,GAAK,GAEP,GAAO,IACP,QAAS,EAAI,EAAQ,KACnB,GAAO,GAAM,EAAI,GACjB,GAAK,EACL,GAAK,GAEP,GAAO,GACT,MACE,QAAS,EAAI,EAAK,GAAK,KACrB,GAAO,GAAM,EAAI,GACjB,GAAK,EACL,GAAK,GAGT,OAAO,CACT,EAOA,WAAc,SAAU,GAEtB,IAAI,EAAI,KAAQ,EACZ,EAAI,KAAQ,EACZ,EAAM,KAAQ,EAAI,GAAS,IAAM,GAErC,GAAI,IAAM,GACR,GAAO,MACF,CACL,IAAI,EAAQ,GAAM,EAAI,GAClB,GAAa,EAAQ,KACvB,GAAO,EACP,GAAO,IACP,GAAK,GAGP,GAAO,EACP,GAAO,IACP,GAAO,CACT,CACA,OAAO,CACT,EAOA,QAAW,SAAU,GAEnB,IAAI,EAAI,KAAQ,EACZ,EAAI,KAAQ,EACZ,EAAM,KAAQ,EAAI,GAAS,IAAM,GAErC,GAAI,IAAM,GACR,GAAO,MACF,CACL,IAAI,EAAQ,GAAM,EAAI,GAClB,GAAa,EAAQ,KACvB,GAAO,EACP,GAAK,GAGP,GAAO,UACP,GAAO,EACP,GAAO,KACP,GAAO,EACP,GAAO,GACT,CACA,OAAO,CACT,EAOA,YAAe,WAEb,IAAI,EAAI,KAAQ,EACZ,EAAI,KAAQ,EACZ,EAAM,GAEV,EAAG,CACD,EAAI,KAAK,GAAM,EAAI,IACnB,IAAI,EAAI,EAAI,EACZ,EAAI,EACJ,EAAI,CACN,OAAS,IAAM,IAEf,OAAO,CACT,EAEA,SAAY,SAAU,GAEpB,MAAM,EAAO,OAAO,GAAK,GAAO,MAAS,GAEnC,EAAU,KAAU,MACpB,EAAO,EAAqB,cAElC,QAAS,EAAI,EAAG,EAAI,EAAK,OAAQ,IAAK,CAEpC,IAAI,EAAI,GAAY,EAAK,EAAI,GAAI,IACjC,QAAS,EAAI,EAAI,EAAG,GAAK,EAAG,IAC1B,EAAI,EAAW,UAAS,IAAE,EAAK,IAGjC,IAAI,EAAI,EAAO,IAAE,GACjB,GAAI,EAAK,EAAI,EAAO,EAAK,EACvB,OAAO,EAAO,IAAE,KAAQ,EAE5B,CACA,OAAO,IACT,GCvgCF,IAEW,GAAqC,GAFrC,WACQ,SAKjB,OAAO,eAAe,GAAU,OAAQ,CACtC,MAAO,aAET,GAAS,UAAU,YAAc,GACjC,GAAS,UAAU,KAAO,WAC1B,GAAS,UAAU,cAOnB,GAAS,UAAU,OAAS,WAC1B,MAAO,CACL,OAAQ,WACR,EAAG,OAAO,KAAK,EAAI,KAAK,GACxB,EAAG,OAAO,KAAK,GAEnB,EAQA,GAAS,SAAW,SAAU,GAC5B,OAAO,IAAI,GAAS,EACtB,EACO,KACN,CACD,aCpCS,GAAmC,GAFnC,SACQ,SAwBjB,SAAS,IACP,KAAM,gBAAgB,GACpB,MAAM,IAAI,YAAY,mDAE1B,CAgNA,OA3MA,EAAO,UAAU,KAAO,SACxB,EAAO,UAAU,YAUjB,EAAO,UAAU,QAAU,WAEzB,MAAM,IAAI,MAAM,8CAClB,EAUA,EAAO,UAAU,SAAW,WAE1B,MAAM,IAAI,MAAM,+CAClB,EAOA,EAAO,UAAU,OAAS,SAAU,EAAM,GACxC,MAAM,IAAI,MAAM,6CAClB,EAeA,EAAO,UAAU,OAAS,SAAU,EAAO,EAAa,GAEtD,MAAM,IAAI,MAAM,6CAClB,EAOA,EAAO,UAAU,IAAM,SAAU,GAE/B,MAAM,IAAI,MAAM,0CAClB,EAWA,EAAO,UAAU,IAAM,SAAU,EAAO,EAAO,GAE7C,MAAM,IAAI,MAAM,0CAClB,EAcA,EAAO,UAAU,OAAS,SAAU,EAAM,GAExC,MAAM,IAAI,MAAM,6CAClB,EAWA,EAAO,UAAU,QAAU,SAAU,EAAM,GAEzC,MAAM,IAAI,MAAM,8CAClB,EAMA,EAAO,UAAU,MAAQ,WAEvB,MAAM,IAAI,MAAM,4CAClB,EAMA,EAAO,UAAU,KAAO,WAEtB,MAAM,IAAI,MAAM,2CAClB,EAYA,EAAO,UAAU,IAAM,SAAU,EAAU,GAEzC,MAAM,IAAI,MAAM,0CAClB,EAQA,EAAO,UAAU,QAAU,SAAU,GAEnC,MAAM,IAAI,MAAM,8CAClB,EAMA,EAAO,UAAU,OAAO,UAAY,WAElC,MAAM,IAAI,MAAM,oCAClB,EAMA,EAAO,UAAU,QAAU,WAEzB,MAAM,IAAI,MAAM,8CAClB,EAMA,EAAO,UAAU,QAAU,WAEzB,MAAM,IAAI,MAAM,8CAClB,EAUA,EAAO,UAAU,OAAS,SAAU,GAElC,MAAM,IAAI,MAAM,6CAClB,EAMA,EAAO,UAAU,SAAW,WAE1B,MAAM,IAAI,MAAM,+CAClB,EACO,CAAM,GACZ,CACD,aCtOF,SAAS,GAAsB,EAAG,EAAM,GACtC,IACI,EAAO,IADS,EAAE,YACO,GACzB,EAAS,GACb,GAAI,EAAM,CACR,GAAI,EAAO,EACT,MAAM,IAAI,MAAM,kCAElB,IAAK,GAAU,GACb,MAAM,IAAI,MAAM,2BAElB,GAAI,EAAE,YAAY,EAAK,IAAI,EAAO,GAAG,IAAI,KAAO,EAAE,SAAS,EAAK,IAAI,EAAO,GAAG,SAC5E,MAAM,IAAI,MAAM,8BAA8B,OAAO,EAAO,EAAG,QAAQ,OAAO,EAAO,EAAG,QAE1F,IAAK,EAAE,YACL,MAAM,IAAI,MAAM,4BAEd,EAAE,SAAS,KACb,EAAI,EAAE,IAAI,EAAK,IAAI,KAErB,EAAS,IAAI,OAAO,EACtB,CACA,OAAQ,GACN,KAAK,EACH,MAAO,GAAG,OAAO,EAAE,YAAY,OAAO,GACxC,KAAK,EACH,MAAO,GAAG,OAAO,EAAE,WAAW,OAAO,GACvC,KAAK,GACH,MAAO,GAAG,OAAO,EAAE,iBAAiB,OAAO,GAC7C,QACE,MAAM,IAAI,MAAM,QAAQ,OAAO,EAAM,oBAE3C,CAmFO,SAAS,GAAO,EAAO,GAC5B,GAAuB,mBAAZ,EAET,OAAO,EAAQ,GAIjB,IAAK,EAAM,WACT,OAAO,EAAM,QAAU,MAAQ,EAAM,GAAG,GAAK,WAAa,YAE5D,IAgG6B,GAhGzB,SACF,EAAQ,UACR,EAAS,SACT,GACE,GAAuB,GAG3B,OAAQ,GACN,IAAK,QACH,OAuFyB,EAvFH,EAAP,EAwFN,QAAQ,GAvFnB,IAAK,cACH,OAAO,GAAc,EAAO,GAC9B,IAAK,cACH,gBA8CwB,EAAO,GAEnC,IAAI,EAAI,EAAM,EACV,EAAS,EAAI,GAAM,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAAI,EAI3D,EADkB,EAAM,IAAI,KAAK,IAAI,IAAK,IACf,YAAY,GAC3C,OAAI,EAAS,SAAS,OAEpB,EAAW,IADK,EAAM,YACG,GAAU,WAE9B,EAAW,KAAO,GAAK,EAAI,IAAM,IAAM,EAAO,UACvD,CA3DM,CAAqB,EAAO,GAC9B,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,GACzC,IAAK,MACH,OAAO,GAAsB,EAAO,EAAG,GACzC,IAAK,MACH,OAAO,GAAsB,EAAO,GAAI,GAC1C,IAAK,OAID,IAAI,EAAW,GAAqE,GAAQ,aACxF,EAAW,GAAqE,GAAQ,SAAU,GAGtG,GAAI,EAAM,SAAU,MAAO,IAI3B,IAAI,EAAU,EAAM,oBAAoB,GACpC,EAAM,EAAQ,EAUlB,OATI,GAAO,GAAY,EAAM,EAErB,EAAQ,UAGR,GAAc,EAAO,IAIlB,QAAQ,kCACjB,IAAI,EAAS,UAAU,GACnB,EAAI,UAAU,GAClB,MAAkB,MAAX,EAAiB,EAAS,EAAI,CACvC,IAEJ,QACE,MAAM,IAAI,MAAM,qBAAuB,EAAvB,oEAEtB,CA8BO,SAAS,GAAc,EAAO,GACnC,gBAAI,EACK,EAAM,cAAc,EAAY,GAEhC,EAAM,eAEjB,CAWA,SAAS,GAAmB,EAAO,GACjC,OAAI,GAAS,GACJ,EACE,GAAY,GACd,EAAM,WAEN,CAEX,CC7LO,SAAS,GAAO,EAAO,GAC5B,IAMe,EAAO,EAkHG,EAxHrB,GAMkB,EANM,EAOP,iBADN,EANM,GAQZ,GAAa,EAAO,GAEzB,GAAY,GACP,GAAgB,EAAO,IA6GP,EAxGH,IAyGW,iBAAV,GAAyC,iBAAZ,EAAM,GAAqC,iBAAZ,EAAM,GAAqC,iBAAZ,EAAM,EAxGjH,GAAgC,YAArB,EAAQ,SAKf,EAAM,WAHN,GAAG,OAAO,EAAM,EAAI,EAAM,EAAG,KAAK,OAAO,EAAM,GAMtD,MAAM,QAAQ,GACT,GAAY,EAAO,GAExB,GAAS,GACJ,GAAU,GAEE,mBAAV,EACF,EAAM,OAAS,OAAO,EAAM,QAAU,WAE3C,GAA0B,iBAAV,EACU,mBAAjB,EAAM,OACR,EAAM,OAAO,GACX,GAAS,EAAM,SAAS,KAAa,GAAG,WAE1C,EAAM,SAAS,GAKf,IAHO,OAAO,KAAK,GAAO,KAAI,GAC5B,GAAU,GAAO,KAAO,GAAO,EAAM,GAAM,KAE/B,KAAK,MAAQ,IAG/B,OAAO,IA9Cd,OAAI,GAA8B,iBAAZ,GAAwB,aAAc,GAAW,EAAO,OAAS,EAAQ,SACtF,EAAO,UAAU,EAAG,EAAQ,SAAW,GAAK,MAE9C,CACT,CAmDO,SAAS,GAAU,GAIxB,QAHI,EAAO,OAAO,GACd,EAAU,GACV,EAAI,EACD,EAAI,EAAK,QAAQ,CACtB,IAAI,EAAI,EAAK,OAAO,GACpB,GAAW,KAAK,GAAoB,GAAkB,GAAK,EAC3D,GACF,CACA,MAAO,IAAM,EAAU,GACzB,CACA,IAAI,GAAoB,CACtB,IAAK,MACL,KAAM,OACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,MACN,KAAM,OAwBR,SAAS,GAAY,EAAO,GAC1B,GAAI,MAAM,QAAQ,GAAQ,CAGxB,QAFI,EAAM,IACN,EAAM,EAAM,OACP,EAAI,EAAG,EAAI,EAAK,IACb,IAAN,IACF,GAAO,MAET,GAAO,GAAY,EAAM,GAAI,GAG/B,OADA,EAAO,GAET,CACE,OAAO,GAAO,EAAO,EAEzB,CC9JO,SAAS,GAAe,EAAQ,EAAU,GAC/C,KAAM,gBAAgB,IACpB,MAAM,IAAI,YAAY,oDAExB,KAAK,OAAS,EACd,KAAK,SAAW,EAChB,KAAK,SAAW,EAChB,KAAK,QAAU,wBAA0B,MAAM,QAAQ,GAAU,IAAM,EAAO,KAAK,MAAQ,IAAM,GAAU,KAAO,KAAK,UAAY,MAAQ,KAAO,MAAM,QAAQ,GAAY,IAAM,EAAS,KAAK,MAAQ,IAAM,GAAY,IAC1N,KAAK,OAAQ,IAAI,OAAQ,KAC3B,CCRO,SAAS,GAAW,EAAO,EAAK,GACrC,KAAM,gBAAgB,IACpB,MAAM,IAAI,YAAY,oDAExB,KAAK,MAAQ,EACT,UAAU,OAAS,GACrB,KAAK,IAAM,EACX,KAAK,IAAM,IAEX,KAAK,IAAM,EACX,KAAK,IAAM,YAET,KAAK,KAAqB,KAAK,MAAQ,KAAK,IAC9C,KAAK,QAAU,uBAAyB,KAAK,MAAQ,MAAQ,KAAK,IAAM,aAC/D,KAAK,KAAqB,KAAK,OAAS,KAAK,IACtD,KAAK,QAAU,uBAAyB,KAAK,MAAQ,OAAS,KAAK,IAAM,GAAK,IAE9E,KAAK,QAAU,uBAAyB,KAAK,MAAQ,IAEvD,KAAK,OAAQ,IAAI,OAAQ,KAC3B,CCfO,SAAS,GAAU,GAExB,QADI,EAAI,GACD,MAAM,QAAQ,IACnB,EAAE,KAAK,EAAE,QACT,EAAI,EAAE,GAER,OAAO,CACT,CAWA,SAAS,GAAU,EAAO,EAAM,GAC9B,IAAI,EACA,EAAM,EAAM,OAChB,GAAI,IAAQ,EAAK,GACf,MAAM,IAAI,GAAe,EAAK,EAAK,IAErC,GAAI,EAAM,EAAK,OAAS,EAAG,CAEzB,IAAI,EAAU,EAAM,EACpB,IAAK,EAAI,EAAG,EAAI,EAAK,IAAK,CACxB,IAAI,EAAQ,EAAM,GAClB,IAAK,MAAM,QAAQ,GACjB,MAAM,IAAI,GAAe,EAAK,OAAS,EAAG,EAAK,OAAQ,KAEzD,GAAU,EAAM,GAAI,EAAM,EAC5B,CACF,MAEE,IAAK,EAAI,EAAG,EAAI,EAAK,IACnB,GAAI,MAAM,QAAQ,EAAM,IACtB,MAAM,IAAI,GAAe,EAAK,OAAS,EAAG,EAAK,OAAQ,IAI/D,CASO,SAAS,GAAS,EAAO,GAE9B,GAD+B,IAAhB,EAAK,QAGlB,GAAI,MAAM,QAAQ,GAChB,MAAM,IAAI,GAAe,EAAM,OAAQ,QAIzC,GAAU,EAAO,EAAM,EAE3B,CAyBO,SAAS,GAAc,EAAO,GACnC,QAAI,MAAqB,CACvB,IAAK,GAAS,KAAW,GAAU,GACjC,MAAM,IAAI,UAAU,oCAAsC,EAAQ,KAEpE,GAAI,EAAQ,GAAuB,iBAAX,GAAuB,GAAS,EACtD,MAAM,IAAI,GAAW,EAAO,EAEhC,CACF,CAoCO,SAAS,GAAO,EAAO,EAAM,GAElC,IAAK,MAAM,QAAQ,GACjB,MAAM,IAAI,UAAU,kBAEtB,GAAoB,IAAhB,EAAK,OACP,MAAM,IAAI,MAAM,uCAkBlB,OAdA,EAAK,kBAAkB,GACrB,IAAK,GAAS,KAAW,GAAU,IAAU,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8D,GAAO,GAAQ,IAErG,KAGI,GAAS,IAAU,GAAY,MACjC,EAAQ,CAAC,IAKX,GAAQ,EAAO,EAAM,WADD,EAA6B,EAAe,GAEzD,CACT,CAWA,SAAS,GAAQ,EAAO,EAAM,EAAK,GACjC,IAAI,EACA,EACA,EAAS,EAAM,OACf,EAAS,EAAK,GACd,EAAS,KAAK,IAAI,EAAQ,GAI9B,GADA,EAAM,OAAS,EACX,EAAM,EAAK,OAAS,EAAG,CAEzB,IAAI,EAAU,EAAM,EAGpB,IAAK,EAAI,EAAG,EAAI,EAAQ,IAEtB,EAAO,EAAM,GACR,MAAM,QAAQ,KACjB,EAAO,CAAC,GACR,EAAM,GAAK,GAEb,GAAQ,EAAM,EAAM,EAAS,GAI/B,IAAK,EAAI,EAAQ,EAAI,EAAQ,IAE3B,EAAO,GACP,EAAM,GAAK,EAGX,GAAQ,EAAM,EAAM,EAAS,EAEjC,KAAO,CAIL,IAAK,EAAI,EAAG,EAAI,EAAQ,IACtB,KAAO,MAAM,QAAQ,EAAM,KACzB,EAAM,GAAK,EAAM,GAAG,GAKxB,IAAK,EAAI,EAAQ,EAAI,EAAQ,IAC3B,EAAM,GAAK,CAEf,CACF,CAYO,SAAS,GAAQ,EAAO,GAC7B,IAAI,WAwMkB,GACtB,IAAI,EAAgB,UAAU,OAAS,YAAK,UAAU,IAAmB,UAAU,GACnF,IAAK,MAAM,QAAQ,GAEjB,OAAO,EAET,GAA6B,kBAAlB,EACT,MAAM,IAAI,UAAU,mDAEtB,IAAI,EAAO,GACP,SAgBJ,SAAS,EAAoB,GAC3B,GAAI,MAAM,QAAQ,EAAM,IACtB,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,EAAoB,EAAM,SAG5B,QAAS,EAAK,EAAG,EAAK,EAAM,OAAQ,IAClC,EAAK,KAAK,EAAM,GAGtB,CAzBE,CAAoB,GAKtB,SAAS,EAAS,GAChB,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAI,EAAO,EAAM,GACb,MAAM,QAAQ,GAChB,EAAS,GAET,EAAK,KAAK,EAEd,CACF,CAZE,CAAS,GAEJ,CAsBT,CA7OM,CAAoB,MACpB,EAAgB,EAAU,OAC9B,IAAK,MAAM,QAAQ,KAAW,MAAM,QAAQ,GAC1C,MAAM,IAAI,UAAU,kBAEtB,GAAqB,IAAjB,EAAM,OACR,MAAM,IAAI,GAAe,EAAG,EAAe,MAG7C,IAAI,EAAY,GADhB,EAAQ,GAAqB,EAAO,IAEpC,GAAI,IAAkB,EACpB,MAAM,IAAI,GAAe,EAAW,EAAe,MAErD,IACE,gBAsDc,EAAO,GAKvB,QAFI,EADA,EAAW,EAGN,EAAY,EAAM,OAAS,EAAG,EAAY,EAAG,IAAa,CACjE,IAAI,EAAO,EAAM,GACjB,EAAY,GAIZ,QADI,EAAS,EAAS,OAAS,EACtB,EAAI,EAAG,EAAI,EAAQ,IAC1B,EAAU,KAAK,EAAS,MAAM,EAAI,GAAO,EAAI,GAAK,IAGpD,EAAW,CACb,CACA,OAAO,CACT,CAxEI,CAAgB,EAAW,EAC7B,OAAS,GACP,MAAI,aAAa,GACT,IAAI,GAAe,EAAW,EAAe,MAE/C,CACR,CACF,CASO,SAAS,GAAqB,EAAO,GAC1C,IAAI,EAAY,GAAQ,GACpB,EAAiB,EAAM,QAEvB,EAAgB,EAAM,YAE1B,GAD4B,EAAM,WAAkB,EAAgB,IAAM,EAExE,MAAM,IAAI,MAAM,mCAIlB,GAFkB,GAAiB,EAElB,CACf,GAFuB,EAAgB,GAAc,EAKnD,MAAM,IAAI,MAAM,qCAAuC,EAAgB,uBAAyB,GAFhG,EAAe,IAAkB,EAAgB,CAIrD,CACA,OAAO,CACT,CAOA,SAAS,GAAQ,GACf,OAAO,EAAM,SAAQ,EAAM,IAAS,EAAO,GAAM,EACnD,CA8FO,SAAS,GAAU,EAAO,EAAM,EAAO,GAC5C,IAAI,EAAI,GAAQ,GAAU,GAG1B,GAAI,EACF,QAAS,EAAI,EAAG,EAAI,EAAO,IACzB,EAAQ,CAAC,GACT,EAAE,QAAQ,GAMd,IADA,EAAQ,GAAW,EAAO,EAAM,GACzB,EAAE,OAAS,GAChB,EAAE,KAAK,GAET,OAAO,CACT,CAUA,SAAS,GAAW,EAAO,EAAM,GAC/B,IAAI,EAAG,EACP,GAAI,MAAM,QAAQ,GAAQ,CACxB,IAAI,EAAO,EAAM,EACjB,IAAK,EAAI,EAAG,EAAK,EAAM,OAAQ,EAAI,EAAI,IACrC,EAAM,GAAK,GAAW,EAAM,GAAI,EAAM,EAE1C,MACE,QAAS,EAAI,EAAK,EAAI,EAAM,IAC1B,EAAQ,CAAC,GAGb,OAAO,CACT,CAgKO,SAAS,GAAiB,EAAO,GAItC,QAHI,EACA,EAAS,EAEJ,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACrC,IAAI,EAAO,EAAM,GACb,EAAW,MAAM,QAAQ,GAQ7B,GALU,IAAN,GAAW,IACb,EAAS,EAAK,QAIZ,GAAY,EAAK,SAAW,EAC9B,OAEF,IAAI,EAAW,EAAW,GAAiB,EAAM,GAC/C,EAAO,GACT,YAAI,EACF,EAAO,UACE,IAAS,EAClB,MAAO,OAIX,CACA,OAAO,CACT,CA8BA,SAAS,GAAgB,EAAG,EAAG,EAAW,GACxC,GAAI,EAAM,EAAW,CAEnB,GAAI,EAAE,SAAW,EAAE,OACjB,MAAM,IAAI,GAAe,EAAE,OAAQ,EAAE,QAGvC,QADI,EAAI,GACC,EAAI,EAAG,EAAI,EAAE,OAAQ,IAC5B,EAAE,GAAK,GAAgB,EAAE,GAAI,EAAE,GAAI,EAAW,EAAM,GAEtD,OAAO,CACT,CAEE,OAAO,EAAE,OAAO,EAEpB,CAQO,SAAS,KACd,IAAI,EAAS,MAAM,UAAU,MAAM,KAAK,UAAW,MAC/C,EAAY,MAAM,UAAU,MAAM,KAAK,cAC3C,GAAsB,IAAlB,EAAO,OACT,OAAO,EAAO,GAEhB,GAAI,EAAO,OAAS,EAClB,OAAO,EAAO,MAAM,GAAG,iBAAiB,EAAG,GACzC,OAAO,GAAgB,EAAG,EAAG,EAAW,EAC1C,GAAG,EAAO,IAEV,MAAM,IAAI,MAAM,+CAEpB,CAoCO,SAAS,GAAuB,EAAM,GAG3C,QAFI,EAAI,EAAO,OACX,EAAM,EAAK,OACN,EAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,IAAI,EAAI,EAAI,EAAM,EAClB,GAAI,EAAK,GAAK,EAAO,IAAM,EAAK,GAAK,GAAK,EAAK,GAAK,EAAO,GACzD,MAAM,IAAI,MAAM,wDAAwD,OAAO,EAAM,0CAA0C,OAAO,EAAK,eAAe,OAAO,EAAK,GAAI,aAAa,OAAO,EAAO,IAEzM,CACF,CAQO,SAAS,GAAY,EAAO,GACjC,IAAI,EAAQ,GAAU,GACtB,GAAI,GAAgB,EAAO,GACzB,OAAO,EAET,GAAuB,EAAO,GAC9B,IAqDsB,EAAgB,EAAe,EArDjD,aAnDJ,QAAS,EAAO,UAAU,OAAQ,EAAQ,IAAI,MAAM,GAAO,EAAO,EAAG,EAAO,EAAM,IAChF,EAAM,GAAQ,UAAU,GAM1B,QAJI,EAAa,EAAM,KAAI,GAAK,EAAE,SAC9B,EAAI,KAAK,OAAO,GAChB,EAAU,IAAI,MAAM,GAAG,KAAK,MAEvB,EAAI,EAAG,EAAI,EAAM,OAAQ,IAGhC,QAFI,EAAO,EAAM,GACb,EAAM,EAAW,GACZ,EAAI,EAAG,EAAI,EAAK,IAAK,CAC5B,IAAI,EAAI,EAAI,EAAM,EACd,EAAK,GAAK,EAAQ,KACpB,EAAQ,GAAK,EAAK,GAEtB,CAEF,QAAS,EAAM,EAAG,EAAM,EAAM,OAAQ,IACpC,GAAuB,EAAM,GAAM,GAErC,OAAO,CACT,CA8BM,CAAiC,EAAO,GACxC,EAAI,EAAgB,OACpB,EAAa,IAAI,MAAM,EAAI,EAAM,QAAQ,KAAK,MAAO,GACrD,EAkLG,GAAS,GAlLF,GAEV,EAAM,OAAS,IAEjB,EAAQ,GADR,EAAI,GAAQ,EAAG,KAKjB,QAAS,EAAM,EAAG,EAAM,EAAG,IACrB,EAAM,GAAO,EAAgB,KAyCb,EAxCN,EAwCsB,EAxCnB,EAAgB,GAwCkB,EAxCZ,EACrC,EAAQ,GADR,EAyCG,MAAU,MAAM,GAAe,KAAK,GAAiB,KArC5D,OAAO,CACT,CAmDO,SAAS,GAAI,EAAO,GACzB,IAAK,MAAM,QAAQ,GACjB,MAAM,IAAI,MAAM,kBAElB,IAAI,EAAO,GAAU,GACrB,GAAI,EAAM,SAAW,EAAK,OACxB,MAAM,IAAI,GAAe,EAAM,OAAQ,EAAK,QAE9C,QAAS,EAAI,EAAG,EAAI,EAAM,OAAQ,IAChC,GAAc,EAAM,GAAI,EAAK,IAE/B,OAAO,EAAM,SAAQ,EAAK,IAAS,EAAI,IAAO,EAChD,CAaO,SAAS,GAAQ,EAAO,GAC7B,IAAI,EAAY,UAAU,OAAS,QAAe,IAAV,UAAU,IAAmB,UAAU,GAC/E,GAAqB,IAAjB,EAAM,OACR,MAAO,GAET,GAAI,EACF,gBAiBO,EAAa,GACpB,GAAI,MAAM,QAAQ,GAAQ,CAGxB,QAFI,EAAI,EAAM,OACV,EAAS,MAAM,GACV,EAAI,EAAG,EAAI,EAAG,IACrB,EAAO,GAAK,EAAa,EAAM,IAEjC,OAAO,CACT,CACE,OAAO,EAAS,EAEpB,CA5BE,CAAoB,GAEtB,IAAI,EAAQ,GACZ,gBACS,EAAsB,EAAO,GACpC,GAAI,MAAM,QAAQ,GAAQ,CAGxB,QAFI,EAAI,EAAM,OACV,EAAS,MAAM,GACV,EAAI,EAAG,EAAI,EAAG,IACrB,EAAM,GAAS,EACf,EAAO,GAAK,EAAsB,EAAM,GAAI,EAAQ,GAEtD,OAAO,CACT,CACE,OAAO,EAAS,EAAO,EAAM,MAAM,EAAG,GAAQ,EAElD,CAbA,CAA6B,EAAO,EA0BtC,CCj2BO,SAAS,GAAiB,EAAU,EAAO,GAChD,IAAI,EAAU,UAAU,OAAS,YAAK,UAAU,IAAmB,UAAU,GAC7E,GAAI,GAAM,gBAAgB,GAAW,CACnC,IAAI,EAQA,EAPJ,GAAI,EACF,EAAoB,MACf,CACL,IAAI,GAAc,EAAM,SAAW,EAAM,OAAS,GAAU,IAAQ,SAAU,IAC1E,EAAa,EAAM,SAAW,EAAM,IAAI,GAAc,GAAI,EAAO,GACrE,WA+E+B,EAAU,EAAO,EAAO,GAE3D,QADI,EAAW,CAAC,EAAO,EAAO,GACrB,EAAI,EAAG,EAAI,EAAG,IAAK,CAC1B,IAAI,EAAO,EAAS,MAAM,EAAG,GAC7B,GAAsC,OAAlC,GAAM,QAAQ,EAAU,GAC1B,OAAO,CAEX,CACF,CAvFM,CAAgD,EAAU,EAAY,EAAY,EACpF,CAEA,GAAI,EAAM,UAA+B,UAAnB,EAAM,mBAAwB,EAAM,SAAwB,CAChF,IAAI,WAsC6B,EAAU,GAC/C,IAAI,EAAoB,GAOxB,GANA,OAAO,QAAQ,EAAS,YAAY,SAAQ,IAC1C,IAAK,EAAW,GAAQ,EACpB,EAAU,MAAM,KAAK,SAAW,GAClC,EAAkB,KAAK,EACzB,IAE+B,IAA7B,EAAkB,OACpB,OAAO,EAAkB,EAE7B,CAjDU,CAAgD,EAAU,GAC9D,WAAe,EAAgC,EAAkB,CACnE,MACE,EAAe,EAEjB,OAAI,GAAqB,GAAK,GAAqB,EAC1C,CACL,QAA+B,IAAtB,EACT,GAAI,WACF,QAAS,EAAO,UAAU,OAAQ,EAAO,IAAI,MAAM,GAAO,EAAO,EAAG,EAAO,EAAM,IAC/E,EAAK,GAAQ,UAAU,GAEzB,OAAO,GAAqB,EAAc,EAAK,MAAM,EAAG,GAAoB,EAAM,EAAS,KAC7F,GAGG,CACL,WACA,GAAI,WACF,QAAS,EAAQ,UAAU,OAAQ,EAAO,IAAI,MAAM,GAAQ,EAAQ,EAAG,EAAQ,EAAO,IACpF,EAAK,GAAS,UAAU,GAE1B,OAAO,GAAqB,EAAc,EAAM,EAAM,EAAS,KACjE,EAEJ,CACA,gBAAI,EACK,CACL,QAAS,GAAuB,GAChC,GAAI,GAGC,CACL,UACA,GAAI,EAGV,CA0BA,SAAS,GAAuB,GAC9B,GAAwB,IAApB,EAAS,OAAc,SAC3B,IAAI,EAAc,EAAS,WAE3B,GAAI,YAAY,KAAK,GAAc,SAGnC,IAAI,EAAY,EAAY,MAAM,WAElC,OAAI,SAAS,KAAK,EAEpB,CAmBA,SAAS,GAAqB,EAAM,EAAM,EAAe,GACvD,IACE,OAAO,KAAQ,EACjB,OAAS,aAcmB,EAAK,EAAM,EAAe,GACtD,IAAI,EAEJ,GAAI,aAAe,WAAyG,eAAhE,QAA1B,EAAY,EAAI,gBAAkB,OAAlB,EAAkD,EAAU,UAA2B,CACvI,IAAI,EAAW,GAQf,MAPA,EAAS,KAAK,UAAU,OAAO,GAAQ,EAAK,MACxC,EAAK,QAAU,GACjB,EAAS,KAAK,UAAU,OAAO,GAAQ,EAAK,MAE1C,EAAK,QAAU,GACjB,EAAS,KAAK,UAAU,OAAO,GAAQ,EAAK,MAExC,IAAI,UAAU,YAAY,OAAO,EAAe,qCAAuC,GAAG,OAAO,EAAc,KAAK,OAAO,EAAS,KAAK,MAAO,eAAe,OAAO,KAAK,UAAU,EAAK,KAClM,CACE,MAAM,IAAI,UAAU,YAAY,OAAO,EAAe,qCAAuC,eAAe,OAAO,EAAc,MAAM,OAAO,EAAI,SAEtJ,CA9BW,CACc,EAAK,EAAM,EAAe,EACjD,CACF,CH1GA,GAAe,UAAY,IAAI,WAC/B,GAAe,UAAU,YAAc,WACvC,GAAe,UAAU,KAAO,iBAChC,GAAe,UAAU,oBCSzB,GAAW,UAAY,IAAI,WAC3B,GAAW,UAAU,YAAc,WACnC,GAAW,UAAU,KAAO,aAC5B,GAAW,UAAU,gBGzBrB,IAEW,GAAwC,GAFxC,cACQ,CAAC,WAC2D,IAC7E,IAAI,OACF,GACE,EAMJ,SAAS,EAAY,EAAM,GACzB,KAAM,gBAAgB,GACpB,MAAM,IAAI,YAAY,oDAExB,GAAI,IAAa,GAAS,GACxB,MAAM,IAAI,MAAM,qBAAuB,GAEzC,GAAI,GAAS,GAEO,gBAAd,EAAK,MAEP,KAAK,MAAQ,GAAM,EAAK,OACxB,KAAK,MAAQ,GAAM,EAAK,OACxB,KAAK,UAAY,GAAY,EAAK,YAGlC,KAAK,MAAQ,EAAK,UAClB,KAAK,MAAQ,EAAK,OAClB,KAAK,UAAY,GAAY,EAAK,mBAE3B,GAAQ,GAAQ,EAAK,OAAS,GAAQ,EAAK,MAEpD,KAAK,MAAQ,EAAK,KAClB,KAAK,MAAQ,EAAK,KAElB,GAAS,KAAK,MAAO,KAAK,OAC1B,KAAK,UAAY,GAAY,EAAK,iBACzB,GAAQ,GAEjB,KAAK,MAAQ,EAAW,GAExB,KAAK,MAAQ,GAAU,KAAK,OAE5B,GAAS,KAAK,MAAO,KAAK,OAE1B,KAAK,UAAY,MACZ,IAAI,EAET,MAAM,IAAI,UAAU,6BAA+B,GAAO,GAAQ,KAGlE,KAAK,MAAQ,GACb,KAAK,MAAQ,CAAC,GACd,KAAK,UAAY,CACnB,CACF,CA+WA,SAAS,EAAQ,EAAQ,EAAM,GAE7B,GAAoB,IAAhB,EAAK,OAAc,CAIrB,QAFI,EAAI,EAAO,MAER,GAAQ,IACb,EAAI,EAAE,GAER,OAAO,CACT,CAKA,OAHA,EAAO,MAAQ,EAAK,MAAM,GAC1B,EAAO,MAAQ,GAAO,EAAO,MAAO,EAAO,MAAO,GAE3C,CACT,CAiCA,SAAS,EAAK,EAAQ,EAAM,GAO1B,QAJA,EAAU,EAAO,MAAM,MAAM,GACzB,KAGG,EAAQ,OAAS,EAAK,QAC3B,EAAQ,KAAK,GACb,KAIF,QAAS,EAAI,EAAG,EAAK,EAAK,OAAQ,EAAI,EAAI,IACpC,EAAK,GAAK,EAAQ,KACpB,EAAQ,GAAK,EAAK,GAClB,MAGA,GAEF,EAAQ,EAAQ,EAAS,EAE7B,CAsgBA,SAAS,EAAW,GAClB,OAAI,GAAS,GACJ,EAAW,EAAK,WAErB,GAAQ,GACH,EAAK,IAAI,GAEX,CACT,CACA,OAr8BA,EAAY,UAAY,IAAI,EAK5B,EAAY,UAAU,kBAAoB,SAAU,EAAM,GACxD,OAAO,IAAI,EAAY,EAAM,EAC/B,EAKA,OAAO,eAAe,EAAa,OAAQ,CACzC,MAAO,gBAET,EAAY,UAAU,YAAc,EACpC,EAAY,UAAU,KAAO,cAC7B,EAAY,UAAU,iBAWtB,EAAY,UAAU,YAAc,WAClC,OAAO,GAAiB,KAAK,MAAO,GACtC,EAWA,EAAY,UAAU,QAAU,WAC9B,MAAO,OACT,EAWA,EAAY,UAAU,SAAW,WAC/B,OAAO,KAAK,SACd,EAQA,EAAY,UAAU,OAAS,SAAU,EAAM,GAC7C,OAAO,IAAI,EAAY,EAAM,EAC/B,EAgBA,EAAY,UAAU,OAAS,SAAU,EAAO,EAAa,GAC3D,OAAQ,UAAU,QAChB,KAAK,EACH,gBAoEQ,EAAQ,GACpB,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,iBAGtB,GADe,EAAM,WAGnB,OAAO,EAAO,IAAI,EAAM,OAGxB,IAAI,EAAO,EAAM,OACjB,GAAI,EAAK,SAAW,EAAO,MAAM,OAC/B,MAAM,IAAI,GAAe,EAAK,OAAQ,EAAO,MAAM,QAMrD,QAFI,EAAM,EAAM,MACZ,EAAM,EAAM,MACP,EAAI,EAAG,EAAK,EAAO,MAAM,OAAQ,EAAI,EAAI,IAChD,GAAc,EAAI,GAAI,EAAO,MAAM,IACnC,GAAc,EAAI,GAAI,EAAO,MAAM,IAIrC,IAkBmB,EAAM,EACvB,EACA,EApBE,EAAe,IAAI,EAAY,IAC/B,GAiBe,EAjBW,EAAO,MAkBnC,GADuB,EAjBmB,GAkBzB,OAAO,OAAS,EACjC,EAAO,MAAM,GACV,CACL,KAGF,SAAS,EAAsB,GAC7B,IAAI,EAAQ,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EAC5E,EAAS,EAAM,UAAU,GAE7B,OADA,EAAK,GAAS,EAAO,OAAO,GACxB,EAAQ,EACH,EAAO,KAAI,IAChB,GAAc,EAAY,EAAK,QACxB,EAAsB,EAAK,GAAa,EAAQ,MACtD,UAEI,EAAO,KAAI,IAChB,GAAc,EAAY,EAAK,QACxB,EAAK,MACX,SAEP,CAlBQ,CAAsB,GAC5B,SAlBA,OAHA,EAAa,MAAQ,EAAU,KAC/B,EAAa,UAAY,EAAO,UAChC,EAAa,MAAQ,EAAU,KACxB,CAEX,CAnGM,CAAY,KAAM,GAGpB,KAAK,EACL,KAAK,EACH,gBA8IQ,EAAQ,EAAO,EAAW,GACtC,IAAK,QAAS,EAAM,QAClB,MAAM,IAAI,UAAU,iBAItB,IAII,EA2EiB,EAAM,EAAO,EAC9B,EAhFA,EAAQ,EAAM,OACd,EAAW,EAAM,WAUrB,GANI,GAAS,IACX,EAAQ,EAAU,OAClB,EAAY,EAAU,WAEtB,EAAQ,GAAU,GAEhB,EAAU,CAIZ,GAAqB,IAAjB,EAAM,OACR,MAAM,IAAI,UAAU,mBAEtB,EAAO,IAAI,EAAM,MAAO,EAAW,EACrC,KAAO,CAIL,IAAK,GAAgB,EAAO,GAC1B,IAME,EAAQ,GAJN,EADmB,IAAjB,EAAM,OACI,GAAY,CAAC,GAAY,GAEzB,GAAY,EAAW,GAGvC,OAAmB,CAIrB,GAAI,EAAM,OAAS,EAAO,MAAM,OAC9B,MAAM,IAAI,GAAe,EAAM,OAAQ,EAAO,MAAM,OAAQ,KAE9D,GAAI,EAAM,OAAS,EAAM,OAAQ,CAI/B,QAFI,EAAI,EACJ,EAAQ,EACQ,IAAb,EAAM,IAAyB,IAAb,EAAM,IAC7B,IAEF,KAAoB,IAAb,EAAM,IACX,IACA,IAIF,EAAY,GAAU,EAAW,EAAM,OAAQ,EAAO,EACxD,CAGA,IAAK,GAAgB,EAAO,GAC1B,MAAM,IAAI,GAAe,EAAO,EAAO,KAIzC,IAAI,EAAO,EAAM,MAAM,cAAc,GACnC,OAAO,EAAI,CACb,IACA,EAAK,EAAQ,EAAM,GAgBA,EAbL,EAAO,MAaW,EAbG,EAcjC,GADuB,EAbG,GAcT,OAAO,OAAS,EAErC,SAAS,EAAsB,EAAM,GACnC,IAAI,EAAQ,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EAC5E,EAAQ,EAAM,UAAU,GACxB,EAAQ,EACV,EAAM,UAAS,EAAY,KACzB,GAAc,EAAY,EAAK,QAC/B,EAAsB,EAAK,GAAa,EAAU,EAAE,IAAK,EAAQ,EAAE,IAGrE,EAAM,UAAS,EAAY,KACzB,GAAc,EAAY,EAAK,QAC/B,EAAK,GAAc,EAAU,EAAE,GAAG,GAGxC,CAfA,CAAsB,EAAM,EAd5B,CACA,OAAO,CACT,CAzNM,CAAY,KAAM,EAAO,EAAa,GACxC,QACE,MAAM,IAAI,YAAY,6BAE5B,EAQA,EAAY,UAAU,IAAM,SAAU,GACpC,OAAO,GAAI,KAAK,MAAO,EACzB,EAYA,EAAY,UAAU,IAAM,SAAU,EAAO,EAAO,GAClD,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kBAEtB,GAAI,EAAM,OAAS,KAAK,MAAM,OAC5B,MAAM,IAAI,GAAe,EAAM,OAAQ,KAAK,MAAM,OAAQ,KAE5D,IAAI,EAAG,EAAI,EAMX,EAAK,KAHM,EAAM,cAAc,GAC7B,OAAO,EAAI,CACb,IACiB,GAGjB,IAAI,EAAO,KAAK,MAChB,IAAK,EAAI,EAAG,EAAK,EAAM,OAAS,EAAG,EAAI,EAAI,IAEzC,GADA,EAAS,EAAM,GACO,EAAK,QAC3B,EAAO,EAAK,GAOd,OAFA,GADA,EAAS,EAAM,EAAM,OAAS,GACR,EAAK,QAC3B,EAAK,GAAU,EACR,IACT,EA8MA,EAAY,UAAU,OAAS,SAAU,EAAM,EAAc,GAE3D,IAAK,GAAa,GAChB,MAAM,IAAI,UAAU,4BAItB,IAAI,EAAY,EAAK,UAAU,KAAI,GAC1B,MAAM,QAAQ,IAA2B,IAAjB,EAAM,OAAe,EAAM,GAAK,IAMjE,OAAO,EAFC,EAAO,KAAK,QAAU,KAEZ,EAAW,EAC/B,EAiCA,EAAY,UAAU,QAAU,SAAU,EAAM,GAC9C,IAAI,EAAI,EAAO,KAAK,QAAU,KAC9B,EAAE,MAAQ,GAAQ,EAAE,MAAO,GAC3B,IAAI,EAAgB,EAAE,MAAM,SAAQ,EAAQ,IAAS,EAAS,IAE9D,OADA,EAAE,MAAQ,GAAqB,EAAM,GAC9B,CACT,EAyCA,EAAY,UAAU,MAAQ,WAM5B,OALQ,IAAI,EAAY,CACtB,KAAM,GAAM,KAAK,OACjB,KAAM,GAAM,KAAK,OACjB,SAAU,KAAK,WAGnB,EAOA,EAAY,UAAU,KAAO,WAC3B,OAAO,KAAK,MAAM,MAAM,EAC1B,EAcA,EAAY,UAAU,IAAM,SAAU,GAEpC,IAAI,EAAU,UAAU,OAAS,YAAK,UAAU,IAAmB,UAAU,GACzE,EAAK,KACL,EAAW,EAAG,MAAM,OAAS,EACjC,GAAI,EAAW,EAAG,OAAO,EAAG,QAC5B,IAAI,EAAe,GAAiB,EAAU,EAAI,MAAO,GACrD,EAAiB,EAAa,GAC9B,EAAS,EAAG,cAAkB,EAAG,WAErC,GADA,EAAO,MAAQ,EAAG,MACd,GAAW,EAAa,QAE1B,OADA,EAAO,eA+BA,EAAa,GACpB,IAAI,EAAQ,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EAC5E,EAAS,MAAM,EAAK,QACxB,GAAI,EAAQ,EACV,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAO,GAAO,EAAa,EAAK,GAAM,EAAQ,QAGhD,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAO,GAAO,EAAe,EAAK,IAGtC,OAAO,CACT,CA5CS,CAAqB,EAAG,OACxB,EAET,GAAiB,IAAb,EAAgB,CAGlB,QAFI,EAAY,EAAG,UACf,EAAO,MAAM,EAAU,QAClB,EAAI,EAAG,EAAI,EAAU,OAAQ,IACpC,EAAK,GAAK,EAAe,EAAU,GAAI,CAAC,GAAI,GAG9C,OADA,EAAO,MAAQ,EACR,CACT,CACA,IAAI,EAAQ,GAEZ,OADA,EAAO,eAEE,EAAQ,GACf,IAAI,EAAQ,UAAU,OAAS,QAAe,IAAV,UAAU,GAAmB,UAAU,GAAK,EAC5E,EAAS,MAAM,EAAK,QACxB,GAAI,EAAQ,EACV,QAAS,EAAK,EAAG,EAAK,EAAK,OAAQ,IACjC,EAAM,GAAS,EACf,EAAO,GAAM,EAAQ,EAAK,GAAK,EAAQ,QAGzC,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAM,GAAS,EACf,EAAO,GAAO,EAAe,EAAK,GAAM,EAAM,QAAS,GAG3D,OAAO,CACT,CAjBO,CAAgB,EAAG,OACnB,CA+BT,EAWA,EAAY,UAAU,QAAU,SAAU,GAExC,IAAI,EAAU,UAAU,OAAS,YAAK,UAAU,IAAmB,UAAU,GACzE,EAAK,KACL,EAAW,EAAG,MAAM,OAAS,EACjC,KAAI,EAAW,GAAf,CACA,IAAI,EAAe,GAAiB,EAAU,EAAI,MAAO,GACrD,EAAiB,EAAa,GAClC,GAAI,GAAW,EAAa,kBA0BnB,EAAa,GACpB,IAAI,EAAQ,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EAChF,GAAI,EAAQ,EACV,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAa,EAAK,GAAM,EAAQ,QAGlC,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAe,EAAK,GAG1B,CArC4B,CACb,EAAG,eAGD,IAAb,EAAJ,CAMA,IAAI,EAAQ,aAEH,EAAQ,GACf,IAAI,EAAQ,UAAU,OAAS,QAAe,IAAV,UAAU,GAAmB,UAAU,GAAK,EAChF,GAAI,EAAQ,EACV,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAM,GAAS,EACf,EAAQ,EAAK,GAAM,EAAQ,QAG7B,QAAS,EAAM,EAAG,EAAM,EAAK,OAAQ,IACnC,EAAM,GAAS,EACf,EAAe,EAAK,GAAM,EAAM,QAAS,EAG/C,CAfY,CACJ,EAAG,MAFX,MAJE,QAAS,EAAI,EAAG,EAAI,EAAG,MAAM,OAAQ,IACnC,EAAe,EAAG,MAAM,GAAI,CAAC,GAAI,EATnB,CAyCpB,EAMA,EAAY,UAAU,OAAO,UAAY,YACvC,IAAI,EAAW,KAAK,MAAM,OAAS,EACnC,KAAI,EAAW,GAGf,GAAiB,IAAb,EAaJ,QAFI,EAAQ,MAAM,EAAW,GAAG,KAAK,GACjC,EAAgB,KAAK,MAAM,SAAQ,EAAG,IAAM,EAAI,GAAG,GAC9C,EAAQ,EAAG,EAAQ,EAAe,IAAS,CAGlD,QADI,EAAU,KAAK,MACV,EAAI,EAAG,EAAI,EAAU,IAC5B,EAAU,EAAQ,EAAM,SAEpB,CACJ,MAAO,EAAQ,EAAM,IACrB,MAAO,EAAM,SAIf,QAAS,EAAK,EAAU,GAAM,IAC5B,EAAM,OACF,EAAM,GAAM,KAAK,MAAM,KAFI,IAG/B,EAAM,GAAM,CAEhB,MA7BE,QAAS,EAAI,EAAG,EAAI,KAAK,MAAM,OAAQ,SAC/B,CACJ,MAAO,KAAK,MAAM,GAClB,MAAO,CAAC,GA2BhB,EAMA,EAAY,UAAU,KAAO,WAC3B,IAAI,EAAS,GAEb,GAAiB,IADT,KAAK,OACP,OACJ,MAAM,IAAI,UAAU,8CAEtB,IAAI,EAAO,KAAK,MAChB,QAAS,KAAO,EACd,EAAO,KAAK,IAAI,EAAY,CAAC,GAAM,KAAK,YAE1C,OAAO,CACT,EAMA,EAAY,UAAU,QAAU,WAC9B,IAAI,EAAQ,KACR,EAAS,GACT,EAAI,KAAK,OACb,GAAiB,IAAb,EAAE,OACJ,MAAM,IAAI,UAAU,8CAOtB,QALI,EAAO,KAAK,MACZ,EAAQ,SAAe,GACzB,IAAI,EAAM,EAAK,KAAI,GAAO,CAAC,EAAI,MAC/B,EAAO,KAAK,IAAI,EAAY,EAAK,EAAM,WACzC,EACS,EAAI,EAAG,EAAI,EAAE,GAAI,IACxB,EAAM,GAER,OAAO,CACT,EAOA,EAAY,UAAU,QAAU,WAC9B,OAAO,GAAM,KAAK,MACpB,EAOA,EAAY,UAAU,QAAU,WAC9B,OAAO,KAAK,KACd,EAWA,EAAY,UAAU,OAAS,SAAU,GACvC,OAAO,GAAO,KAAK,MAAO,EAC5B,EAOA,EAAY,UAAU,SAAW,WAC/B,OAAO,GAAO,KAAK,MACrB,EAOA,EAAY,UAAU,OAAS,WAC7B,MAAO,CACL,OAAQ,cACR,KAAM,KAAK,MACX,KAAM,KAAK,MACX,SAAU,KAAK,UAEnB,EAUA,EAAY,UAAU,SAAW,SAAU,GAEzC,GAAI,GAMF,GAJI,GAAY,KACd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,GAC7B,MAAM,IAAI,UAAU,kDAItB,EAAI,EAgBN,QAdI,EAAS,EAAI,EAAI,EAAI,EACrB,EAAO,EAAI,GAAK,EAAI,EAGpB,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GAGrB,EAAI,KAAK,IAAI,EAAO,EAAM,EAAU,GAGpC,EAAO,GAGF,EAAI,EAAG,EAAI,EAAG,IACrB,EAAK,GAAK,KAAK,MAAM,EAAI,GAAM,EAAI,GAIrC,OAAO,IAAI,EAAY,CACrB,OACA,KAAM,CAAC,GACP,SAAU,KAAK,WAEnB,EAcA,EAAY,SAAW,SAAU,EAAM,EAAO,EAAG,GAC/C,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kCAEtB,GAAoB,IAAhB,EAAK,OACP,MAAM,IAAI,MAAM,4CAkBlB,GAdA,EAAO,EAAK,cAAc,GAOxB,GALI,GAAY,KAEd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,IAAM,EAAI,EACvC,MAAM,IAAI,MAAM,yCAElB,OAAO,CACT,IAGI,GAMF,GAJI,GAAY,KACd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,GAC7B,MAAM,IAAI,UAAU,kDAItB,EAAI,EAEN,IAWI,EAXA,EAAS,EAAI,EAAI,EAAI,EACrB,EAAO,EAAI,GAAK,EAAI,EAGpB,EAAO,EAAK,GACZ,EAAU,EAAK,GAGf,EAAI,KAAK,IAAI,EAAO,EAAM,EAAU,GAMxC,GAAI,GAAQ,GAAQ,CAElB,GAAI,EAAM,SAAW,EAEnB,MAAM,IAAI,MAAM,8BAGlB,EAAS,SAAgB,GAEvB,OAAO,EAAM,EACf,CACF,SAAW,GAAS,GAAQ,CAE1B,IAAI,EAAK,EAAM,OAEf,GAAkB,IAAd,EAAG,QAAgB,EAAG,KAAO,EAE/B,MAAM,IAAI,MAAM,yBAGlB,EAAS,SAAgB,GAEvB,OAAO,EAAM,IAAI,CAAC,GACpB,CACF,MAEE,EAAS,WAEP,OAAO,CACT,EAIG,IAEH,EAAe,GAAY,EAAO,IAAM,EAAO,GAAG,IAAI,GACpD,GAIJ,IAAI,EAAO,GAGX,GAAI,EAAK,OAAS,EAAG,CAEnB,EAAO,GAAO,EAAM,EAAM,GAE1B,QAAS,EAAI,EAAG,EAAI,EAAG,IACrB,EAAK,EAAI,GAAM,EAAI,GAAU,EAAO,EAExC,CAGA,OAAO,IAAI,EAAY,CACrB,OACA,KAAM,CAAC,EAAM,IAEjB,EAUA,EAAY,SAAW,SAAU,GAC/B,OAAO,IAAI,EAAY,EACzB,EAWA,EAAY,UAAU,SAAW,SAAU,EAAG,GAE5C,KAAK,GAAS,IAAO,GAAU,IAAO,GAAS,IAAO,GAAU,IAC9D,MAAM,IAAI,MAAM,uCAGlB,GAA0B,IAAtB,KAAK,MAAM,OACb,MAAM,IAAI,MAAM,4CASlB,OANA,GAAc,EAAG,KAAK,MAAM,IAC5B,GAAc,EAAG,KAAK,MAAM,IAG5B,EAAY,UAAU,EAAG,EAAG,KAAK,OAE1B,IACT,EASA,EAAY,UAAY,SAAU,EAAG,EAAG,GAEtC,IAAI,EAAK,EAAK,GACd,EAAK,GAAK,EAAK,GACf,EAAK,GAAK,CACZ,EAkBO,CAAW,GACjB,CACD,aC19BK,SAAS,GAAQ,EAAO,EAAU,GACvC,IAAK,EACH,OAAI,GAAS,GACJ,EAAM,KAAI,GAAK,EAAS,WAExB,GAAa,EAAO,MAG/B,IAAI,EAAoB,GAAW,IAAN,EAAU,EAAI,EAAS,GACpD,OAAI,GAAS,GACJ,EAAM,KAAI,GAAK,EAAkB,QAAI,GAErC,GAAa,EAAO,KAE/B,CC5DA,IAAI,GAAK,SACL,GAAK,iBACF,SAAS,GAAU,GACxB,OAAO,KAAK,IAAI,EAClB,CAEO,SAAS,GAAU,EAAG,GAC3B,OAAO,EAAI,CACb,CAEO,SAAS,GAAe,EAAG,GAChC,OAAO,EAAI,CACb,CAEO,SAAS,GAAe,EAAG,GAChC,OAAO,EAAI,CACb,CAMO,SAAS,GAAiB,GAC/B,OAAQ,CACV,CAoPO,SAAS,GAAU,EAAG,GAG3B,OAAI,EAAI,EAAI,GAAK,IAAM,KAAY,EAAI,EAAI,GAAK,SACvC,EAEF,KAAK,IAAI,EAAG,EACrB,CChRO,SAAS,GAAQ,EAAG,GACzB,GAAI,EAAI,EACN,OAAO,EAET,GAAI,IAAM,EACR,OAAO,EAET,IAAI,EAAO,EAAI,GAAK,EACpB,OAAO,GAAQ,EAAG,GAAQ,GAAQ,EAAO,EAAG,EAC9C,CCTO,SAAS,GAAY,GAC1B,IAAI,EACJ,GAAI,GAAU,GACZ,OAAI,GAAK,EACA,SAAS,GAAK,IAAW,IAE9B,EAAI,IACC,IAEF,GAAQ,EAAG,EAAI,GAExB,GAAI,EAAI,GACN,OAAO,KAAK,IAAM,KAAK,IAAI,KAAK,GAAK,GAAK,GAAY,EAAI,IAE5D,GAAI,GAAK,OACP,OAAO,IAET,GAAI,EAAI,GAAM,CAEZ,IAAI,EAAO,EAAI,EACX,EAAS,EAAO,EAChB,EAAQ,EAAS,EACjB,EAAQ,EAAQ,EACpB,OAAO,KAAK,KAAK,EAAI,KAAK,GAAK,GAAK,KAAK,IAAI,EAAI,KAAK,EAAG,IAAM,EAAI,GAAK,GAAK,GAAK,GAAK,IAAM,GAAQ,KAAO,MAAQ,GAAU,KAAO,QAAU,GAAS,QAAU,UAAY,GAAS,SAAW,YAAc,EAAQ,GAC1N,GACE,EACF,EAAI,GAAO,GACX,QAAS,EAAI,EAAG,EAAI,GAAO,SAAU,EACnC,GAAK,GAAO,IAAM,EAAI,GAExB,IAAI,EAAI,EAAI,GAAS,GACrB,OAAO,KAAK,KAAK,EAAI,KAAK,IAAM,KAAK,IAAI,EAAG,EAAI,IAAO,KAAK,KAAK,GAAK,CACxE,CF9BA,GAAU,UAAY,GAItB,GAAU,UAAY,GAItB,GAAe,UAAY,GAI3B,GAAe,UAAY,GAQ3B,GAAiB,UAAY,GA2P7B,GAAU,UAAY,GEhPtB,GAAY,UAAY,SAIjB,IAAI,GAAS,UACT,GAAS,CAAC,kBAAwB,qCAA+C,sCAAgD,qBAA2B,2CAAuD,4CAAuD,4CAAuD,4CAAuD,uBCxC/X,GAAO,SAEA,GAA8B,GAAQ,GAD9B,CAAC,QAAS,gBACwC,IACnE,IAAI,MACF,EAAK,YACL,GACE,EAkCJ,OAAO,EAAM,GAAM,CACjB,0CAA2C,GAAK,EAAY,EAAG,GAC/D,OAAQ,GAAW,KAAN,EACb,KAAM,EAAM,aAAY,GAAQ,GAAK,EAAM,KAAK,EAAM,EAAE,YAAnB,CAAgC,EAAE,SACvE,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,MAC5D,IC9CO,GAAoC,GAAQ,eAAgB,CAAC,UAAU,IAChF,IAAI,MACF,GACE,EACJ,MAAO,CACL,aAAc,EAAM,aAAY,GAAQ,CAAC,EAAG,KAC1C,IAAK,EAAE,UAAU,GACf,MAAM,IAAI,MAAM,4CAElB,OAAO,EAAM,KAAK,EAAM,CAAC,EAAE,YAAa,EAAE,aAAnC,CAAiD,EAAE,MAAO,EAAE,UAEtE,ICPC,GAAO,cAEA,GAAmC,GAAQ,GADnC,CAAC,QAAS,WAC6C,IACxE,IAAI,MACF,EAAK,OACL,GACE,EACA,EAAe,GAAmB,CACpC,UAWF,OAAO,EAAM,GAAM,CACjB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,IAAM,CACf,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,GAAY,EAAG,EAAG,EAAO,OAAQ,EAAO,OACjD,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAO,EAAE,GAAG,aChBU,EAAG,GAC7B,IAAI,EAAS,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,KAC7E,EAAS,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,EACjF,GAAI,GAAU,EACZ,MAAM,IAAI,MAAM,6CAElB,GAAI,EAAS,EACX,MAAM,IAAI,MAAM,yCAGlB,OAAI,EAAE,UAAW,EAAE,UAGd,EAAE,YAAe,EAAE,aAIpB,EAAE,GAAG,IAIF,EAAE,MAAM,GAAG,MAAM,IAAI,EAAE,YAAY,IAAI,EAAE,YAAY,IAAI,EAAE,MAAO,EAAE,OAAO,IAAI,GAAS,IAPtF,EAAE,GAAG,GAQhB,CDNkB,CAAqB,EAAG,EAAG,EAAO,OAAQ,EAAO,OAC/D,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,IAAM,CACf,EACA,qBAAsB,SAA2B,EAAG,GAClD,OAAO,EAAE,OAAO,EAClB,EACA,mBAAoB,SAAyB,EAAG,GAC9C,OE9BwB,EF8BH,EE9BM,EF8BH,EE9BM,EF8BH,EAAO,OE9BI,EF8BI,EAAO,OE7B9C,GAAY,EAAE,GAAI,EAAE,GAAI,EAAQ,IAAW,GAAY,EAAE,GAAI,EAAE,GAAI,EAAQ,GF6B9E,IE9BwB,EAAG,EAAG,EAAQ,CF+BxC,GACC,EAAa,IAEmB,GAAQ,GAAM,CAAC,QAAS,WAAW,IACtE,IAAI,MACF,EAAK,OACL,GACE,EACJ,OAAO,EAAM,GAAM,CACjB,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,GAAY,EAAG,EAAG,EAAO,OAAQ,EAAO,OACjD,GACA,IG9CJ,IAEW,GAAyC,GAFzC,eACQ,CAAC,QAAS,cAAe,WACoC,IAC9E,IAAI,MACF,EAAK,YACL,EAAW,OACX,GACE,EAOJ,SAAS,EAAa,EAAM,GAC1B,KAAM,gBAAgB,GACpB,MAAM,IAAI,YAAY,oDAExB,GAAI,IAAa,GAAS,GACxB,MAAM,IAAI,MAAM,qBAAuB,GAEzC,GAAI,GAAS,GAyBY,EAvBL,KAuBqB,EAvBT,EAyBZ,kBAFa,EAvBP,GAyBf,MAET,EAAO,QAAU,EAAO,QAAU,GAAM,EAAO,gBAC/C,EAAO,OAAS,GAAM,EAAO,QAC7B,EAAO,KAAO,GAAM,EAAO,MAC3B,EAAO,MAAQ,GAAM,EAAO,OAC5B,EAAO,UAAY,GAAY,EAAO,WAGtC,EAAiB,EAAQ,EAAO,UAAW,GAAY,EAAO,gBAlChC,GACrB,GAAQ,GAAQ,EAAK,QAAU,GAAQ,EAAK,MAAQ,GAAQ,EAAK,MAE1E,KAAK,QAAU,EAAK,OACpB,KAAK,OAAS,EAAK,MACnB,KAAK,KAAO,EAAK,IACjB,KAAK,MAAQ,EAAK,KAClB,KAAK,UAAY,GAAY,EAAK,iBACzB,GAAQ,GAEjB,EAAiB,KAAM,EAAM,OACxB,IAAI,EAET,MAAM,IAAI,UAAU,6BAA+B,GAAO,GAAQ,KAGlE,KAAK,QAAU,GACf,KAAK,OAAS,GACd,KAAK,KAAO,CAAC,GACb,KAAK,MAAQ,CAAC,EAAG,GACjB,KAAK,UAAY,CACnB,CAvBa,IAyBY,EAAQ,EAAQ,CAD3C,CAeA,SAAS,EAAiB,EAAQ,EAAM,GAEtC,EAAO,QAAU,GACjB,EAAO,OAAS,GAChB,EAAO,KAAO,GACd,EAAO,UAAY,EAEnB,IAAI,EAAO,EAAK,OACZ,EAAU,EAGV,EAAK,EAEL,EAAO,EASX,GARI,GAAS,KAEX,EAAK,EAAM,KAAK,EAAa,CAAC,EAAU,KAAc,EAEtD,EAAO,EAAM,QAAQ,EAAG,IAItB,EAAO,EAAG,CAEZ,IAAI,EAAI,EACR,EAAG,CAED,EAAO,KAAK,KAAK,EAAO,OAAO,QAE/B,QAAS,EAAI,EAAG,EAAI,EAAM,IAAK,CAE7B,IAAI,EAAM,EAAK,GAEf,GAAI,GAAQ,IAMV,GAJU,IAAN,GAAW,EAAU,EAAI,SAC3B,EAAU,EAAI,QAGZ,EAAI,EAAI,OAAQ,CAElB,IAAI,EAAI,EAAI,GAEP,EAAG,EAAG,KAET,EAAO,QAAQ,KAAK,GAEpB,EAAO,OAAO,KAAK,GAEvB,OAGU,IAAN,GAAW,EAAU,IACvB,EAAU,GAGP,EAAG,EAAK,KAEX,EAAO,QAAQ,KAAK,GAEpB,EAAO,OAAO,KAAK,GAGzB,CAEA,GACF,OAAS,EAAI,EACf,CAEA,EAAO,KAAK,KAAK,EAAO,OAAO,QAE/B,EAAO,MAAQ,CAAC,EAAM,EACxB,CA2YA,SAAS,EAAe,EAAG,EAAK,EAAQ,GAEtC,GAAI,EAAS,GAAQ,EACnB,OAAO,EAGT,QAAS,EAAI,EAAK,EAAI,EAAQ,IAE5B,GAAI,EAAM,KAAO,EACf,OAAO,EAIX,OAAO,CACT,CAUA,SAAS,EAAQ,EAAG,EAAG,EAAG,EAAG,EAAQ,EAAO,GAE1C,EAAO,OAAO,EAAG,EAAG,GAEpB,EAAM,OAAO,EAAG,EAAG,GAEnB,QAAS,EAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAClC,EAAI,IAER,CA2CA,SAAS,EAAQ,EAAQ,EAAM,EAAS,GAEtC,IAAI,EAAQ,GAAgB,EAGxB,EAAK,EAEL,EAAO,EACP,GAAS,EAAO,aAElB,EAAK,EAAM,KAAK,EAAa,CAAC,EAAO,UAAW,EAAO,aAAe,EAEtE,EAAO,EAAM,QAAQ,EAAG,EAAO,WAE/B,EAAQ,EAAM,QAAQ,EAAO,EAAO,YAItC,IAKI,EAAG,EAAG,EALN,GAAO,EAAG,EAAO,GAGjB,EAAI,EAAO,MAAM,GACjB,EAAI,EAAO,MAAM,GAIrB,GAAI,EAAU,EAAG,CAEf,IAAK,EAAI,EAAG,EAAI,EAAS,IAIvB,GAFA,EAAO,KAAK,GAAK,EAAO,QAAQ,OAE5B,EAEF,IAAK,EAAI,EAAG,EAAI,EAAG,IAEjB,EAAO,QAAQ,KAAK,GAEpB,EAAO,OAAO,KAAK,GAKzB,EAAO,KAAK,GAAW,EAAO,QAAQ,MACxC,MAAW,EAAU,IAEnB,EAAO,KAAK,OAAO,EAAU,EAAG,EAAI,GAEpC,EAAO,QAAQ,OAAO,EAAO,KAAK,GAAU,EAAO,QAAQ,QAC3D,EAAO,OAAO,OAAO,EAAO,KAAK,GAAU,EAAO,OAAO,SAM3D,GAHA,EAAI,EAGA,EAAO,GAET,GAAI,EAAK,CAEP,IAAI,EAAI,EAER,IAAK,EAAI,EAAG,EAAI,EAAG,IAAK,CAEtB,EAAO,KAAK,GAAK,EAAO,KAAK,GAAK,EAElC,EAAI,EAAO,KAAK,EAAI,GAAK,EAEzB,IAAI,EAAI,EAER,IAAK,EAAI,EAAG,EAAI,EAAM,IAAK,IAEzB,EAAO,QAAQ,OAAO,EAAI,EAAG,EAAG,GAEhC,EAAO,OAAO,OAAO,EAAI,EAAG,EAAG,GAE/B,GAEJ,CAEA,EAAO,KAAK,GAAK,EAAO,QAAQ,MAClC,UACS,EAAO,EAAG,CAEnB,IAAI,EAAI,EAER,IAAK,EAAI,EAAG,EAAI,EAAG,IAAK,CAEtB,EAAO,KAAK,GAAK,EAAO,KAAK,GAAK,EAElC,IAAI,EAAK,EAAO,KAAK,GACjB,EAAK,EAAO,KAAK,EAAI,GAAK,EAE9B,IAAK,EAAI,EAAI,EAAI,EAAI,KAEnB,EAAI,EAAO,OAAO,IAEV,EAAO,IAEb,EAAO,QAAQ,OAAO,EAAG,GAEzB,EAAO,OAAO,OAAO,EAAG,GAExB,IAGN,CAEA,EAAO,KAAK,GAAK,EAAO,QAAQ,MAClC,CAKA,OAHA,EAAO,MAAM,GAAK,EAClB,EAAO,MAAM,GAAK,EAEX,CACT,CA4UA,SAAS,EAAS,EAAQ,EAAO,EAAK,EAAM,GAE1C,IAKI,EAAG,EALH,EAAO,EAAK,GACZ,EAAU,EAAK,GAEf,EAAI,GAIR,IAAK,EAAI,EAAG,EAAI,EAAM,IAEpB,IADA,EAAE,GAAK,GACF,EAAI,EAAG,EAAI,EAAS,IACvB,EAAE,GAAG,GAAK,EAKd,IAAK,EAAI,EAAG,EAAI,EAAS,IAKvB,QAHI,EAAK,EAAI,GACT,EAAK,EAAI,EAAI,GAER,EAAI,EAAI,EAAI,EAAI,IAIvB,EAFA,EAAI,EAAM,IAEL,GAAK,EAAS,EAAO,GAAM,EAAO,IAAM,EAAO,GAAK,EAG7D,OAAO,CACT,CA4YA,OA9zCA,EAAa,UAAY,IAAI,EAK7B,EAAa,UAAU,mBAAqB,SAAU,EAAM,GAC1D,OAAO,IAAI,EAAa,EAAM,EAChC,EAKA,OAAO,eAAe,EAAc,OAAQ,CAC1C,MAAO,iBAET,EAAa,UAAU,YAAc,EACrC,EAAa,UAAU,KAAO,eAC9B,EAAa,UAAU,kBAWvB,EAAa,UAAU,YAAc,WACnC,OAAO,GAAiB,KAAK,QAAS,GACxC,EAWA,EAAa,UAAU,QAAU,WAC/B,MAAO,QACT,EAWA,EAAa,UAAU,SAAW,WAChC,OAAO,KAAK,SACd,EAQA,EAAa,UAAU,OAAS,SAAU,EAAM,GAC9C,OAAO,IAAI,EAAa,EAAM,EAChC,EAWA,EAAa,UAAU,QAAU,WAE/B,IAAI,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GAEzB,OAAgB,IAAT,GAA0B,IAAZ,EAAgB,KAAK,OAAO,QAAU,EAAO,GAAW,CAC/E,EAgBA,EAAa,UAAU,OAAS,SAAU,EAAO,EAAa,GAE5D,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,iDAIlB,OAAQ,UAAU,QAChB,KAAK,EACH,gBAUc,EAAQ,GAE1B,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,iBAGtB,GADe,EAAI,WAGjB,OAAO,EAAO,IAAI,EAAI,OAGxB,IAMI,EAAG,EAAI,EAAG,EANV,EAAO,EAAI,OACf,GAAI,EAAK,SAAW,EAAO,MAAM,OAC/B,MAAM,IAAI,GAAe,EAAK,OAAQ,EAAO,MAAM,QAOrD,IAAI,EAAM,EAAI,MACV,EAAM,EAAI,MACd,IAAK,EAAI,EAAG,EAAK,EAAO,MAAM,OAAQ,EAAI,EAAI,IAC5C,GAAc,EAAI,GAAI,EAAO,MAAM,IACnC,GAAc,EAAI,GAAI,EAAO,MAAM,IAIrC,IAAI,EAAU,EAAO,QACjB,EAAS,EAAO,OAChB,EAAO,EAAO,KAGd,EAAO,EAAI,UAAU,GACrB,EAAU,EAAI,UAAU,GAGxB,EAAI,GACJ,EAAK,GAGT,EAAK,kBAAkB,EAAG,GAExB,EAAG,GAAK,EAAE,GAEV,EAAE,KACJ,IAGA,IAAI,EAAS,EAAU,UACnB,EAAQ,GACR,EAAM,GAyBV,OAtBA,EAAQ,kBAAkB,GAIxB,IAFA,EAAI,KAAK,EAAM,QAEV,EAAI,EAAK,GAAI,EAAK,EAAK,EAAI,GAAI,EAAI,EAAI,IAE1C,EAAI,EAAO,QAEP,EAAE,KAEJ,EAAM,KAAK,EAAG,IAEV,GACF,EAAO,KAAK,EAAQ,IAI5B,IAEA,EAAI,KAAK,EAAM,QAGR,IAAI,EAAa,CACtB,SACA,QACA,MACA,OACA,SAAU,EAAO,WAErB,CA7FM,CAAkB,KAAM,GAG1B,KAAK,EACL,KAAK,EACH,gBAyFc,EAAQ,EAAO,EAAW,GAE5C,IAAK,QAAS,EAAM,QAClB,MAAM,IAAI,UAAU,iBAItB,IAII,EAJA,EAAQ,EAAM,OACd,EAAW,EAAM,WAerB,GAXI,GAAS,IAEX,EAAQ,EAAU,OAElB,EAAY,EAAU,WAGtB,EAAQ,GAAU,GAIhB,EAAU,CAEZ,GAAqB,IAAjB,EAAM,OACR,MAAM,IAAI,UAAU,mBAGtB,EAAO,IAAI,EAAM,MAAO,EAAW,EACrC,KAAO,CAEL,GAAqB,IAAjB,EAAM,QAAiC,IAAjB,EAAM,OAC9B,MAAM,IAAI,GAAe,EAAM,OAAQ,EAAO,MAAM,OAAQ,KAI9D,GAAI,EAAM,OAAS,EAAM,OAAQ,CAI/B,QAFI,EAAI,EACJ,EAAQ,EACQ,IAAb,EAAM,IAAyB,IAAb,EAAM,IAC7B,IAEF,KAAoB,IAAb,EAAM,IACX,IACA,IAGF,EAAY,GAAU,EAAW,EAAM,OAAQ,EAAO,EACxD,CAGA,IAAK,GAAgB,EAAO,GAC1B,MAAM,IAAI,GAAe,EAAO,EAAO,KAIzC,GAAqB,IAAjB,EAAM,OAEI,EAAM,UAAU,GACtB,kBAAkB,EAAW,GACjC,GAAc,GACd,EAAO,IAAI,CAAC,EAAW,GAAI,EAAU,EAAS,IAAK,EACrD,QACK,CAEL,IAAI,EAAsB,EAAM,UAAU,GACtC,EAAuB,EAAM,UAAU,GAC3C,EAAoB,kBAAkB,EAAgB,GACpD,GAAc,GACd,EAAqB,kBAAkB,EAAiB,GACtD,GAAc,GACd,EAAO,IAAI,CAAC,EAAgB,GAAkB,EAAU,EAAc,IAAI,EAAe,IAAK,EAChG,GACF,GACF,CACF,CACA,OAAO,CACT,CAxKM,CAAkB,KAAM,EAAO,EAAa,GAC9C,QACE,MAAM,IAAI,YAAY,6BAE5B,EA4KA,EAAa,UAAU,IAAM,SAAU,GACrC,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kBAEtB,GAAI,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAI,GAAe,EAAM,OAAQ,KAAK,MAAM,QAIpD,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,8CAIlB,IAAI,EAAI,EAAM,GACV,EAAI,EAAM,GAGd,GAAc,EAAG,KAAK,MAAM,IAC5B,GAAc,EAAG,KAAK,MAAM,IAG5B,IAAI,EAAI,EAAe,EAAG,KAAK,KAAK,GAAI,KAAK,KAAK,EAAI,GAAI,KAAK,QAE/D,OAAI,EAAI,KAAK,KAAK,EAAI,IAAM,KAAK,OAAO,KAAO,EACtC,KAAK,QAAQ,GAEf,CACT,EAYA,EAAa,UAAU,IAAM,SAAU,EAAO,EAAG,GAC/C,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kBAEtB,GAAI,EAAM,SAAW,KAAK,MAAM,OAC9B,MAAM,IAAI,GAAe,EAAM,OAAQ,KAAK,MAAM,QAIpD,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,8CAIlB,IAAI,EAAI,EAAM,GACV,EAAI,EAAM,GAGV,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GAGrB,EAAK,EAEL,EAAO,EACP,GAAS,KAAK,aAEhB,EAAK,EAAM,KAAK,EAAa,CAAC,KAAK,UAAW,KAAK,aAAe,EAElE,EAAO,EAAM,QAAQ,EAAG,KAAK,aAI3B,EAAI,EAAO,GAAK,EAAI,EAAU,KAEhC,EAAQ,KAAM,KAAK,IAAI,EAAI,EAAG,GAAO,KAAK,IAAI,EAAI,EAAG,GAAU,GAE/D,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,IAIvB,GAAc,EAAG,GACjB,GAAc,EAAG,GAGjB,IAAI,EAAI,EAAe,EAAG,KAAK,KAAK,GAAI,KAAK,KAAK,EAAI,GAAI,KAAK,QAiB/D,OAfI,EAAI,KAAK,KAAK,EAAI,IAAM,KAAK,OAAO,KAAO,EAExC,EAAG,EAAG,YA8BE,EAAG,EAAG,EAAQ,EAAO,GAEpC,EAAO,OAAO,EAAG,GACjB,EAAM,OAAO,EAAG,GAEhB,QAAS,EAAI,EAAI,EAAG,EAAI,EAAI,OAAQ,IAClC,EAAI,IAER,CAtCe,CAKD,EAAG,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,MAH9C,KAAK,QAAQ,GAAK,EAMf,EAAG,EAAG,IAET,EAAQ,EAAG,EAAG,EAAG,EAAG,KAAK,QAAS,KAAK,OAAQ,KAAK,MAGjD,IACT,EAmDA,EAAa,UAAU,OAAS,SAAU,EAAM,EAAc,GAE5D,IAAK,GAAa,GAChB,MAAM,IAAI,UAAU,4BAItB,IAAI,EAAY,EAAK,UAAU,KAAI,GAC1B,MAAM,QAAQ,IAA2B,IAAjB,EAAM,OAAe,EAAM,GAAK,IAEjE,GAAyB,IAArB,EAAU,OACZ,MAAM,IAAI,MAAM,4CAalB,OATA,EAAU,kBAAkB,GAC1B,IAAK,GAAS,KAAW,GAAU,IAAU,EAAQ,EACnD,MAAM,IAAI,UAAU,uDAA8D,GAAO,GAAa,IAE1G,IAKO,EAFC,EAAO,KAAK,QAAU,KAEZ,EAAU,GAAI,EAAU,GAAI,EAChD,EAqIA,EAAa,UAAU,QAAU,SAAU,EAAO,GAEhD,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kBAEtB,GAAqB,IAAjB,EAAM,OACR,MAAM,IAAI,MAAM,0DAIlB,EAAM,kBAAkB,GACtB,IAAK,GAAS,KAAW,GAAU,IAAU,OAAyB,IAAV,EAC1D,MAAM,IAAI,UAAU,6DAAoE,GAAO,GAAS,IAE5G,IACA,IAAI,EAAgB,KAAK,MAAM,GAAK,KAAK,MAAM,GAK/C,GAAI,KAJJ,EAAQ,GAAqB,EAAO,IACd,GAAK,EAAM,GAI/B,MAAM,IAAI,MAAM,uEAIlB,IAAI,EAAI,EAAO,KAAK,QAAU,KAG9B,GAAI,KAAK,MAAM,KAAO,EAAM,IAAM,KAAK,MAAM,KAAO,EAAM,GACxD,OAAO,EAKT,QADI,EAAW,GACN,EAAI,EAAG,EAAI,EAAE,KAAK,OAAQ,IACjC,QAAS,EAAI,EAAG,EAAI,EAAE,KAAK,EAAI,GAAK,EAAE,KAAK,GAAI,IAC7C,EAAS,KAAK,GAWlB,QANI,EAAS,EAAE,QAAQ,QAGnB,EAAW,EAAE,OAAO,QAGf,EAAK,EAAG,EAAK,EAAE,OAAO,OAAQ,IAAM,CAC3C,IAAI,EAAK,EAAS,GACd,EAAK,EAAS,GACd,EAAO,EAAK,EAAE,MAAM,GAAK,EAC7B,EAAS,GAAM,EAAO,EAAM,GAC5B,EAAS,GAAM,KAAK,MAAM,EAAO,EAAM,GACzC,CASA,EAAE,QAAQ,OAAS,EACnB,EAAE,OAAO,OAAS,EAClB,EAAE,KAAK,OAAS,EAAM,GAAK,EAC3B,EAAE,MAAQ,EAAM,QAChB,QAAS,EAAM,EAAG,EAAM,EAAE,KAAK,OAAQ,IACrC,EAAE,KAAK,GAAO,EAKhB,QAAS,EAAI,EAAG,EAAI,EAAO,OAAQ,IAAK,CACtC,IAAI,EAAM,EAAS,GACf,EAAK,EAAS,GACd,EAAI,EAAO,GAEf,EADQ,EAAe,EAAK,EAAE,KAAK,GAAK,EAAE,KAAK,EAAK,GAAI,EAAE,QAC/C,EAAK,EAAI,EAAG,EAAE,QAAS,EAAE,OAAQ,EAAE,KAChD,CAIA,OAAO,CACT,EAOA,EAAa,UAAU,MAAQ,WAQ7B,OAPQ,IAAI,EAAa,CACvB,OAAQ,KAAK,QAAU,GAAM,KAAK,gBAClC,MAAO,GAAM,KAAK,QAClB,IAAK,GAAM,KAAK,MAChB,KAAM,GAAM,KAAK,OACjB,SAAU,KAAK,WAGnB,EAOA,EAAa,UAAU,KAAO,WAC5B,OAAO,KAAK,MAAM,MAAM,EAC1B,EAaA,EAAa,UAAU,IAAM,SAAU,EAAU,GAE/C,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,8CAGlB,IAAI,EAAK,KAEL,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GACrB,EAAe,GAAiB,EAAU,EAAI,OAOlD,gBAOY,EAAQ,EAAQ,EAAQ,EAAW,EAAW,EAAU,GAEpE,IAAI,EAAS,GACT,EAAQ,GACR,EAAM,GAGN,EAAK,EAEL,EAAO,EACP,GAAS,EAAO,aAElB,EAAK,EAAM,KAAK,EAAa,CAAC,EAAO,UAAW,EAAO,aAAe,EAEtE,EAAO,EAAM,QAAQ,EAAG,EAAO,YAgBjC,QAZI,EAAS,SAAgB,EAAG,EAAG,GAEjC,IAAI,EA3BsC,SALf,EAAG,EAAG,GAEjC,OAAO,EAAa,GAAG,EAAG,CAAC,EAAG,GAAI,EACpC,CA6Bc,CAAS,EAAG,EAAG,GAEtB,EAAG,EAAO,KAEb,EAAO,KAAK,GAEZ,EAAM,KAAK,GAEf,EAES,EArCsB,EAqCP,GAAK,EAAW,IAAK,CAE3C,EAAI,KAAK,EAAO,QAEhB,IAAI,EAAK,EAAO,KAAK,GACjB,EAAK,EAAO,KAAK,EAAI,GACzB,GAAI,EAEF,QAAS,EAAI,EAAI,EAAI,EAAI,IAAK,CAE5B,IAAI,EAAI,EAAO,OAAO,GAElB,GAjDQ,GAiDO,GAAK,GAEtB,EAAO,EAAO,QAAQ,GAAI,EAnDhB,EAmD4B,EAnDf,EAqD3B,KACK,CAGL,QADI,EAAU,GACL,EAAK,EAAI,EAAK,EAAI,IAEzB,EADU,EAAO,OAAO,IACT,EAAO,QAAQ,GAKhC,QAAS,EAhEK,EAgES,GAAO,EAAQ,IAEpC,EADY,KAAO,EAAU,EAAQ,GAAO,EAC9B,EAlEF,EAkEgB,EAlEH,EAoE7B,CACF,CAKA,OAFA,EAAI,KAAK,EAAO,QAET,IAAI,EAAa,CACtB,SACA,QACA,MACA,KAAM,CAAC,EA9ES,EA8ES,EAAG,EA9EC,EA8EuB,IAExD,CAhFE,CAAY,KAAM,EAAG,EAAO,EAAG,EAAG,EAAU,IAAW,EACzD,EA2FA,EAAa,UAAU,QAAU,SAAU,EAAU,GAEnD,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,kDASlB,QANI,EAAK,KAEL,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GACrB,EAAe,GAAiB,EAAU,EAAI,WAEzC,EAAI,EAAG,EAAI,EAAS,IAAK,CAEhC,IAAI,EAAK,KAAK,KAAK,GACf,EAAK,KAAK,KAAK,EAAI,GACvB,GAAI,EAEF,QAAS,EAAI,EAAI,EAAI,EAAI,IAAK,CAE5B,IAAI,EAAI,KAAK,OAAO,GAIpB,EAAa,GAAG,KAAK,QAAQ,GAAI,CAAC,EAAG,GAAI,EAC3C,KACK,CAGL,QADI,EAAS,GACJ,EAAM,EAAI,EAAM,EAAI,IAE3B,EADU,KAAK,OAAO,IACR,KAAK,QAAQ,GAK7B,QAAS,EAAM,EAAG,EAAM,EAAM,IAAO,CACnC,IAAI,EAAQ,KAAO,EAAS,EAAO,GAAO,EAC1C,EAAa,GAAG,EAAO,CAAC,EAAK,GAAI,EACnC,CACF,CACF,CACF,EAMA,EAAa,UAAU,OAAO,UAAY,YACxC,IAAK,KAAK,QACR,MAAM,IAAI,MAAM,wCAGlB,QADI,EAAU,KAAK,MAAM,GAChB,EAAI,EAAG,EAAI,EAAS,IAG3B,QAFI,EAAK,KAAK,KAAK,GACf,EAAK,KAAK,KAAK,EAAI,GACd,EAAI,EAAI,EAAI,EAAI,IAAK,CAE5B,IAAI,EAAI,KAAK,OAAO,QACd,CACJ,MAAO,KAAK,QAAQ,GACpB,MAAO,CAAC,EAAG,GAEf,CAEJ,EAOA,EAAa,UAAU,QAAU,WAC/B,OAAO,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,SAC7D,EAOA,EAAa,UAAU,QAAU,WAC/B,OAAO,EAAS,KAAK,QAAS,KAAK,OAAQ,KAAK,KAAM,KAAK,SAC7D,EA0CA,EAAa,UAAU,OAAS,SAAU,GASxC,QAPI,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GAErB,EAAU,KAAK,UAEf,EAAM,kBAAoB,GAAO,EAAM,GAAW,MAAQ,GAAO,EAAS,GAAW,cAAgB,GAAO,EAAS,GAAW,KAE3H,EAAI,EAAG,EAAI,EAAS,IAK3B,QAHI,EAAK,KAAK,KAAK,GACf,EAAK,KAAK,KAAK,EAAI,GAEd,EAAI,EAAI,EAAI,EAAI,IAIvB,GAAO,UAAY,GAFX,KAAK,OAAO,GAES,GAAW,KAAO,GAAO,EAAG,GAAW,UAAY,KAAK,QAAU,GAAO,KAAK,QAAQ,GAAI,GAAW,KAGtI,OAAO,CACT,EAOA,EAAa,UAAU,SAAW,WAChC,OAAO,GAAO,KAAK,UACrB,EAOA,EAAa,UAAU,OAAS,WAC9B,MAAO,CACL,OAAQ,eACR,OAAQ,KAAK,QACb,MAAO,KAAK,OACZ,IAAK,KAAK,KACV,KAAM,KAAK,MACX,SAAU,KAAK,UAEnB,EAUA,EAAa,UAAU,SAAW,SAAU,GAE1C,GAAI,GAMF,GAJI,GAAY,KACd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,GAC7B,MAAM,IAAI,UAAU,kDAItB,EAAI,EAEN,IAAI,EAAS,EAAI,EAAI,EAAI,EACrB,EAAO,EAAI,GAAK,EAAI,EAGpB,EAAO,KAAK,MAAM,GAClB,EAAU,KAAK,MAAM,GAGrB,EAAI,KAAK,IAAI,EAAO,EAAM,EAAU,GAGpC,EAAS,GACT,EAAQ,GACR,EAAM,GAEV,EAAI,GAAK,EAET,QAAS,EAAI,EAAQ,EAAI,GAAW,EAAO,OAAS,EAAG,IAKrD,QAHI,EAAK,KAAK,KAAK,GACf,EAAK,KAAK,KAAK,EAAI,GAEd,EAAI,EAAI,EAAI,EAAI,IAAK,CAE5B,IAAI,EAAI,KAAK,OAAO,GAEpB,GAAI,IAAM,EAAI,EAAS,EAAM,CAE3B,EAAO,KAAK,KAAK,QAAQ,IAEzB,EAAM,EAAO,OAAS,GAAK,EAAI,EAE/B,KACF,CACF,CAKF,OAFA,EAAI,KAAK,EAAO,QAET,IAAI,EAAa,CACtB,SACA,QACA,MACA,KAAM,CAAC,EAAG,IAEd,EAUA,EAAa,SAAW,SAAU,GAChC,OAAO,IAAI,EAAa,EAC1B,EAcA,EAAa,SAAW,SAAU,EAAM,EAAO,EAAG,EAAc,GAC9D,IAAK,GAAQ,GACX,MAAM,IAAI,UAAU,kCAEtB,GAAoB,IAAhB,EAAK,OACP,MAAM,IAAI,MAAM,4CAkBlB,GAdA,EAAO,EAAK,cAAc,GAOxB,GALI,GAAY,KAEd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,IAAM,EAAI,EACvC,MAAM,IAAI,MAAM,yCAElB,OAAO,CACT,IAGI,GAMF,GAJI,GAAY,KACd,EAAI,EAAE,aAGH,GAAS,KAAO,GAAU,GAC7B,MAAM,IAAI,UAAU,kDAItB,EAAI,EAIN,IAAI,EAAK,EAEL,EAAO,EACP,GAAS,KAEX,EAAK,EAAM,KAAK,EAAa,CAAC,EAAU,KAAc,EAEtD,EAAO,EAAM,QAAQ,EAAG,IAE1B,IAWI,EAXA,EAAS,EAAI,EAAI,EAAI,EACrB,EAAO,EAAI,GAAK,EAAI,EAGpB,EAAO,EAAK,GACZ,EAAU,EAAK,GAGf,EAAI,KAAK,IAAI,EAAO,EAAM,EAAU,GAMxC,GAAI,GAAQ,GAAQ,CAElB,GAAI,EAAM,SAAW,EAEnB,MAAM,IAAI,MAAM,8BAGlB,EAAS,SAAgB,GAEvB,OAAO,EAAM,EACf,CACF,SAAW,GAAS,GAAQ,CAE1B,IAAI,EAAK,EAAM,OAEf,GAAkB,IAAd,EAAG,QAAgB,EAAG,KAAO,EAE/B,MAAM,IAAI,MAAM,yBAGlB,EAAS,SAAgB,GAEvB,OAAO,EAAM,IAAI,CAAC,GACpB,CACF,MAEE,EAAS,WAEP,OAAO,CACT,EASF,QALI,EAAS,GACT,EAAQ,GACR,EAAM,GAGD,EAAI,EAAG,EAAI,EAAS,IAAK,CAEhC,EAAI,KAAK,EAAO,QAEhB,IAAI,EAAI,EAAI,EAEZ,GAAI,GAAK,GAAK,EAAI,EAAG,CAEnB,IAAI,EAAI,EAAO,GAEV,EAAG,EAAG,KAET,EAAM,KAAK,EAAI,GAEf,EAAO,KAAK,GAEhB,CACF,CAIA,OAFA,EAAI,KAAK,EAAO,QAET,IAAI,EAAa,CACtB,SACA,QACA,MACA,KAAM,CAAC,EAAM,IAEjB,EAWA,EAAa,UAAU,SAAW,SAAU,EAAG,GAE7C,KAAK,GAAS,IAAO,GAAU,IAAO,GAAS,IAAO,GAAU,IAC9D,MAAM,IAAI,MAAM,uCAGlB,GAA0B,IAAtB,KAAK,MAAM,OACb,MAAM,IAAI,MAAM,4CASlB,OANA,GAAc,EAAG,KAAK,MAAM,IAC5B,GAAc,EAAG,KAAK,MAAM,IAG5B,EAAa,UAAU,EAAG,EAAG,KAAK,MAAM,GAAI,KAAK,QAAS,KAAK,OAAQ,KAAK,MAErE,IACT,EAWA,EAAa,YAAc,SAAU,EAAG,EAAQ,EAAO,EAAK,GAM1D,QAJI,EAAK,EAAI,GACT,EAAK,EAAI,EAAI,GAGR,EAAI,EAAI,EAAI,EAAI,IAEvB,EAAS,EAAM,GAAI,EAAO,GAE9B,EAYA,EAAa,UAAY,SAAU,EAAG,EAAG,EAAS,EAAQ,EAAO,GAE/D,QAAS,EAAI,EAAG,EAAI,EAAS,IAAK,CAEhC,IAAI,EAAK,EAAI,GACT,EAAK,EAAI,EAAI,GAEb,EAAK,EAAe,EAAG,EAAI,EAAI,GAE/B,EAAK,EAAe,EAAG,EAAI,EAAI,GAEnC,GAAI,EAAK,GAAM,EAAK,GAAM,EAAM,KAAQ,GAAK,EAAM,KAAQ,GAEzD,GAAI,EAAQ,CACV,IAAI,EAAI,EAAO,GACf,EAAO,GAAM,EAAO,GACpB,EAAO,GAAM,CACf,UAKE,EAAK,GAAM,EAAM,KAAQ,IAAM,GAAM,GAAM,EAAM,KAAQ,GAA7D,CAEE,IAAI,EAAK,EAAS,EAAO,UAEzB,EAAM,OAAO,EAAI,EAAG,GAChB,GACF,EAAO,OAAO,EAAI,EAAG,GAGvB,EAAM,OAAO,GAAM,EAAK,EAAK,EAAI,EAAI,GACjC,GACF,EAAO,OAAO,GAAM,EAAK,EAAK,EAAI,EAAI,EAI1C,SAEI,EAAK,GAAM,EAAM,KAAQ,IAAM,GAAM,GAAM,EAAM,KAAQ,GAAI,CAE/D,IAAI,EAAK,EAAS,EAAO,UAEzB,EAAM,OAAO,EAAI,EAAG,GAChB,GACF,EAAO,OAAO,EAAI,EAAG,GAGvB,EAAM,OAAO,GAAM,EAAK,EAAK,EAAI,EAAI,GACjC,GACF,EAAO,OAAO,GAAM,EAAK,EAAK,EAAI,EAAI,EAE1C,CACF,CACF,EACO,CAAY,GAClB,CACD,aC55CS,GAA8B,GA/C9B,SACQ,CAAC,UA8CiD,IACnE,IAAI,MACF,GACE,EA0BA,EAAS,EAAM,SAAU,CAC3B,GAAI,WACF,OAAO,CACT,EACA,OAAQ,SAAgB,GACtB,OAAO,CACT,EACA,OAAQ,SAAgB,GACtB,GAAU,QAAN,EAAa,OAAO,IACxB,IA7E4B,EAC5B,EA4EI,GA5EJ,GAD4B,EA6EyB,GA5EpB,MAAM,2CASlC,CACL,QACA,MATU,CACV,KAAM,EACN,KAAM,EACN,KAAM,IACN,EAAyB,IAMzB,YALgB,EAAyB,GAMzC,eALmB,EAAyB,IAQvC,KA6DL,GAAI,EACF,gBArD+B,GAGrC,QAFI,EAAI,SAAS,EAAM,YAAa,EAAM,OACtC,EAAI,EACC,EAAI,EAAG,EAAI,EAAM,eAAe,OAAQ,IAE/C,GADiB,SAAS,EAAM,eAAe,GAAI,EAAM,OACvC,KAAK,IAAI,EAAM,MAAO,EAAI,GAE9C,IAAI,EAAS,EAAI,EACjB,GAAI,MAAM,GACR,MAAM,IAAI,YAAY,WAAa,EAAM,MAAQ,2BAEnD,OAAO,CACT,CAyCQ,CAAqC,GAEvC,IAAI,EAAO,EACP,EAAsB,EAAE,MAAM,iCAC9B,IAGF,EAAO,OAAO,EAAoB,IAClC,EAAI,EAAoB,IAE1B,IAAI,EAAM,OAAO,GACjB,GAAI,MAAM,GACR,MAAM,IAAI,YAAY,WAAa,EAAI,2BAEzC,GAAI,EAAqB,CAGvB,GAAI,EAAM,GAAK,EAAO,EAEpB,MAAM,IAAI,YAAY,WAAY,OAAO,EAAG,sBAG1C,GAAO,IAAM,EAAO,KACtB,GAAY,GAAK,EAErB,CACA,OAAO,CACT,EACA,UAAW,SAAmB,GAC5B,OAAO,EAAE,UACX,EACA,OAAQ,SAAgB,GACtB,OAAO,OAAO,EAChB,EACA,SAAU,SAAkB,GAC1B,OAAO,EAAE,SACX,EACA,KAAM,EAAM,aAAY,GAAQ,IAC9B,IAAI,EAAQ,EAAE,QAEd,OADA,EAAM,MAAQ,EAAK,EAAE,OACd,KAET,KAAM,SAAe,GACnB,OAAO,CACT,EACA,sBAAuB,SAA2B,EAAM,GACtD,OAAO,EAAK,SAAS,EACvB,EACA,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,OAW9D,OAHA,EAAO,SAAW,SAAU,GAC1B,OAAO,WAAW,EAAK,MACzB,EACO,CAAM,IChJJ,GAAiC,GAFjC,YACQ,CAAC,QAAS,cAC2C,IACtE,IAAI,MACF,EAAK,UACL,GACE,EA0BJ,OAAO,EAAM,YAAa,CACxB,GAAI,WACF,OAAO,IAAI,EAAU,EACvB,EACA,OAAQ,SAAgB,GAEtB,OAAO,IAAI,EAAU,EAAI,GAC3B,EACA,OAAQ,SAAgB,GACtB,IAAI,EAAsB,EAAE,MAAM,iCAClC,GAAI,EAAqB,CAEvB,IAAI,EAAO,EAAoB,GAC3B,EAAI,EAAU,EAAoB,IAClC,EAAa,IAAI,EAAU,GAAG,IAAI,OAAO,IAC7C,GAAI,EAAE,GAAG,EAAW,IAAI,IACtB,MAAM,IAAI,YAAY,WAAY,OAAO,EAAG,sBAE9C,IAAI,EAAmB,IAAI,EAAU,GAAG,IAAI,OAAO,GAAQ,GAC3D,OAAI,EAAE,IAAI,GACD,EAAE,IAAI,GAEN,CAEX,CACA,OAAO,IAAI,EAAU,EACvB,EACA,UAAW,SAAmB,GAE5B,OAAO,CACT,EACA,OAAQ,SAAgB,GACtB,OAAO,IAAI,EAAU,EAAE,WACzB,EACA,KAAM,EAAM,aAAY,GAAQ,IAC9B,IAAI,EAAQ,EAAE,QAEd,OADA,EAAM,MAAQ,EAAK,EAAE,OACd,KAET,SAAU,SAAkB,GAC1B,OAAO,IAAI,EAAU,OAAO,EAAE,IAAI,IAAI,OAAO,EAAE,IAAI,MAAM,OAAO,EAAE,GACpE,EACA,KAAM,SAAe,GACnB,OAAO,IAAI,EAAU,EACvB,EACA,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,MAC5D,IC5EO,GAAgC,GAFhC,WACQ,CAAC,QAAS,aAC0C,IACrE,IAAI,MACF,EAAK,SACL,GACE,EAsCJ,OAAO,EAAM,WAAY,CACvB,OAAQ,SAAgB,GACtB,IAAK,SAAS,IAAM,MAAM,GACxB,MAAM,IAAI,MAAM,EAAI,wCAEtB,OAAO,IAAI,EAAS,EACtB,EACA,OAAQ,SAAgB,GACtB,OAAO,IAAI,EAAS,EACtB,EACA,iBAAkB,SAAuB,EAAW,GAClD,OAAO,IAAI,EAAS,EAAW,EACjC,EACA,iBAAkB,SAAuB,EAAW,GAClD,OAAO,IAAI,EAAS,EAAW,EACjC,EACA,KAAM,SAAe,GACnB,OAAO,IAAI,EAAS,EACtB,EACA,UAAW,SAAmB,GAC5B,OAAO,IAAI,EAAS,EAAE,WACxB,EACA,OAAQ,SAAgB,GACtB,OAAO,IAAI,EAAS,EAAE,WACxB,EACA,SAAU,SAAkB,GAC1B,OAAO,CACT,EACA,KAAM,EAAM,aAAY,GAAQ,IAC9B,IAAI,EAAQ,EAAE,QAEd,OADA,EAAM,MAAQ,EAAK,EAAE,OACd,KAET,OAAQ,SAAgB,GACtB,OAAO,IAAI,EAAS,EACtB,EACA,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,MAC5D,IClFA,GAAO,SAEA,GAA8B,GAAQ,GAD9B,CAAC,QAAS,SAAU,cAAe,iBACe,IACnE,IAAI,MACF,EAAK,OACL,EAAM,YACN,EAAW,aACX,GACE,EAkCJ,OAAO,EAAM,GAAM,CACjB,GAAI,WACF,OAAO,EAAQ,GACjB,EACA,OAAQ,SAAgB,GACtB,OAAO,EAAQ,GAAI,EACrB,EACA,iBAAkB,SAAuB,EAAQ,GAC/C,OAAO,EAAQ,GAAI,EAAQ,EAC7B,EACA,MAAO,SAAe,GACpB,OAAO,EAAQ,EACjB,EACA,OAAQ,SAAgB,GACtB,OAAO,EAAQ,EAAM,EAAK,UAC5B,EACA,yBAA0B,EAC1B,iCAAkC,IAWpC,SAAS,EAAQ,EAAM,EAAQ,GAE7B,GAAe,UAAX,GAAiC,YAAX,YAAwB,EAChD,OAAO,IAAI,EAAY,EAAM,GAE/B,GAAe,WAAX,EACF,OAAO,IAAI,EAAa,EAAM,GAEhC,MAAM,IAAI,UAAU,uBAAyB,KAAK,UAAU,GAAU,IACxE,KC7EE,GAAO,aAEA,GAAkC,GAAQ,GADlC,CAAC,UACqD,IACvE,IAAI,MACF,GACE,EAwBJ,OAAO,EAAM,GAAM,CACjB,OAAQ,GACR,iCAAkC,GAAK,EAAE,MACzC,OAAQ,IAAM,EACd,KAAM,EAAM,aAAY,GAAQ,IAC9B,IAAI,EAAM,EAAE,QAEZ,OADA,EAAI,MAAQ,EAAM,KAAK,EAAM,EAAI,YAArB,CAAkC,EAAE,OACzC,KAGT,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,SAG5D,ICxCO,GAA2B,GAF3B,MACQ,CAAC,UAC8C,IAChE,IAAI,MACF,GACE,EAyBJ,OAAO,EA9BE,MA8BU,CACjB,OAAQ,GACR,wCAAyC,GAAK,EAAE,MAChD,OAAQ,GAAK,EAAI,IAAM,EAAI,EAE3B,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,SAC5D,ICrCA,GAAO,YAEA,GAAiC,GAAQ,GADjC,CAAC,UACoD,IACtE,IAAI,MACF,GACE,EAaJ,OAAO,EAAM,GAAM,CACjB,iBAAkB,GAClB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAE,IAAI,EACf,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAO,EAAE,KAAK,EAChB,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,EAAI,CACb,EACA,qBAAsB,SAA2B,EAAG,GAClD,OAAO,EAAE,IAAI,EACf,EACA,aAAc,EAAM,aAAY,GAAQ,CAAC,EAAG,KAC1C,GAAgB,OAAZ,EAAE,YAAoB,IAAF,EAAE,MACxB,MAAM,IAAI,MAAM,oDAElB,GAAgB,OAAZ,EAAE,gBAAkB,EAAE,MACxB,MAAM,IAAI,MAAM,oDAElB,IAAK,EAAE,UAAU,GAAI,MAAM,IAAI,MAAM,sBACrC,IAAI,EAAM,EAAE,QAGZ,OAFA,EAAI,MAAQ,EAAM,KAAK,EAAM,CAAC,EAAI,YAAa,EAAE,aAArC,CAAmD,EAAI,MAAO,EAAE,OAC5E,EAAI,aACG,MAET,IC7CA,GAAO,iBAEA,GAAsC,GAAQ,GADtC,CAAC,UACyD,IAC3E,IAAI,MACF,GACE,EAaJ,OAAO,EAAM,GAAM,CACjB,iBAAkB,GAClB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAE,IAAI,EACf,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAO,EAAE,MAAM,EACjB,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,EAAI,CACb,EACA,qBAAsB,SAA2B,EAAG,GAClD,OAAO,EAAE,IAAI,EACf,EACA,aAAc,EAAM,aAAY,GAAQ,CAAC,EAAG,KAC1C,GAAgB,OAAZ,EAAE,gBAAkB,EAAE,MACxB,MAAM,IAAI,MAAM,oDAElB,GAAgB,OAAZ,EAAE,gBAAkB,EAAE,MACxB,MAAM,IAAI,MAAM,oDAElB,IAAK,EAAE,UAAU,GAAI,MAAM,IAAI,MAAM,sBACrC,IAAI,EAAM,EAAE,QAGZ,OAFA,EAAI,MAAQ,EAAM,KAAK,EAAM,CAAC,EAAI,YAAa,EAAE,aAArC,CAAmD,EAAI,MAAO,EAAE,OAC5E,EAAI,aACG,MAET,IC5CO,GAAqC,GAFrC,gBACQ,CAAC,QAAS,gBAC+C,IAC1E,IAAI,MACF,EAAK,YACL,GACE,EAoBJ,OAAO,SAAuB,EAAG,EAAG,EAAU,GAE5C,IAAI,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAQ,EAAE,MACV,EAAM,EAAE,UAGZ,IAAK,EACH,MAAM,IAAI,MAAM,sEAIlB,IAII,EAJA,EAAO,EAAM,GACb,EAAU,EAAM,GAKhB,EAAK,EAEL,EAAO,EAEP,EAAK,EAGU,iBAAR,IAET,EAAK,EAEL,EAAK,EAAM,KAAK,EAAa,CAAC,EAAI,IAElC,EAAO,EAAM,QAAQ,EAAG,GAExB,EAAI,EAAM,QAAQ,EAAG,GAErB,EAAK,EAAM,KAAK,EAAU,CAAC,EAAI,KASjC,QALI,EAAU,GACV,EAAS,GACT,EAAO,GAGF,EAAI,EAAG,EAAI,EAAS,IAAK,CAEhC,EAAK,GAAK,EAAO,OAEjB,QAAS,EAAK,EAAK,GAAI,EAAK,EAAK,EAAI,GAAI,EAAI,EAAI,EAAI,EAAI,IAAK,CAE5D,IAAI,EAAI,EAAO,GAEX,EAAI,EAAU,EAAG,EAAG,EAAQ,IAAM,EAAG,EAAQ,GAAI,GAEhD,EAAG,EAAG,KAET,EAAO,KAAK,GACZ,EAAQ,KAAK,GAEjB,CACF,CAKA,OAHA,EAAK,GAAW,EAAO,OAGhB,EAAE,mBAAmB,CAC1B,OAAQ,EACR,MAAO,EACP,IAAK,EACL,KAAM,CAAC,EAAM,GACb,SAAU,GAEd,CAAC,ICjGQ,GAAoC,GAFpC,eACQ,CAAC,UACuD,IACzE,IAAI,MACF,GACE,EAgBJ,OAAO,SAAsB,EAAG,EAAG,EAAU,GAE3C,IAKI,EALA,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,UAKR,EAAK,EAGU,iBAAR,IAET,EAAK,EAEL,EAAI,EAAM,QAAQ,EAAG,GAErB,EAAK,EAAM,KAAK,EAAU,CAAC,EAAI,KAIjC,IAAI,EAAQ,EAAM,OAAS,EAAI,EAAS,EAAI,EAAG,EAAO,EAAM,GAAI,EAAO,EAAG,GAAW,GAGrF,OAAO,EAAE,kBAAkB,CACzB,KAAM,EACN,KAAM,GAAM,GACZ,SAAU,GAEd,EAGA,SAAS,EAAS,EAAG,EAAO,EAAG,EAAG,EAAI,EAAI,GAExC,IAAI,EAAK,GAET,GAAI,IAAU,EAAE,OAAS,EAEvB,QAAS,EAAI,EAAG,EAAI,EAAG,IAErB,EAAG,GAAK,EAAU,EAAE,EAAI,EAAG,IAAM,EAAE,EAAG,GAAI,QAI5C,QAAS,EAAI,EAAG,EAAI,EAAG,IAErB,EAAG,GAAK,EAAS,EAAG,EAAQ,EAAG,EAAG,EAAE,EAAQ,GAAI,EAAG,GAAI,EAAI,GAG/D,OAAO,CACT,KCtES,GAAsC,GAFtC,iBACQ,CAAC,UACyD,IAC3E,IAAI,MACF,GACE,EAaJ,OAAO,EAAM,iBAAkB,CAC7B,iBAAkB,GAClB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAE,IAAI,EACf,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAO,EAAE,MAAM,EACjB,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,EAAI,CACb,EACA,qBAAsB,SAA2B,EAAG,GAClD,OAAO,EAAE,IAAI,EACf,EACA,gDAAiD,CAAC,EAAG,IAAM,EAAE,SAAS,GACtE,uDAAwD,CAAC,EAAG,IAAM,EAAE,SAAS,IAC7E,IC/BA,GAAO,WAEA,GAAgC,GAAQ,GADhC,CAAC,QAAS,SAAU,YAAa,iBAAkB,cAAe,QACd,IACrE,IAAI,MACF,EAAK,OACL,EAAM,UACN,EAAS,eACT,EAAc,YACd,EAAW,IACX,GACE,EACA,EAAgB,GAAoB,CACtC,QACA,gBAEE,EAAe,GAAmB,CACpC,UAEF,SAAS,EAA0B,EAAO,GAExC,OAAQ,EAAM,QACZ,KAAK,EAEH,OAAQ,EAAM,QACZ,KAAK,EAEH,GAAI,EAAM,KAAO,EAAM,GAErB,MAAM,IAAI,WAAW,2EAEvB,MACF,KAAK,EAEH,GAAI,EAAM,KAAO,EAAM,GAErB,MAAM,IAAI,WAAW,wDAA0D,EAAM,GAAK,6BAA+B,EAAM,GAAK,KAEtI,MACF,QACE,MAAM,IAAI,MAAM,+DAAiE,EAAM,OAAS,gBAEpG,MACF,KAAK,EAEH,OAAQ,EAAM,QACZ,KAAK,EAEH,GAAI,EAAM,KAAO,EAAM,GAErB,MAAM,IAAI,WAAW,yDAA2D,EAAM,GAAK,+BAAiC,EAAM,GAAK,KAEzI,MACF,KAAK,EAEH,GAAI,EAAM,KAAO,EAAM,GAErB,MAAM,IAAI,WAAW,2DAA6D,EAAM,GAAK,+BAAiC,EAAM,GAAK,KAE3I,MACF,QACE,MAAM,IAAI,MAAM,+DAAiE,EAAM,OAAS,gBAEpG,MACF,QACE,MAAM,IAAI,MAAM,+DAAiE,EAAM,OAAS,gBAEtG,CAsGA,IAAI,EAAwB,EAAM,wBAAyB,CACzD,mBA2BF,SAAoC,EAAG,GAErC,IAWI,EAXA,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAM,GACd,EAAW,EAAM,GAKjB,EAAK,EAEL,EAAK,EAGL,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,KAOvC,QAHI,EAAI,GAGC,EAAI,EAAG,EAAI,EAAO,IAAK,CAM9B,QAJI,EAAM,EAAM,GAEZ,EAAM,EAAG,EAAI,GAAI,EAAM,IAElB,EAAI,EAAG,EAAI,EAAU,IAE5B,EAAM,EAAG,EAAK,EAAG,EAAI,GAAI,EAAM,KAEjC,EAAE,GAAK,CACT,CAGA,OAAO,EAAE,kBAAkB,CACzB,KAAM,EACN,KAAM,CAAC,GACP,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,UAE3D,EA7EE,oBA2QF,SAAqC,EAAG,GAEtC,IAAI,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAM,EAAE,oBAAa,EAAE,MAAsB,EAAE,UAAY,EAAE,cAEjE,IAAK,EACH,MAAM,IAAI,MAAM,0DAGlB,IAWI,EAXA,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAE,MAAM,GAChB,EAAQ,EAAE,MAAM,GAEhB,EAAU,GACV,EAAS,GACT,EAAO,GAKP,EAAK,EAEL,EAAK,EAEL,EAAK,EAEL,EAAO,EAGP,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,IACrC,EAAK,EAAM,KAAK,EAAa,CAAC,EAAI,IAElC,EAAO,EAAM,QAAQ,EAAG,IAI1B,IAAI,EAAI,GAEJ,EAAI,GAGR,EAAK,GAAK,EAEV,QAAS,EAAK,EAAG,EAAK,EAAO,IAAM,CAEjC,IAAI,EAAM,EAAM,GAEhB,IAAK,EAAG,EAAK,GAEX,QAAS,EAAM,EAAK,GAAK,EAAM,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,IAAM,CAErE,IAAI,EAAK,EAAO,GAEX,EAAE,GASL,EAAE,GAAM,EAAG,EAAE,GAAK,EAAG,EAAK,EAAQ,MAPlC,EAAE,MAEF,EAAO,KAAK,GAEZ,EAAE,GAAM,EAAG,EAAK,EAAQ,IAK5B,CAEJ,CAEA,QAAS,EAAK,EAAO,OAAQ,EAAI,EAAG,EAAI,EAAI,IAAK,CAE/C,IAAI,EAAK,EAAO,GAEhB,EAAQ,GAAK,EAAE,EACjB,CAKA,OAHA,EAAK,GAAK,EAAO,OAGV,EAAE,mBAAmB,CAC1B,OAAQ,EACR,MAAO,EACP,IAAK,EACL,KAAM,CAAC,EAAO,GACd,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,UAE3D,IA9VI,EAAwB,EAAM,wBAAyB,CACzD,2BA2EF,SAAyC,EAAG,GAG1C,IAaI,EAbA,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAM,GACd,EAAW,EAAM,GACjB,EAAW,EAAM,GAKjB,EAAK,EAEL,EAAK,EAGL,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,GAA2B,UAAR,IAE7E,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,KAOvC,QAHI,EAAI,GAGC,EAAI,EAAG,EAAI,EAAO,IAAK,CAE9B,IAAI,EAAM,EAAM,GAEhB,EAAE,GAAK,GAEP,QAAS,EAAI,EAAG,EAAI,EAAU,IAAK,CAIjC,QAFI,EAAM,EAAG,EAAI,GAAI,EAAM,GAAG,IAErB,EAAI,EAAG,EAAI,EAAU,IAE5B,EAAM,EAAG,EAAK,EAAG,EAAI,GAAI,EAAM,GAAG,KAEpC,EAAE,GAAG,GAAK,CACZ,CACF,CAGA,OAAO,EAAE,kBAAkB,CACzB,KAAM,EACN,KAAM,CAAC,EAAO,GACd,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,UAE3D,EArIE,4BA+IF,SAA0C,EAAG,GAE3C,IAAI,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAQ,EAAE,MACV,EAAM,EAAE,gBAAe,IAAF,EAAE,MAAsB,EAAE,UAAY,EAAE,cAEjE,IAAK,EACH,MAAM,IAAI,MAAM,0DAGlB,IAII,EAJA,EAAQ,EAAM,GACd,EAAW,EAAM,GAKjB,EAAK,EAEL,EAAK,EAEL,EAAK,EAEL,EAAO,EAGP,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,IACrC,EAAK,EAAM,KAAK,EAAa,CAAC,EAAI,IAElC,EAAO,EAAM,QAAQ,EAAG,IAiB1B,QAbI,EAAU,GACV,EAAS,GACT,EAAO,GAEP,EAAI,EAAE,mBAAmB,CAC3B,OAAQ,EACR,MAAO,EACP,IAAK,EACL,KAAM,CAAC,EAAO,GACd,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,WAIhD,EAAK,EAAG,EAAK,EAAU,IAAM,CAEpC,EAAK,GAAM,EAAO,OAElB,IAAI,EAAM,EAAK,GACX,EAAM,EAAK,EAAK,GAEpB,GAAI,EAAM,EAIR,QAFI,EAAO,EAEF,EAAI,EAAG,EAAI,EAAO,IAAK,CAM9B,QAJI,EAAO,EAAI,EAEX,SAEK,EAAK,EAAK,EAAK,EAAK,IAAM,CAEjC,IAAI,EAAK,EAAO,GAEZ,IAAS,GAEX,EAAM,EAAG,EAAM,GAAG,GAAK,EAAQ,IAE/B,EAAO,GAGP,EAAM,EAAG,EAAK,EAAG,EAAM,GAAG,GAAK,EAAQ,IAE3C,CAEI,IAAS,GAAS,EAAG,EAAK,KAE5B,EAAO,KAAK,GACZ,EAAQ,KAAK,GAEjB,CAEJ,CAKA,OAHA,EAAK,GAAY,EAAO,OAGjB,CACT,EAnPE,4BAqWF,SAA0C,EAAG,GAE3C,IAAI,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAM,EAAE,oBAAa,EAAE,MAAsB,EAAE,UAAY,EAAE,cAEjE,IAAK,EACH,MAAM,IAAI,MAAM,0DAGlB,IAQI,EARA,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAE,MAAM,GAChB,EAAQ,EAAE,MAAM,GAChB,EAAW,EAAE,MAAM,GAKnB,EAAK,EAEL,EAAK,EAEL,EAAK,EAEL,EAAO,EAGP,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,IACrC,EAAK,EAAM,KAAK,EAAa,CAAC,EAAI,IAElC,EAAO,EAAM,QAAQ,EAAG,IAsB1B,QAlBI,EAAU,GACV,EAAS,GACT,EAAO,GAEP,EAAI,EAAE,mBAAmB,CAC3B,OAAQ,EACR,MAAO,EACP,IAAK,EACL,KAAM,CAAC,EAAO,GACd,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,WAIrD,EAAI,GAEJ,EAAI,GAGC,EAAK,EAAG,EAAK,EAAU,IAAM,CAEpC,EAAK,GAAM,EAAO,OAIlB,QAFI,EAAO,EAAK,EAEP,EAAK,EAAG,EAAK,EAAO,IAAM,CAEjC,IAAI,EAAO,EAAM,GAAI,GAErB,IAAK,EAAG,EAAM,GAEZ,QAAS,EAAM,EAAK,GAAK,EAAM,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,IAAM,CAErE,IAAI,EAAK,EAAO,GAEZ,EAAE,KAAQ,GAEZ,EAAE,GAAM,EAER,EAAO,KAAK,GAEZ,EAAE,GAAM,EAAG,EAAM,EAAQ,KAGzB,EAAE,GAAM,EAAG,EAAE,GAAK,EAAG,EAAM,EAAQ,IAEvC,CAEJ,CAEA,QAAS,EAAK,EAAK,GAAK,EAAK,EAAO,OAAQ,EAAI,EAAI,EAAI,EAAI,IAAK,CAE/D,IAAI,EAAK,EAAO,GAEhB,EAAQ,GAAK,EAAE,EACjB,CACF,CAKA,OAHA,EAAK,GAAY,EAAO,OAGjB,CACT,EA3cE,6BAqdF,SAA2C,EAAG,GAE5C,IAiBI,EAjBA,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAM,EAAE,gBAAe,IAAF,EAAE,MAAsB,EAAE,UAAY,EAAE,cAE7D,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAO,EAAE,KACT,EAAM,EAAE,gBAAe,IAAF,EAAE,MAAsB,EAAE,UAAY,EAAE,cAG7D,EAAQ,EAAE,MAAM,GAChB,EAAW,EAAE,MAAM,GAEnB,EAAS,GAAW,EAKpB,EAAK,EAEL,EAAK,EAGL,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,KAuBvC,QAFI,EAAI,EAAK,EAAK,EAAI,EAAK,EAAK,EAAI,EAjBhC,EAAU,EAAS,UACnB,EAAS,GACT,EAAO,GAEP,EAAI,EAAE,mBAAmB,CAC3B,OAAQ,EACR,MAAO,EACP,IAAK,EACL,KAAM,CAAC,EAAO,GACd,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,WAIrD,EAAI,EAAS,UAEb,EAAI,GAIC,EAAK,EAAG,EAAK,EAAU,IAAM,CAEpC,EAAK,GAAM,EAAO,OAElB,IAAI,EAAO,EAAK,EAEhB,IAAK,EAAM,EAAK,GAAK,EAAM,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,IAI3D,GAFA,EAAK,EAAO,GAER,EAEF,IAAK,EAAM,EAAK,GAAK,EAAM,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,IAIvD,EAFJ,EAAK,EAAO,MAEE,GAEZ,EAAE,GAAM,EAER,EAAO,KAAK,GAEZ,EAAE,GAAM,EAAG,EAAQ,GAAK,EAAQ,KAGhC,EAAE,GAAM,EAAG,EAAE,GAAK,EAAG,EAAQ,GAAK,EAAQ,UAK9C,IAAK,EAAM,EAAK,GAAK,EAAM,EAAK,EAAK,GAAI,EAAK,EAAK,EAAK,EAAK,IAIvD,EAFJ,EAAK,EAAO,MAEE,IAEZ,EAAE,GAAM,EAER,EAAO,KAAK,IAMpB,GAAI,EAEF,QAAS,EAAK,EAAK,GAAK,EAAK,EAAO,OAAQ,EAAI,EAAI,EAAI,EAAI,IAAK,CAE/D,IAAI,EAAK,EAAO,GAEhB,EAAQ,GAAK,EAAE,EACjB,CAEJ,CAKA,OAHA,EAAK,GAAY,EAAO,OAGjB,CACT,IAmCA,OAAO,EAAM,GAAM,EAAgB,CAGjC,eAAgB,EAAM,QAAQ,kBAAkB,GAAU,CAAC,EAAG,KAE5D,EAA0B,GAAU,GAAI,GAAU,IAGlD,IAAI,EAAI,EAAO,EAAO,GAAI,EAAO,IAEjC,OAAO,GAAS,GAAK,EAAE,UAAY,KAErC,iBAAkB,SAAuB,EAAG,GAE1C,IAAI,EAAQ,EAAE,OACV,EAAQ,EAAE,OAMd,OAHA,EAA0B,EAAO,GAGZ,IAAjB,EAAM,OAEa,IAAjB,EAAM,OAAW,SA7uBI,EAAG,EAAG,GAEnC,GAAU,IAAN,EACF,MAAM,IAAI,MAAM,qCAElB,OAAO,EAAI,EAAG,EAChB,CAuuB2B,CAEU,EAAG,EAAG,EAAM,IA/tBjD,SAA+B,EAAG,GAEhC,GAAoB,UAAhB,EAAE,UACJ,MAAM,IAAI,MAAM,4CAElB,gBAWkC,EAAG,GAErC,IAYI,EAZA,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAQ,EAAE,MACV,EAAQ,EAAE,MACV,EAAM,EAAE,WAAa,EAAE,cAEvB,EAAU,EAAM,GAChB,EAAW,EAAM,GAKjB,EAAK,EAEL,EAAK,EAGL,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,IAE1D,EAAK,EAEL,EAAK,EAAM,KAAK,EAAW,CAAC,EAAI,IAChC,EAAK,EAAM,KAAK,EAAgB,CAAC,EAAI,KAOvC,QAHI,EAAI,GAGC,EAAI,EAAG,EAAI,EAAU,IAAK,CAIjC,QAFI,EAAM,EAAG,EAAM,GAAI,EAAM,GAAG,IAEvB,EAAI,EAAG,EAAI,EAAS,IAE3B,EAAM,EAAG,EAAK,EAAG,EAAM,GAAI,EAAM,GAAG,KAEtC,EAAE,GAAK,CACT,CAGA,OAAO,EAAE,kBAAkB,CACzB,KAAM,EACN,KAAM,CAAC,GACP,SAAU,IAAQ,EAAE,WAAa,IAAQ,EAAE,UAAY,UAE3D,CA7DE,CAAkC,EAAG,EACvC,CA4tBa,CAAsB,EAAG,GAGb,IAAjB,EAAM,OAED,EAAsB,EAAG,GAG3B,EAAsB,EAAG,EAClC,EACA,gBAAiB,EAAM,QAAQ,iBAAiB,GAAU,CAAC,EAAG,IAAM,EAAO,EAAG,EAAO,MACrF,gBAAiB,EAAM,aAAY,GAAQ,CAAC,EAAG,IAEtC,EAAK,EAAO,EAAG,EAAE,WAAY,KAEtC,oBAAqB,SAA0B,EAAG,GAChD,OAAO,EAAc,EAAG,EAAG,KAC7B,EACA,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAa,EAAG,EAAG,KAC5B,EACA,oBAAqB,SAA0B,EAAG,GAChD,OAAO,EAAc,EAAG,EAAG,KAC7B,EACA,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAa,EAAG,EAAG,KAC5B,EACA,aAAc,SAAmB,EAAG,GAElC,OAAO,EAAa,EAAO,GAAI,EAAG,MAAuB,SAC3D,EACA,aAAc,SAAmB,EAAG,GAElC,OAAO,EAAa,EAAO,GAAI,EAAG,MAAsB,SAC1D,EACA,WAAY,EACZ,mBAAoB,EAAM,aAAY,GAAQ,CAAC,EAAG,EAAG,KAEnD,QADI,EAAS,EAAK,EAAG,GACZ,EAAI,EAAG,EAAI,EAAK,OAAQ,IAC/B,EAAS,EAAK,EAAQ,EAAK,IAE7B,OAAO,MAET,IC52BA,GAAO,OAEA,GAA4B,GAAQ,GAD5B,CAAC,UAC+C,IACjE,IAAI,MACF,GACE,EA0BJ,OAAO,EAAM,GAAM,CACjB,gCAAiC,GAAK,EACtC,QAAS,GAAK,EAAE,YAChB,KAAM,EAAM,aAAY,GAAQ,GAAK,IAAI,EAAE,YAAY,EAAK,EAAE,aAAc,EAAE,iBAC9E,iBAAkB,EAAM,aAAY,GAAQ,GAAK,GAAQ,EAAG,MAC5D,IClCA,GAAO,WAEA,GAAgC,GAAQ,GADhC,CAAC,QAAS,SAAU,SAAU,YAAa,cAAe,iBACN,IACrE,IAAI,MACF,EAAK,OACL,EAAM,OACN,EAAM,UACN,EAAS,YACT,EAAW,aACX,GACE,EA+BJ,OAAO,EAAM,GAAM,CACjB,GAAI,WACF,MAAyB,WAAlB,EAAO,OAAsB,EAAO,IAAM,EACnD,EACA,OAAQ,SAAgB,GACtB,OAAO,EAAO,EAChB,EACA,qBAAsB,SAA2B,GAC/C,OAAO,EAAU,EAAM,EAAwB,WAAlB,EAAO,OAAsB,eAC5D,EACA,6BAA8B,SAAkC,EAAM,GACpE,OAAO,EAAU,EAAM,EAAM,EAC/B,EACA,yCAA0C,SAA6C,EAAM,GAC3F,OAAO,EAAU,EAAM,EAAwB,WAAlB,EAAO,OAAsB,eAC5D,EACA,iDAAkD,SAAoD,EAAM,EAAM,GAChH,OAAO,EAAU,EAAM,EAAM,EAC/B,EACA,MAAO,SAAe,GACpB,OAAO,EAAgB,EACzB,EACA,gBAAiB,SAAsB,EAAM,GAC3C,OAAO,EAAgB,EAAM,EAC/B,EACA,OAAQ,SAAgB,GACtB,OAAO,EAAgB,EAAK,UAAW,EAAK,UAC9C,EACA,iBAAkB,SAAuB,EAAM,GAC7C,OAAO,EAAgB,EAAK,UAAW,EACzC,IAEF,SAAS,EAAgB,EAAM,GAC7B,OAAQ,EAAK,QACX,KAAK,EACH,OAAO,EAAS,EAAO,GAAU,GACnC,KAAK,EACH,OAAO,EAAU,EAAK,GAAI,EAAK,GAAI,GACrC,KAAK,EACH,OAAO,EAAU,EAAK,GAAI,EAAK,GAAI,GACrC,QACE,MAAM,IAAI,MAAM,yCAEtB,CAUA,SAAS,EAAU,EAAM,EAAM,GAE7B,IAAI,EAAM,GAAY,IAAS,GAAY,GAAQ,EAAY,KAG/D,GAFI,GAAY,KAAO,EAAO,EAAK,YAC/B,GAAY,KAAO,EAAO,EAAK,aAC9B,GAAU,IAAS,EAAO,EAC7B,MAAM,IAAI,MAAM,6DAElB,IAAK,GAAU,IAAS,EAAO,EAC7B,MAAM,IAAI,MAAM,6DAElB,IAAI,EAAM,EAAM,IAAI,EAAU,GAAK,EAC/B,EAAe,EAAM,IAAI,EAAI,GAAK,EAClC,EAAO,CAAC,EAAM,GAGlB,GAAI,EAAQ,CAEV,GAAe,WAAX,EACF,OAAO,EAAa,SAAS,EAAM,EAAK,EAAG,GAE7C,GAAe,UAAX,EACF,OAAO,EAAY,SAAS,EAAM,EAAK,EAAG,GAE5C,MAAM,IAAI,UAAU,wBAAyB,OAAO,EAAQ,KAC9D,CAOA,QAJI,EAAM,GAAO,GAAI,EAAM,GAEvB,EAAU,EAAO,EAAO,EAAO,EAE1B,EAAI,EAAG,EAAI,EAAS,IAC3B,EAAI,GAAG,GAAK,EAEd,OAAO,CACT,KCtIK,SAAS,KACd,MAAM,IAAI,MAAM,0CAClB,CACO,SAAS,KACd,MAAM,IAAI,MAAM,yCAClB,CCFA,ICFW,GDEP,GAAO,OAEA,GAA4B,GAAQ,GAD5B,CAAC,QAAS,SAAU,YAC4B,IACjE,IAAI,MACF,EAAK,OACL,EAAM,OACN,GACE,EAwBJ,OAAO,EAAM,GAAM,CACjB,OAAQ,SAAgB,GACtB,OAAO,EAAE,OAAO,EAAE,OAAQ,SAC5B,EACA,MAAO,GACP,OAAQ,SAAgB,GACtB,MAAyB,UAAlB,EAAO,OAAqB,CAAC,EAAE,QAAU,EAAO,CAAC,EAAE,QAAS,QAAS,SAC9E,EACA,uDAAwD,SAAyD,GAE/G,MAAyB,UAAlB,EAAO,OAAqB,GAAK,EAAS,EAAO,GAAI,QAAS,qBDrCzE,MAAM,IAAI,MAAM,uCAClB,CCoC2E,EACvE,GACA,IEzCO,GAA+B,GAF/B,UACQ,CAAC,SAAU,aAAc,cAC0B,IACpE,IACE,OAAQ,EAAO,UACf,EAAS,SACT,GACE,EACA,EAAkB,CACpB,UACA,UACA,aACA,aAIE,EAAmB,CACrB,OAAQ,GAAK,EAAQ,GACrB,UAAW,EAAY,GAAK,EAAU,GAAK,GAC3C,OAAQ,GAAK,OAAO,GACpB,SAAU,EAAW,GAAK,EAAS,GAAK,IAiC1C,OAAO,SAAiB,GACtB,IAAI,EAAa,UAAU,OAAS,YAAK,UAAU,GAAmB,UAAU,GAAK,SAErF,QAD6C,KAAjC,UAAU,OAAS,EAAI,UAAU,WAE3C,MAAM,IAAI,YAAY,wCAExB,IAAI,EAAY,GAAO,GACvB,KAAM,KAAa,GACjB,MAAM,IAAI,UAAU,kBAAoB,EAAQ,aAAe,EAAY,4BAA8B,OAAO,KAAK,GAAiB,KAAK,OAE7I,KAAM,KAAc,GAClB,MAAM,IAAI,UAAU,kBAAoB,EAAQ,aAAe,EAAa,6BAA+B,OAAO,KAAK,GAAkB,KAAK,OAEhJ,OAAI,IAAe,EACV,EAEA,EAAiB,GAAY,EAExC,CAAC,ICzEC,GAAO,eAEA,GAAoC,GAAQ,GADpC,CAAC,QAAS,YAC8C,IACzE,IAAI,MACF,EAAK,QACL,GACE,EAaJ,OAAO,EAAM,GAAM,CACjB,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,EAAI,CACb,EACA,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAE,IAAI,EACf,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAO,EAAE,IAAI,EACf,EACA,iBAAkB,SAAuB,EAAG,GAC1C,OAAO,EAAI,CACb,EACA,qBAAsB,SAA2B,EAAG,GAClD,OAAO,EAAE,IAAI,EACf,EACA,uDAAwD,CAAC,EAAG,IAAM,EAAE,OAAO,GAC3E,gDAAiD,CAAC,EAAG,IAAM,EAAE,WAAW,IACxE,IChCO,GAA2B,GAF3B,MACQ,CAAC,QAAS,SAAU,WAAY,WAAY,SAAU,MAAO,WAAY,SAAU,YACpC,IAChE,IAAI,MACF,EAAK,OACL,EAAM,SACN,EAAQ,SACR,EAAQ,OACR,EAAM,IACN,EAAG,OACH,EAAM,SACN,EAAQ,QACR,GACE,EAuCJ,OAAO,EApDE,MAoDU,CACjB,iBAAkB,EAClB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAE,IAAI,EACf,EACA,uBAAwB,SAA6B,EAAG,GACtD,OAAI,EAAE,aAAe,GAAK,GAAK,EAAO,YAC7B,EAAE,IAAI,GAEN,IAAI,EAAQ,EAAE,WAAY,GAAG,IAAI,EAAE,WAAY,EAE1D,EACA,iBAAkB,CAAC,EAAG,IAAM,GAAK,EACjC,qBAAsB,SAA2B,EAAG,GAClD,IAAI,EAAS,EAAE,IAAI,GACnB,GAAc,MAAV,EACF,OAAO,EAET,GAAI,EAAO,YACT,MAAM,IAAI,MAAM,uEAEhB,OAAO,EAAK,EAAE,UAAW,EAAE,UAE/B,EACA,gBAAiB,EACjB,mBAAoB,SAAyB,EAAG,GAC9C,OAAO,EAAU,EAAG,EAAE,WACxB,EACA,iBAAkB,EAClB,oBAAqB,SAA0B,EAAG,GAChD,OAAO,EAAW,EAAG,EAAE,WACzB,EACA,2BAA4B,SAAgC,EAAG,GAC7D,OAAO,EAAE,IAAI,EACf,IAUF,SAAS,EAAK,EAAG,GAGf,GAAI,EAAO,cAAgB,GAAU,IAAM,EAAI,EAE7C,IACE,IAAI,EAAQ,EAAS,GACjB,EAAO,EAAO,GAClB,IAAI,IAAM,GAAQ,KAAK,KAAK,EAAI,GAAQ,GAAK,QACvC,EAAM,EAAI,KAAO,GACnB,OAAQ,EAAM,EAAI,KAAO,GAAK,MAAU,KAAK,KAAK,EAAG,EAG3D,OAEA,CAQF,OAAI,EAAO,cAAgB,MAAU,IAAM,KAAY,MAAU,EAAI,GAAK,UACjE,IAEL,GAAU,IAAM,GAAK,GAAK,EAAO,YAC5B,GAAU,EAAG,GAMhB,EAAI,EAAI,GAAK,IAAM,KAAY,EAAI,EAAI,GAAK,SACvC,EAEF,IAAI,EAAQ,EAAG,GAAG,IAAI,EAAG,EAEpC,CASA,SAAS,EAAU,EAAG,GACpB,IAAK,GAAU,GACb,MAAM,IAAI,UAAU,2CAA6C,EAAI,KAGvE,IAAI,EAAI,GAAK,GACb,GAAiB,IAAb,EAAE,OACJ,MAAM,IAAI,MAAM,2CAA6C,EAAE,OAAS,gBAE1E,GAAI,EAAE,KAAO,EAAE,GACb,MAAM,IAAI,MAAM,sCAAwC,EAAE,GAAK,IAAM,EAAE,GAAK,KAE9E,GAAI,EAAI,EACN,IACE,OAAO,EAAU,EAAI,IAAK,EAC5B,OAAS,GACP,KAAsB,kDAAlB,EAAM,QACF,IAAI,UAAU,6EAA+E,EAAI,KAEnG,CACR,CAIF,QAFI,EAAM,EAAS,EAAE,IAAI,UACrB,EAAK,EACF,GAAK,GACM,GAAX,IACH,EAAM,EAAS,EAAI,IAErB,IAAM,EACN,EAAK,EAAS,EAAI,GAEpB,OAAO,CACT,CASA,SAAS,EAAW,EAAG,GACrB,OAAO,EAAO,EAAU,EAAE,UAAW,GACvC,KC1LS,GAA2B,GAF3B,MACQ,CAAC,QAAS,YAAa,iBAAkB,OAAQ,SACF,IAChE,IAAI,MACF,EAAK,UACL,EAAS,eACT,EAAc,KACd,EAAI,KACJ,GACE,EAwBJ,OAAO,EAjCE,MAiCU,CACjB,2CAyBF,SAAmB,EAAG,GACpB,IAAI,EAAI,EAAa,EAAG,GACpB,EAAQ,GAAS,GAAK,EAAE,MAAQ,EAChC,EAAM,GAAS,GAAK,EAAE,WAAa,EAAE,qBACrC,EAAQ,GAAS,GAAK,EAAE,MAAQ,EAChC,EAAM,GAAS,GAAK,EAAE,WAAa,EAAE,qBAGrC,EAAgC,IAApB,EAAM,GAAG,OACrB,EAAgC,IAApB,EAAM,GAAG,OACrB,EAAM,EACN,EAAM,EAGV,GAAI,GAAO,GAAO,IAAQ,GAAsB,iBAAR,GAA4B,UAAR,EAAiB,CAC3E,IAAI,EAAK,EAET,EAAM,EAAM,KAAK,EAAW,CAAC,EAAI,IACjC,EAAM,EAAM,KAAK,EAAgB,CAAC,EAAI,GACxC,CAGA,IAAK,IAAc,EAAW,CAE5B,QADI,EAAI,EAAI,EAAK,EAAM,IAAK,EAAM,IACzB,EAAI,EAAG,EAAI,EAAG,IACrB,EAAI,EAAI,EAAG,EAAI,EAAK,EAAM,IAAK,EAAM,KAEvC,OAAO,CACT,CAGA,IAAK,GAAa,EAAW,CAE3B,QADI,EAAK,EAAI,EAAK,EAAM,IAAK,EAAM,GAAG,IAC7B,EAAK,EAAG,EAAK,EAAG,IACvB,EAAK,EAAI,EAAI,EAAI,EAAK,EAAM,IAAM,EAAM,GAAI,KAE9C,OAAO,CACT,CAGA,GAAI,IAAc,EAAW,CAE3B,QADI,EAAM,EAAI,EAAK,EAAM,GAAG,IAAK,EAAM,IAC9B,EAAM,EAAG,EAAM,EAAG,IACzB,EAAM,EAAI,EAAK,EAAI,EAAK,EAAM,GAAK,IAAK,EAAM,KAEhD,OAAO,CACT,CAGA,GAAI,GAAa,EAAW,CAE1B,QADI,EAAM,EAAI,EAAK,EAAM,GAAG,IAAK,EAAM,GAAG,IACjC,EAAM,EAAG,EAAM,EAAG,IACzB,EAAM,EAAI,EAAK,EAAI,EAAK,EAAM,GAAK,IAAK,EAAM,GAAK,KAErD,OAAO,CACT,CACF,EAhFE,6BAiFF,SAAoB,EAAG,GACrB,EAAa,EAAG,GAYhB,QAXI,EAAS,EAAE,OACX,EAAU,EAAE,QACZ,EAAS,EAAE,OACX,EAAU,EAAE,QAGZ,EAAI,EACJ,EAAM,EACN,EAAM,EACN,EAAI,EACJ,EAAI,EACD,EAAI,EAAO,QAAU,EAAI,EAAO,QAAQ,CAC7C,IAAI,EAAI,EAAO,GACX,EAAI,EAAO,GACX,EAAI,EACN,IAGE,EAAI,EACN,IAGE,IAAM,IACR,EAAI,EAAI,EAAG,EAAI,EAAQ,GAAI,EAAQ,KACnC,IACA,IAEJ,CACA,OAAO,CACT,IA9GA,SAAS,EAAa,EAAG,GACvB,IAEI,EAAM,EAFN,EAAQ,EAAM,GACd,EAAQ,EAAM,GAElB,GAAqB,IAAjB,EAAM,OACR,EAAO,EAAM,OACR,IAAqB,IAAjB,EAAM,QAA6B,IAAb,EAAM,GAGrC,MAAM,IAAI,WAAW,2DAA6D,EAAM,KAAK,MAAQ,KAFrG,EAAO,EAAM,EAGf,CACA,GAAqB,IAAjB,EAAM,OACR,EAAO,EAAM,OACR,IAAqB,IAAjB,EAAM,QAA6B,IAAb,EAAM,GAGrC,MAAM,IAAI,WAAW,2DAA6D,EAAM,KAAK,MAAQ,KAFrG,EAAO,EAAM,EAGf,CACA,GAAI,IAAS,EAAM,MAAM,IAAI,WAAW,mCAAqC,EAAO,OAAS,EAAO,KACpG,GAAa,IAAT,EAAY,MAAM,IAAI,WAAW,qDACrC,OAAO,CACT,CA4FA,SAAS,EAAM,GACb,OAAO,GAAS,GAAK,EAAE,OAAS,EAAK,EACvC,KCpJS,GAA2B,GAF3B,MACQ,CAAC,QAAS,SAAU,iBAAkB,WAAY,eAAgB,SAAU,eAC7B,IAChE,IAAI,MACF,EAAK,OACL,EAAM,eACN,EAAc,SACd,EAAQ,aACR,EAAY,OACZ,EAAM,WACN,GACE,EA0BJ,OAAO,EArCE,MAqCU,CACjB,IAAK,SAAa,GAChB,OAAO,GAAM,EACf,EACA,iBAAkB,SAAa,GAC7B,IAAI,EAUJ,QARE,EADE,GAAS,GACJ,EAAE,OACA,MAAM,QAAQ,IACvB,EAAI,EAAO,IACF,OAGF,IAEI,QACX,KAAK,EAEH,OAAO,GAAM,GACf,KAAK,EAEH,GAAgB,IAAZ,EAAK,GACP,OAAO,GAAM,EAAE,UAAU,IAE3B,GAAgB,IAAZ,EAAK,GACP,OAAO,EAEP,MAAM,IAAI,WAAW,gCAAuC,GAAO,GAAQ,KAE/E,KAAK,EAGD,IAAI,EAAO,EAAK,GACZ,EAAO,EAAK,GAChB,GAAI,IAAS,EACX,gBAuBE,EAAQ,GACpB,GAAa,IAAT,EAEF,OAAO,GAAM,EAAO,GAAG,IAClB,GAAa,IAAT,EAGT,OAAO,EAAe,EAAS,EAAO,GAAG,GAAI,EAAO,GAAG,IAAK,EAAS,EAAO,GAAG,GAAI,EAAO,GAAG,KAO7F,QAFI,KACA,EAAa,IAAI,MAAM,GAAM,KAAK,GAAG,MAAK,EAAG,IAAM,IAC9C,EAAI,EAAG,EAAI,EAAM,IAAK,CAC7B,IAAI,EAAK,EAAW,GACpB,GAAI,EAAO,EAAO,GAAI,IAAK,CACzB,IAAI,SACJ,IAAK,EAAK,EAAI,EAAG,EAAK,EAAM,IAC1B,IAAK,EAAO,EAAO,EAAW,IAAK,IAAK,CACtC,EAAK,EAAW,GAChB,EAAW,GAAM,EAAW,GAC5B,EAAW,GAAK,EAChB,GAAW,EACX,KACF,CAEF,GAAI,IAAO,EAAM,OAAO,EAAO,GAAI,EACrC,CAGA,QAFI,EAAM,EAAO,GAAI,GACjB,EAAa,IAAN,EAAU,EAAI,EAAO,EAAW,EAAI,IAAI,EAAI,GAC9C,EAAI,EAAI,EAAG,EAAI,EAAM,IAE5B,QADI,EAAK,EAAW,GACX,EAAI,EAAI,EAAG,EAAI,EAAM,IAC5B,EAAO,GAAI,GAAK,EAAa,EAAe,EAAS,EAAO,GAAI,GAAI,GAAM,EAAS,EAAO,GAAI,GAAI,EAAO,GAAI,KAAM,EAGzH,CACA,IAAI,EAAM,EAAO,EAAW,EAAO,IAAI,EAAO,GAC9C,OAAO,EAAU,EAAW,GAAO,CAEvC,CAhEY,CAAY,EAAE,QAAQ,UAAW,GAEnC,GAAa,IAAT,EACF,OAAO,EAEP,MAAM,IAAI,WAAW,gCAAuC,GAAO,GAAQ,KAGjF,QAEE,MAAM,IAAI,WAAW,yCAAgD,GAAO,GAAQ,KAE1F,GAoDF,ICtIS,GAA2B,GAF3B,MACQ,CAAC,QAAS,SAAU,eAAgB,YAAa,WAAY,aAAc,MAAO,WAAY,QAC/C,IAChE,IAAI,MACF,EAAK,OACL,EAAM,aACN,EAAY,UACZ,EAAS,SACT,EAAQ,WACR,EAAU,IACV,EAAG,SACH,EAAQ,IACR,GACE,EAqBJ,OAAO,EAlCE,MAkCU,CACjB,iBAAkB,SAAuB,GACvC,IAAI,EAAO,GAAS,GAAK,EAAE,OAAS,GAAU,GAC9C,OAAQ,EAAK,QACX,KAAK,EAEH,GAAgB,IAAZ,EAAK,GACP,OAAI,GAAS,GACJ,EAAO,CAAC,EAAa,EAAG,EAAE,UAAU,MAEpC,CAAC,EAAa,EAAG,EAAE,KAG5B,MAAM,IAAI,WAAW,gCAAuC,GAAO,GAAQ,KAE/E,KAAK,EAGD,IAAI,EAAO,EAAK,GACZ,EAAO,EAAK,GAChB,GAAI,IAAS,EACX,OAAI,GAAS,GACJ,EAAO,EAAK,EAAE,UAAW,EAAM,GAAO,EAAE,WAGxC,EAAK,EAAG,EAAM,GAGvB,MAAM,IAAI,WAAW,gCAAuC,GAAO,GAAQ,KAGjF,QAEE,MAAM,IAAI,WAAW,yCAAgD,GAAO,GAAQ,KAE1F,EACA,IAAK,SAAa,GAEhB,OAAO,EAAa,EAAG,EACzB,IAWF,SAAS,EAAK,EAAK,EAAM,GACvB,IAAI,EAAG,EAAG,EAAG,EAAO,EACpB,GAAa,IAAT,EAAY,CAGd,GAAc,KADd,EAAQ,EAAI,GAAG,IAEb,MAAM,MAAM,iDAEd,MAAO,CAAC,CAAC,EAAa,EAAG,IAC3B,CAAO,GAAa,IAAT,EAAY,CAErB,IAAI,EAAI,EAAI,GACZ,GAAU,IAAN,EACF,MAAM,MAAM,iDAEd,MAAO,CAAC,CAAC,EAAa,EAAI,GAAG,GAAI,GAAI,EAAa,EAAW,EAAI,GAAG,IAAK,IAAK,CAAC,EAAa,EAAW,EAAI,GAAG,IAAK,GAAI,EAAa,EAAI,GAAG,GAAI,IACjJ,CAQE,IAAI,EAAI,EAAI,SACZ,IAAK,EAAI,EAAG,EAAI,EAAM,IACpB,EAAE,GAAK,EAAE,GAAG,SAQd,QAHI,EAAI,EAAS,GAAM,UAGd,EAAI,EAAG,EAAI,EAAM,IAAK,CAE7B,IAAI,EAAO,EAAI,EAAE,GAAG,IAChB,EAAO,EAEX,IADA,EAAI,EAAI,EACD,EAAI,GACL,EAAI,EAAE,GAAG,IAAM,IACjB,EAAO,EAAI,EAAE,GAAG,IAChB,EAAO,GAET,IAEF,GAAa,IAAT,EACF,MAAM,MAAM,kDAEd,EAAI,KACM,IACR,EAAO,EAAE,GACT,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,EACP,EAAO,EAAE,GACT,EAAE,GAAK,EAAE,GACT,EAAE,GAAK,GAIT,IAAI,EAAK,EAAE,GACP,EAAK,EAAE,GACX,IAAK,EAAI,EAAG,EAAI,EAAM,IAAK,CACzB,IAAI,EAAK,EAAE,GACP,EAAK,EAAE,GACX,GAAI,IAAM,GAER,GAAc,IAAV,EAAG,GAAU,CAKf,IAJA,EAAI,EAAa,EAAW,EAAG,IAAK,EAAG,IAIlC,EAAI,EAAG,EAAI,EAAM,IACpB,EAAG,GAAK,EAAU,EAAG,GAAI,EAAS,EAAG,EAAG,KAE1C,IAAK,EAAI,EAAG,EAAI,EAAM,IACpB,EAAG,GAAK,EAAU,EAAG,GAAI,EAAS,EAAG,EAAG,IAE5C,MACK,CAIL,IADA,EAAI,EAAG,GACF,EAAI,EAAG,EAAI,EAAM,IACpB,EAAG,GAAK,EAAa,EAAG,GAAI,GAE9B,IAAK,EAAI,EAAG,EAAI,EAAM,IACpB,EAAG,GAAK,EAAa,EAAG,GAAI,EAEhC,CACF,CACF,CACA,OAAO,CAEX,KCpLE,GAAO,QAEA,GAA6B,GAAQ,GAD7B,CAAC,QAAS,SAAU,iBAAkB,MAAO,YAAa,YACT,IAClE,IAAI,MACF,EAAK,OACL,EAAM,eACN,EAAc,IACd,EACA,UAAW,EAAU,QACrB,GACE,EAmEJ,OAAO,EAAM,GAAM,CACjB,OAAQ,GACR,QA3CF,SAAS,EAAa,GACpB,GAAa,IAAT,EAAE,GACJ,OAAO,GAAY,EAAE,IAKvB,GAAI,EAAE,GAAK,GAAK,CAMd,IAAI,EAAK,IAAI,EAAQ,EAAI,EAAE,IAAK,EAAE,IAC9B,EAAI,IAAI,EAAQ,KAAK,GAAK,EAAE,GAAI,KAAK,GAAK,EAAE,IAChD,OAAO,IAAI,EAAQ,KAAK,IAAI,IAAI,EAAE,OAAO,IAAI,EAAa,GAC5D,CAIA,EAAI,IAAI,EAAQ,EAAE,GAAK,EAAG,EAAE,IAK5B,QAFI,EAAI,IAAI,EAAQ,GAAO,GAAI,GAEtB,EAAI,EAAG,EAAI,GAAO,SAAU,EAAG,CAEtC,IAAI,EAAY,IAAI,EAAQ,GAAO,GAAI,GACvC,EAAI,EAAE,IAAI,EAAU,IAAI,EAAE,IAAI,IAChC,CAEA,IAAI,EAAI,IAAI,EAAQ,EAAE,GAAK,GAAS,GAAK,EAAE,IAGvC,EAAY,KAAK,KAAK,EAAI,KAAK,IAC/B,EAAO,EAAE,IAAI,EAAE,IAAI,KACnB,EAAO,EAAE,MAAM,MAGnB,OAAO,EAAE,IAAI,GAAW,IAAI,GAAM,IAAI,EACxC,EAIE,UAAW,SAAmB,GAC5B,GAAI,EAAE,YACJ,OAAO,EAAE,cAAgB,EAAE,SAAW,IAAI,EAAW,KAAY,EAAa,EAAE,MAAM,IAExF,IAAK,EAAE,WACL,OAAO,IAAI,EAAW,EAAE,aAAe,IAAM,KAE/C,MAAM,IAAI,MAAM,6BAClB,IAQF,SAAS,EAAa,GACpB,GAAI,EAAI,EACN,OAAO,IAAI,EAAW,CAAC,EAAG,EAAG,EAAG,EAAG,GAAI,IAAK,IAAK,MAAM,IAEzD,IAAI,EAAY,EAAO,WAAsC,EAAzB,KAAK,IAAI,EAAE,aAC3C,EAAM,EAAW,MAAM,CACzB,cAEF,GAAI,EAAI,GAAM,EACZ,OAAO,EAAE,MAAM,EAAa,IAAI,EAAW,EAAI,KAKjD,QAHI,EAAI,EACJ,EAAO,IAAI,EAAI,GACf,EAAM,EAAE,WACL,EAAI,GAET,GADA,GAAK,EAEL,EAAO,EAAK,MAAM,GAEpB,OAAO,IAAI,EAAW,EAAK,YAAY,EAAW,WACpD,KC9GS,GAA2B,GAAqB,CAC3D,OAAE,KAES,GAAyB,GAAmB,IAU5C,GAA0B,GAAoB,IAgB9C,GAAwB,GAAkB,IA0B1C,GAA6B,GAAuB,CAC7D,YAmBS,GAAuB,GAAY,CAC5C,aACA,WACA,eACA,cAMS,GAAqB,GAAU,CACxC,WAiBS,GAA2B,GAAgB,CACpD,WAyCS,GAAsB,GAAW,CAC1C,WAgBS,GAA6B,GAAkB,CAC1D,OAAE,GACA,WA6CS,GAAwB,GAAa,CAC9C,eACA,WAuBS,GAAgC,GAAqB,CAC9D,WAKS,GAAwB,GAAa,CAC9C,WAiCS,GAA8B,GAAwB,CAC/D,UACA,eACA,WAWS,GAAgC,GAAqB,CAC9D,WA0BS,GAA2B,GAAgB,CACpD,aACA,WAuBS,GAAwB,GAAa,CAC9C,eACA,UACA,gBACA,WA+GS,GAA0B,GAAe,CAClD,YACA,WAES,GAA0B,GAAe,CAClD,aACA,eACA,gBACF,OAAE,GACA,UACA,WAsCS,GAAyB,GAAc,CAChD,aACA,YACA,YA6BS,GAAsB,GAAW,CAC1C,UACF,OAAE,GACA,WAgBS,GAA4B,GAAiB,CACtD,WAyFS,GAA8B,GAAmB,CAC1D,WACA,WA8RS,GAA0B,GAAe,CAClD,aACA,IAxD8B,GAAU,CACxC,aACA,QACA,kBACA,QACA,WAoDA,eACA,UACA,kBACA,WA0US,GAAuB,GAAY,CAC5C,aACA,WACF,OAAE,GACA,kBACA,IA7K8B,GAAU,CACxC,WACF,OAAE,GACA,YACA,YACA,IA9B8B,GAAU,CACxC,OACA,aACA,IAtB8B,GAAU,CACxC,gBACA,UACA,UACA,YACA,kBACA,SACA,gBAgBA,gBACA,YACA,UACA,YACA,SACA,gBAsBA,UACA,YACA,UACA,WAqKA,WClwCK,MAAM,GAMT,WAAA,CAAY,GACR,GAAI,EAAS,CACT,MAAM,YAAE,GAAgB,EACxB,GAA2B,mBAAhB,EACP,KAAK,aAAe,UACf,EACL,MAAM,IAAI,UAAU,sCAC5B,CACJ,CACA,aACA,eAAA,GACI,OAAO,KAAK,YAChB,CAUA,EAAE,OAAO,aAAa,SACX,KAAK,gBAAgB,EAChC,CAOA,OAAA,GACI,UAAW,KAAQ,WACT,CAEd,CAeA,KAAA,CAAM,EAAW,GACb,IAAI,EAAQ,EACZ,UAAW,KAAQ,KACf,IAAK,EAAU,KAAK,EAAS,EAAM,IAAS,MACxC,SAGR,QACJ,CAeA,IAAA,CAAK,EAAW,GACZ,IAAI,EAAQ,EACZ,UAAW,KAAQ,KACf,GAAI,EAAU,KAAK,EAAS,EAAM,IAAS,MACvC,SAGR,QACJ,CAcA,OAAA,CAAQ,EAAY,GAChB,IAAI,EAAQ,EACZ,UAAW,KAAQ,KACf,EAAW,KAAK,EAAS,EAAM,IAAS,KAEhD,CAiBA,IAAA,CAAK,EAAW,GACZ,IAAI,EAAQ,EACZ,UAAW,KAAQ,KACf,GAAI,EAAU,KAAK,EAAS,EAAM,IAAS,MACvC,OAAO,CAGnB,CAWA,GAAA,CAAI,GACA,UAAW,KAAO,KACd,GAAI,IAAQ,EACR,SAER,QACJ,CAcA,MAAA,CAAO,EAAY,GACf,IAAI,EAAc,GAAgB,EAC9B,EAAQ,EACZ,UAAW,KAAQ,KACf,EAAc,EAAW,EAAa,EAAM,IAAS,MAEzD,OAAO,CACX,CAQA,OAAA,GACI,MAAO,IAAI,KACf,CAOA,QAAA,GACI,MAAO,IAAI,KACf,CAOA,KAAA,GACI,QAAQ,IAAI,KAAK,WACrB,ECZG,MAAM,WAAa,GActB,WAAA,CAAY,EAAW,GAAI,GAEvB,GADA,MAAM,GACF,EAAS,CACT,MAAM,WAAE,GAAe,EACnB,IACA,KAAK,YAAc,EAC3B,CACA,KAAK,QAAQ,EACjB,CACA,UAAY,GAKZ,YAAA,GACI,OAAO,KAAK,SAChB,CAIA,QAAA,GACI,OAAO,KAAK,SAAS,MACzB,CAKA,QAAA,GACI,OAAO,KAAK,SAAS,KAAK,KAAO,UACrC,CAOA,cAAA,CAAe,EAAU,GACrB,OAAO,IAAI,GAAK,EAAU,EAC9B,CAWA,GAAA,CAAI,GAEA,OADA,KAAK,UAAU,KAAK,GACb,KAAK,UAAU,KAAK,SAAS,OAAS,EACjD,CAcA,OAAA,CAAQ,GACJ,MAAM,EAAM,GACZ,UAAW,KAAM,EACT,KAAK,aACL,EAAI,KAAK,KAAK,IAAI,KAAK,aAAa,KAGxC,EAAI,KAAK,KAAK,IAAI,IAEtB,OAAO,CACX,CAQA,IAAA,GACI,GAA6B,IAAzB,KAAK,SAAS,OACd,OACJ,MAAM,EAAQ,KAAK,SAAS,GACtB,EAAO,KAAK,SAAS,MAK3B,OAJI,KAAK,SAAS,SACd,KAAK,SAAS,GAAK,EACnB,KAAK,UAAU,EAAG,KAAK,SAAS,QAAU,IAEvC,CACX,CAQA,IAAA,GACI,OAAO,KAAK,SAAS,EACzB,CAKA,OAAA,GACI,OAAqB,IAAd,KAAK,IAChB,CAIA,KAAA,GACI,KAAK,UAAY,EACrB,CAQA,MAAA,CAAO,GAEH,OADA,KAAK,UAAY,EACV,KAAK,KAChB,CASA,GAAA,CAAI,GACA,OAAO,KAAK,SAAS,SAAS,EAClC,CAYA,OAAO,GACH,MAAM,EAAQ,KAAK,SAAS,QAAQ,GACpC,QAAI,EAAQ,IAEE,IAAV,EACA,KAAK,OAEA,IAAU,KAAK,SAAS,OAAS,EACtC,KAAK,SAAS,OAGd,KAAK,SAAS,OAAO,EAAO,EAAG,KAAK,SAAS,OAC7C,KAAK,UAAU,GACf,KAAK,UAAU,EAAO,KAAK,SAAS,QAAU,OAGtD,CASA,GAAA,CAAI,EAAQ,OACR,MAAM,EAAS,GAET,EAAQ,IACV,MAAM,EAAO,EAAI,EAAQ,EAAG,EAAQ,EAAO,EACvC,EAAQ,KAAK,OACC,OAAV,GACA,EAAK,GACL,EAAO,KAAK,KAAK,SAAS,IAC1B,EAAK,IAEU,QAAV,GACL,EAAO,KAAK,KAAK,SAAS,IAC1B,EAAK,GACL,EAAK,IAEU,SAAV,IACL,EAAK,GACL,EAAK,GACL,EAAO,KAAK,KAAK,SAAS,OAKtC,OADA,EAAK,GACE,CACX,CAQA,KAAA,GACI,OAAO,IAAI,GAAK,KAAM,CAAE,WAAY,KAAK,WAAY,YAAa,KAAK,aAC3E,CAQA,IAAA,GACI,MAAM,EAAc,GACd,EAAS,IAAI,GAAK,KAAM,CAAE,WAAY,KAAK,aACjD,KAAuB,IAAhB,EAAO,MAAY,CACtB,MAAM,EAAM,EAAO,gBACf,GACA,EAAY,KAAK,EACzB,CACA,OAAO,CACX,CAOA,GAAA,GACI,MAAM,EAAU,GAChB,QAAS,EAAI,KAAK,MAAM,KAAK,KAAO,GAAI,GAAK,EAAG,IAC5C,EAAQ,KAAK,KAAK,UAAU,EAAG,KAAK,SAAS,QAAU,IAC3D,OAAO,CACX,CAiBA,MAAA,CAAO,EAAU,GACb,MAAM,EAAe,IAAI,GAAK,GAAI,CAAE,YAAa,KAAK,YAAa,WAAY,KAAK,aACpF,IAAI,EAAQ,EACZ,UAAW,KAAW,KACd,EAAS,KAAK,EAAS,EAAS,EAAO,OACvC,EAAa,IAAI,GAErB,IAEJ,OAAO,CACX,CAsBA,GAAA,CAAI,EAAU,EAAY,EAAa,GACnC,MAAM,EAAa,IAAI,GAAK,GAAI,CAAE,aAAY,gBAC9C,IAAI,EAAQ,EACZ,UAAW,KAAM,KACb,EAAW,IAAI,EAAS,KAAK,EAAS,EAAI,EAAO,OACjD,IAEJ,OAAO,CACX,CACA,oBAAsB,CAAC,EAAG,KACtB,GAAiB,iBAAN,GAA+B,iBAAN,EAChC,MAAM,UAAU,4GAEpB,OAAI,EAAI,EACG,EACP,EAAI,KAED,GAEX,YAAc,KAAK,oBAKnB,cAAA,GACI,OAAO,KAAK,WAChB,CAIA,aAAA,GACI,UAAW,KAAW,KAAK,eACjB,CAEd,CAQA,SAAA,CAAU,GACN,MAAM,EAAU,KAAK,SAAS,GAC9B,KAAO,EAAQ,GAAG,CACd,MAAM,EAAU,EAAQ,GAAM,EACxB,EAAa,KAAK,SAAS,GACjC,GAAI,KAAK,WAAW,EAAY,IAAY,EACxC,MACJ,KAAK,SAAS,GAAS,EACvB,EAAQ,CACZ,CAEA,OADA,KAAK,SAAS,GAAS,IAE3B,CASA,SAAA,CAAU,EAAO,GACb,MAAM,EAAU,KAAK,SAAS,GAC9B,KAAO,EAAQ,GAAY,CACvB,IAAI,EAAQ,GAAS,EAAK,EAC1B,MAAM,EAAQ,EAAO,EACrB,IAAI,EAAU,KAAK,SAAS,GAK5B,GAJI,EAAQ,KAAK,SAAS,QAAU,KAAK,WAAW,EAAS,KAAK,SAAS,IAAU,IACjF,EAAO,EACP,EAAU,KAAK,SAAS,IAExB,KAAK,WAAW,EAAS,IAAY,EACrC,MACJ,KAAK,SAAS,GAAS,EACvB,EAAQ,CACZ,CAEA,OADA,KAAK,SAAS,GAAS,IAE3B,YVrjBO,GACP,EAAa,EAAoB,MAAI,GAAK,QAC1C,EAAa,EAAsB,QAAI,GAAK,SAC/C,CUkjBG,CVljBD,KAAiB,GAAe,KWI5B,MAAM,WAAsB,GAS/B,WAAA,CAAY,EAAW,GAAI,GACvB,MAAM,EAAU,EACpB,CAOA,KAAA,GACI,OAAO,IAAI,GAAc,KAAM,CAAE,WAAY,KAAK,WAAY,YAAa,KAAK,aACpF,CAiBA,MAAA,CAAO,EAAU,GACb,MAAM,EAAwB,IAAI,GAAc,GAAI,CAChD,YAAa,KAAK,YAClB,WAAY,KAAK,aAErB,IAAI,EAAQ,EACZ,UAAW,KAAW,KACd,EAAS,KAAK,EAAS,EAAS,EAAO,OACvC,EAAsB,IAAI,GAE9B,IAEJ,OAAO,CACX,CAsBA,GAAA,CAAI,EAAU,EAAY,EAAa,GACnC,MAAM,EAAsB,IAAI,GAAc,GAAI,CAAE,aAAY,gBAChE,IAAI,EAAQ,EACZ,UAAW,KAAM,KACb,EAAoB,IAAI,EAAS,KAAK,EAAS,EAAI,EAAO,OAC1D,IAEJ,OAAO,CACX,ECrFG,MAAM,WAAyB,GAYlC,WAAA,CAAY,EAAW,GAAI,GACvB,MAAM,EAAU,EACpB,CAOA,KAAA,GACI,OAAO,IAAI,GAAiB,KAAM,CAAE,WAAY,KAAK,WAAY,YAAa,KAAK,aACvF,CAiBA,MAAA,CAAO,EAAU,GACb,MAAM,EAAwB,IAAI,GAAiB,GAAI,CACnD,YAAa,KAAK,YAClB,WAAY,KAAK,aAErB,IAAI,EAAQ,EACZ,UAAW,KAAW,KACd,EAAS,KAAK,EAAS,EAAS,EAAO,OACvC,EAAsB,IAAI,GAE9B,IAEJ,OAAO,CACX,CAsBA,GAAA,CAAI,EAAU,EAAY,EAAa,GACnC,MAAM,EAAsB,IAAI,GAAiB,GAAI,CAAE,aAAY,gBACnE,IAAI,EAAQ,EACZ,UAAW,KAAM,KACb,EAAoB,IAAI,EAAS,KAAK,EAAS,EAAI,EAAO,OAC1D,IAEJ,OAAO,CACX,ECnFY,IAAI,OACD,IAAI,UACJ,IAAI,UACJ,IAAI,UACJ,IAAI,8hhC,2dCQL,IAAI,UACH,IAAI,UACvB,MAAM,GAAoB,IAAI,UAC9B,GAAkB,IACd,EAAG,EAAG,EACN,EAAG,EAAG,EACN,KAAO,GACP,MAAM,IAA2B,IAAI,WAAU,IAC3C,EAAG,EAAI,EAAG,EACV,EAAG,KAAO,EACV,EAAG,EAAI,EAAG,EACV,EAAG,EAAI,EAAG,GAGlB,SAAS,GAAa,EAAG,GACrB,OAAQ,YAAU,YAAY,GAAM,YAAU,YAAY,IAAM,MAAS,CAC7E,CACA,MAAM,WAAmB,OACrB,WAAA,CAAY,EAAU,EAAU,EAAY,GAExC,MAGM,EAAY,KAAK,IAAoC,KAAhC,KAAK,KAAK,GAAmC,KAAK,IAAI,KAAa,IAC9F,IAAI,EAFgB,EAEU,KAAK,IAAI,KAAa,GACpD,EAAY,KAAK,MAAM,EAAY,GAAa,EAGhD,MAAM,EAA4B,IAAI,sBAAoB,KAAa,KANnD,EAM6E,CAC7F,UAAW,gBACX,UAAW,gBACX,KAAM,YACN,OAAQ,aACR,WAAY,EACZ,eACA,wBAEJ,EAA0B,QAAQ,KAAO,YACzC,EAA0B,QAAQ,OAAS,aAC3C,EAA0B,QAAQ,eAAiB,UACnD,EAAS,iBAAiB,GAG1B,MAAM,EAAyB,IAAI,sBAAoB,KAAa,KArBhD,EAqB0E,CAC1F,UAAW,gBACX,UAAW,gBACX,WAAY,EACZ,KAAM,YACN,OAAQ,aACR,eACA,wBAEJ,EAAuB,QAAQ,KAAO,YACtC,EAAuB,QAAQ,OAAS,aACxC,EAAuB,QAAQ,eAAiB,UAChD,EAAS,iBAAiB,GAI1B,MAAM,EAAW,IAAI,iBACjB,CACI,YAAa,QACb,SAAU,CACN,YAAa,CAAE,MAAO,MACtB,UAAW,CAAE,MA1CL,GA2CR,kBAAmB,CAAE,MAAO,EAAuB,SACnD,qBAAsB,CAAE,MAAO,EAA0B,SACzD,kBAAmB,CAAE,MAAO,IAC5B,eAAgB,CAAE,MAAO,GAAG,GAAiB,IAC7C,WAAY,CAAE,MAAO,OAAO,WAI5B,kBAAmB,CAAE,MAAO,IAAI,WAChC,EAAG,CAAE,MAAO,GACZ,OAAQ,CAAE,MAAO,GACjB,kBAAmB,CAAE,MAAO,GAC5B,WAAY,CAAE,MAAO,KACrB,QAAS,CAAC,UACV,mBAAoB,CAAC,MAAO,GAC5B,UAAW,CAAC,MAAO,GAGnB,WAAY,CAAE,MAAO,GACrB,WAAY,CAAE,MAAO,GACrB,SAAU,CAAE,MAAO,GACnB,SAAU,CAAE,MAAO,IAAI,UAAQ,EAAK,KAExC,aAAc,KACd,eAAgB,GAA0B,KAC1C,eACA,KAAM,YACN,aACA,cACA,SAAU,mBAKZ,EAAW,IAAI,0BACf,EAAW,IAAI,aAAa,KAAO,GAAK,EAAG,GAAK,GAAK,OAAG,GAAY,EAAG,OAAW,IAGxF,EAAS,SAFO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,IAGhC,EAAS,aAAa,WAAY,IAAI,kBAAgB,EAAU,IAChE,MAAM,EAAQ,IAAI,YAAY,GAExB,EAAiB,IAAI,2BAAyB,EAAO,MAC3D,EAAe,eACf,EAAe,SAAS,oBACxB,EAAS,aAAa,QAAS,GAC/B,EAAS,cAAgB,EAGzB,MAAM,EAAU,GAChB,KAAK,gBAAkB,EACvB,KAAK,oBACL,KAAK,WAAa,EAClB,KAAK,kBAAoB,EACzB,KAAK,eAAiB,EACtB,KAAK,YAAc,KACnB,KAAK,YAnGe,EAoGpB,KAAK,UAAY,EACjB,KAAK,UAAY,EACjB,KAAK,kBAAoB,EAEzB,KAAK,0BAA4B,EACjC,KAAK,uBAAyB,EAE9B,KAAK,SAAW,EAEhB,KAAK,OAAS,EAEd,KAAK,cAAgB,IAAI,GACzB,QAAS,EAAI,EAAG,EAAI,KAAK,UAAW,GAAK,EACrC,KAAK,cAAc,IAAI,GAG3B,KAAK,OAAS,IAAI,GAElB,KAAK,cAAgB,GAIrB,KAAK,cAAgB,KACrB,KAAK,sBAAwB,EAC7B,KAAK,gBAAkB,GAGvB,KAAK,sBAAwB,GAC7B,KAAK,uBAAyB,GAC9B,KAAK,OAAO,UAAY,IAGpB,IACI,KAAK,cAAgB,IAAI,YAAY,EAAQ,KAAK,MACtD,OAEI,KAAK,cAAgB,EAAQ,KAAK,KACtC,CACA,KAAK,sBAAwB,EAAQ,KAAK,OAAS,WACxC,EAAQ,KAAK,IACpB,KAAK,gBAAgB,KAAK,EAAQ,KAAK,KAG/C,KAAK,eAAiB,IAAI,UAAQ,EAAG,EAAG,GACxC,KAAK,cACL,KAAK,aAAa,IAAI,UAAQ,EAAG,EAAG,GAAc,GAAV,KAAK,IAC7C,KAAK,iBAIL,KAAK,eAAiB,IAAI,iBACtB,CACI,YAAa,QACb,SAAU,CACN,cAAe,IAEnB,aAAc,KACd,eA27BK,+OA17BL,eACA,KAAM,YACN,aACA,gBAGR,KAAK,eAAiB,IAAI,iBACtB,CACI,YAAa,QACb,SAAU,CACN,cAAe,GACf,EAAG,CAAE,MAAO,IAEhB,aAAc,KACd,eA67BK,0QA57BL,eACA,KAAM,YACN,aACA,gBAGR,KAAK,WAAa,IAAI,yBAAyB,GAAK,OAAW,GAAK,IACpE,KAAK,WAAW,SAAS,EAAI,EAC7B,KAAK,UAAY,IAAI,QACrB,MAAM,EAAe,IAAI,gBAAc,EAAG,GAC1C,KAAK,SAAW,IAAI,OAAK,EAAc,KAAK,gBAC5C,KAAK,UAAU,IAAI,KAAK,UACxB,KAAK,UAAU,oBACf,KAAK,SAAS,oBACd,KAAK,kBAET,CAKA,UAAA,CAAW,GAEP,MAAM,EAAI,EAAc,GADxB,EAAU,KAAK,IAAI,EAAG,KAAK,IAAI,EAAI,EAAI,KAEvC,KAAK,SAAS,SAAS,EAAE,MAAQ,EACjC,KAAK,SAAS,SAAS,OAAO,MAAQ,KAAK,IAAK,EAAM,GAAM,EAAM,GAAM,EAAG,EAAI,GAC/E,KAAK,SAAS,SAAS,kBAAkB,MAAkB,EAAV,EACjD,KAAK,SAAS,SAAS,WAAW,MAAQ,GAC9C,CACA,mBAAA,CAAoB,GAChB,KAAK,gBAAkB,EACvB,KAAK,SAAS,SAAS,QAAQ,MAAQ,CAC3C,CACA,YAAA,CAAa,GACT,KAAK,UAAY,EACjB,KAAK,SAAS,SAAS,UAAU,MAAQ,KAAK,SAClD,CAMA,aAAA,CAAc,GACP,KAAK,UAAY,KAAK,SAAS,mBAAmB,KAAK,SAAS,SAAS,aACxE,KAAK,SAAS,SAAS,WAAW,MAAQ,EAElD,CAMA,aAAA,CAAc,GACP,KAAK,UAAY,KAAK,SAAS,eAA0C,IAAvB,KAAK,SAAS,SAAS,aACxE,KAAK,SAAS,SAAS,WAAW,MAAQ,EAElD,CAMA,WAAA,CAAY,GACL,KAAK,UAAY,KAAK,SAAS,mBAAmB,KAAK,SAAS,SAAS,WACxE,KAAK,SAAS,SAAS,SAAS,MAAQ,EAEhD,CAOA,WAAA,CAAY,EAAa,GAClB,KAAK,UAAY,KAAK,SAAS,mBAAmB,KAAK,SAAS,SAAS,UACxE,KAAK,SAAS,SAAS,SAAS,MAAM,IAAI,EAAa,EAE/D,CACA,kBAAA,CAAmB,GACF,EAAO,iBAAiB,SAErC,KAAK,SAAS,QAAQ,KAAK,SAAS,SAAS,kBAAkB,OAC/D,MAAM,EAAa,KAAK,SAAS,gBACjC,KAAK,SAAS,SAAS,kBAAkB,MAAM,eAAe,GAE1D,KAAK,SAAS,SAAS,mBAAmB,MAAQ,CAK1D,CACA,OAAA,GACI,KAAK,SAAS,UACd,KAAK,eAAe,UACpB,KAAK,eAAe,UACpB,KAAK,uBAAuB,UAC5B,KAAK,0BAA0B,UAC/B,KAAK,OAAO,YACZ,KAAK,OAAS,KACd,KAAK,eAAe,aACpB,KAAK,SAAS,SAClB,CAEA,SAAA,CAAU,EAAK,EAAK,EAAY,GAC5B,KAAK,eAAe,SAAS,cAAc,MAAQ,EACnD,MAAM,EAAgB,KAAK,SAAS,UAC9B,EAAmB,KAAK,SAAS,kBACvC,KAAK,SAAS,aACd,MAAM,EAAe,EAAW,GAAK,EAAW,GAC1C,EAAgB,EAAW,GAAK,EAAW,GACjD,EAAI,SAAS,IAAI,EAAW,GAAI,EAAW,GAAI,EAAc,GAE7D,KAAK,SAAS,gBAAgB,EAAK,GACnC,KAAK,SAAS,OAAO,KAAK,UAAW,KAAK,YAE1C,KAAK,SAAS,gBAAgB,GAE9B,KAAK,SAAS,UAAY,CAE9B,CAEA,SAAA,CAAU,EAAK,EAAK,GAChB,KAAK,eAAe,SAAS,cAAc,MAAQ,EAEnD,MAAM,EAAgB,KAAK,SAAS,UAC9B,EAAmB,KAAK,SAAS,kBACvC,KAAK,SAAS,aAEd,KAAK,SAAS,SAAW,KAAK,eAE9B,QAAS,EAAQ,EAAG,EAAQ,EAAW,IACnC,KAAK,SAAS,gBAAgB,EAAK,GACnC,KAAK,eAAe,SAAS,EAAE,OAAS,EAAQ,IAAG,EACnD,KAAK,SAAS,OAAO,KAAK,UAAW,KAAK,YAG9C,KAAK,SAAS,SAAW,KAAK,eAE9B,KAAK,SAAS,gBAAgB,GAC9B,KAAK,SAAS,UAAY,CAE9B,CAMA,uBAAA,CAAwB,GACpB,KAAK,SAAS,SAAS,eAAe,MAAQ,GAAgB,KAAK,iBAAmB,EAC1F,CAKA,mBAAA,CAAoB,GAChB,KAAK,SAAS,SAAS,WAAW,MAAQ,CAC9C,CAEA,IAAA,CAAK,EAAgB,GACZ,KAAK,SACL,EAQK,KAAK,gBAAmB,EAAe,OAAO,KAAK,kBACzD,KAAK,eAAe,KAAK,GACpB,GACI,KAAK,gBAAe,KAAK,cAAgB,IAAI,WAClD,KAAK,cAAc,KAAK,GACxB,KAAK,cAAc,SAAS,KAE5B,KAAK,qBAIT,KAAK,OAAO,YAAY,CACpB,OAAQ,OACR,IAAK,CAAC,KAAK,eAAe,EAAG,KAAK,eAAe,GAAI,KAAK,eAAe,GACzE,IAAK,KAAK,eAAiB,KAAK,gBAAgB,KAAK,cAAc,iBACnE,GAAI,KAAK,YAtBb,KAAK,OAAO,YAAY,CACpB,OAAQ,OACR,IAAK,CAAC,KAAK,eAAe,EAAG,KAAK,eAAe,GAAI,KAAK,eAAe,GACzE,IAAK,KAAK,eAAiB,KAAK,gBAAgB,KAAK,cAAc,iBACnE,GAAI,KAAK,WAqBrB,CAOA,MAAA,GAEI,GAAK,KAAK,eAAuD,IAAtC,KAAK,sBAAsB,QAAuD,IAAvC,KAAK,uBAAuB,OAAlG,CAGA,KAAO,KAAK,uBAAuB,OAAS,GAAG,CAC3C,MAAM,EAAK,KAAK,uBAAuB,QACjC,EAAS,EAAG,eAElB,KAAK,SAAS,iBAAiB,EAAG,8BAElC,KAAK,UAAU,EAAG,6BAA6B,QAAS,EAAG,6BAA8B,GACzF,EAAG,6BAA6B,UAChC,KAAK,0BAA4B,EAAG,6BACpC,KAAK,SAAS,SAAS,qBAAqB,MAAQ,KAAK,0BAA0B,QAEnF,KAAK,SAAS,iBAAiB,EAAG,2BAClC,KAAK,UAAU,EAAG,0BAA0B,QAAS,EAAG,0BAA2B,GACnF,EAAG,0BAA0B,UAC7B,KAAK,uBAAyB,EAAG,0BACjC,KAAK,SAAS,SAAS,kBAAkB,MAAQ,KAAK,uBAAuB,QAG7E,KAAK,YAAc,EAAG,eACtB,KAAK,SAAS,SAAS,UAAU,MAAQ,KAAK,WAClD,CAGA,KAAO,KAAK,sBAAsB,OAAS,GAAG,CAC1C,MAAM,EAAO,KAAK,sBAAsB,QAElC,EAAK,IAAI,cAAY,EAAK,MAAO,EAAK,YAAa,EAAK,UAAW,aAAY,aACrF,EAAG,eAAiB,UACpB,EAAG,mBACH,EAAG,UAAY,gBACf,EAAG,UAAY,gBACf,EAAG,WAAa,EAChB,EAAG,eACH,KAAK,SAAS,YAAY,GAG1B,MAAM,EAAqB,kBAAd,EAAK,KAA4B,KAAK,0BAA4B,KAAK,uBACpF,KAAK,UAAU,EAAI,EAAK,EAAK,QAAS,EAAK,kBAC3C,EAAG,SACP,CAGA,GAAI,KAAK,cAAe,CACpB,MAAM,EAAW,KAAK,cAGtB,GAFA,KAAK,kBAAoB,EAAS,OAE9B,EAAS,OAAS,KAAK,eAAe,MAAO,CAC7C,MAAM,EAAW,IAAI,0BACf,EAAW,IAAI,aAAa,KAAO,GAAK,EAAG,GAAK,GAAK,OAAG,GAAY,EAAG,OAAW,IAClF,EAAU,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GAEhC,EAAS,SAAS,GAClB,EAAS,aAAa,WAAY,IAAI,kBAAgB,EAAU,IAChE,MAAM,EAAQ,IAAI,YAAY,KAAK,WAE7B,EAAiB,IAAI,2BAAyB,EAAO,MAC3D,EAAe,eACf,EAAe,SAAS,oBACxB,EAAS,aAAa,QAAS,GAC/B,EAAS,cAAgB,EAEzB,KAAK,SAAS,UACd,KAAK,SAAW,EAChB,KAAK,eAAiB,CAC1B,CAEA,KAAK,eAAe,oBACpB,KAAK,eAAe,IAAI,GACxB,KAAK,eAAe,eAAe,EAAG,EAAS,QAC/C,KAAK,eAAe,eACpB,KAAK,SAAS,cAAgB,KAAK,sBACnC,KAAK,SAAS,eAGd,UAAW,KAAO,KAAK,gBACnB,QAAS,EAAI,KAAK,cAAc,OAAS,EAAG,GAAK,EAAG,IACnC,KAAK,cAAc,GAAG,IAE/B,KAAK,cAAc,OAAO,EAAG,GAMzC,KAAK,cAAgB,KACrB,KAAK,sBAAwB,EAC7B,KAAK,gBAAgB,OAAS,CAClC,CA1FgH,CA2FpH,CACA,OAAA,CAAQ,EAAW,GAEnB,CAEA,aAAA,CAAc,EAAW,EAAQ,EAAM,GACnC,IAAK,KAAK,OAAQ,OAClB,MAAM,EAAO,KAEP,EAAgB,EAAU,KAAO,EAAU,KAAK,MAAQ,EAAU,MAClE,EAAS,EAAU,MAAQ,EAAU,KAAK,oBAAsB,EAAU,KAAK,OAAS,EACxF,EAAS,EAAU,MAAQ,EAAU,KAAK,oBAAsB,EAAU,OAAS,EACnF,EAAa,KAAK,KAAK,EAAc,QAAU,KAAK,UAAY,IAChE,EAAmB,GACnB,EAAwB,GAK9B,IAAI,EAAU,OACd,MAAM,EAAgB,IAAI,aAAc,EAAc,OAAS,EAAU,GACnE,EAAS,IAAI,YACf,EAAc,OACd,EAAc,WACd,EAAc,QAGlB,QAAS,EAAI,EAAG,EAAI,EAAc,OAAS,EAAG,IAC1C,EAAkB,EAAJ,GAAS,EAAc,EAAI,EAAS,GAClD,EAAkB,EAAJ,EAAQ,GAAK,EAAc,EAAI,EAAS,EAAS,GAC/D,EAAkB,EAAJ,EAAQ,GAAK,EAAc,EAAI,EAAS,EAAS,GAInE,EAAU,CAAC,EAAK,EAAY,KACxB,MAAM,EAAgB,EAAY,EAC5B,EAAoB,KAAK,IAAI,EAAK,SAAS,SAAS,WAAW,MAAM,GAGrE,EAAa,IAAI,UACjB,EAAc,IAAI,UAClB,EAAI,IAAI,UACR,EAAI,IAAI,UACR,EAAkB,IAAI,UAEtB,EAAY,EAAc,OAAS,EACzC,QAAS,EAAI,EAAG,EAAI,EAAW,IAAK,CAIhC,GAFA,EAAY,IAAI,EAAkB,EAAJ,IAAS,EAAkB,EAAJ,EAAQ,GAAI,EAAkB,EAAJ,EAAQ,IAEnF,EAAY,WAAa,GAAqB,EAAI,kBAAkB,GAAe,EACnF,SAGJ,GAAsB,EAAM,EAAM,EAAG,GAErC,MAAM,EAAI,EAAE,KAAK,GAAa,IAAI,EAAI,QAAQ,IAAI,EAAI,WACtD,GAAI,EAAI,EAAG,SAEX,EAAgB,KAAK,EAAI,WAAW,eAAe,GAAG,IAAI,EAAI,QAE9D,MAAM,EAAe,EAAE,KAAK,GAAiB,IAAI,GACjD,GAAqB,EAAY,EAAc,GAE/C,MAAM,EAAgB,EAAa,IAAI,GAEjC,EAAa,EAAO,KAAK,GAAK,KAAK,QAAW,GAEhD,EAAa,KACb,EAAW,KAAK,CACZ,SAAU,EACV,MAAO,EAAgB,QACvB,QAAS,EACT,KAAM,QACN,OAAQ,MAGpB,GAGA,EAAa,KAAK,cAAc,MAChC,KAAK,eAGT,QAAS,EAAI,EAAG,EAAI,EAAY,IAAK,CACjC,MAAM,EAAU,KAAK,cAAc,OAC/B,MAAM,IACN,QAAQ,IAAI,iDAIhB,EAAiB,KAAK,GACtB,EAAsB,KAAe,EAAV,GAC3B,MAAM,EAAa,EAAI,KAAK,UAC5B,KAAK,eAAe,EAAY,EAAS,EAAQ,EAAQ,EAAM,EACnE,CAGA,EAAK,OAAO,YAAY,CACpB,OAAQ,aACR,iBAAkB,EAClB,UAAW,EAAc,OACzB,OAAQ,EACR,OAAQ,EACR,UAAW,EAAK,WACjB,CAAC,EAAc,SAElB,IAAI,KA4DJ,MAAO,CACH,KA5DS,KAEM,GAAX,GAAmB,EAAK,SACxB,EAAK,oBACL,KACA,EAAK,OAAO,YAAY,CACpB,OAAQ,cACR,iBAAkB,EAClB,IAAK,CAAC,EAAK,eAAe,EAAG,EAAK,eAAe,GAAI,EAAK,eAAe,GACzE,IAAK,KAAK,eAAiB,KAAK,gBAAgB,KAAK,cAAc,iBACnE,GAAI,EAAK,aAmDjB,KA5CU,IACV,GAAe,GAAX,GAAoB,EAAK,OAAQ,CACjC,EAAK,oBACL,KACA,MAAM,EAAS,EAAK,OACd,EAAY,GACV,GAAM,IACN,QAKR,EAAK,cAAc,KAAK,GAExB,EAAK,OAAO,YAAY,CACpB,OAAQ,cACR,iBAAkB,EAClB,IAAK,CAAC,EAAK,eAAe,EAAG,EAAK,eAAe,GAAI,EAAK,eAAe,GACzE,IAAK,KAAK,eAAiB,KAAK,gBAAgB,KAAK,cAAc,iBACnE,GAAI,EAAK,UAEjB,GAwBA,OApBW,KACN,EAAK,SACV,SACA,EAAK,OAAO,YAAY,CACpB,OAAQ,gBACR,iBAAkB,EAClB,IAAK,CAAC,EAAK,eAAe,EAAG,EAAK,eAAe,GAAI,EAAK,eAAe,GACzE,IAAK,KAAK,eAAiB,KAAK,gBAAgB,KAAK,cAAc,iBACnE,GAAI,EAAK,WAEb,EAAiB,SAAQ,GAAW,EAAK,cAAc,IAAI,OAW3D,KAAM,KAAK,KACX,QAAS,EACT,iBAGR,CAGA,cAAA,CAAe,EAAqB,EAAS,EAAW,EAAQ,EAAM,GAQlE,MAAM,EAAqB,IAAI,aAA8B,EAAjB,KAAK,WAC3C,EAAkB,IAAI,aAA8B,EAAjB,KAAK,WAGxC,EAAU,IAAI,YAAY,GAC1B,EAAU,IAAI,YAAY,GAC1B,EAAU,IAAI,aAAa,GAC3B,EAAY,IAAQ,EAAQ,GAAK,IAAM,EAAU,EAAQ,IAGzD,EAAS,IAAI,aAAa,EAAU,OAAQ,EAAU,WAAY,EAAU,QAE5E,EAAiB,EAAU,OAAS,EAC1C,QAAS,EAAI,EAAS,EAAI,EAAU,KAAK,UAAW,IAAK,CACrD,MAAM,EAAO,EAAI,EACX,EAAyB,EAAP,EAElB,EAAgB,EAAsB,EACtC,EAAU,GAAK,EAAsB,GAE3C,GAAI,GAAiB,EAAgB,MAGrC,MAAM,EAAK,EAAO,GACZ,EAAK,EAAO,EAAU,GACtB,EAAK,EAAO,EAAU,GAGtB,EAAK,EAAO,KAAK,GACjB,EAAK,EAAO,KAAK,GACjB,EAAK,EAAO,KAAK,GACjB,EAAK,EAAO,KAAK,GAGjB,EAAQ,GAAa,EAAK,KAAK,GAAgB,EAAK,KAAK,IACzD,EAAQ,GAAa,EAAK,KAAK,GAAgB,EAAK,KAAK,IACzD,EAAQ,GAAa,EAAK,KAAK,GAAgB,EAAK,KAAK,IAE/D,EAAgB,GAAuB,EAAS,GAChD,EAAgB,EAAkB,GAAK,EAAS,GAChD,EAAgB,EAAkB,GAAK,EAAS,GAChD,EAAgB,EAAkB,GAAK,EAGvC,EAAmB,GAAuB,EAC1C,EAAmB,EAAkB,GAAK,EAC1C,MAAM,EAAQ,GAAa,EAAI,GACzB,EAAQ,GAAa,EAAI,GAC/B,EAAmB,EAAkB,GAAK,EAAS,GACnD,EAAmB,EAAkB,GAAK,EAAS,EACvD,CAEA,MAAM,EAAmB,KAAK,MAAM,EAAU,KAAK,IAAI,KAAK,YAAa,IACnE,EAAY,KAAK,KAAK,KAAK,UAAY,KAAK,aAC5C,EAAU,CAAC,EAAI,EAAU,KAAK,YAAgB,EAAmB,KAAK,YAAc,KAAK,aAC/F,EAAQ,KAAK,EAAQ,GAAK,GAK1B,KAAK,sBAAsB,KAAK,CAC5B,KAAM,gBACN,MAAO,EACP,YAAa,KAAK,YAClB,UAAW,EACX,QAAS,EACT,iBAAkB,IAEtB,KAAK,sBAAsB,KAAK,CAC5B,KAAM,aACN,MAAO,EACP,YAAa,KAAK,YAClB,UAAW,EACX,QAAS,EACT,iBAAkB,GAG1B,CAEA,YAAA,GAGI,QAAS,EAAI,KAAK,UAAW,EAAI,KAAK,UAAa,KAAK,YAAc,KAAK,YAAc,GAAK,KAAK,UAC/F,KAAK,cAAc,IAAI,GAE3B,KAAK,WAAc,KAAK,YAAc,KAAK,YAI3C,MAAM,EAAiB,KAAK,YAAc,EAIpC,EAA4B,IAAI,sBAAoB,KAAK,YAAa,KAAK,YAAa,EAAgB,CAC1G,UAAW,gBACX,UAAW,gBACX,KAAM,YACN,OAAQ,aACR,WAAY,EACZ,eACA,wBAEJ,EAA0B,QAAQ,KAAO,YACzC,EAA0B,QAAQ,eAAiB,UACnD,EAA0B,QAAQ,OAAS,aAE3C,MAAM,EAAyB,IAAI,sBAAoB,KAAK,YAAa,KAAK,YAAa,EAAgB,CACvG,UAAW,gBACX,UAAW,gBACX,WAAY,EACZ,KAAM,YACN,OAAQ,aACR,eACA,wBAEJ,EAAuB,QAAQ,KAAO,YACtC,EAAuB,QAAQ,eAAiB,UAChD,EAAuB,QAAQ,OAAS,aAGxC,KAAK,uBAAuB,KAAK,CAC7B,6BAA8B,EAC9B,0BAA2B,EAC3B,6BAA8B,KAAK,0BACnC,0BAA2B,KAAK,uBAChC,eAAgB,KAAK,YACrB,eAAgB,GAOxB,EAsCG,SAAS,KACZ,MAAgB,w5QAiPnB,CACM,SAAS,KACZ,MAAiB,62BAkCrB,CAEA,SAAS,KACL,MAAiB,mLAWrB,CA4CA,SAAS,GAAsB,EAAM,EAAM,EAAO,GAC9C,MAAM,EAAM,EAAK,KAAK,GAChB,EAAM,EAAK,KAAK,GAChB,EAAM,EAAK,KAAK,GAChB,EAAM,EAAK,KAAK,GAChB,EAAM,EAAK,KAAK,GAChB,EAAM,EAAK,KAAK,GAEtB,EAAO,IACH,EAAK,EAAK,EACV,EAAK,EAAK,EACV,EAAK,EAAK,EAElB,CASA,SAAS,GAAqB,EAAG,EAAG,GAChC,MAAM,EAAM,EAAE,cACd,GAAI,KAAK,IAAI,GAAO,MAEhB,YADA,EAAO,IAAI,EAAG,EAAG,GAGrB,MAAM,EAAS,EAAM,EAEf,GAAK,IAAI,WAAU,KAAK,GAC9B,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAE/D,MAAM,GAAK,IAAI,WAAU,KAAK,GAC9B,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAE/D,MAAM,GAAK,IAAI,WAAU,KAAK,GAC9B,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAAG,EAAG,SAAS,GAAK,EAAE,EAE/D,EAAO,IACH,EAAG,cAAgB,EACnB,EAAG,cAAgB,EACnB,EAAG,cAAgB,EAE3B,CC7rCA,SAAS,GAAW,EAAM,GACxB,IAAK,GAAM,MAAM,QAAQ,IAAmB,IAAb,EAAE,OAC/B,MAAM,IAAI,MAAM,GAAG,sCAErB,OAAO,CACT,CAMA,SAAS,GAAa,EAAI,EAAI,GAC5B,MAAO,CAAE,KAAM,SAAU,OAAQ,CAAE,GAAI,OAAO,GAAK,GAAI,OAAO,GAAK,GAAI,OAAO,IAChF,CA2CY,MAAC,GAAgB,CAC3B,WAlDF,SAAoB,GAClB,MAAO,CAAE,KAAM,OAAQ,OAAQ,CAAE,OAAQ,OAAO,IAClD,EAiDE,gBACA,UA3CF,SAAmB,EAAI,EAAI,GACzB,OAAO,GAAa,EAAI,EAAI,EAC9B,EA0CE,kBAxCF,SAA2B,EAAI,EAAI,EAAI,GACrC,MAAO,CAAE,KAAM,cAAe,OAAQ,CAAE,GAAI,OAAO,GAAK,GAAI,OAAO,GAAK,GAAI,OAAO,GAAK,OAAQ,OAAO,IACzG,EAuCE,cArCF,SAAuB,EAAY,GACjC,MAAO,CAAE,KAAM,UAAW,OAAQ,CAAE,WAAY,OAAO,GAAa,OAAQ,OAAO,IACrF,EAoCE,WAlCF,SAAoB,EAAY,GAC9B,MAAO,CAAE,KAAM,OAAQ,OAAQ,CAAE,WAAY,OAAO,GAAa,OAAQ,OAAO,IAClF,EAiCE,eA/BF,SAAwB,EAAY,GAClC,MAAO,CAAE,KAAM,WAAY,OAAQ,CAAE,WAAY,OAAO,GAAa,OAAQ,OAAO,IACtF,EA8BE,cA5BF,SAAuB,EAAG,GACxB,MAAO,CAAE,KAAM,UAAW,OAAQ,CAAE,EAAG,GAAW,IAAK,GAAI,EAAG,GAAW,IAAK,IAChF,EA2BE,eAzBF,SAAwB,EAAG,EAAG,GAC5B,MAAO,CAAE,KAAM,WAAY,OAAQ,CAAE,EAAG,GAAW,IAAK,GAAI,EAAG,GAAW,IAAK,GAAI,EAAG,GAAW,IAAK,IACxG,EAwBE,eAtBF,SAAwB,EAAU,GAChC,MAAO,CAAE,KAAM,WAAY,OAAQ,CAAE,WAAU,QAAS,GAAW,MACrE,EAqBE,iBAnBF,SAA0B,GACxB,MAAO,CAAE,KAAM,aAAc,OAAQ,CAAE,YACzC,EAkBE,kBAhBF,SAA2B,EAAM,EAAM,EAAS,EAAQ,CAAE,EAAG,EAAG,EAAG,EAAG,EAAG,IACvE,MAAO,CAAE,KAAM,cAAe,OAAQ,CAAE,KAAM,OAAO,GAAO,KAAM,OAAO,GAAO,UAAS,SAC3F,GChEA,IAAI,GACJ,MAAM,GAAa,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,EAAG,EAAG,GAAI,GAC1D,GAAU,IAAI,GAAI,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IACzC,IAAI,EAAM,KAC3B,MAAM,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GACnC,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GAEnC,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GACnC,GAAU,IAAI,EAAM,IACpB,GAAe,IAAI,EAAM,QACD,IAAI,EAAM,QACxB,IAAI,EAAM,QAC1B,MAAM,GAA4B,IAAI,EAAM,QACtC,GAAiB,GAEjB,GAAiB,IAAI,EAAM,WAC3B,GAAY,GAKlB,SAAS,KACL,IAAI,EAAO,GACX,QAAS,KAAO,GACR,GAAU,eAAe,IAAQ,GAAU,GAAO,GAClD,EAAK,KAAK,GAGlB,OAAO,CAEX,CAQA,MAAM,WAAkB,EAAM,SAmF1B,WAAA,CAAY,GACR,QACA,MAAM,EAAO,KACb,EAAK,QAAU,EAAW,SAAW,GACrC,MAAM,EAAI,EAAK,QACf,GAAI,GAAkB,iBAAN,IACP,EAAE,OAAM,EAAE,KAAO,SACP,MAAX,EAAE,QAAe,EAAE,MAAQ,QACjB,MAAV,EAAE,OAAc,EAAE,KAAO,GACxB,MAAM,QAAQ,EAAE,WAAe,EAAE,UAAY,EAAE,SAAS,YAAY,EAAE,SAAW,CAAC,EAAG,EAAG,IACxF,MAAM,QAAQ,EAAE,kBAAsB,EAAE,iBAAmB,EAAE,gBAAgB,YAAY,EAAE,gBAAkB,CAAC,EAAG,EAAG,IACzG,MAAZ,EAAE,SAAgB,EAAE,OAAS,KAG7B,EAAE,WAAoC,iBAAhB,EAAE,WAAwB,CAChD,MAAM,EAAI,EAAE,UACI,MAAZ,EAAE,SAAgB,EAAE,OAAU,OAAO,SAAS,EAAE,QAAU,EAAE,OAAS,KACpE,MAAM,QAAQ,EAAE,WAEjB,EAAE,SAAW,EAAE,SAAS,QAAO,GAAW,SAAN,GAAsB,SAAN,GAAsB,WAAN,IAC1C,IAAtB,EAAE,SAAS,SAAc,EAAE,SAAW,CAAC,OAAQ,OAAQ,YAH/B,EAAE,SAAW,CAAC,OAAQ,OAAQ,UAKzD,MAAM,QAAQ,EAAE,oBAAmB,EAAE,iBAAmB,IACxD,MAAM,QAAQ,EAAE,WAAU,EAAE,QAAU,GAC/C,CA0BJ,GAtBA,EAAK,WAAa,EAAW,WAC7B,EAAK,mBAAqB,EAAW,mBACrC,EAAK,iBAAmB,EAAW,iBACnC,EAAK,cAA4C,MAA5B,EAAW,cAA6B,EAAW,cAAgB,IACxF,EAAK,iBAAkD,MAA/B,EAAW,kBAAgC,EAAW,iBAC9E,KAAK,WAAa,GACZ,EAAW,UAAc,EAAW,UACtC,KAAK,aAAe,IAAI,EAAM,QAAQ,EAAW,SAAU,EAAW,WAEtE,KAAK,aAAe,IAAI,EAAM,QAAQ,IAAM,KAEhD,KAAK,aAAa,EAAW,WAC7B,KAAK,gBAAkB,EAAW,gBAAkB,EAAW,gBAAgB,cAAgB,cAC/F,KAAK,aAAe,KAAK,IAAI,KAAQ,EAAW,aAAe,EAAW,aAAe,GACzF,KAAK,MAAQ,EAAW,MACxB,KAAK,qBAAqB,EAAW,oBAAqB,EAAW,mBACrE,KAAK,cAAgB,EAAW,cAChC,KAAK,iBAAmB,EAAW,iBAC/B,EAAW,cACX,KAAK,YAAc,IAAK,EAAW,cAEvC,KAAK,KAAO,KACN,EAAW,WACb,KAAK,WAAa,EAAW,eAC1B,CACH,MAAM,EAAoB,GAC1B,EAAkB,aAAgB,EAAW,aAGzC,EAAW,aAH6C,CAAC,EAAM,KAC/D,EAAK,SAAS,aACd,EAAK,SAAS,KAAO,EAAM,YAE/B,EAAkB,eAAkB,EAAW,eAG3C,EAAW,eAHiD,CAAC,EAAQ,KACrE,EAAO,SAAS,KAAO,KAAK,IAAI,EAAgB,KAChD,EAAO,SAAS,oBAEpB,EAAkB,MAAQ,KAAK,MAC/B,EAAkB,SAAW,EAAW,SACxC,EAAkB,YAAc,EAAW,YAC3C,EAAkB,WAAa,EAAW,WAC1C,EAAK,WAAa,IAAI,GAAW,GACjC,MAAM,EAAS,KAAK,OACpB,KAAK,OAAU,IACX,EAAO,KAAK,EAAM,GAClB,EAAK,WAAW,SAExB,CACA,KAAK,mBAAqB,EAAW,iBAErC,KAAK,yBAA6B,EAAW,yBAA2B,EAAW,yBAA2B,EAC9G,KAAK,iBAAmB,OAAO,UAC/B,KAAK,qBAAuB,EAGN,KAAK,iBAAoB,QAAgC,IAAX,EAAW,iBAAoC,EAAW,iBAAmB,EAC3H,KAAK,iBAAoB,YAAqB,EAAW,iBAAoC,EAAW,iBAAmB,EAC3H,KAAK,eAAkB,YAAqB,EAAW,eAAkC,EAAW,eAAiB,EAE3I,MAAM,EAAO,YAAqB,EAAW,eAAkC,EAAW,eAAiB,CAAC,EAAK,GAwCjH,GAvCA,KAAK,eAAiB,MAAM,QAAQ,GAAO,CAAC,OAAO,EAAI,IAAM,GAAM,OAAO,EAAI,IAAM,IAAQ,CAAC,OAAO,EAAI,MAAQ,GAAM,OAAO,EAAI,MAAQ,IAEzI,KAAK,SAAW,EAAW,SAC3B,KAAK,aAAe,EAAW,aAC/B,KAAK,gBAAkB,EAAW,gBAClC,KAAK,aAAe,EAAW,aAC/B,KAAK,WAAa,EAAW,WAC7B,KAAK,wBAA0B,EAAW,wBAC1C,KAAK,OAAS,EAAW,OACrB,KAAK,0BACL,KAAK,MAAQ,IAAI,EAAM,MACvB,KAAK,MAAM,OAAuB,SAAhB,KAAK,UACvB,KAAK,QAAU,EAAM,UAAU,MAAqB,IAAf,EAAK,MAAM,EAAS,EAAG,MAAQ,GAAK,EAAM,UAAU,MAAqB,IAAf,EAAK,MAAM,EAAS,EAAG,MAAQ,EAAI,EAAM,UAAU,MAAqB,IAAf,EAAK,MAAM,EAAS,EAAG,MAE/K,KAAK,SACL,KAAK,oBACL,KAAK,0BAIT,KAAK,cAAgB,GACrB,KAAK,YAAc,GACnB,KAAK,YACL,KAAK,OACL,KAAK,SACL,KAAK,eACL,KAAK,eACL,KAAK,KACL,KAAK,sBACL,KAAK,MAAQ,EAAW,MAAQ,EAAW,MAAQ,EACnD,KAAK,eAAiB,EACtB,KAAK,uBAAyB,EAC9B,KAAK,YAAc,EAAW,YAC9B,KAAK,gBAAkB,IAAI,gBAE3B,KAAK,eAAiB,EAAW,eAI3B,EAAW,KAEb,EAAK,OAAO,WAGL,EAAW,IAAK,CACvB,IAAI,EAAM,EAAW,IACrB,GAAI,EAAK,YAAa,CAClB,IAAI,EAAQ,GACZ,QAAS,KAAO,EAAK,YACb,EAAK,YAAY,eAAe,KAChC,GAAS,IAAM,EAAM,IAAM,EAAK,YAAY,IAGhD,EAAI,SAAS,KACb,GAAO,EAEP,GAAO,IAAM,EAAM,UAAU,EAErC,EAII,EAAK,MACW,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EACN,OAAQ,EAAK,gBAAgB,SAKzB,IACL,MAAM,EAAK,CAAE,OAAQ,EAAK,gBAAgB,YAGzC,MAAK,IACjB,IAAK,EAAO,GACR,MAAM,IAAI,MAAM,kBAAkB,EAAW,oCAAoC,EAAO,YAAY,EAAO,cAE/G,EAAO,OAAO,MAAK,GAAiB,GAAiB,EAAM,KAAQ,MAAK,IACpE,EAAK,OAAO,CAAE,SAAU,WAAa,EAAW,KAAM,KAAM,GAAO,GACrE,IACH,OAAM,IAAW,EAAK,eAAe,GAAW,KACvD,CACJ,CAOA,YAAA,CAAa,GACT,GAAI,aAAqB,IAAO,aAAqB,EAAM,OACvD,KAAK,UAAY,UAEZ,aAAqB,EAAM,KAAM,CACtC,MAAM,EAAS,IAAI,EAAM,QACnB,EAAW,IAAI,EAAM,QAE3B,EAAU,UAAU,GACpB,EAAU,QAAQ,GAAU,eAAe,IAG3C,KAAK,UAAY,IAAI,GAAI,CACrB,EAAO,EAAG,EAAO,EAAG,EAAO,EAC3B,EAAS,EAAG,EAAG,EACf,EAAG,EAAS,EAAG,EACf,EAAG,EAAG,EAAS,GAEvB,MAEI,SAEA,KAAK,eACL,KAAK,cAAc,SAAQ,IACvB,EAAG,cAAc,KAAK,UAAU,GAI5C,CAEA,aAAA,CAAc,GACV,KAAK,UAAY,EACb,KAAK,eACL,KAAK,cAAc,SAAQ,IACvB,EAAG,cAAc,KAAK,UAAU,GAG5C,CAKA,uBAAA,CAAwB,GACpB,KAAK,qBAAuB,EACxB,KAAK,YACL,KAAK,WAAW,wBAAwB,KAAK,qBAErD,CAKA,mBAAA,CAAoB,GAChB,KAAK,iBAAmB,EACpB,KAAK,YACL,KAAK,WAAW,oBAAoB,KAAK,iBAEjD,CAMA,kBAAA,CAAmB,GACf,KAAK,gBAAkB,EACnB,KAAK,YACL,KAAK,WAAW,aAAa,KAAK,gBAE1C,CAMA,mBAAA,CAAoB,GAChB,KAAK,iBAAmB,EACpB,KAAK,YAAY,KAAK,WAAW,oBAAoB,EAC7D,CAEA,gBAAA,CAAiB,GACb,KAAK,cAAgB,EACjB,KAAK,YAAY,KAAK,WAAW,WAAW,EACpD,CAMA,mBAAA,CAAoB,GAChB,KAAK,iBAAmB,EACpB,KAAK,YAAuD,mBAAlC,KAAK,WAAW,eAC1C,KAAK,WAAW,cAAc,EAEtC,CAMA,mBAAA,CAAoB,GAChB,KAAK,iBAAmB,EACpB,KAAK,YAAuD,mBAAlC,KAAK,WAAW,eAC1C,KAAK,WAAW,cAAc,EAEtC,CAMA,iBAAA,CAAkB,GACd,KAAK,eAAiB,EAClB,KAAK,YAAqD,mBAAhC,KAAK,WAAW,aAC1C,KAAK,WAAW,YAAY,EAEpC,CAOA,iBAAA,CAAkB,EAAmB,GACjC,KAAK,eAAiB,CAAC,EAAmB,GACtC,KAAK,YAAqD,mBAAhC,KAAK,WAAW,aAC1C,KAAK,WAAW,YAAY,EAAmB,EAEvD,CAMA,cAAA,GACI,KAAK,eACD,KAAK,YAAY,KAAK,WAAW,eACjC,KAAK,SACL,KAAK,UAAS,IACN,EAAE,aACF,EAAE,yBACN,IAEA,KAAK,aAAY,KAAK,WAAW,2BAEzC,KAAK,sBAED,KAAK,SACL,KAAK,UAAS,IACN,EAAE,aAAY,EAAE,yBAA6B,IAEjD,KAAK,aAAY,KAAK,WAAW,0BAE7C,CAQA,aAAA,CAAc,EAAO,GACjB,KAAK,aAAa,IAAI,EAAO,EACjC,CAEA,YAAA,CAAa,GACT,MAAM,EAAO,KA2Cb,GAxCI,EAAW,KAAK,qBACZ,EAAW,KAAK,mBAAmB,SAAS,4BAA8B,EAAW,KAAK,mBAAmB,SAAS,iCACtH,EAAK,uBAGP,EAAW,KAAK,MAClB,EAAK,KAAO,EAAW,KAAK,KACvB,EAAK,KAAK,SAAQ,EAAK,KAAK,OAAS,EAAW,KAAK,QACrD,EAAK,KAAK,iBAAgB,EAAK,KAAK,eAAiB,EAAW,KAAK,gBACrE,EAAK,KAAK,YAAW,EAAK,KAAK,UAAY,EAAW,KAAK,WAC3D,EAAK,KAAK,iBAAgB,EAAK,KAAK,eAAiB,EAAW,KAAK,iBAE1E,EAAK,KAAO,EAAW,KAItB,EAAK,KAAK,WACP,EAAK,KAAK,YACV,EAAK,KAAK,eAAiB,EAAK,KAAK,cAErC,EAAK,KAAK,SAAW,IAG7B,EAAK,SAAa,EAAW,KAAK,SAAW,EAAW,KAAK,SAAW,EAAW,SAG7E,EAAK,KAAK,OACZ,EAAK,OAAS,EAAK,KAAK,OAExB,EAAK,OAAS,EAAW,aAGvB,EAAK,KAAK,eACZ,EAAK,eAAiB,EAAK,KAAK,eAEhC,EAAK,eAAiB,EAAW,qBAK/B,EAAK,KAAK,UAAW,CACvB,IAAI,EAAM,IAAI,EAAM,QACpB,EAAI,SAAW,EAAK,KAAK,UACzB,EAAK,aAAa,EAEtB,CAUA,GAAM,EAAK,KAAK,eACZ,GAAM,EAAK,KAAK,eAAe,IAC3B,EAAK,eAAiB,IAAI,GAAI,EAAK,KAAK,eAAe,aAC9C,EAAK,KAAK,eAAe,OAAQ,CAC1C,MAAM,EAAS,EAAK,KAAK,eAAe,OACxC,EAAK,2BAA2B,EAAO,GAAI,EAAO,GAAI,EAAO,GAAI,IACjE,EAAK,2BAA2B,EAAO,GAAI,EAAO,GAAI,EAAO,GAAI,IACjE,GAAS,KAAK,GAAU,IACxB,EAAK,eAAiB,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,GAAS,EAAG,GAAS,EAAG,GAAS,GAAI,GAAS,WAAW,IACtH,SAAa,EAAK,KAAK,eAAe,OAAQ,CAC1C,MAAM,EAAS,EAAK,KAAK,eAAe,OACxC,EAAK,eAAiB,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,EAAO,GAAI,EAAO,GAAI,EAAO,IAAK,EAAO,GACtG,MACI,EAAK,eAAiB,EAAW,0BAGrC,EAAK,eAAiB,EAAW,qBAOrC,SAAS,EAAc,GACb,EAAE,KAAO,EAAE,IAAI,SAAS,SAEjB,EAAE,KAAO,EAAE,IAAI,SAAS,QADjC,EAAK,yBAIL,EAAK,gBAEb,CA2DA,GAzDM,EAAK,KAAK,SACZ,EAAc,EAAK,KAAK,SACG,GAAvB,EAAK,iBACL,EAAK,MAAQ,KAAK,IAAI,EAAG,EAAK,WAAa,EAAK,WAAW,MAAQ,IAAO,IAE9E,EAAK,SAEI,EAAK,KAAK,WACnB,EAAK,KAAK,SAAS,SAAQ,GAAK,EAAc,KACnB,GAAvB,EAAK,iBACL,EAAK,MAAQ,KAAK,IAAI,EAAG,EAAK,WAAa,EAAK,WAAW,MAAQ,IAAO,KAO5E,EAAK,cACP,GAAS,KAAK,EAAK,eAAe,QAG5B,KAAK,KAAK,eAAe,SAC3B,KAAK,2BAC2E,IAA3E,KAAK,KAAK,eAAe,OAAO,GAAK,KAAK,KAAK,eAAe,OAAO,IACM,IAA3E,KAAK,KAAK,eAAe,OAAO,GAAK,KAAK,KAAK,eAAe,OAAO,IACM,IAA3E,KAAK,KAAK,eAAe,OAAO,GAAK,KAAK,KAAK,eAAe,OAAO,IACtE,IAEJ,GAAe,mBAAmB,GAAS,YAAa,GAAS,aACjE,EAAK,gBAAgB,KAEzB,GAAS,aAAa,EAAK,QAC3B,EAAK,SAAS,IAAI,IAElB,EAAK,kBAGL,EAAK,gBACL,EAAK,eAAe,IAEnB,EAAK,YAAc,EAAK,SAAW,EAAK,QAAQ,MACjD,EAAK,QAAQ,YAAc,EAAK,QAAQ,IAAI,UAAU,CAClD,OAAQ,EACR,KAAM,EAAK,QAAQ,KACnB,KAAM,EAAK,QAAQ,KACnB,SAAU,EAAK,SACf,SAAU,EAAK,WACf,SAAU,EAAK,QAAQ,SACvB,gBAAiB,EAAK,QAAQ,mBAMtC,EAAK,WAGD,EAAK,MAAQ,GAAK,EAAK,mBAIvB,GAHI,EAAK,MACL,QAAQ,IAAI,gBAEZ,KAAK,eAAe,KAAM,CAC1B,IAAI,EAAM,KAAK,eAAe,KAAK,QACnC,EAAI,aAAa,KAAK,aACtB,EAAK,KAAO,IAAI,EAAM,WAAW,EAAK,IAAI,EAAM,MAAM,KAAK,SAAU,KAAK,SAAU,KAAK,WAEzF,EAAK,IAAI,EAAK,MACd,EAAK,KAAK,SAAS,UACvB,MAAW,EAAK,0BAA0B,KACtC,EAAK,KAAO,EAAK,eAAe,SAChC,EAAK,IAAI,EAAK,MACd,EAAK,KAAK,SAAS,WAI/B,CACA,YAAA,CAAa,EAAM,GAEV,EAAK,SAAS,OACf,GAAQ,KAGZ,IACI,MAAM,EAAU,IAAI,IAAI,GACxB,IAAI,EAAY,EAAQ,SAAS,MAAM,KAAK,QAAO,GAAW,KAAN,IACpD,EAAgB,EAAS,MAAM,KAAK,QAAO,GAAW,KAAN,IAEpD,QAAS,EAAI,EAAG,GAAK,EAAU,UACvB,GAAK,EAAc,QADY,IAInC,GAFkB,EAAU,MAAM,EAAU,OAAS,EAAG,EAAU,QAAQ,KAAK,OACzD,EAAc,MAAM,EAAG,GAAG,KAAK,KACpB,CAC7B,QAAS,EAAI,EAAG,EAAI,EAAG,IACnB,EAAU,MAEd,KACJ,CAGJ,KAAO,EAAc,OAAS,GAA0B,OAArB,EAAc,IAC7C,EAAU,MACV,EAAc,QAGlB,MAAO,GAAG,EAAQ,aAAa,EAAQ,QAAQ,IAAI,KAAc,GAAe,KAAK,MACzF,OAGI,OAAK,EAAK,SAAS,MAAS,EAAS,WAAW,KAGrC,EAAO,EAFP,EAAO,IAAM,CAI5B,CACJ,CAEA,mBAAA,CAAoB,EAAK,GACrB,IACI,MAAM,EAAS,IAAI,IAAI,GAGvB,QAAU,EAAK,KAAU,EAAO,aAC5B,EAAO,GAAO,EAKlB,OADA,EAAO,OAAS,GACT,EAAO,UAClB,OAEI,OAAO,CACX,CACJ,CACA,WAAA,CAAY,KAAiB,MAEzB,IAAI,EAAO,KACX,IAAI,EAAK,UAAW,EACpB,GAAM,EAAK,KAAK,cACN,EAAY,EAAK,KAAK,QAAS,KAAM,EAAU,WAC5C,EAAK,KAAK,SAAU,CAC7B,IAAI,EAAW,EAAK,KAAK,SAAS,MAAK,EAAS,IAAU,EAAY,EAAS,EAAO,EAAU,KAEhG,QAAQ,IAAI,EAEhB,CAEA,eAAe,EAAY,EAAS,EAAc,EAAU,GACxD,IAAI,EACE,EAAQ,IACV,EAAM,EAAQ,IACL,EAAQ,MACjB,EAAM,EAAQ,KAElB,MAAM,EAAW,sCAajB,GAXI,EAAS,KAAK,EAAK,UAEd,EAAS,KAAK,KACf,EAAM,EAAK,aAAa,EAAK,SAAU,IAG3C,EAAM,EAAK,SAAW,OAAW,EAEhC,EAAI,WAAW,kBAChB,EAAM,EAAK,oBAAoB,EAAK,EAAK,cAEzC,EAAK,YAAa,CAClB,IAAI,EAAQ,GACZ,QAAS,KAAO,EAAK,YACb,EAAK,YAAY,eAAe,KAChC,GAAS,IAAM,EAAM,IAAM,EAAK,YAAY,IAGhD,EAAI,SAAS,KACb,GAAO,EAEP,GAAO,IAAM,EAAM,UAAU,EAErC,CAEA,GAAM,EAEF,GADA,EAAK,WAAW,KAAK,GACjB,IAAa,EAAI,SAAS,UAAY,EAAI,SAAS,SAAW,EAAI,SAAS,UAE3E,IAEI,EAAK,WAAW,IAAI,EAAK,gBAAiB,EAAK,KAAM,GAAK,IAEtD,IAAM,EAAK,QAAX,CAkBA,GAbI,EAAK,OAAS,EAAK,MAAM,YACzB,EAAK,MAAM,UAAU,MAAM,KAAK,SAAQ,IAC9B,GAAU,GACZ,GAAU,KAEV,GAAU,GAAK,CACnB,IAEA,EAAK,kBACL,MAIJ,EAAK,aAAc,CACnB,IAAK,EAAK,WAAY,CAmBlB,GAhBA,EAAK,WAAa,IAAI,GAAW,EAAK,WAAW,qBAAU,EAAsB,EAAK,mBAAqB,IAAO,GAClH,EAAK,WAAW,WAAW,EAAK,eAChC,EAAK,WAAW,oBAAoB,EAAK,kBACzC,EAAK,WAAW,oBAAoB,EAAK,kBACzC,EAAK,WAAW,wBAAwB,EAAK,+BAGlC,EAAK,kBAA6E,mBAAlC,EAAK,WAAW,eACvE,EAAK,WAAW,cAAc,EAAK,2BAE5B,EAAK,kBAA6E,mBAAlC,EAAK,WAAW,eACvE,EAAK,WAAW,cAAc,EAAK,2BAE5B,EAAK,gBAAyE,mBAAhC,EAAK,WAAW,aACrE,EAAK,WAAW,YAAY,EAAK,yBAE1B,EAAK,gBAAyE,mBAAhC,EAAK,WAAW,YAA4B,CACjG,MAAM,EAAK,EAAK,gBAAkB,CAAC,EAAK,GACxC,EAAK,WAAW,YAAY,EAAG,GAAI,EAAG,GAC1C,CAEI,EAAK,SACL,EAAK,WAAW,oBAChB,EAAK,WAAW,0BAEpB,EAAK,IAAI,EAAK,YACd,EAAK,gBACT,CACA,EAAO,EAAK,WAAW,cAAc,EAAK,UAAW,EAAK,OAAQ,EAAK,KAAM,EAAK,KAGtF,CA+BA,OA7BK,EAAK,gBAGN,EAAK,UAAU,IAMX,IALI,EAAE,QAAU,EAAE,WACd,EAAE,OAAO,QAAQ,GAIjB,EAAE,QAEE,EAAK,wBAAyB,CAC9B,MAAM,EAAW,EAAE,SAAS,WAAW,SACjC,EAAS,GACf,QAAS,EAAI,EAAG,EAAI,EAAS,MAAO,IAChC,EAAO,KAAK,EAAK,MAAM,EAAG,EAAK,MAAM,EAAG,EAAK,MAAM,GAEvD,EAAE,SAAS,aAAa,QAAS,IAAI,EAAM,uBAAuB,EAAQ,GAC9E,CAGJ,IAEJ,EAAK,IAAI,GACT,EAAK,kBAIT,EAAK,YAAY,KAAK,GACf,CAlFP,CAkFW,GAEX,EAAK,aAAyB,IAKF,aAAxB,EAAK,gBACE,EAAK,2BAA2B,EAAK,cAEpB,eAAxB,EAAK,gBAED,EAAK,WACE,EAAK,WAAW,2BAA2B,EAAK,cAAgB,KAAK,IAAI,EAAG,EAAK,WAAW,OAE5F,EAAK,2BAA2B,EAAK,cAAgB,KAAK,IAAI,EAAG,EAAK,OASzD,YAAxB,EAAK,gBACD,EAAK,WACE,EAAK,MAAQ,EAAK,WAAW,2BAA2B,EAAK,cAE7D,EAAK,MAAQ,EAAK,2BAA2B,EAAK,cAG1D,EA7Ba,IAAM,OAsCrB,EAAK,gBACV,EAAK,MACL,EAAK,iBACH,EAAK,KAAK,eAAe,SACzB,EAAK,KAAK,eAAe,OAC3B,EAAK,eACL,EAAK,mBAEb,OAAS,GACD,EAAK,eAAe,GAAW,EACvC,MAGO,GAAY,EAAI,SAAS,WAChC,EAAK,cAAgB,EACrB,EAAK,WAAW,IAAI,EAAK,gBAAiB,EAAK,KAAM,SAAK,IACtD,EAAK,gBAGL,EAAK,SAAW,WAAa,GAC7B,EAAK,KAAK,SAAS,KAAK,GACJ,MAAhB,SACO,EAAK,KAAK,QAEV,EAAK,KAAK,SAAS,OAAO,EAAc,GAGnD,EAAK,wBAAwB,IAoB7C,CACJ,CAKA,OAAA,GACI,MAAM,EAAO,KAEb,GAAI,EAAK,SAAW,EAAK,QAAQ,MACzB,EAAK,eACL,EAAK,QAAQ,IAAI,eAAe,CAAE,WAAY,EAAK,eACnD,EAAK,qBAEL,MAAM,QAAQ,EAAK,gBAAkB,EAAK,cAAc,QAAQ,CAChE,UAAW,KAAS,EAAK,cACrB,EAAK,QAAQ,IAAI,eAAe,CAAE,WAAY,IAElD,EAAK,cAAgB,EACzB,CAGJ,EAAK,YAAY,SAAQ,IACf,GAAQ,EAAG,OAAS,EAAG,MAAM,YAC/B,EAAG,MAAM,UAAU,MAAM,KAAK,SAAQ,IAC5B,GAAU,IACZ,GAAU,IACd,IAEA,EAAK,kBACL,KAER,IAKJ,EAAK,cAAc,SAAQ,GAAQ,EAAK,YACxC,EAAK,WAED,EAAK,aAEL,EAAK,YAAY,SAAQ,GAAS,EAAM,SACnC,EAAK,aACN,EAAK,WAAW,UAChB,EAAK,oBAGP,EAAK,aACP,EAAK,WAAW,SAAQ,IACpB,EAAK,WAAW,WAAW,EAAK,EAAK,KAAK,IAE9C,EAAK,WAAa,IAGhB,EAAK,kBAAoB,EAAK,eAChC,EAAK,gBAAgB,MAAM,mBAE/B,KAAK,OAAS,KACd,EAAK,YAAc,GACf,EAAK,MAAM,EAAK,KAAK,UAEzB,KAAK,cAAc,CAAE,KAAM,WAC/B,CACA,mBAAA,GACI,MAAM,EAAO,KACb,IAAM,EAAK,QAAX,CACA,EAAK,WACC,EAAK,kBACP,EAAK,gBAAgB,MAAM,mBAC3B,EAAK,gBAAkB,IAAI,iBAE/B,QAAS,EAAI,EAAK,YAAY,OAAS,EAAG,GAAK,EAAG,IAAK,CACnD,MAAM,EAAK,EAAK,YAAY,GACtB,GAAQ,EAAG,OAAS,EAAG,MAAM,YAC/B,EAAG,MAAM,UAAU,MAAM,KAAK,SAAQ,IAC5B,GAAU,IACZ,GAAU,IACd,IAEA,EAAK,kBACL,MAIR,EAAK,OAAO,EAChB,CACI,EAAK,YACL,EAAK,YAAY,SAAQ,GAAS,EAAM,SAE5C,EAAK,YAAc,GACnB,EAAK,WAAW,SAAQ,IAEpB,EAAK,WAAW,WAAW,EAAK,EAAK,KAAK,IAE9C,EAAK,WAAa,EA7BE,CA+BxB,CACA,gBAAA,GACI,IAAI,EAAO,KAEX,EAAK,cAAc,SAAQ,IACvB,EAAK,UACL,EAAK,OAAO,EAAI,IAEpB,EAAK,cAAgB,EAOzB,CAEA,OAAA,CAAQ,EAAW,GAEf,GAAK,KAAK,WAEH,CACH,GAAQ,KAAK,EAAU,KACvB,GAAa,KAAK,KAAK,aAAa,SACpC,GAAQ,aAAa,IACrB,IAAI,KACJ,GAAI,KAAK,0BAA0B,GAC/B,EAAe,KAAK,eAAe,cAAc,QAC9C,MAAI,KAAK,0BAA0B,EAAM,QAI5C,SAFA,EAAe,IAAI,iBAAiB,KAAK,eAI7C,CAcA,OAbI,GAAgB,KAAK,oBAAwB,KAAK,cAClD,GAAe,OAAS,EACxB,KAAK,YAAY,SAAQ,IACjB,EAAG,gBACH,EAAG,QAAQ,GAAS,GAAgB,EAAU,OAAO,OAAO,WAC5D,GAAe,SAAQ,IACnB,EAAE,MAAM,aAAa,KAAK,YAAY,IAEtC,EAAW,QAAQ,IAC3B,KAID,CACX,CA7BI,OAAO,MAAM,QAAQ,EAAW,EA8BxC,CAOA,MAAA,CAAO,GACC,KAAK,YACL,KAAK,WAAW,mBAAmB,EAAQ,KAAK,UAEpD,MAAM,EAAU,IAAI,EAAM,QAC1B,EAAQ,yBAAwB,IAAI,EAAM,SAAU,iBAAiB,EAAO,iBAAkB,EAAO,qBAIrG,IAAI,EAAW,CAAC,GACZ,EAAmB,CAAC,GACpB,EAAS,CAAC,GACV,EAAmB,CAAC,GAgBxB,GAfmB,WAAf,KAAK,QAEI,cADD,KAAK,iBACS,KAAK,iBAAiB,EAAQ,GAAU,KAAK,gBAAgB,EAAQ,EAAU,EAAkB,KAIvH,KAAK,QAAQ,EAAQ,GACrB,KAAK,OAAO,EAAQ,EAAU,EAAkB,IAGhD,EAAW,IACX,EAAiB,IAAM,EAAS,IAIhC,KAAK,WAKL,GAJA,GAA0B,KAAK,EAAO,UACtC,GAAa,KAAK,KAAK,aAAa,SACpC,GAA0B,aAAa,IAEnC,KAAK,iBAAkB,CACvB,MAAM,GAAgB,IAAI,EAAM,SAC3B,iBAAiB,EAAO,iBAAkB,EAAO,oBACjD,SAAS,KAAK,aACnB,KAAK,WAAW,KAAK,GAA2B,EACpD,MACI,KAAK,WAAW,KAAK,IAU7B,OAJI,KAAK,YACL,KAAK,WAAW,SAGb,CAAE,eAAgB,EAAS,GAAI,iBAAkB,EAAiB,GAAI,OAAQ,EAAO,GAAI,iBAAkB,EAAiB,GACvI,CAEA,gBAAA,CAAiB,EAAQ,GACrB,KAAK,wBAAwB,EAAQ,GACrC,KAAK,iCACL,KAAK,qBAAqB,GAC1B,KAAK,gBAAkB,KAAK,OAAS,KAAa,KAAK,gBACvD,KAAK,kCACL,KAAK,qBACL,KAAK,oBAGT,CAGA,eAAA,CAAgB,EAAQ,EAAU,EAAkB,GAChD,EAAO,GAAK,KAAK,IAAI,EAAO,GAAI,KAAK,QACjC,KAAK,iBAAqB,KAAK,sBAC/B,EAAS,KACH,KAAK,oBAAoB,EAAiB,MAE9C,KAAK,oBAAoB,EAAiB,KAGhD,KAAK,cAAc,SAAQ,IACvB,EAAM,gBAAgB,EAAQ,EAAU,EAAkB,EAAiB,GAEnF,CACA,MAAA,CAAO,EAAQ,EAAU,EAAkB,GACvC,EAAO,GAAK,KAAK,IAAI,EAAO,GAAI,KAAK,OACjC,KAAK,iBACL,EAAS,KACL,KAAK,YAAY,QAAU,KAAK,gBAAgB,EAAiB,KAC/D,KAAK,oBAAoB,EAAiB,MAIpD,KAAK,cAAc,SAAQ,IACvB,EAAM,OAAO,EAAQ,EAAU,EAAkB,EAAiB,GAE1E,CAIA,kBAAA,GACI,MAAM,EAAO,KACb,GAAmB,MAAf,EAAK,OAET,GAAI,EAAK,gBAAoB,EAAK,iBAAmB,EAAK,mBAAsB,CAC5E,GAAI,EAAK,aAAe,EAAK,YACzB,OAEJ,EAAK,kBACT,MACI,EAAK,cAAc,SAAQ,IACvB,EAAM,oBAAoB,GAItC,CACA,8BAAA,CAA+B,MAG3B,MAAM,EAAO,KACb,GAAK,EAAK,eAOV,GAAI,EAAK,gBACD,EAAK,YAAY,QAAU,EAAK,eAC3B,EAAK,mBAON,EAAK,cAAc,SAAQ,IACvB,EAAM,kCAAoC,KAN9C,EAAK,6BACL,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,KAShE,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,QAG7D,CACH,IAAK,EAAK,iBAAmB,EAAK,OAAS,EAMvC,OALA,EAAK,6BACD,EAAK,YAAY,OAAS,GAAG,EAAK,2BACtC,EAAK,cAAc,SAAQ,IACvB,EAAM,kCAAoC,IAKlD,IAAI,EAAK,oBAAwB,EAAK,aAAgB,EAAK,YAkCvD,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,YAjCxD,EACA,EAAK,6BACD,EAAK,YAAY,OAAS,GAAG,EAAK,sBACtC,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,QAEzD,CACH,IAAI,KACJ,EAAK,cAAc,OAAM,KAEhB,EAAM,sBACP,MAAmB,KAKvB,GAAoB,EAAK,cAAc,OAAS,GAChD,EAAK,6BACD,EAAK,YAAY,OAAS,GAAG,EAAK,sBACtC,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,KAI5D,EAAK,cAAc,SAAQ,IACvB,EAAM,gCAAiC,EAAK,cAAgB,EAAK,YAAa,GAG1F,CAQR,MAzEI,EAAK,cAAc,SAAQ,IACvB,EAAM,+BAA+B,EAAmB,GA4EpE,CACA,+BAAA,GACI,MAAM,EAAO,KACR,EAAK,eASc,MAAf,EAAK,OACV,EAAK,mBAEA,EAAK,OAAS,GACnB,EAAK,kBAAoB,EAAK,gBAC9B,EAAK,cAAc,SAAQ,IACvB,EAAM,iCAAiC,KAGtC,EAAK,OAAS,EAAK,yBAA2B,EAAK,eACpD,EAAK,yBAIC,EAAK,MAAU,EAAK,KAAK,UAAY,EAAK,KAAK,SAAS,OAAS,GACnE,EAAK,mBACL,EAAK,cAAc,SAAQ,IACvB,EAAM,mBACN,EAAM,iCAAiC,KAI3C,EAAK,oBAOb,EAAK,cAAc,SAAQ,IACvB,EAAM,iCAAiC,KArC3C,EAAK,cAAc,SAAQ,IACvB,EAAM,mBACN,EAAM,iCAAiC,IAE3C,EAAK,mBAoCb,CAEA,+BAAA,GACiB,KACR,mBADQ,KAER,cAAc,SAAQ,IACvB,EAAM,iCAAiC,GAE/C,CACA,kBAAA,GACI,MAAM,EAAO,KACR,EAAK,gBAMN,EAAK,gBACD,EAAK,YAAY,OAAS,EAAK,gBACL,GAA1B,EAAK,WAAW,SAEhB,EAAK,WAEL,EAAK,UAAM,IAXf,EAAK,cAAc,SAAQ,IACvB,EAAM,oBAAoB,GAkBtC,CAEA,uBAAA,CAAwB,EAAQ,GAC5B,MAAM,EAAO,KACb,EAAK,UACA,EAAK,UAEJ,EAAK,gBAAoB,EAAK,iBAChC,EAAK,OAAS,EAAK,uBAAuB,EAAQ,IAEtD,EAAK,cAAc,SAAQ,GAAS,EAAM,wBAAwB,EAAQ,KAG9E,CAGA,oBAAA,CAAqB,GACjB,MAAM,EAAO,KAER,EAAK,yBACD,EAAK,eAMF,EAAK,yBAA2B,EAAK,iBAAmB,EAAK,wBAAwB,MAAM,EAAK,UAG5F,EAAK,QAAU,GAAK,EAAK,OAAS,EAAK,yBAA2B,EAAK,gBACrE,EAAK,MAAU,EAAK,KAAK,UAAY,EAAK,cAAc,OAAS,EAAK,KAAK,SAAS,QAEtF,EAAK,kBAAkB,GAXzB,EAAK,MAAU,EAAK,KAAK,UAAY,EAAK,cAAc,OAAS,EAAK,KAAK,SAAS,QACtF,EAAK,kBAAkB,IAiBnC,EAAK,cAAc,SAAQ,GAAS,EAAM,qBAAqB,IACnE,CAGA,OAAA,CAAQ,EAAQ,GACZ,MAAM,EAAO,KAEb,IAAK,EAAK,QAAS,OAMnB,MAAM,EAAyB,EAAK,mBAOT,IAMN,EAXf,EAAK,gBAAoB,EAAK,iBAChC,EAAK,OAAS,EAAK,uBAAuB,EAAQ,IAEtD,EAAK,cAAc,SAAQ,GAAS,EAAM,QAAQ,EAAQ,cAuB3B,GAG3B,GAAI,EAAS,EAGT,OAFA,EAAK,kBACL,EAAK,2BAA2B,EAAK,iBAMzC,GAHI,EAAK,aAGJ,EAAK,kBAGN,EAAK,YAAY,OAAS,EAAK,gBAQnC,IAAiC,GAA7B,EAAK,cAAc,OAEnB,YADA,EAAK,6BAKT,GAAI,GAAU,EAAK,yBAA2B,EAAK,eAE/C,EAAK,kCAAyB,GACvB,EAAS,EAAK,yBAA2B,EAAK,gBAElC,WAAf,EAAK,OAAqB,CAC1B,IAAI,KACJ,EAAK,cAAc,OAAM,KAEhB,EAAM,aACP,MAAmB,KAKvB,EACA,EAAK,6BAGL,EAAK,4BAEb,EAIR,CA5E0D,CAEpC,EAAK,SAMN,EALT,EAAK,QAOA,GAAK,EAAK,gBACnB,EAAK,yBAA2B,EAAK,iBAAmB,EAAK,wBAAwB,MAAM,EAAK,YAG/F,EAAK,gBAAmB,GAAU,EAAK,yBAA2B,EAAK,iBAAmB,EAAK,YAAY,OAAS,GAAK,EAAK,cACzH,EAAK,MAAU,EAAK,KAAK,UAAY,EAAK,cAAc,QAAU,EAAK,KAAK,SAAS,QACvF,EAAK,kBAAkB,GAblB,SA6EE,EAAQ,GACvB,GAAK,EAAK,eACV,KAAK,EAAK,UAGN,YAFA,EAAK,mBAIT,GAAI,EAAK,0BACJ,GACD,EAAK,gBACL,EAAK,YAAY,OAAS,GAC1B,EAAK,oBACL,EAAK,iCAEL,OAAI,EAAK,YAAc,EAAK,qBAAuB,EAAK,iBACpD,OAEJ,EAAK,mBAIT,GAAI,GAAU,EAAK,yBAA2B,EAAK,eAAgB,CAC/D,GAAI,EAAK,YAAc,EAAK,qBAAuB,EAAK,YACpD,OAEJ,EAAK,kBAGT,EAEJ,CA3GiB,CACP,EAAK,OAAQ,EA8G3B,CAEA,iBAAA,CAAkB,GACd,MAAM,EAAO,KACb,QAAS,EAAI,EAAK,KAAK,SAAS,OAAS,EAAG,GAAK,EAAG,IAC3C,EAAK,KAAK,SAAS,GAAG,MAAS,EAAK,KAAK,SAAS,GAAG,UAAa,EAAK,KAAK,SAAS,GAAG,aAAgB,EAAK,KAAK,SAAS,GAAG,SAAY,EAAK,KAAK,SAAS,GAAG,UACjK,EAAK,KAAK,SAAS,OAAO,EAAG,GAGrC,EAAK,KAAK,SAAS,SAAQ,IAEvB,IAAI,EAAY,IAAI,GAAU,CAC1B,WAAY,EACZ,YAAa,EAAK,YAClB,qBAAsB,EAAK,eAC3B,qBAAsB,EAAK,eAC3B,aAAc,EAAK,OACnB,KAAM,EACN,SAAU,EAAK,SACf,yBAA0B,EAAK,yBAC/B,gBAAiB,EAAK,gBACtB,MAAO,KAAK,MAAM,EAAK,OAAS,EAChC,WAAY,EAAK,WACjB,aAAc,EACd,wBAAyB,EAAK,wBAC9B,SAAU,EAAK,SACf,OAAQ,EAAK,OACb,eACA,cAAe,EAAK,cACpB,iBAAkB,EAAK,iBACvB,aAAc,EAAK,aACnB,gBAAiB,EAAK,gBACtB,mBAAoB,EAAK,mBACzB,WAAY,EAAK,WACjB,UAAW,EAAK,UAChB,mBAAoB,EAAK,mBACzB,QAAS,EAAK,UAElB,EAAK,cAAc,KAAK,GACxB,EAAK,IAAI,EAAU,IAGvB,EAAK,kBACT,CAEA,8BAAA,GACI,IAAI,KACJ,MAAM,EAAO,KAyBb,OAxBA,KAAK,cAAc,OAAM,IACrB,GAAI,EAAM,eAAgB,CACtB,GAAI,EAAM,cAAc,OAAS,EAE7B,OADA,MAAqB,EAGzB,GAAI,EAAM,OAAS,EACf,SAKG,GAHH,EAAM,sBAAwB,EAAK,YAAgB,EAAK,cAGjD,EAAK,wBAAwB,MAAM,EAAM,SAEhD,OADA,OAGR,UACS,EAAM,iCAEP,OADA,MAAqB,EAI7B,QAAW,IAER,CACX,CAMA,QAAA,GAGI,GAAmB,MAAf,KAAK,OACL,SAEJ,GAAI,KAAK,OAAS,EACd,SAGJ,GAAI,KAAK,uBACL,SAGJ,IAAK,KAAK,gBAA+C,GAA7B,KAAK,KAAK,SAAS,SAAgB,KAAK,uBAChE,SAGJ,IAAM,KAAK,gBAA6C,GAA3B,KAAK,YAAY,SAAiB,KAAK,mBAAsB,CACtF,GAAI,KAAK,SAAS,OAAS,EAAG,CAC1B,IAAI,KASJ,OARA,KAAK,cAAc,OAAM,KAChB,EAAM,aACP,MAAmB,KAMpB,CACX,CACI,QAGR,CAIA,OAAK,KAAK,kBAIN,KAAK,YAAY,OAAS,KAAK,mBAK/B,KAAK,kBAQb,CAEA,iBAAA,GAEI,GAAM,KAAK,qBAAwB,KAAK,iBAAmB,KAAK,OAAS,EACrE,SAYA,GAAI,KAAK,cAAc,OAAS,EAAG,CAC/B,IAAI,KAQJ,OAPA,KAAK,cAAc,OAAM,KAChB,EAAM,sBACP,MAAmB,KAKpB,CACX,CACI,QAcZ,CAGA,wBAAA,CAAyB,GACrB,MAAM,EAAO,KACb,GAAI,EAAK,oBAAsB,EAA/B,CAKA,GAJI,EAAK,OAEL,EAAK,KAAK,SAAS,QAAU,GAE7B,EAAK,WACD,GAAc,EAAK,qBAEnB,EAAK,YAAY,SAAQ,IACjB,GAAc,EAAG,cAIjB,EAAG,WACK,EAAK,qBACL,EAAK,eACT,KAMJ,EAAG,OACH,EAAK,eACT,IAGJ,EAAK,mBAAqB,OAE3B,CAuBH,GAtBI,EAAK,gBAAkB,EAAK,YAAY,OAAS,IAC7C,EACA,EAAK,YAAY,SAAQ,IACrB,EAAG,UAAU,KACL,EAAE,QAAU,EAAE,WACd,EAAE,OAAO,OAAO,EACpB,GACF,IAIN,EAAK,YAAY,SAAQ,IACrB,EAAG,UAAU,KACL,EAAE,QAAU,EAAE,WACd,EAAE,OAAO,QAAQ,EACrB,GACF,KAMV,EAAK,oBAAsB,EAC3B,OAEJ,EAAK,mBAAqB,CAC9B,CAEA,EAAK,iBA1DsC,CA+D/C,CAeA,OAAA,CAAQ,EAAU,EAAU,GAExB,IAAM,EAAkB,UACpB,MAAM,IAAI,UAAU,sEAExB,IAAM,EAAe,UACjB,MAAM,IAAI,UAAU,mEAExB,IAAM,EAAgB,UAAO,EAAqB,aAC9C,MAAM,IAAI,UAAU,2EAEpB,KAAK,SAAW,KAAK,QAAQ,KAAO,KAAK,QAAQ,aAIjD,KAAK,QAAQ,IAAI,QAAQ,CACrB,OAAQ,KAAK,QAAQ,YACrB,SAAU,EACV,SAAU,IAIV,IAAU,EAAM,OAAO,KAAK,SAC5B,KAAK,MAAM,KAAK,GAChB,KAAK,iBACL,KAAK,UAAS,IACN,EAAM,iBAAiB,EAAM,iBAAiB,OAK1D,KAAK,MAAM,KAAK,GAEZ,EAAS,aACT,KAAK,0BAA0B,GAE/B,KAAK,qBAAqB,GAG9B,KAAK,SAAS,KAAK,GACnB,KAAK,iBAEb,CACA,eAAA,GACI,MAAM,EAAO,KACb,IAAK,EAAK,UAAY,EAAK,QAAQ,IAAK,OAExC,MAAM,EAAO,EAAK,QAAQ,YACpB,EAAQ,KAAK,MAAM,EAAK,OAAS,GACjC,IAAc,EAAK,mBACnB,EAAmB,MAAM,QAAQ,EAAK,gBAAkB,EAAK,cAAc,OAAS,EAGpF,EAAQ,EAAK,SAAW,EAAK,QAAQ,WAA+C,iBAA3B,EAAK,QAAQ,UAA0B,EAAK,QAAQ,UAAY,KAGzH,EAAS,OAAO,SAAS,GAAM,QAAU,EAAK,OAC7C,OAAO,SAAS,EAAK,QAAQ,QAAU,EAAK,QAAQ,OAAS,IAG9D,EAAiB,CAAC,EAAY,KAChC,MAAM,EAAO,MAAM,QAAQ,IAAa,EAAS,OAAS,EAAW,CAAC,OAAQ,OAAQ,UACtF,UAAW,KAAK,EAAM,GAAI,EAAW,SAAS,GAAI,OAAO,EACzD,OAAO,MAEL,EAAsB,KAExB,MAAM,EAAW,GAAM,UAAY,CAAC,OAAQ,OAAQ,UACpD,GAAI,GAAS,MAAM,QAAQ,EAAK,mBAAqB,EAAK,iBAAiB,OAAS,CAChF,MAAM,EAAK,EAAK,eAChB,GAAkB,iBAAP,EAAiB,CACxB,MAAM,EAAa,GACnB,UAAW,KAAK,EAAK,iBAAkB,CACnC,IAAK,IAAM,EAAE,MAAO,SACpB,MAAM,EAAwB,iBAAV,EAAE,IAAoB,EAAE,SACtC,EAAwB,iBAAV,EAAE,IAAoB,EAAE,IAAM,IAC9C,GAAM,GAAO,EAAK,GAAK,EAAW,KAAK,EAAE,MACjD,CACA,MAAM,EAAS,EAAe,EAAY,GAC1C,GAAI,EAAQ,OAAO,CACvB,CAEA,OAAI,EAAK,aAAqB,EAAK,aAC/B,EAAK,QAAQ,MAAc,EAAK,QAAQ,MACrC,MACX,CAAO,GAAI,GAAS,MAAM,QAAQ,EAAK,UAAY,EAAK,QAAQ,OAAS,CACrE,MAAM,EAAM,KAAK,MAAM,EAAK,OAAS,GAC/B,EAAa,GACnB,UAAW,KAAK,EAAK,QAAS,CAC1B,IAAK,IAAM,EAAE,MAAO,SACpB,MAAM,EAAwB,iBAAV,EAAE,IAAoB,EAAE,SACtC,EAAwB,iBAAV,EAAE,IAAoB,EAAE,IAAM,IAC9C,GAAO,GAAO,GAAO,GAAK,EAAW,KAAK,EAAE,MACpD,CAEA,OADe,EAAe,EAAY,KAEtC,EAAK,aAAqB,EAAK,aAC/B,EAAK,QAAQ,MAAc,EAAK,QAAQ,MACrC,OACX,CAEI,OAAO,EAAK,QAAQ,OAAS,QAG/B,EAAiB,IAGjB,EAAuB,KACrB,EAAK,eACL,EAAK,QAAQ,IAAI,eAAe,CAAE,WAAY,EAAK,eACnD,EAAK,sBAGP,EAAsB,KACxB,GAAI,MAAM,QAAQ,EAAK,gBAAkB,EAAK,cAAc,OAAQ,CAChE,UAAW,KAAS,EAAK,cACrB,EAAK,QAAQ,IAAI,eAAe,CAAE,WAAY,IAElD,EAAK,cAAgB,EACzB,GAEE,EAAY,KACd,IACA,IACA,EAAK,6BAWT,IAPK,IAAS,GAAqC,SAAnB,GAO5B,EAAQ,EAGR,OAFA,SACA,EAAK,6BAKT,MAAM,EAAmB,GAAa,GAAS,EAIzC,EAAY,EAAK,sBAAwB,OAE3C,IAAc,IADI,GAAa,IAAU,GAAU,IAEhC,SAAd,GAAsC,SAAd,GAA4C,WAAnB,EAE7B,WAAd,GAA8C,SAAnB,GAAgD,SAAnB,EAEzC,SAAd,GAA2C,SAAnB,GAA6C,SAAd,GAA2C,SAAnB,EAEvF,IAGA,IANA,IAFA,IAUJ,EAAK,qBAAwB,GAAqC,SAAnB,EAA6B,UAIhF,IAAI,EAAU,EACd,KAAO,GAAW,EAAQ,YAAY,EAAU,EAAQ,WACxD,MAAM,EAAQ,IAAI,EAAM,QAAW,EAAQ,IAAI,EAAM,WAAc,EAAQ,IAAI,EAAM,QACjF,GAAW,EAAQ,aAAa,EAAQ,YAAY,UAAU,EAAO,EAAO,GAChF,MAAM,GAAS,IAAI,EAAM,SAAU,QAAQ,EAAO,EAAO,IAAI,EAAM,QAAQ,EAAG,EAAG,IAC3E,GAAY,IAAI,EAAM,SAAU,KAAK,GAAQ,SAGnD,GAAuB,WAAnB,GAqFJ,GAAuB,SAAnB,GAAgD,SAAnB,EAK7B,GAFA,IAEI,EAAkB,CAElB,IAAM,EAAK,gBAAkB,EAAK,YAAY,SAAW,EAAK,eAAiB,OAG/E,IAAK,MAAM,QAAQ,EAAK,gBAAgD,IAA9B,EAAK,cAAc,OAAc,CACvE,EAAK,cAAgB,GACrB,MAAM,EAAmC,SAAnB,EAA6B,wBAA0B,wBAEvE,EAAmB,IACrB,KAAK,GAAY,EAAQ,QAAW,EAAQ,UAAa,EAAQ,SAAS,kBAAkB,OAG5F,MAAM,GAAI,IAAI,EAAM,SAAU,iBAAiB,EAAW,EAAQ,aAC5D,EAAK,IAAI,EAAM,QACf,EAAK,IAAI,EAAM,WACf,EAAQ,IAAI,EAAM,QACxB,EAAE,UAAU,EAAI,EAAI,GAGpB,MAAM,EAAS,IAAI,EAAM,QACzB,EAAQ,cAAc,GACtB,EAAO,IAAI,KAAK,IAAI,EAAO,GAAI,KAAK,IAAI,EAAO,GAAI,KAAK,IAAI,EAAO,IAEnE,EAAK,QAAQ,IAAI,GAAc,CAC3B,OAAQ,EACR,SAAU,EAAQ,SAClB,cAAe,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,GAC/B,cAAe,EACf,WAAY,CAAC,EAAO,EAAG,EAAO,EAAG,EAAO,KACzC,MAAM,IAEL,MAAM,EAAe,IACf,GAAiB,EAAK,UAA6B,SAAjB,GAA4C,SAAjB,GAC7D,EAAiB,KAAK,MAAM,EAAK,OAAS,IAAM,EAChD,EAA0B,KAAK,MAAM,EAAK,OAAS,KAAO,GAAW,MAAM,QAAQ,EAAK,gBAAkB,EAAK,cAAc,OAAS,EACzH,IAAkB,EAAK,mBAAqB,EAAiB,GAAkB,IAM9F,GAAO,EAAK,cAAc,KAAK,GACnC,EAAK,qBAAuB,GAJpB,GAAO,EAAK,QAAQ,IAAI,eAAe,CAAE,WAAY,GAInB,IAC3C,YAAM,KAIb,UAAW,KAAM,EAAK,YACb,IAAM,EAAG,gBACV,EAAG,QAAQ,EAAgB,GAC3B,EAAG,UAAU,EAAG,UAAS,IAAW,EAAE,QAAQ,EAAgB,EAAE,IAE5E,CACJ,MAEQ,IAAU,GAAU,IAGpB,IACA,EAAK,qCAnJb,IAEI,GAEA,IAAK,EAAK,aACN,GAAI,EAAK,0BAA0B,IAAO,EAAK,gBAAgB,MAAO,CAElE,MACM,EADc,EAAK,aAAa,EAAK,eAAe,OAAO,SAChC,QAAQ,aAAa,GAIhD,EADc,EAAK,aAAa,IAAI,EAAM,QAAQ,EAAG,EAAG,IAC/B,QAAQ,aAAa,GAG9C,EAAU,EAAK,eAAe,GAAG,QAAQ,eAAe,EAAK,eAAe,SAAS,GACrF,EAAU,EAAK,eAAe,GAAG,QAAQ,eAAe,EAAK,eAAe,SAAS,GACrF,EAAU,EAAK,eAAe,GAAG,QAAQ,eAAe,EAAK,eAAe,SAAS,GAGrF,EAAY,EAAK,aAAa,EAAQ,SAAS,aAAa,GAC5D,EAAY,EAAK,aAAa,EAAQ,SAAS,aAAa,GAC5D,EAAY,EAAK,aAAa,EAAQ,SAAS,aAAa,GAE5D,EAAS,EAAU,QAAQ,IAAI,GAC/B,EAAS,EAAU,QAAQ,IAAI,GAC/B,EAAS,EAAU,QAAQ,IAAI,GAE/B,EAAK,EAAO,SACZ,EAAK,EAAO,SACZ,EAAK,EAAO,SAEZ,EAAM,EAAK,EAAI,EAAO,QAAQ,eAAe,EAAI,GAAM,IAAI,EAAM,QAAQ,EAAG,EAAG,GAC/E,EAAM,EAAK,EAAI,EAAO,QAAQ,eAAe,EAAI,GAAM,IAAI,EAAM,QAAQ,EAAG,EAAG,GAC/E,EAAM,EAAK,EAAI,EAAO,QAAQ,eAAe,EAAI,GAAM,IAAI,EAAM,QAAQ,EAAG,EAAG,GAE/E,GAAW,IAAI,EAAM,SAAU,UAAU,EAAK,EAAK,GACnD,GAAY,IAAI,EAAM,YAAa,sBAAsB,GAE/D,EAAK,aAAe,EAAK,QAAQ,IAAI,oBAAoB,CACrD,OAAQ,EACR,MAAO,GAAc,UAAU,EAAI,EAAI,GACvC,cAAe,CAAC,EAAa,EAAG,EAAa,EAAG,EAAa,GAC7D,cAAe,IAEnB,EAAK,qBAAuB,QAChC,SAAW,EAAK,0BAA0B,EAAM,QAAU,EAAK,gBAAgB,SAAU,CACrF,MACM,EADc,EAAK,aAAa,EAAK,eAAe,OAAO,SAChC,QAAQ,aAAa,GAGhD,EADc,EAAK,aAAa,IAAI,EAAM,QAAQ,EAAG,EAAG,IAC/B,QAAQ,aAAa,GAG9C,EAAS,EAAK,aAAa,IAAI,EAAM,QAAQ,EAAG,EAAG,IAAI,aAAa,GAAW,IAAI,GAAY,SAC/F,EAAS,EAAK,aAAa,IAAI,EAAM,QAAQ,EAAG,EAAG,IAAI,aAAa,GAAW,IAAI,GAAY,SAC/F,EAAS,EAAK,aAAa,IAAI,EAAM,QAAQ,EAAG,EAAG,IAAI,aAAa,GAAW,IAAI,GAAY,SAE/F,EAAO,KAAK,IAAI,EAAQ,EAAQ,GAChC,EAAe,EAAK,eAAe,OAAS,EAElD,EAAK,aAAe,EAAK,QAAQ,IAAI,oBAAoB,CACrD,OAAQ,EACR,MAAO,GAAc,WAAW,GAChC,cAAe,CAAC,EAAa,EAAG,EAAa,EAAG,EAAa,KAEjE,EAAK,qBAAuB,QAChC,OAIA,IAAU,GAAU,IAIpB,IACA,EAAK,4BA2ErB,CACA,sBAAA,CAAuB,EAAQ,GAE3B,IAAI,EAAW,EACf,GAAI,KAAK,0BAA0B,GAAK,CAIpC,GAFA,GAAQ,KAAK,KAAK,gBAClB,GAAQ,aAAa,KAAK,cACrB,GAAQ,UAAU,GAAU,SACjC,GAAsB,MAAlB,KAAK,YACA,KAAK,UAAU,WAAa,GAAQ,iBAAiB,KAAK,YAC1D,KAAK,UAAU,QAAU,GAAQ,cAAc,KAAK,YAErD,OAAO,OAAO,UAKtB,EAAW,KAAK,IAAI,EAAG,GAAQ,gBAAgB,EAAO,UAAY,EAAO,KAQ7E,KAAO,MAAI,KAAK,0BAA0B,EAAM,QAgB5C,OADA,QAAQ,MAAM,wBAXd,GAFA,GAAW,KAAK,KAAK,gBACrB,GAAW,aAAa,KAAK,aACP,MAAlB,KAAK,YACA,KAAK,UAAU,QAAU,KAAK,UAAU,iBAAiB,KACzD,KAAK,UAAU,WAAa,KAAK,UAAU,iBAAiB,KAE7D,OAAO,OAAO,UAItB,IAAK,EAAQ,iBAAiB,IAAa,SAC3C,EAAW,KAAK,IAAI,EAAG,EAAO,SAAS,WAAW,GAAW,QAAU,GAAW,OAAS,EAAO,KAKtG,CAMA,GAJA,EAAW,KAAK,IAAI,EAAU,KAAK,cAInB,GAAZ,EACA,OAAO,EAEX,MAAM,EAAQ,KAAK,YAAY,oBACzB,KAAK,UACP,KAAK,SAAS,qBAAqB,KAAK,cAE5C,IAAI,EAAI,KAAK,aAAa,EACtB,EAAM,EAAO,IAOjB,OANI,EAAO,OAAS,IAChB,GAAO,EAAO,OACd,EAAI,KAAK,aAAa,GAGb,EAAM,KAAK,IAAI,GAAM,EAAM,qBAAsC,EACtE,IAAgB,EAAI,EAChC,CAEA,YAAA,GACI,MAAM,EAAO,KACP,EAAQ,GACd,IAAK,EAAK,WAAY,OAAO,EAC7B,IAAI,EAAI,EAAK,WACb,MAAQ,EAAE,gBAAoB,EAAE,YAC5B,EAAI,EAAE,WAUV,OARA,EAAE,cAAc,SAAQ,IACpB,GAAM,GAAS,GAAS,EAAM,CAC1B,MAAQ,EAAM,gBAAoB,EAAM,cAAc,IAClD,EAAQ,EAAM,cAAc,GAEhC,EAAM,KAAK,EACf,KAEG,CACX,CACA,0BAAA,CAA2B,GACvB,OAAI,KAAK,0BAA0B,IAE/B,GAAQ,KAAK,KAAK,gBAClB,GAAQ,aAAa,KAAK,aACnB,KAAK,IAAI,EAAG,GAAQ,gBAAgB,EAAO,YAE3C,KAAK,0BAA0B,EAAM,QAE5C,GAAW,KAAK,KAAK,gBACrB,GAAW,aAAa,KAAK,aACtB,KAAK,IAAI,EAAG,EAAO,SAAS,WAAW,GAAW,QAAU,GAAW,UAG9E,QAAQ,MAAM,wBAItB,CAUA,2BAAA,CAA4B,GACxB,KAAK,yBAA2B,EAEhC,KAAK,cAAc,SAAQ,GAAS,EAAM,4BAA4B,IAC1E,CAUA,eAAA,CAAgB,GACZ,KAAK,aAAe,EACpB,KAAK,cAAc,SAAQ,GAAS,EAAM,gBAAgB,IAC9D,CAEA,0BAAA,CAA2B,EAAK,EAAK,EAAG,GACpC,MAEM,EAFI,QAEK,KAAK,KAAK,EADf,iBAC0B,KAAK,IAAI,KAAK,IAAI,GAAM,IACtD,EAAS,KAAK,IAAI,GAClB,EAAS,KAAK,IAAI,GAClB,EAAS,KAAK,IAAI,GAElB,EAAO,EAAI,EACX,EAAI,EAAM,EAAS,EACnB,EAAI,EAAM,EAHD,KAAK,IAAI,GAIlB,GAAK,iBAAoB,EAAI,GAAK,EAExC,EAAK,IAAI,EAAG,EAAG,EACnB,CAGA,aAAA,GAoCK,MACD,GAAe,SAAS,cAAc,QACzB,MAAM,SAAW,QAC9B,GAAa,MAAM,OAAS,OAC5B,GAAa,MAAM,KAAO,OAC1B,GAAa,MAAM,MAAQ,QAC3B,GAAa,MAAM,WAAa,qFAChC,GAAa,MAAM,QAAU,OAC7B,GAAa,MAAM,gBAAkB,qBAGrC,SAAS,KAAK,YAAY,KAE9B,GAAa,MAAM,QAAU,CA/C7B,CACA,aAAA,GAiDK,MACD,GAAe,SAAS,cAAc,QACzB,MAAM,SAAW,QAC9B,GAAa,MAAM,OAAS,OAC5B,GAAa,MAAM,KAAO,OAC1B,GAAa,MAAM,MAAQ,QAC3B,GAAa,MAAM,WAAa,qFAChC,GAAa,MAAM,QAAU,OAC7B,GAAa,MAAM,gBAAkB,qBAGrC,SAAS,KAAK,YAAY,KAE9B,GAAa,MAAM,QAAU,CA5D7B,EAIJ,SAAS,GAAW,GAEhB,IAAI,EAAW,SAAS,cAAc,OAGtC,EAAS,YAAc,EAGvB,EAAS,MAAM,SAAW,QAC1B,EAAS,MAAM,IAAM,OACrB,EAAS,MAAM,KAAO,MACtB,EAAS,MAAM,UAAY,mBAC3B,EAAS,MAAM,QAAU,OACzB,EAAS,MAAM,gBAAkB,UACjC,EAAS,MAAM,MAAQ,UACvB,EAAS,MAAM,OAAS,OAGxB,SAAS,KAAK,YAAY,GAG1B,uBACI,EAAS,QACb,GAAG,IACP,CAkCA,SAAS,KAEA,MACD,GAAe,SAAS,cAAc,QACzB,MAAM,SAAW,QAC9B,GAAa,MAAM,OAAS,OAC5B,GAAa,MAAM,KAAO,OAC1B,GAAa,MAAM,MAAQ,QAC3B,GAAa,MAAM,WAAa,qFAChC,GAAa,MAAM,QAAU,OAC7B,GAAa,MAAM,gBAAkB,qBAGrC,SAAS,KAAK,YAAY,KAI9B,MAAM,EAAO,KACb,IAAI,EAAa,GACjB,EAAK,SAAQ,IACT,GAAc,EAAO,IAAI,IAE7B,EAAa,EAAW,MAAM,MAE9B,GAAa,YAAc,CAG/B,CCvyEA,MAAM,GAAa,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,EAAG,EAAG,GAAI,GAC1D,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GACnC,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GACnC,GAAW,IAAI,EAAM,QAAQ,EAAG,EAAG,GACnC,GAAe,IAAI,EAAM,QACzB,GAAiB,IAAI,EAAM,WAC3B,GAAa,IAAI,EAAM,QAE7B,MAAM,WAAsB,EAAM,SAqB9B,WAAA,CAAY,GACR,QACA,MAAM,EAAO,KA2Cb,GA1CI,EAAW,cACX,KAAK,YAAc,IAAK,EAAW,cAEvC,KAAK,KAAO,KACN,EAAW,WACb,KAAK,WAAa,EAAW,WAE7B,QAAQ,MAAM,mEAGlB,KAAK,OAAS,EAAW,OACzB,KAAK,gBAAkB,EAAW,gBAClC,KAAK,aAAe,EAAW,aAC/B,KAAK,WAAa,EAAW,WAC7B,KAAK,aAAe,KAAK,IAAI,KAAO,EAAW,aAAc,EAAW,aAAa,GAGrF,KAAK,cAAgB,GACrB,KAAK,aAAe,GACpB,KAAK,YAAc,IAAI,IAEvB,KAAK,OAAS,EAAW,OACrB,KAAK,SACL,KAAK,oBACL,KAAK,0BAET,KAAK,YACL,KAAK,WACL,KAAK,SACL,KAAK,eACL,KAAK,eACL,KAAK,KACL,KAAK,sBACL,KAAK,aACL,KAAK,MAAQ,EAAW,MAAQ,EAAW,MAAQ,EACnD,KAAK,eAAiB,EACtB,KAAK,uBAAyB,EAC9B,KAAK,YAAc,EAAW,YAE9B,KAAK,WACL,KAAK,gBAAkB,IAAI,gBAErB,EAAW,KACb,KAAK,SAAa,EAAW,KAAK,SAAW,EAAW,KAAK,SAAW,EAAW,SAC/E,EAAW,KAAK,WAAU,KAAK,aAAe,EAAW,KAAK,UAClE,EAAK,MAAM,WACJ,EAAW,IAAK,CAGvB,KAAK,SAAW,CAAC,EAAM,KAEnB,MAAM,EAAI,WAAa,GACvB,EAAK,MAAM,CAAE,SAAU,EAAG,KAAM,EAAM,eAAgB,EAAW,kBAKrE,IAAI,EAAM,EAAW,IACrB,GAAI,EAAK,YAAa,CAClB,IAAI,EAAQ,GACZ,QAAS,KAAO,EAAK,YACb,EAAK,YAAY,eAAe,KAChC,GAAS,IAAM,EAAM,IAAM,EAAK,YAAY,IAGhD,EAAI,SAAS,KACb,GAAO,EAEP,GAAO,IAAM,EAAM,UAAU,EAErC,CACA,EAAK,WAAW,IAAI,EAAK,gBAAiB,EAAK,EAAK,KAAM,EAC9D,CACJ,CAEA,WAAA,CAAY,GACR,MAAM,EAAO,KAEP,EAAW,KAAK,MAClB,EAAK,KAAO,EAAW,KAAK,MACvB,EAAK,KAAK,UAAY,EAAK,KAAK,cACjC,EAAK,KAAK,eAAiB,EAAK,KAAK,eAEzC,EAAK,aAAe,EAAK,KAAK,SACzB,EAAK,KAAK,aAAY,EAAK,KAAK,WAAa,EAAW,KAAK,YAC7D,EAAK,KAAK,iBAAgB,EAAK,KAAK,eAAiB,EAAW,KAAK,gBACrE,EAAK,KAAK,YAAW,EAAK,KAAK,UAAY,EAAW,KAAK,WAC3D,EAAK,KAAK,iBAAgB,EAAK,KAAK,eAAiB,EAAW,KAAK,kBAE1E,EAAK,KAAO,EAAW,MAClB,EAAK,KAAK,UAAY,EAAK,KAAK,cACjC,EAAK,KAAK,eAAiB,EAAK,KAAK,cACrC,EAAK,aAAe,EAAK,KAAK,WAItC,EAAK,SAAa,EAAW,KAAK,SAAW,EAAW,KAAK,SAAW,EAAW,SAG7E,EAAK,KAAK,WACZ,EAAK,WAAa,EAAK,KAAK,WAE5B,EAAK,WAAa,EAAW,iBAG3B,EAAK,KAAK,eACZ,EAAK,eAAiB,EAAK,KAAK,eAEhC,EAAK,eAAiB,EAAW,qBAGrC,IAAI,EAAM,IAAI,EAAM,QAoBpB,GAnBM,EAAK,KAAK,YAAc,EAAK,cAC/B,EAAI,SAAW,EAAK,KAAK,WAG7B,EAAK,aAAa,GAEZ,EAAK,YAAgB,EAAK,WAAW,SAEvC,EAAK,OAAO,YAAY,EAAK,WAAW,QAExC,EAAK,OAAO,UAAU,EAAK,SAAU,EAAK,WAAY,EAAK,QAI/D,EAAK,0BACL,EAAK,sBAAkB,GAIjB,EAAK,KAAK,eACZ,GAAM,EAAK,KAAK,eAAe,IAC3B,EAAK,eAAiB,IAAI,GAAI,EAAK,KAAK,eAAe,aAC9C,EAAK,KAAK,eAAe,OAAQ,CAC1C,MAAM,EAAS,EAAK,KAAK,eAAe,OACxC,EAAK,0BAA0B,EAAO,GAAI,EAAO,GAAI,EAAO,GAAI,IAChE,EAAK,0BAA0B,EAAO,GAAI,EAAO,GAAI,EAAO,GAAI,IAChE,GAAS,KAAK,GAAU,IACxB,EAAK,eAAiB,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,GAAS,EAAG,GAAS,EAAG,GAAS,GAAI,GAAS,WAAW,IACtH,SAAa,EAAK,KAAK,eAAe,OAAQ,CAC1C,MAAM,EAAS,EAAK,KAAK,eAAe,OACxC,EAAK,eAAiB,IAAI,EAAM,OAAO,IAAI,EAAM,QAAQ,EAAO,GAAI,EAAO,GAAI,EAAO,IAAK,EAAO,GACtG,MACI,EAAK,eAAiB,EAAW,0BAGrC,EAAK,eAAiB,EAAW,qBAGrC,SAAS,EAAa,GACZ,EAAE,KAAO,EAAE,IAAI,SAAS,SAEjB,EAAE,KAAO,EAAE,IAAI,SAAS,QADjC,EAAK,yBAIL,EAAK,gBAEb,CAYA,GAXM,EAAK,KAAK,SACZ,EAAa,EAAK,KAAK,SAEvB,EAAK,QACI,EAAK,KAAK,WACnB,EAAK,KAAK,SAAS,SAAQ,GAAK,EAAa,KAE7C,EAAK,QAIH,EAAK,YAAa,CACpB,MAAM,EAAa,IAAI,EAAM,OACzB,EAAK,0BAA0B,GAE/B,EAAW,KAAK,EAAK,eAAe,QAC7B,EAAK,0BAA0B,EAAM,QAE5C,EAAW,KAAK,EAAK,gBAInB,KAAK,KAAK,eAAe,SAC3B,EAAK,0BAC2E,IAA3E,EAAK,KAAK,eAAe,OAAO,GAAK,EAAK,KAAK,eAAe,OAAO,IACM,IAA3E,EAAK,KAAK,eAAe,OAAO,GAAK,EAAK,KAAK,eAAe,OAAO,IACM,IAA3E,EAAK,KAAK,eAAe,OAAO,GAAK,EAAK,KAAK,eAAe,OAAO,IACtE,IAEJ,GAAe,mBAAmB,GAAS,YAAa,GAAS,aACjE,EAAK,OAAO,gBAAgB,IAC5B,EAAK,OAAO,sBAAkB,IAElC,GAAW,iBAAiB,EAAW,OAAO,EAAI,EAAK,MAAM,GAAI,EAAW,OAAO,EAAI,EAAK,MAAM,GAAI,EAAW,OAAO,EAAI,EAAK,MAAM,GAEvI,EAAK,OAAO,OAAO,SAAS,IAC5B,EAAK,OAAO,OAAO,UAAU,EAAK,OAAO,SAAU,EAAK,OAAO,WAAY,EAAK,OAAO,MAC3F,CAEA,EAAK,WACD,EAAW,gBAAgB,EAAW,eAAe,EAC7D,CAEA,mBAAA,CAAoB,GAEhB,MACM,EADW,sCACY,KAAK,GAG5B,EAAe,EAAM,WAAW,OAAS,EAAM,WAAW,MAEhE,OAAO,GAAe,CAC1B,CAEA,WAAA,CAAY,EAAM,GAET,EAAK,SAAS,OACf,GAAQ,KAGZ,MAAM,EAAU,IAAI,IAAI,GACxB,IAAI,EAAY,EAAQ,SAAS,MAAM,KAAK,QAAO,GAAW,KAAN,IACpD,EAAgB,EAAS,MAAM,KAAK,QAAO,GAAW,KAAN,IAEpD,QAAS,EAAI,EAAG,GAAK,EAAU,UACvB,GAAK,EAAc,QADY,IAInC,GAFkB,EAAU,MAAM,EAAU,OAAS,EAAG,EAAU,QAAQ,KAAK,OACzD,EAAc,MAAM,EAAG,GAAG,KAAK,KACpB,CAC7B,QAAS,EAAI,EAAG,EAAI,EAAG,IACnB,EAAU,MAEd,KACJ,CAIJ,KAAO,EAAc,OAAS,GAA0B,OAArB,EAAc,IAC7C,EAAU,MACV,EAAc,QAGlB,MAAO,GAAG,EAAQ,aAAa,EAAQ,QAAQ,IAAI,KAAc,GAAe,KAAK,MACzF,CACA,kBAAA,CAAmB,EAAK,GACpB,MAAM,EAAS,IAAI,IAAI,GAGvB,QAAU,EAAK,KAAU,EAAO,aAC5B,EAAO,GAAO,EAKlB,OADA,EAAO,OAAS,GACT,EAAO,UAClB,CACA,IAAA,GACI,IAAI,EAAO,KAQX,SAAS,EAAY,GACjB,IAAI,EACE,EAAQ,IACV,EAAM,EAAQ,IACL,EAAQ,MACjB,EAAM,EAAQ,KAElB,MAAM,EAAW,sCAYjB,GAVI,EAAS,KAAK,EAAK,UACd,EAAS,KAAK,KACf,EAAM,EAAK,YAAY,EAAK,SAAU,IAGtC,cAAgB,EAAK,YACrB,EAAM,EAAK,SAAW,OAAW,GAGzC,EAAM,EAAK,mBAAmB,EAAK,EAAK,aACpC,EAAK,YAAa,CAClB,IAAI,EAAQ,GACZ,QAAS,KAAO,EAAK,YACb,EAAK,YAAY,eAAe,KAChC,GAAS,IAAM,EAAM,IAAM,EAAK,YAAY,IAGhD,EAAI,SAAS,KACb,GAAO,EAEP,GAAO,IAAM,EAAM,UAAU,EAErC,CAEM,IACE,EAAI,SAAS,UAAY,EAAI,SAAS,SAAW,EAAI,SAAS,UAC9D,EAAK,WAAa,EAGlB,EAAK,WAAW,IAAI,EAAK,gBAAiB,EAAK,EAAK,KAAM,EAAO,EAAK,aAAyB,IACpF,EAAK,0BAA0B,EAAK,cADsC,IAAM,OAElF,EAAK,eACV,EAAK,OACH,EAAK,KAAK,eAAe,SACzB,EAAK,KAAK,eAAe,OAC3B,EAAK,iBACF,EAAI,SAAS,UACpB,EAAK,WAAW,IAAI,EAAK,gBAAiB,EAAK,EAAK,KAAM,GAKtE,CA1DI,EAAK,UACH,EAAK,KAAK,QAEZ,EAAY,EAAK,KAAK,SACb,EAAK,KAAK,UACnB,EAAK,KAAK,SAAS,SAAQ,GAAW,EAAY,KAuD1D,CAEA,QAAA,CAAS,GACQ,KACJ,SADI,KAKR,YAAY,IAAI,EAEzB,CAEA,QAAA,CAAS,EAAM,GACP,KAAK,UAGH,KAAK,KAAK,WACZ,KAAK,aAAe,KAAK,KAAK,UAGlC,EAAK,SAAW,WAAa,GAC7B,KAAK,aAAa,KAAK,GACvB,KAAK,yBACT,CAEA,OAAA,GAEI,MAAM,EAAO,KACb,EAAK,cAAc,SAAQ,GAAQ,EAAK,YAExC,EAAK,WACD,EAAK,iBAAiB,EAAK,gBAAgB,QAC/C,KAAK,OAAS,KACd,KAAK,WAAa,KAClB,KAAK,cAAc,CAAE,KAAM,WAC/B,CACA,eAAA,GAEe,KAEN,cAAc,SAAQ,GAAQ,EAAK,YAF7B,KAGN,cAAgB,EAEzB,CAGA,OAAA,CAAQ,EAAQ,GACZ,MAAM,EAAO,KA0Bb,SAAS,EAAqB,GAG1B,GAAK,EAAK,kBAIN,EAAK,YAAY,KAAO,EAAK,gBAAjC,CAKA,GAAI,EAAS,EAGT,OAFA,EAAK,kBACL,EAAK,0BAA0B,EAAK,iBAOxC,GAJI,EAAK,aAIwB,GAA7B,EAAK,cAAc,QAMvB,GAAI,GAAU,EAAK,OAAO,yBAA2B,EAAK,eAEtD,EAAK,iCAAwB,GACtB,EAAS,EAAK,OAAO,yBAA2B,EAAK,eAAgB,CAE5E,IAAI,KACJ,EAAK,cAAc,OAAM,KAEhB,EAAM,YACP,MAAmB,KAKvB,GACA,EAAK,2BAEb,OAtBI,EAAK,2BAbT,CAoCJ,CA7D0B,IAIN,EAbf,EAAK,UAEqB,EAAK,mBAE9B,EAAK,gBAAoB,EAAK,iBAChC,EAAK,OAAS,EAAK,sBAAsB,EAAQ,IAErD,EAAK,cAAc,SAAQ,GAAS,EAAM,QAAQ,EAAQ,KAE1D,EAAqB,EAAK,SAIN,EAHT,EAAK,QAKC,GAAK,EAAK,kBAEjB,EAAK,gBAAkB,EAAK,UAAc,EAAS,EAAK,OAAO,yBAA2B,EAAK,gBAAkB,EAAK,YAAY,KAAO,IACrI,EAAK,MAAU,EAAK,cAAgB,EAAK,cAAc,QAAU,EAAK,aAAa,QAuE7F,EAAK,aAAa,SAAQ,IACtB,KAAK,EAAU,MAAS,EAAU,UAAa,EAAU,aAAgB,EAAU,SAAY,EAAU,UACrG,OAEJ,IAAI,EAAY,IAAI,GAAc,CAC9B,WAAY,EACZ,YAAa,EAAK,YAClB,qBAAsB,EAAK,eAC3B,qBAAsB,EAAK,eAC3B,iBAAkB,EAAK,WACvB,KAAM,EACN,SAAU,EAAK,SACf,gBAAiB,EAAK,gBACtB,MAAO,EAAK,MAAQ,EACpB,WAAY,EAAK,WACjB,aAAc,EACd,OAAQ,EAAK,OACb,iBAEJ,EAAK,cAAc,KAAK,EAAU,IAlG1B,SA8DE,GACd,GAAK,EAAK,eACV,KAAK,EAAK,UAGN,OAFA,EAAK,uBACL,EAAqB,GAGrB,GAAU,EAAK,OAAO,yBAA2B,EAAK,iBACtD,EAAK,kBACL,EAAqB,IAI7B,CA3EgB,CACP,EAAK,QAsGlB,CAEA,6BAAA,GACI,IAAI,KAuBJ,OArBA,KAAK,cAAc,OAAM,IACrB,GAAI,EAAM,eAAgB,CACtB,GAAI,EAAM,cAAc,OAAS,EAE7B,OADA,MAAqB,EAGzB,IAAK,EAAM,UACP,SAEJ,IAAK,EAAM,oBAAsB,EAAM,iBAAmB,EAAM,gBAE5D,OADA,MAAqB,CAG7B,UACS,EAAM,gCAEP,OADA,MAAqB,EAI7B,QAAW,IAER,CACX,CAMA,OAAA,GAEI,IAAK,KAAK,UAAW,SAGrB,GAAI,KAAK,uBACL,SAEJ,IAAM,KAAK,gBAA2C,GAAzB,KAAK,YAAY,OAAc,KAAK,mBAAqB,CAClF,GAAI,KAAK,cAAc,OAAS,EAAG,CAC/B,IAAI,KAQJ,OAPA,KAAK,cAAc,OAAM,KAChB,EAAM,YACP,MAAmB,KAKpB,CACX,CACI,QAGR,CAEA,OAAK,KAAK,kBAIN,KAAK,YAAY,KAAO,KAAK,mBAK5B,KAAK,kBAOd,CAGA,uBAAA,CAAwB,GACP,KACR,mBAAqB,CAI9B,CACA,qBAAA,CAAsB,EAAQ,GAE1B,GAAI,KAAK,0BAA0B,IAI/B,GAFA,GAAW,KAAK,KAAK,eAAe,QACpC,GAAW,aAAa,KAAK,cACxB,EAAQ,iBAAiB,IAAa,aACxC,MAAI,KAAK,0BAA0B,EAAM,QAO5C,OADA,QAAQ,MAAM,wBAFd,GAFA,GAAW,KAAK,KAAK,gBACrB,GAAW,aAAa,KAAK,cACxB,EAAQ,iBAAiB,IAAa,QAI/C,CAIA,IAAI,EAAW,KAAK,IAAI,EAAG,EAAO,SAAS,WAAW,GAAW,QAAU,GAAW,QAKtF,GAFA,EAAW,KAAK,IAAI,EAAS,KAAK,cAElB,GAAZ,EACA,OAAO,EAEX,MAAM,EAAQ,KAAK,YAAY,oBAC/B,KAAK,OAAO,YAAY,IACxB,IAAI,EAAI,GAAa,EACjB,EAAM,EAAO,IACb,EAAO,OAAS,IAChB,GAAO,EAAO,OACd,EAAI,GAAa,GAGrB,IAAI,EAAS,EAAM,KAAK,IAAI,GAAM,EAAM,qBAAsC,EAE9E,OAAkC,GAA1B,OAAO,iBAAwB,GAAW,EAAI,EAE1D,CAEA,WAAA,GACI,MAAM,EAAO,KACP,EAAQ,GACd,IAAK,EAAK,WAAY,OAAO,EAC7B,IAAI,EAAI,EAAK,WACb,MAAQ,EAAE,gBAAoB,EAAE,YAC5B,EAAI,EAAE,WAUV,OARA,EAAE,cAAc,SAAQ,IACpB,GAAM,GAAS,GAAS,EAAM,CAC1B,MAAQ,EAAM,gBAAoB,EAAM,cAAc,IAClD,EAAQ,EAAM,cAAc,GAEhC,EAAM,KAAK,EACf,KAEG,CACX,CACA,yBAAA,CAA0B,GAetB,OAdI,KAAK,0BAA0B,IAE/B,GAAW,KAAK,KAAK,eAAe,QACpC,GAAW,aAAa,KAAK,cAEtB,KAAK,0BAA0B,EAAM,QAE5C,GAAW,KAAK,KAAK,gBACrB,GAAW,aAAa,KAAK,cAI7B,QAAQ,MAAM,qBAEX,KAAK,IAAI,EAAG,EAAO,SAAS,WAAW,GAAW,QAAU,GAAW,OAClF,CAEA,cAAA,GAEI,OADa,KACD,WAChB,CAEA,yBAAA,CAA0B,EAAK,EAAK,EAAG,GACnC,MAEM,EAFI,QAEK,KAAK,KAAK,EADf,iBAC0B,KAAK,IAAI,KAAK,IAAI,GAAM,IACtD,EAAS,KAAK,IAAI,GAClB,EAAS,KAAK,IAAI,GAClB,EAAS,KAAK,IAAI,GAElB,EAAO,EAAI,EACX,EAAI,EAAM,EAAS,EACnB,EAAI,EAAM,EAHD,KAAK,IAAI,GAIlB,GAAK,iBAAoB,EAAI,GAAK,EAExC,EAAK,IAAI,EAAG,EAAG,EACnB,EC9qBJ,MAAM,WAA2B,EAAM,SA2BnC,WAAA,CAAY,GACR,QACA,EAAW,OAAS,KAEf,EAAW,UAAc,EAAW,UACrC,KAAK,aAAe,IAAI,EAAM,QAAQ,EAAW,SAAU,EAAW,WAEtE,KAAK,aAAe,IAAI,EAAM,QAAQ,IAAM,KAEhD,KAAK,SAAW,EAAW,SAC3B,KAAK,aAAe,KAAK,IAAI,KAAO,EAAW,aAAc,EAAW,aAAa,GAErF,KAAK,yBAA2B,EAAW,yBAA0B,EAAW,yBAAyB,EACzG,KAAK,QAAU,IAAI,GAAc,GAC7B,EAAW,SACX,KAAK,qBAET,KAAK,WAAa,EAAW,UACjC,CAEA,WAAA,CAAY,GACH,KAAK,SACN,KAAK,SAAS,qBAAqB,GAEnC,EAAK,KAAK,KAAK,aAGvB,CASC,aAAA,CAAc,EAAO,GAClB,KAAK,aAAa,IAAI,EAAO,EACjC,CAKA,MAAA,CAAO,EAAQ,GACX,GAAK,EACD,KAAK,QAAQ,QAAQ,EAAQ,OAC5B,CACD,MAAM,EAAU,IAAI,EAAM,QAC1B,EAAQ,yBAAwB,IAAI,EAAM,SAAU,iBAAiB,EAAO,iBAAkB,EAAO,qBACrG,KAAK,QAAQ,QAAQ,EAAQ,EACjC,CAEJ,CAUA,2BAAA,CAA4B,GACxB,KAAK,yBAA2B,GAAkD,CACtF,ECnGJ,MAAM,GACF,WAAA,CAAY,GACR,MAAM,EAAO,KACb,EAAK,MAAQ,EACb,EAAK,eAAiB,GACtB,EAAK,cAGL,EAAK,gBAAkB,IAAI,EAAM,OACrC,CACA,WAAA,CAAY,GACR,MAAM,EAAO,KACb,EAAc,SACd,EAAc,UAAY,EAAK,eAC/B,EAAK,eAAe,KAAK,GACtB,EAAK,eACJ,EAAc,SAAS,EAAK,cAEpC,CAEA,UAAA,GAEI,MAAM,EAAO,KACb,EAAK,cAAc,YAAY,EAAE,IAAI,EAAM,SAC3C,EAAK,cAAc,eAAe,eAClC,EAAK,cAAc,MAAQ,EAE3B,EAAK,MAAM,IAAI,EAAK,eACpB,EAAK,cAAc,cAAgB,YACxB,EAAK,cAAc,cAC1B,EAAK,cAAc,iBAE3B,CAEA,SAAA,CAAU,GACN,MAAM,EAAO,KACb,EAAK,cAAgB,EACrB,EAAK,cAAc,oBACnB,EAAK,cAAc,yBACf,EAAK,MAAM,SAAS,SAAS,IAC7B,KAAK,aAGT,QAAQ,EAAI,EAAG,EAAE,EAAK,eAAe,OAAQ,IACzC,EAAK,eAAe,GAAG,SAAS,EAAK,cAE7C,CAEA,MAAA,GACI,MAAM,EAAO,KAEb,QAAQ,EAAI,EAAK,eAAe,OAAO,EAAG,GAAG,EAAG,IACzC,EAAK,eAAe,GAAG,SACtB,EAAK,eAAe,OAAO,EAAE,GAIrC,GAAK,EAAK,cAAc,CAEpB,EAAK,cAAc,MAAQ,EAC3B,EAAK,cAAc,eAAiB,GACpC,QAAQ,EAAI,EAAG,EAAE,EAAK,eAAe,OAAQ,IACzC,EAAK,eAAe,GAAG,YAAY,IAAI,EAAK,eACzC,EAAK,eAAe,GAAG,qBACtB,EAAK,cAAc,QACnB,EAAK,gBAAgB,IAAI,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GACvD,EAAK,gBAAgB,SAAS,EAAK,eAAe,GAAG,aACrD,EAAK,gBAAgB,SAAS,EAAK,cAAc,YAEjD,EAAK,cAAc,YAAY,EAAK,cAAc,MAAM,EAAG,EAAK,iBAGhE,EAAK,cAAc,eAAe,KAAK,EAAK,eAAe,KAInE,EAAK,cAAc,eAAe,eAClC,EAAK,cAAc,eACnB,EAAK,cAAc,uBACvB,CACJ,CAEA,QAAA,GACI,OAAO,KAAK,eAAe,MAC/B,CAEA,OAAA,GACI,MAAM,EAAO,KACb,QAAG,EAAK,eAAe,OAAO,IAIrB,EAAK,gBAEN,EAAK,MAAM,OAAO,EAAK,eACvB,EAAK,cAAc,UAAU,IAEzB,GADG,EAAE,SAAS,EAAE,UACZ,EAAE,SAEF,GAAI,EAAE,SAAS,OACX,QAAS,EAAI,EAAG,EAAI,EAAE,SAAS,SAAU,EACrC,EAAE,SAAS,GAAG,eAIlB,EAAE,SAAS,UAGf,EAAE,UAAU,EAAE,SAAS,SAAS,IAExC,EAAK,cAAc,aAK/B,ECnHJ,MAAM,GACF,WAAA,GACI,MAAM,EAAO,KACb,EAAK,MAAQ,EACb,EAAK,KACL,EAAK,eAAiB,EAC1B,CAEA,WAAA,CAAY,GACR,KAAK,eAAe,KAAK,GACtB,KAAK,MACJ,EAAa,SAAS,KAAK,KAAM,KAAK,IAE9C,CAIA,SAAA,CAAU,EAAM,GACZ,MAAM,EAAO,KACb,EAAK,KAAO,EACZ,EAAK,IAAM,EACX,QAAQ,EAAI,EAAG,EAAE,EAAK,eAAe,OAAQ,IACzC,EAAK,eAAe,GAAG,SAAU,EAAK,KAAM,EAAK,IAEzD,CAEA,QAAA,GACI,OAAO,KAAK,eAAe,MAC/B,CACA,MAAA,GACI,MAAM,EAAO,KACb,QAAQ,EAAI,EAAK,eAAe,OAAO,EAAG,GAAG,EAAG,IACzC,EAAK,eAAe,GAAG,SACtB,EAAK,eAAe,OAAO,EAAE,EAGzC,CACA,OAAA,GACI,SAAK,KAAK,MAAsC,GAA9B,KAAK,eAAe,OAI1C,EChCJ,IAAI,GAAsB,EAyb1B,eAAe,GAAwB,GAGnC,OAAO,IAAI,SAAS,IAChB,MAAM,EAAW,kBACP,EAAO,iBAAkB,EAAO,aAAkB,EAAO,gBAAiB,EAAO,aACnF,cAAc,GACd,IACJ,GACD,GAAG,GAEd,UAAA,GAAA,GAAA,WAAA,OAAA,WAAA,SAAA,IAAA,QAAA,OAAA,cAAA,UAAA,4CAAA,KAAA,IAAA,IAAA,0CAAA,SAAA,eAAA,WAAA,SAAA,cAAA,QAAA,eAAA,SAAA,cAAA,KAAA,SAAA,SAAA,MAAA,CAAA,KAAA,SAAA,KAAA,GAAA,MAAA,UAAA,GAAA,GAAA,WAAA,OAAA,WAAA,SAAA,IAAA,QAAA,OAAA,cAAA,UAAA,4CAAA,KAAA,IAAA,IAAA,0CAAA,SAAA,eAAA,WAAA,SAAA,cAAA,QAAA,eAAA,SAAA,cAAA,KAAA,SAAA,SAAA,MAAA,CAAA,KAAA,SAAA,KAAA,GAAA,MAAA,CCrcA,SAAS,GAAiB,EAAO,EAAW,CAAC,QAAU,IACrD,OAAK,EACD,MAAM,QAAQ,IAA2B,IAAjB,EAAM,OAAqB,CAAC,OAAO,EAAM,IAAK,OAAO,EAAM,IAAK,OAAO,EAAM,KACrG,EAAM,UAAkB,CAAC,EAAM,EAAG,EAAM,EAAG,EAAM,GAChC,iBAAV,GAAsB,MAAO,GAAS,MAAO,GAAS,MAAO,EAAc,CAAC,OAAO,EAAM,GAAI,OAAO,EAAM,GAAI,OAAO,EAAM,IAC/H,EAAS,QAJG,EAAS,OAK9B,CAEA,SAAS,GAAoB,EAAO,EAAW,CAAC,EAAG,EAAG,EAAG,IACvD,IAAK,EAAO,OAAO,EAAS,QAC5B,GAAI,MAAM,QAAQ,IAA2B,IAAjB,EAAM,OAAc,MAAO,CAAC,OAAO,EAAM,IAAK,OAAO,EAAM,IAAK,OAAO,EAAM,IAAK,OAAO,EAAM,KAC3H,GAAI,EAAM,aAAc,MAAO,CAAC,EAAM,EAAG,EAAM,EAAG,EAAM,EAAG,EAAM,GACjE,GAAI,EAAM,QAAS,CACjB,MAAM,GAAI,IAAI,EAAM,YAAa,aAAa,GAC9C,MAAO,CAAC,EAAE,EAAG,EAAE,EAAG,EAAE,EAAG,EAAE,EAC3B,CACA,OAAO,EAAS,OAClB,CAEA,SAAS,GAAiB,GAKxB,GAAI,MAAM,QAAQ,IAAa,GAAW,EAAQ,UAChD,MAAO,CAAE,KAAM,SAAU,OAAQ,GAAiB,IAEpD,MAAM,EAAI,GAAW,GAErB,MAAa,gBADC,EAAE,MAAQ,UAAU,cAEzB,CACL,KAAM,aACN,aAAc,GAAiB,EAAE,cAAgB,CAAC,EAAG,EAAG,GAAI,CAAC,EAAG,EAAG,IACnE,UAAkC,iBAAhB,EAAE,UAAyB,EAAE,UAAY,MAGxD,CAAE,KAAM,SAAU,OAAQ,GAAiB,EAAE,QAAU,EAAG,CAAC,QAAU,IAC9E,CAiEA,SAAS,KACP,cAAe,YAAgB,KAAe,YAAY,IAAO,YAAY,MAAQ,KAAK,KAC5F,CAAA,QAAA,cAAA,GAAA,QAAA,mBAAA,GAAA,QAAA,oBD5FA,MAmBI,WAAA,CAAY,EAAO,GAmBf,GAlBA,KAAK,eAAiB,IAAI,EAAM,QAChC,KAAK,eAAe,IAAI,EAAG,EAAG,EAAG,EAC7B,EAAG,KAAO,EACV,EAAG,EAAG,EAAG,EACT,EAAG,EAAG,EAAG,GACb,KAAK,eAAiB,IACtB,KAAK,aAAe,EACpB,KAAK,MAAQ,EAAQ,MACf,IACF,KAAK,aAAe,EAAQ,aAC5B,KAAK,eAAiB,EAAQ,eAC1B,EAAQ,iBAAgB,KAAK,eAAiB,EAAQ,gBACtD,EAAQ,eAAc,KAAK,aAAe,EAAQ,eAK1D,KAAK,WAAa,IAAI,GAChB,GAAa,EAAQ,YACvB,KAAK,WAAW,eAAe,EAAQ,aACvC,KAAK,sBACF,CACH,MAAM,EAAc,IAAI,GACxB,EAAY,eAAe,2DAC3B,KAAK,WAAW,eAAe,GAC/B,KAAK,WAAW,iBACpB,CAEA,GAAM,GAAa,EAAQ,WACvB,KAAK,WAAW,cAAc,EAAQ,YACtC,KAAK,yBACI,GAAa,EAAQ,SAAU,CACxC,MAAM,EAAa,IAAI,GACvB,EAAW,kBAAkB,sDAAsD,cAAc,EAAQ,UACzG,KAAK,WAAW,cAAc,GAC9B,KAAK,WAAW,gBACpB,CAEA,KAAK,WAAW,kBAAkB,IAClC,KAAK,qBAEL,KAAK,YAAc,IAAI,GAAY,KAAK,YAGxC,KAAK,MAAQ,IAAI,GACjB,KAAK,MAAQ,EAEb,KAAK,MAAQ,GACb,KAAK,UAAY,GACjB,KAAK,UAAY,GACjB,KAAK,cAAgB,EAEzB,CAMA,MAAA,GACI,MAAM,EAAO,KACb,EAAK,aACL,EAAK,MAAM,MAAM,SAAQ,IACrB,EAAE,QAAQ,IAGV,GAAsB,GACtB,EAAK,YAET,EAAK,YACT,CAGA,SAAA,GACI,MAAM,EAAO,KACb,GAAiC,GAA7B,EAAK,cAAc,SACnB,EAAK,oBAC4B,GAA7B,EAAK,cAAc,QAE3B,KAAO,EAAK,cAAc,OAAS,GAAG,CAClC,MAAM,EAAe,EAAK,cAAc,QACxC,GAAM,EAqCA,GAnCE,EAAa,KAAK,SAAS,WAOvB,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EAAa,OARf,IACL,MAAM,EAAa,MAYlC,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GAER,MADA,QAAQ,MAAM,mCAAqC,EAAa,MAC1D,IAAI,MAAM,kBAAkB,EAAa,qCAAqC,EAAO,YAAY,EAAO,cAElH,OAAO,EAAO,aAAa,IAE5B,MAAK,GACG,KAAK,YAAY,mBAAmB,GAAoB,IAAW,EAAK,aAAa,EAAM,EAAa,eAAc,GAAK,EAAK,aAAc,EAAa,cAAe,EAAa,gBAC/L,MAAK,IACJ,EAAK,iBACL,EAAa,KAAK,UAAU,GAC5B,EAAK,MAAM,QAAQ,EAAa,IAEjC,OAAM,GAAK,QAAQ,MAAM,KACvB,cACG,IAAqB,KAE3B,EAAa,KAAK,SAAS,SAAY,EAAa,KAAK,SAAS,SAOhE,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EAAa,OARf,IACL,MAAM,EAAa,MAYlC,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GACR,MAAM,IAAI,MAAM,mBAEpB,OAAO,EAAO,aAAa,IAC5B,YAAK,UACE,GAAwB,KAAK,YACnC,KAAK,WAAW,MAAM,EAAa,MAAM,IAoBrC,IAAI,EAnBJ,EAAK,MAAM,MAAQ,EAAK,MAEpB,EAAa,eACb,EAAK,MAAM,aAAa,KAAK,gBAEjC,EAAK,MAAM,UAAU,IACjB,EAAE,eAAiB,EAAa,eAC5B,EAAE,SACE,EAAa,cACb,EAAE,aAAa,KAAK,gBAElB,EAAK,cACP,EAAK,aAAa,EAAG,EAAE,iBAG3B,EAAE,UACF,QAAQ,MAAM,yCAClB,IAGJ,EAAK,MAAM,sBAAkB,GAC7B,EAAK,MAAM,UAAS,IAEZ,EAAM,SACN,EAAgB,IAAI,EAAM,cAAc,EAAM,SAAU,EAAM,SAAU,EAAK,cAC7E,EAAc,WAAa,EAAM,YACrC,IAGJ,EAAK,MAAM,QAAQ,GACd,GAMD,EAAc,iBACd,EAAa,KAAK,UAAU,IAN5B,EAAK,MAAM,UAAS,IACZ,EAAE,SAAS,EAAE,UACb,EAAE,UAAU,EAAE,SAAS,SAAS,GAK5C,GACF,IACH,IACC,QAAQ,MAAM,yBAA2B,EAAa,KAAI,IAC3D,cACC,IAAqB,YAKlB,EAAa,KAAK,SAAS,SAAU,CAC5C,IAAI,EAMA,EALC,EAAK,MAKU,IACL,MAAM,EAAK,MACd,CACI,OAAQ,OACR,KAAM,EAAa,OARf,IACL,MAAM,EAAa,MAYlC,KACA,IAAgB,MAAK,IACjB,IAAK,EAAO,GAER,MADA,QAAQ,MAAM,mCAAqC,EAAa,MAC1D,IAAI,MAAM,kBAAkB,EAAa,qCAAqC,EAAO,YAAY,EAAO,cAElH,OAAO,EAAO,MAAM,IAErB,MAAK,GACG,GAAiB,EAAM,EAAa,QAC5C,MAAK,IACJ,EAAa,KAAK,UAAU,EAAM,EAAa,MAC/C,EAAK,MAAM,QAAQ,EAAa,IAE/B,OAAM,GAAK,QAAQ,MAAM,KAAI,cAC1B,IAAqB,GAEjC,CAER,CAEJ,CAEA,UAAA,GACI,OAA6B,GAAzB,KAAK,UAAU,SACf,KAAK,gBACwB,GAAzB,KAAK,UAAU,QAAoB,EAE1B,KAAK,UAAU,QAIzB,EAHe,CAI1B,CAEA,aAAA,GACI,IAAI,EAAmB,OAAO,UAC1B,KACJ,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IAEnC,KAAK,MAAM,GAAG,kBACf,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,EAAG,GAAG,IAGpD,KAAI,KAAK,UAAU,OAAS,GAA5B,CACA,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IAAK,CAC7C,MAAM,EAAO,KAAK,MAAM,GAAG,mBAAqB,KAAK,MAAM,GAAG,MAC1D,EAAO,IACP,EAAmB,EACnB,EAAU,EAElB,CACA,GAAI,GAAW,EAAG,CACd,MAAM,EAAc,KAAK,MAAM,OAAO,EAAS,GAAG,MAClD,KAAK,UAAU,KAAK,GACpB,MAAM,EAAW,EAAY,cAC7B,QAAS,EAAI,KAAK,MAAM,OAAS,EAAG,GAAK,EAAG,IACpC,EAAS,SAAS,KAAK,MAAM,GAAG,OAChC,KAAK,UAAU,KAAK,KAAK,MAAM,OAAO,EAAG,GAAG,MAGxD,CAjB+B,CAkBnC,CAgBA,GAAA,CAAI,EAAiB,EAAM,EAAM,EAAoB,EAAkB,EAAa,EAAO,EAAe,EAAc,GACpH,MAAM,EAAO,KACP,WAyIS,GAKnB,QAHI,EAAQ,EAAU,MAAM,KACxB,EAAW,GACX,EAAS,EACJ,EAAI,EAAG,EAAI,EAAM,OAAQ,IAAK,CACnC,IAAI,EAAO,EAAM,GACJ,MAAT,GAAyB,KAAT,GAAwB,OAAT,EAMnC,EAAS,KAAY,EALJ,OAAT,GAAiB,EAAS,GAC1B,GAKZ,CAEA,GAAe,IAAX,EACA,MAAO,IAGX,IAAI,EAAS,GACb,IAAS,EAAI,EAAG,EAAI,EAAQ,IACxB,GAAU,IAAM,EAAS,GAG7B,OAAO,CACX,CAnKc,CAAoB,GAE1B,KAAK,EAAK,SAAS,UAAa,EAAK,SAAS,UAAa,EAAK,SAAS,SAAY,EAAK,SAAS,UAE/F,YADA,QAAQ,MAAM,uEAIlB,MAAM,EAAa,EAAK,MAAM,IAAI,GAClC,GAAM,EACF,EAAW,YAAY,WAInB,EAAK,SAAS,UAAY,EAAK,SAAS,SAAW,EAAK,SAAS,SAAU,CAC3E,MAAM,EAAO,IAAI,GAAS,EAAK,OAC/B,EAAK,YAAY,GAEjB,EAAK,MAAM,IAAI,EAAK,GAEpB,MAAM,EAAsB,IAAI,gBAChC,EAAgB,OAAO,iBAAiB,cACb,GAAnB,EAAK,YACL,EAAoB,OACxB,IAEJ,KAAK,UAAU,KAAK,CAChB,gBAAiB,EACjB,KAAM,EACN,IAAK,EACL,KAAM,EACN,iBAAkB,EAClB,YAAa,EACb,MAAO,EACP,KAAM,EACN,cAAe,EACf,aAAc,EACd,eAAgB,EAChB,iBAAkB,QAI1B,SAAW,EAAK,SAAS,SAAU,CAC/B,MAAM,EAAO,IAAI,GACjB,EAAK,YAAY,GACjB,EAAK,MAAM,IAAI,EAAK,GAEpB,MAAM,EAAsB,IAAI,gBAChC,EAAgB,OAAO,iBAAiB,cACb,GAAnB,EAAK,YACL,EAAoB,OACxB,IAEJ,KAAK,UAAU,KAAK,CAChB,gBAAiB,EACjB,KAAM,EACN,IAAK,EACL,KAAM,EACN,iBAAkB,EAClB,YAAa,EACb,MAAO,EACP,iBAAkB,QAK1B,CAER,CAIA,iBAAA,GACI,IAAI,EAAmB,OAAO,UAC1B,KACJ,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IAAK,CACjD,MAAM,EAAW,KAAK,UAAU,GAC3B,EAAS,mBAIT,EAAS,kBACV,KAAK,cAAc,KAAK,KAAK,UAAU,OAAO,EAAG,GAAG,IAJpD,KAAK,UAAU,OAAO,EAAG,EAMjC,CACA,KAAI,KAAK,cAAc,OAAS,GAAhC,CACA,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IAAK,CACjD,MAAM,EAAW,KAAK,UAAU,GAC1B,EAAO,EAAS,mBAAqB,EAAS,MAChD,EAAO,IACP,EAAmB,EACnB,EAAU,EAElB,CACA,GAAI,GAAW,EAAG,CACd,MAAM,EAAc,KAAK,UAAU,OAAO,EAAS,GAAG,MACtD,KAAK,cAAc,KAAK,GACxB,MAAM,EAAW,EAAY,cAC7B,QAAS,EAAI,KAAK,UAAU,OAAS,EAAG,GAAK,EAAG,IACxC,EAAS,SAAS,KAAK,UAAU,GAAG,OACpC,KAAK,cAAc,KAAK,KAAK,UAAU,OAAO,EAAG,GAAG,MAGhE,CAlBmC,CAmBvC,CAEA,UAAA,GACI,MAAM,EAAO,KAEb,IAAI,EAAI,EAER,KAAO,EAAK,MAAM,OAAS,EAAK,gBAAkB,EAAI,EAAK,MAAM,QAAQ,CACrE,IACA,MAAM,EAAQ,EAAK,MAAM,OACzB,EAAK,MAAM,OAAO,EAAM,KACnB,EAAM,MAAM,WACb,EAAK,MAAM,IAAI,EAAM,IAAK,EAAM,MAKxC,CACJ,GAAA,QAAA,IAAA,GAAA,QAAA,UAAA,GAAA,QAAA,wBEzbJ,MAKI,WAAA,GACI,KAAK,QAAU,GACf,KAAK,aAAe,IAAI,EAAM,kBAAkB,CAAE,kBAClD,KAAK,aAAa,KAAO,EAAM,UAC/B,KAAK,WAAa,KAAK,oBACvB,KAAK,WAAa,IAAI,WAAW,EAAI,KAAK,WAAW,MAAQ,KAAK,WAAW,OACjF,CAMA,OAAA,CAAQ,GACJ,KAAK,aAAa,KAAO,CAC7B,CAEA,iBAAA,GACI,MAAM,EAAS,IAAI,EAAM,kBAAkB,KAAK,MAA0B,IAApB,OAAO,YAAoB,KAAK,MAA2B,IAArB,OAAO,cAWnG,OAVA,EAAO,QAAQ,OAAS,EAAM,WAC9B,EAAO,QAAQ,WAAa,EAAM,qBAClC,EAAO,QAAQ,UAAY,EAAM,cACjC,EAAO,QAAQ,UAAY,EAAM,cACjC,EAAO,QAAQ,mBACf,EAAO,iBACP,EAAO,eACP,EAAO,aAAe,IAAI,EAAM,aAChC,EAAO,aAAa,OAAS,EAAM,YACnC,EAAO,aAAa,KAAO,EAAM,kBAC1B,CACX,CAQA,MAAA,CAAO,EAAO,EAAU,GACpB,IAAI,EAAmB,EAAS,kBAC5B,EAAuB,EAAM,iBAEjC,EAAM,iBAAmB,KAAK,aAC9B,EAAS,gBAAgB,KAAK,YAC9B,EAAS,OAAO,EAAO,GAEvB,EAAM,iBAAmB,EACzB,EAAS,gBAAgB,GAEzB,EAAS,uBAAuB,KAAK,WAAY,EAAG,EAAG,KAAK,WAAW,MAAO,KAAK,WAAW,OAAQ,KAAK,YAC3G,KAAK,QAAU,GAEf,QAAS,EAAI,EAAG,EAAI,KAAK,WAAW,OAAQ,GAAK,EAAG,CAChD,MAAM,EAAI,EAAM,UAAU,MAAM,KAAK,WAAW,GAAI,EAAG,MAAQ,GAAK,EAAM,UAAU,MAAM,KAAK,WAAW,EAAI,GAAI,EAAG,MAAQ,EAAI,EAAM,UAAU,MAAM,KAAK,WAAW,EAAI,GAAI,EAAG,KAClL,KAAK,QAAQ,KACjB,CAEJ,CAOA,KAAA,CAAM,GACF,OAAO,KAAK,QAAQ,EACxB,GAAA,QAAA,QDsCG,MAQL,WAAA,CAAY,EAAU,IACpB,KAAK,iBAAuD,iBAA7B,EAAQ,iBAAgC,EAAQ,iBAAmB,GAClG,KAAK,QAAqC,iBAApB,EAAQ,QAAuB,EAAQ,QAAW,KAAK,iBAAmB,IAChG,KAAK,QAAU,GAAiB,EAAQ,SACxC,KAAK,eAAY,EAAQ,UAGzB,KAAK,6BAAgC,kBAAsB,QAAmB,aAAc,WAAW,qBAQvG,KAAK,OAAS,IAAI,GAA+B,CAAiB,GAElE,KAAK,OAAS,EACd,KAAK,SAAW,IAAI,IACpB,KAAK,iBAAmB,KAAK,iBAAiB,KAAK,MACnD,KAAK,OAAO,UAAY,KAAK,iBAC7B,KAAK,OAAO,QAAW,IACrB,QAAQ,MAAM,wBAAyB,GAAG,SAAW,IAIvD,KAAK,aAAe,KACpB,KAAK,aAAe,EACpB,KAAK,eAAiB,IAAI,IAC1B,KAAK,iBAAmB,KAAK,iBAAmB,KAAK,iBAAiB,KAAK,MAAU,MAGrF,KAAK,WACL,KAAK,cAAgB,KACrB,KAAK,WAAa,KAClB,KAAK,cAAgB,KACrB,KAAK,kBAAoB,KAGzB,KAAK,YAAc,EACnB,KAAK,gBAAkB,EACvB,KAAK,YAAc,IAAI,IACvB,KAAK,gBAAkB,IAAI,IAC3B,KAAK,eAAiB,IAAI,IAG1B,KAAK,WAAa,IAAI,IAItB,KAAK,aAAe,KAAK,MAAM,CAC7B,KAAM,OACN,QAAS,KAAK,QACd,sBAAuB,KAAK,sBAC5B,QAAS,KAAK,UAGZ,KAAK,WACP,KAAK,aACF,WAAa,KAAK,mBAAmB,IACrC,OAAO,IAAU,QAAQ,MAAM,uBAAwB,EAAI,GAElE,CAcA,SAAA,CAAU,EAAU,IAClB,MAAM,EAAK,MAAM,KAAK,cAChB,GAAQ,EAAQ,MAAQ,WAAW,cACnC,EAA+B,iBAAjB,EAAQ,KAAoB,EAAQ,KAAO,EAEzD,EAAI,GAAiB,EAAQ,SAAU,CAAC,EAAG,EAAG,IAC9C,EAAI,GAAoB,EAAQ,SAAU,CAAC,EAAG,EAAG,EAAG,IACpD,EAAI,EAAQ,SAAW,GAAiB,EAAQ,SAAU,CAAC,EAAG,EAAG,WACjE,EAAI,EAAQ,gBAAkB,GAAiB,EAAQ,gBAAiB,CAAC,EAAG,EAAG,WAkBrF,OAhBA,KAAK,YAAY,IAAI,EAAI,CACvB,KACA,OAAQ,EAAQ,QAAU,KAC1B,OACA,OACA,KAAM,CAAE,IAAG,KACX,QAAS,CAAE,EAAG,EAAE,QAAS,EAAG,EAAE,WAEhC,KAAK,gBAAgB,IAAI,EAAI,IAAI,KAEjC,KAAK,MAAM,CACT,KAAM,YACN,KACA,KAAM,CAAE,OAAM,OAAM,IAAG,IAAG,IAAG,OAGxB,CACT,CASA,qBAAA,EAAsB,OAAE,EAAM,SAAE,EAAQ,UAAE,EAAS,QAAE,EAAO,cAAE,EAAa,cAAE,EAAa,WAAE,IAC1F,IAAK,KAAK,YAAY,IAAI,GAExB,OADA,QAAQ,KAAK,yCAAyC,KAC/C,QAAQ,QAAQ,MAIzB,IAAI,EAAW,KACX,EAAW,KAEf,GAAI,GAAY,EAAS,iBAAkB,CACzC,MAAM,EAAU,EAAS,aAAa,YACtC,GAAK,EAEE,GAAI,EAAQ,6BAA8B,CAC/C,MAAM,EAAQ,EAAQ,MACtB,EAAW,IAAI,aAAqB,EAAR,GAC5B,QAAS,EAAI,EAAG,EAAI,EAAO,IACzB,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,GACnC,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,GACnC,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,EAEvC,MAAW,EAAQ,QACjB,EAAW,IAAI,aAAa,EAAQ,aAVpC,QAAQ,KAAK,6DAaf,MAAM,EAAU,EAAS,aACzB,GAAI,GAAW,EAAQ,MAAO,CAC5B,MAAM,EAAM,EAAQ,MACpB,EAAwC,IAAI,YAAY,EAC1D,CACF,MACM,IACF,EAAW,MAAM,QAAQ,IAEpB,aAAqB,aADtB,IAAI,aAAa,GAGf,IAAI,aAAa,EAAU,QAAU,IAEzC,IACF,EAAW,MAAM,QAAQ,IAEpB,aAAmB,YADpB,IAAI,YAAY,GAGd,IAAI,YAAY,EAAQ,QAAU,IAI5C,KAAM,aAAoB,cAExB,OADA,QAAQ,KAAK,8DACN,QAAQ,QAAQ,MAGzB,MAAM,EAAK,EAAgB,GAAiB,EAAe,CAAC,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,GACzE,EAAK,EAAgB,GAAoB,EAAe,CAAC,EAAG,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,EAAG,GAClF,EAAM,MAAM,QAAQ,IAAqC,IAAtB,EAAW,OAChD,CAAC,OAAO,EAAW,IAAK,OAAO,EAAW,IAAK,OAAO,EAAW,KACjE,CAAC,EAAG,EAAG,GAEL,EAAa,OAAO,KAAK,kBAEzB,EAAM,KAAK,gBAAgB,IAAI,IAAW,IAAI,IACpD,EAAI,IAAI,GACR,KAAK,gBAAgB,IAAI,EAAQ,GACjC,KAAK,eAAe,IAAI,EAAY,GAEpC,MAAM,EAAM,CACV,KAAM,wBACN,GAAI,EACJ,SACA,UAAW,EACX,QAAS,GAAY,KACrB,MAAO,CAAE,EAAG,EAAI,EAAG,EAAI,EAAG,IAGtB,EAAW,GAIjB,OAHI,GAAU,QAAQ,EAAS,KAAK,EAAS,QACzC,GAAU,QAAQ,EAAS,KAAK,EAAS,QAEtC,KAAK,MAAM,EAAK,GAAU,UAAW,GAC9C,CAOA,qBAAA,EAAsB,OAAE,EAAM,SAAE,EAAQ,UAAE,EAAS,QAAE,EAAO,cAAE,EAAa,cAAE,EAAa,WAAE,IAC1F,IAAK,KAAK,YAAY,IAAI,GAExB,OADA,QAAQ,KAAK,yCAAyC,KAC/C,QAAQ,QAAQ,MAIzB,IAAI,EAAW,KACX,EAAW,KAEf,GAAI,GAAY,EAAS,iBAAkB,CACzC,MAAM,EAAU,EAAS,aAAa,YACtC,GAAK,EAEE,GAAI,EAAQ,6BAA8B,CAC/C,MAAM,EAAQ,EAAQ,MACtB,EAAW,IAAI,aAAqB,EAAR,GAC5B,QAAS,EAAI,EAAG,EAAI,EAAO,IACzB,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,GACnC,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,GACnC,EAAS,EAAI,EAAI,GAAK,EAAQ,KAAK,EAEvC,MAAW,EAAQ,QACjB,EAAW,IAAI,aAAa,EAAQ,aAVpC,QAAQ,KAAK,6DAaf,MAAM,EAAU,EAAS,aACzB,GAAI,GAAW,EAAQ,MAAO,CAC5B,MAAM,EAAM,EAAQ,MACpB,EAAwC,IAAI,YAAY,EAC1D,CACF,MACM,IACF,EAAW,MAAM,QAAQ,IAEpB,aAAqB,aADtB,IAAI,aAAa,GAGf,IAAI,aAAa,EAAU,QAAU,IAEzC,IACF,EAAW,MAAM,QAAQ,IAEpB,aAAmB,YADpB,IAAI,YAAY,GAGd,IAAI,YAAY,EAAQ,QAAU,IAI5C,KAAM,aAAoB,cAExB,OADA,QAAQ,KAAK,8DACN,QAAQ,QAAQ,MAGzB,MAAM,EAAK,EAAgB,GAAiB,EAAe,CAAC,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,GACzE,EAAK,EAAgB,GAAoB,EAAe,CAAC,EAAG,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,EAAG,GAClF,EAAM,MAAM,QAAQ,IAAqC,IAAtB,EAAW,OAChD,CAAC,OAAO,EAAW,IAAK,OAAO,EAAW,IAAK,OAAO,EAAW,KACjE,CAAC,EAAG,EAAG,GAEL,EAAa,OAAO,KAAK,kBAEzB,EAAM,KAAK,gBAAgB,IAAI,IAAW,IAAI,IACpD,EAAI,IAAI,GACR,KAAK,gBAAgB,IAAI,EAAQ,GACjC,KAAK,eAAe,IAAI,EAAY,GAGpC,MAAM,EAAY,CAChB,KAAM,oBACN,UAAW,EACX,QAAS,GAAY,KACrB,WAAY,GAER,EAAiB,GAIvB,OAHI,GAAU,QAAQ,EAAe,KAAK,EAAS,QAC/C,GAAU,QAAQ,EAAe,KAAK,EAAS,QAE5C,KAAK,YAAY,EAAW,GAAgB,MAAM,IACvD,MAAM,EAAY,GAAK,SACvB,KAAM,aAAqB,eAAiB,EAAU,OAAS,EAC7D,MAAM,IAAI,MAAM,oEAGlB,MACM,EAAM,CACV,KAAM,sBACN,GAAI,EACJ,SACA,MALY,CAAE,KAAM,aAAc,OAAQ,CAAE,SAAU,IAMtD,MAAO,CAAE,EAAG,EAAI,EAAG,IAEf,EAAW,GAEjB,OADI,GAAW,QAAQ,EAAS,KAAK,EAAU,QACxC,KAAK,MAAM,EAAK,GAAU,UAAW,GAAW,IACtD,OAAO,IAER,MAAM,EAAO,KAAK,gBAAgB,IAAI,GAItC,OAHI,GAAM,EAAK,OAAO,GACtB,KAAK,eAAe,OAAO,GAC3B,QAAQ,KAAK,gCAAiC,GACvC,IAAI,GAEf,CAOA,mBAAA,EAAoB,OAAE,EAAM,MAAE,EAAK,cAAE,EAAa,cAAE,IAClD,IAAK,KAAK,YAAY,IAAI,GAExB,OADA,QAAQ,KAAK,uCAAuC,KAC7C,QAAQ,QAAQ,MAEzB,IAAK,GAA0B,iBAAV,EAEnB,OADA,QAAQ,KAAK,4DACN,QAAQ,QAAQ,MAGzB,MAAM,EAAK,EAAgB,GAAiB,EAAe,CAAC,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,GACzE,EAAK,EAAgB,GAAoB,EAAe,CAAC,EAAG,EAAG,EAAG,IAAM,CAAC,EAAG,EAAG,EAAG,GAClF,EAAa,OAAO,KAAK,kBAEzB,EAAM,KAAK,gBAAgB,IAAI,IAAW,IAAI,IACpD,EAAI,IAAI,GACR,KAAK,gBAAgB,IAAI,EAAQ,GACjC,KAAK,eAAe,IAAI,EAAY,GAEpC,MAAM,EAAM,CACV,KAAM,sBACN,GAAI,EACJ,SACA,QACA,MAAO,CAAE,EAAG,EAAI,EAAG,IAIrB,OADA,KAAK,MAAM,GACJ,CACT,CAKA,cAAA,EAAe,WAAE,IACf,MAAM,EAAS,KAAK,eAAe,IAAI,GACvC,IAAK,EAAQ,OACb,MAAM,EAAM,KAAK,gBAAgB,IAAI,GACjC,GAAK,EAAI,OAAO,GACpB,KAAK,eAAe,OAAO,GAE3B,KAAK,MAAM,CAAE,KAAM,iBAAkB,cACvC,CAKA,YAAA,EAAa,OAAE,IACb,IAAK,KAAK,YAAY,IAAI,GAAS,OACnC,MAAM,EAAM,KAAK,gBAAgB,IAAI,GACrC,GAAI,EACF,UAAW,KAAS,EAClB,KAAK,eAAe,OAAO,GAG/B,KAAK,gBAAgB,OAAO,GAC5B,KAAK,YAAY,OAAO,GACxB,KAAK,MAAM,CAAE,KAAM,eAAgB,GAAI,GACzC,CAKA,UAAA,EAAW,OAAE,EAAM,MAAE,EAAK,WAAE,EAAU,KAAE,KAAW,QAAE,KAAe,YAAE,KAAmB,aAAE,OACzF,IAAK,KAAK,YAAY,IAAI,GAExB,YADA,QAAQ,KAAK,8BAA8B,KAG7C,MAAM,EAAI,GAAiB,EAAO,CAAC,EAAG,EAAG,IACnC,EAAI,EAAa,GAAiB,EAAY,CAAC,EAAG,EAAG,WAC3D,KAAK,MAAM,CACT,KAAM,aACN,GAAI,EACJ,MAAO,EACP,MAAO,EACP,OAAQ,EACR,UAAW,EACX,cAAe,EACf,eAAgB,GAEpB,CAKA,WAAA,EAAY,OAAE,EAAM,OAAE,EAAM,YAAE,EAAW,KAAE,KAAW,QAAE,KAAe,YAAE,KAAmB,aAAE,OAC5F,IAAK,KAAK,YAAY,IAAI,GAExB,YADA,QAAQ,KAAK,+BAA+B,KAG9C,IAAK,MAAM,QAAQ,GAAS,OAC5B,MAAM,EAAK,EAAO,KAAI,GAAK,GAAiB,EAAG,CAAC,EAAG,EAAG,MAChD,EAAM,MAAM,QAAQ,GAAe,EAAY,KAAI,GAAK,EAAI,GAAiB,EAAG,CAAC,EAAG,EAAG,aAAmB,GAChH,KAAK,MAAM,CACT,KAAM,cACN,GAAI,EACJ,OAAQ,EACR,OAAQ,EACR,OAAQ,EACR,UAAW,EACX,cAAe,EACf,eAAgB,GAEpB,CAKA,WAAA,EAAY,OAAE,EAAM,OAAE,EAAM,KAAE,KAAW,QAAE,KAAe,aAAE,OAC1D,IAAK,KAAK,YAAY,IAAI,GAExB,YADA,QAAQ,KAAK,+BAA+B,KAG9C,MAAM,EAAI,GAAiB,EAAQ,CAAC,EAAG,EAAG,IAC1C,KAAK,MAAM,CACT,KAAM,cACN,GAAI,EACJ,OAAQ,EACR,OAAQ,EACR,UAAW,EACX,eAAgB,GAEpB,CAKA,YAAA,EAAa,OAAE,EAAM,QAAE,EAAO,KAAE,KAAW,QAAE,KAAe,aAAE,OAC5D,IAAK,KAAK,YAAY,IAAI,GAExB,YADA,QAAQ,KAAK,gCAAgC,KAG/C,IAAK,MAAM,QAAQ,GAAU,OAC7B,MAAM,EAAK,EAAQ,KAAI,GAAK,GAAiB,EAAG,CAAC,EAAG,EAAG,MACvD,KAAK,MAAM,CACT,KAAM,eACN,GAAI,EACJ,QAAS,EACT,OAAQ,EACR,UAAW,EACX,eAAgB,GAEpB,CAKA,UAAA,CAAW,GACT,KAAK,QAAU,GAAiB,GAChC,KAAK,MAAM,CAAE,KAAM,aAAc,QAAS,KAAK,SACjD,CASA,OAAA,EAAQ,OAAE,EAAM,SAAE,EAAQ,SAAE,EAAQ,KAAE,OACpC,IAAK,KAAK,YAAY,IAAI,GAExB,YADA,QAAQ,KAAK,2BAA2B,KAG1C,MAAM,EAAI,MAAC,EAA+C,GAAiB,EAAU,CAAC,EAAG,EAAG,IAAM,KAC5F,EAAI,MAAC,EAA+C,GAAoB,EAAU,CAAC,EAAG,EAAG,EAAG,IAAM,KAGxG,KAAK,MAAM,CAAE,KAAM,UAAW,GAAI,EAAQ,IAAG,IAAG,OAAQ,IAGxD,MAAM,EAAO,KAAK,YAAY,IAAI,GAC9B,IACE,IACF,EAAK,KAAK,EAAI,EAAE,QAChB,EAAK,QAAQ,EAAI,EAAE,QACf,EAAK,QAAQ,YAAY,EAAK,OAAO,SAAS,IAAI,EAAE,GAAI,EAAE,GAAI,EAAE,KAElE,IACF,EAAK,KAAK,EAAI,EAAE,QAChB,EAAK,QAAQ,EAAI,EAAE,QACf,EAAK,QAAQ,YAAY,EAAK,OAAO,WAAW,IAAI,EAAE,GAAI,EAAE,GAAI,EAAE,GAAI,EAAE,KAE1E,EAAK,QAAQ,aACX,EAAK,OAAO,eAAgB,EAAK,OAAO,uBAEtC,EAAK,OAAO,kBAA4B,EAAK,OAAO,oBACpD,EAAK,OAAO,uBAAiC,EAAK,OAAO,wBAIrE,CAKA,OAAA,EAAQ,OAAE,EAAM,UAAE,EAAS,OAAE,EAAS,IAAG,OAAE,IACzC,MAAM,EAAI,GAAiB,EAAQ,CAAC,EAAG,EAAG,IACpC,EAAI,GAAiB,EAAW,CAAC,KAAO,IAC9C,OAAO,KAAK,MAAM,CAAE,KAAM,UAAW,OAAQ,EAAG,UAAW,EAAG,SAAQ,OAAQ,GAAU,MAC1F,CAKA,KAAA,GAAU,KAAK,UAAgB,CAC/B,MAAA,GACO,KAAK,UACV,KAAK,WACL,KAAK,cAAgB,KACrB,KAAK,oBACP,CAKA,iBAAA,CAAkB,GAChB,KAAK,iBAAmB,KAAK,IAAI,EAAG,OAAO,IAAO,GACpD,CAMA,QAAA,CAAS,GACP,MAAM,EAA0B,iBAAd,EAAyB,EAAY,KAAK,QAC5D,OAAO,KAAK,MAAM,CAAE,KAAM,OAAQ,MACpC,CAOA,MAAA,GACE,IAAK,KAAK,cAAe,OAEzB,MAAM,EAAO,KAAK,YAAc,KAAK,cAC/B,EAAO,KAAK,cAEZ,EAAO,KACP,EAAK,EAAK,QAAU,EACpB,EAAK,EAAK,QAAU,EACpB,EAAQ,KAAK,IAAI,KAAO,EAAK,GACnC,IAAI,EAAQ,EAAM,UAAU,OAAO,EAAO,GAAM,EAAQ,EAAK,EAAK,KAAK,mBAEvE,EAAQ,EAAM,UAAU,MAAM,EAAO,EAAK,GAE1C,MAAM,EAAQ,IAAI,EAAM,WAClB,EAAQ,IAAI,EAAM,WAClB,EAAQ,IAAI,EAAM,WAExB,UAAY,EAAI,KAAS,KAAK,YAAY,UAAW,CACnD,MAAM,EAAK,EAAK,SAAS,GACnB,EAAK,EAAK,SAAS,GAEzB,IAAK,IAAO,EAAI,SAEhB,MAAM,EAAK,GAAI,GAAK,EAAK,QAAQ,EAC3B,EAAK,GAAI,GAAK,EAAK,QAAQ,EAC3B,EAAK,GAAI,GAAK,EAAK,QAAQ,EAC3B,EAAK,GAAI,GAAK,EAAK,QAAQ,EAE3B,EAAK,EAAM,UAAU,KAAK,EAAG,GAAI,EAAG,GAAI,GACxC,EAAK,EAAM,UAAU,KAAK,EAAG,GAAI,EAAG,GAAI,GACxC,EAAK,EAAM,UAAU,KAAK,EAAG,GAAI,EAAG,GAAI,GAE9C,EAAM,IAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAClC,EAAM,IAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAClC,EAAM,KAAK,GAAO,MAAM,EAAO,GAE3B,EAAK,QAAU,EAAK,OAAO,aAC7B,EAAK,OAAO,SAAS,IAAI,EAAI,EAAI,GACjC,EAAK,OAAO,WAAW,KAAK,GACxB,EAAK,OAAO,eAAgB,EAAK,OAAO,uBAEtC,EAAK,OAAO,kBACd,EAAK,OAAO,oBAEV,EAAK,OAAO,uBACd,EAAK,OAAO,wBAOlB,EAAK,KAAO,CAAE,EAAG,EAAG,QAAS,EAAG,EAAG,SACnC,EAAK,QAAU,CAAE,EAAG,EAAG,QAAS,EAAG,EAAG,QACxC,CACF,CAMA,OAAA,GACE,IAAM,KAAK,OAAO,WAAa,OAAa,CAC5C,IAAM,KAAK,cAAc,WAAa,OAAa,CACnD,KAAK,YAAY,QACjB,KAAK,gBAAgB,QACrB,KAAK,eAAe,QACpB,KAAK,SAAS,QACd,KAAK,WAAW,QAChB,KAAK,WAAa,KAClB,KAAK,cAAgB,IACvB,CAIA,iBAAA,GACM,KAAK,SACT,gBAAiB,KAAK,WAAW,KAAK,iBACxC,CAEA,OAAA,GACE,GAAI,KAAK,QAAS,OAElB,MAAM,EAAI,KACC,KAAK,IAAI,MAAW,EAAI,KAAK,eAAiB,KACzD,KAAK,cAAgB,EAGrB,KAAK,MAAM,CAAE,KAAM,OAAQ,GAAI,KAAK,UAGpC,KAAK,SAGL,KAAK,mBACP,CAEA,gBAAA,CAAiB,GACf,MAAM,EAAO,EAAG,MAAQ,GACxB,GAAI,EAAK,QAAT,CACE,MAAM,EAAU,KAAK,SAAS,IAAI,EAAK,SACnC,IACF,KAAK,SAAS,OAAO,EAAK,SACtB,EAAK,MACP,EAAQ,IAAM,EAAQ,IAAI,EAAK,OAAS,QAAQ,MAAM,wBAAyB,EAAK,OAEpF,EAAQ,KAAM,EAAQ,IAAI,EAAK,QAIrC,MAEA,OAAQ,EAAK,MACX,IAAK,QAEH,KAAK,WAAa,KAAK,cACvB,KAAK,cAAgB,EAAK,OAAS,KACnC,KAAK,MAAM,QAAS,KAAK,eACzB,MAEF,IAAK,QAEH,KAAK,MAAM,QAAS,EAAK,OAO/B,CAEA,mBAAA,GACM,KAAK,eACT,KAAK,aAAe,IAAI,GAA+B,CAAiB,GACxE,KAAK,aAAa,UAAY,KAAK,iBACnC,KAAK,aAAa,QAAW,IAC3B,QAAQ,MAAM,+BAAgC,GAAG,SAAW,IAEhE,CAEA,gBAAA,CAAiB,GACf,MAAM,EAAO,EAAG,MAAQ,GACxB,GAAI,EAAK,QAAS,CAChB,MAAM,EAAU,KAAK,eAAe,IAAI,EAAK,SACzC,IACF,KAAK,eAAe,OAAO,EAAK,SAC5B,EAAK,MACP,EAAQ,IAAM,EAAQ,IAAI,EAAK,OAAS,QAAQ,MAAM,+BAAgC,EAAK,OAE3F,EAAQ,KAAM,EAAQ,IAAI,EAAK,QAGrC,CACF,CAEA,WAAA,CAAY,EAAK,EAAW,IAC1B,KAAK,sBACL,MAAM,IAAO,KAAK,aACZ,EAAW,IAAK,EAAK,OAAQ,GAEnC,OADA,KAAK,aAAa,YAAY,EAAU,GACjC,IAAI,UAAS,EAAK,KACvB,KAAK,eAAe,IAAI,EAAI,CAAE,MAAK,OAAM,GAE7C,CAEA,KAAA,CAAM,EAAK,EAAW,IACpB,MAAM,IAAO,KAAK,OAGZ,EAAW,IAAK,EAAK,OAAQ,GAEnC,OADA,KAAK,OAAO,YAAY,EAAU,GAC3B,IAAI,UAAS,EAAK,KACvB,KAAK,SAAS,IAAI,EAAI,CAAE,MAAK,OAAM,GAIvC,CAGA,EAAA,CAAG,EAAM,GAGP,OAFK,KAAK,WAAW,IAAI,IAAO,KAAK,WAAW,IAAI,EAAM,IAAI,KAC9D,KAAK,WAAW,IAAI,GAAM,IAAI,GACvB,IAAM,KAAK,IAAI,EAAM,EAC9B,CACA,GAAA,CAAI,EAAM,GACR,MAAM,EAAM,KAAK,WAAW,IAAI,GAC5B,GAAK,EAAI,OAAO,EACtB,CACA,KAAA,CAAM,EAAM,GACV,MAAM,EAAM,KAAK,WAAW,IAAI,GAChC,GAAK,EACL,UAAW,KAAM,EACf,IAAM,EAAG,EAAU,OAAS,GAAK,QAAQ,MAAM,EAAI,CAEvD,GAAA,QAAA,WAAA,GAAA,QAAA,WAAA,GAAA,QAAA,2BAAA,GAAA,QAAA,qBAAA,GAAA,QAAA,mBAAA","file":"/npm/@jdultra/threedtiles@14.0.26/dist/threedtiles.cjs.js","sourceRoot":"","sourcesContent":["/**\n * Minified by jsDelivr using Terser v5.39.0.\n * Original file: /npm/@jdultra/threedtiles@14.0.26/dist/threedtiles.cjs.js\n *\n * Do NOT use SRI with dynamically generated files! More information: https://www.jsdelivr.com/using-sri-with-dynamic-files\n */\n","\r\n\r\nimport { Matrix3, Matrix4, Ray, Sphere, Vector3, Box3, BufferGeometry, LineSegments, LineBasicMaterial } from \"three\";\r\n\r\nconst tempMatrix = new Matrix3();\r\nconst tempVector3 = new Vector3();\r\nconst size = new Vector3();\r\nconst aabb = new Box3();\r\nconst matrix = new Matrix4();\r\nconst inverse = new Matrix4();\r\nconst localRay = new Ray();\r\n\r\nclass OBB {\r\n    /**\r\n     * Creates an oriented-bounding-box (OBB) from a 12-element numeric array.\r\n     *\r\n     * @param {number[]} values 12 numbers:  \r\n     * `[cx, cy, cz, e1x, e1y, e1z, e2x, e2y, e2z, e3x, e3y, e3z]` where  \r\n     * `center = (cx, cy, cz)` and `e1 e2 e3` are the local edge vectors.\r\n     * @constructor\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:0]{index=0}\r\n    */constructor(values) {\r\n        this.isOBB = true;\r\n        this.center = new Vector3(values[0], values[1], values[2]);\r\n        this.e1 = new Vector3(values[3], values[4], values[5]);\r\n        this.e2 = new Vector3(values[6], values[7], values[8]);\r\n        this.e3 = new Vector3(values[9], values[10], values[11]);\r\n\r\n        this.halfSize = new Vector3(this.e1.length(), this.e2.length(), this.e3.length());\r\n\r\n        this.e1.normalize();\r\n        // make e2 orthogonal to e1\r\n        const dot12 = this.e2.dot(this.e1);\r\n        this.e2.addScaledVector(this.e1, -dot12).normalize();\r\n        // e3 as cross to ensure orthonormal frame\r\n        this.e3.copy(this.e1).cross(this.e2);\r\n        if (this.e3.lengthSq() === 0) {\r\n            // fallback if inputs were collinear\r\n            this.e2.set(0, 1, 0);\r\n            if (Math.abs(this.e1.y) > 0.999) this.e2.set(1, 0, 0);\r\n            this.e2.addScaledVector(this.e1, -this.e2.dot(this.e1)).normalize();\r\n            this.e3.copy(this.e1).cross(this.e2);\r\n        } else {\r\n            this.e3.normalize();\r\n        }\r\n\r\n        this.rotationMatrix = new Matrix3();\r\n        this.rotationMatrix.set(\r\n            this.e1.x, this.e2.x, this.e3.x,\r\n            this.e1.y, this.e2.y, this.e3.y,\r\n            this.e1.z, this.e2.z, this.e3.z);\r\n    }\r\n\r\n    /**\r\n     * Copy all geometric properties from another {@link OBB}.\r\n     *\r\n     * @param {OBB} aObb Source OBB whose data will be copied.\r\n     * @returns {void}\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:1]{index=1}\r\n    */\r\n    copy(aObb) {\r\n        this.center.copy(aObb.center);\r\n        this.rotationMatrix.copy(aObb.rotationMatrix);\r\n        this.halfSize.copy(aObb.halfSize);\r\n        this.e1.copy(aObb.e1);\r\n        this.e2.copy(aObb.e2);\r\n        this.e3.copy(aObb.e3);\r\n    }\r\n\r\n    /**\r\n     * Get the full **size** (width, height, depth) of this OBB.\r\n     *\r\n     * @param {THREE.Vector3} result Pre-allocated vector that receives the size.\r\n     * @returns {THREE.Vector3} The same `result` instance for chaining.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:2]{index=2}\r\n     */\r\n    getSize(result) {\r\n\r\n        return result.copy(this.halfSize).multiplyScalar(2);\r\n\r\n    }\r\n\r\n    /**\r\n     * Apply an arbitrary affine transformation to this OBB.\r\n     *\r\n     * Scales, rotations (including non-uniform scale & reflection) and translations\r\n     * encoded in the 4×4 matrix are baked into `center`, `rotationMatrix`\r\n     * and `halfSize`.\r\n     *\r\n     * @param {THREE.Matrix4} matrix World-space transform to apply.\r\n     * @returns {OBB} This instance for chaining.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:3]{index=3}\r\n     */applyMatrix4(matrix) {\r\n        const e = matrix.elements;\r\n\r\n        let sx = tempVector3.set(e[0], e[1], e[2]).length();\r\n        let sy = tempVector3.set(e[4], e[5], e[6]).length();\r\n        let sz = tempVector3.set(e[8], e[9], e[10]).length();\r\n\r\n        tempMatrix.setFromMatrix4(matrix);\r\n\r\n        const invSX = sx !== 0 ? 1 / sx : 0;\r\n        const invSY = sy !== 0 ? 1 / sy : 0;\r\n        const invSZ = sz !== 0 ? 1 / sz : 0;\r\n\r\n        tempMatrix.elements[0] *= invSX;\r\n        tempMatrix.elements[1] *= invSX;\r\n        tempMatrix.elements[2] *= invSX;\r\n\r\n        tempMatrix.elements[3] *= invSY;\r\n        tempMatrix.elements[4] *= invSY;\r\n        tempMatrix.elements[5] *= invSY;\r\n\r\n        tempMatrix.elements[6] *= invSZ;\r\n        tempMatrix.elements[7] *= invSZ;\r\n        tempMatrix.elements[8] *= invSZ;\r\n\r\n        this.rotationMatrix.premultiply(tempMatrix);\r\n\r\n        this.halfSize.x *= Math.abs(sx);\r\n        this.halfSize.y *= Math.abs(sy);\r\n        this.halfSize.z *= Math.abs(sz);\r\n\r\n        this.center.applyMatrix4(matrix);\r\n        this.rotationMatrix.extractBasis(this.e1, this.e2, this.e3);\r\n        return this;\r\n    }\r\n\r\n    /**\r\n     * Compute the exact intersection point between a world-space ray and this OBB.\r\n     *\r\n     * @param {THREE.Ray} ray Ray expressed in world coordinates.\r\n     * @param {THREE.Vector3} result Vector that receives the intersection point.\r\n     * @returns {?THREE.Vector3} `result` with the hit point, or `null` if no hit.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:4]{index=4}\r\n     */intersectRay(ray, result) {\r\n\r\n        this.getSize(size);\r\n        aabb.setFromCenterAndSize(tempVector3.set(0, 0, 0), size);\r\n\r\n        const RT = tempMatrix.copy(this.rotationMatrix).transpose();\r\n\r\n        localRay.origin.copy(ray.origin).sub(this.center).applyMatrix3(RT);\r\n        localRay.direction.copy(ray.direction).applyMatrix3(RT).normalize();\r\n\r\n        if (localRay.intersectBox(aabb, result)) {\r\n            return result\r\n                .applyMatrix3(this.rotationMatrix)\r\n                .add(this.center);\r\n        } else {\r\n            return null;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Clamp a point to the surface or interior of the OBB (closest point query).\r\n     *\r\n     * @param {THREE.Vector3} point World-space point to be clamped.\r\n     * @param {THREE.Vector3} target Vector that will receive the clamped point.\r\n     * @returns {THREE.Vector3} The same `target` instance for chaining.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:5]{index=5}\r\n     */\r\n    clampPoint(point, target) {\r\n\r\n        // point → local coordinates of this OBB\r\n        tempVector3.copy(point).sub(this.center);\r\n\r\n        const lx = tempVector3.dot(this.e1);\r\n        const ly = tempVector3.dot(this.e2);\r\n        const lz = tempVector3.dot(this.e3);\r\n\r\n        // clamp each local coordinate to the half-extents\r\n        const cx = Math.max(- this.halfSize.x, Math.min(this.halfSize.x, lx));\r\n        const cy = Math.max(- this.halfSize.y, Math.min(this.halfSize.y, ly));\r\n        const cz = Math.max(- this.halfSize.z, Math.min(this.halfSize.z, lz));\r\n\r\n        // local → world\r\n        return target\r\n            .copy(this.center)\r\n            .addScaledVector(this.e1, cx)\r\n            .addScaledVector(this.e2, cy)\r\n            .addScaledVector(this.e3, cz);\r\n\r\n    }\r\n\r\n    /**\r\n     * Test whether a {@link THREE.Sphere} intersects or is contained by this OBB.\r\n     *\r\n     * @param {THREE.Sphere} sphere Sphere to test.\r\n     * @returns {boolean} `true` if the sphere overlaps the OBB.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:6]{index=6}\r\n     */\r\n    intersectsSphere(sphere) {\r\n\r\n        // get nearest point on the box to the sphere centre\r\n        this.clampPoint(sphere.center, tempVector3);\r\n\r\n        // inside sphere?\r\n        return tempVector3.distanceToSquared(sphere.center) <= sphere.radius * sphere.radius;\r\n\r\n    }\r\n\r\n    /**\r\n     * Separating-Axis-Theorem (SAT) intersection test between two OBBs.\r\n     *\r\n     * @param {OBB} other The second OBB.\r\n     * @param {number} [epsilon=Number.EPSILON] Numerical tolerance for stability.\r\n     * @returns {boolean} `true` if the two OBBs overlap.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:7]{index=7}\r\n     */\r\n    intersectsOBB(other, epsilon = Number.EPSILON) {\r\n\r\n        const uA = [this.e1, this.e2, this.e3];\r\n        const uB = [other.e1, other.e2, other.e3];\r\n        const aE = [this.halfSize.x, this.halfSize.y, this.halfSize.z];\r\n        const bE = [other.halfSize.x, other.halfSize.y, other.halfSize.z];\r\n\r\n        // rotation matrix & absolute value matrix\r\n        const R = [[0, 0, 0], [0, 0, 0], [0, 0, 0]];\r\n        const AbsR = [[0, 0, 0], [0, 0, 0], [0, 0, 0]];\r\n\r\n        for (let i = 0; i < 3; ++i) {\r\n            for (let j = 0; j < 3; ++j) {\r\n                R[i][j] = uA[i].dot(uB[j]);\r\n                AbsR[i][j] = Math.abs(R[i][j]) + epsilon;\r\n            }\r\n        }\r\n\r\n        // translation vector (world) → A-space\r\n        tempVector3.subVectors(other.center, this.center);\r\n        const t = [\r\n            tempVector3.dot(uA[0]),\r\n            tempVector3.dot(uA[1]),\r\n            tempVector3.dot(uA[2])\r\n        ];\r\n\r\n        let ra, rb;\r\n\r\n        // 3 face axes of A\r\n        for (let i = 0; i < 3; ++i) {\r\n            ra = aE[i];\r\n            rb = bE[0] * AbsR[i][0] + bE[1] * AbsR[i][1] + bE[2] * AbsR[i][2];\r\n            if (Math.abs(t[i]) > ra + rb) return false;\r\n        }\r\n\r\n        // 3 face axes of B\r\n        for (let i = 0; i < 3; ++i) {\r\n            ra = aE[0] * AbsR[0][i] + aE[1] * AbsR[1][i] + aE[2] * AbsR[2][i];\r\n            rb = bE[i];\r\n            if (Math.abs(t[0] * R[0][i] + t[1] * R[1][i] + t[2] * R[2][i]) > ra + rb) return false;\r\n        }\r\n\r\n        // 9 edge-cross-edge axes\r\n        ra = aE[1] * AbsR[2][0] + aE[2] * AbsR[1][0];\r\n        rb = bE[1] * AbsR[0][2] + bE[2] * AbsR[0][1];\r\n        if (Math.abs(t[2] * R[1][0] - t[1] * R[2][0]) > ra + rb) return false;\r\n\r\n        ra = aE[1] * AbsR[2][1] + aE[2] * AbsR[1][1];\r\n        rb = bE[0] * AbsR[0][2] + bE[2] * AbsR[0][0];\r\n        if (Math.abs(t[2] * R[1][1] - t[1] * R[2][1]) > ra + rb) return false;\r\n\r\n        ra = aE[1] * AbsR[2][2] + aE[2] * AbsR[1][2];\r\n        rb = bE[0] * AbsR[0][1] + bE[1] * AbsR[0][0];\r\n        if (Math.abs(t[2] * R[1][2] - t[1] * R[2][2]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[2][0] + aE[2] * AbsR[0][0];\r\n        rb = bE[1] * AbsR[1][2] + bE[2] * AbsR[1][1];\r\n        if (Math.abs(t[0] * R[2][0] - t[2] * R[0][0]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[2][1] + aE[2] * AbsR[0][1];\r\n        rb = bE[0] * AbsR[1][2] + bE[2] * AbsR[1][0];\r\n        if (Math.abs(t[0] * R[2][1] - t[2] * R[0][1]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[2][2] + aE[2] * AbsR[0][2];\r\n        rb = bE[0] * AbsR[1][1] + bE[1] * AbsR[1][0];\r\n        if (Math.abs(t[0] * R[2][2] - t[2] * R[0][2]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[1][0] + aE[1] * AbsR[0][0];\r\n        rb = bE[1] * AbsR[2][2] + bE[2] * AbsR[2][1];\r\n        if (Math.abs(t[1] * R[0][0] - t[0] * R[1][0]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[1][1] + aE[1] * AbsR[0][1];\r\n        rb = bE[0] * AbsR[2][2] + bE[2] * AbsR[2][0];\r\n        if (Math.abs(t[1] * R[0][1] - t[0] * R[1][1]) > ra + rb) return false;\r\n\r\n        ra = aE[0] * AbsR[1][2] + aE[1] * AbsR[0][2];\r\n        rb = bE[0] * AbsR[2][1] + bE[1] * AbsR[2][0];\r\n        if (Math.abs(t[1] * R[0][2] - t[0] * R[1][2]) > ra + rb) return false;\r\n\r\n        // no separating axis found → intersecting\r\n        return true;\r\n\r\n    }\r\n\r\n    /**\r\n     * Fast boolean ray-OBB intersection convenience method.\r\n     *\r\n     * @param {THREE.Ray} ray Ray expressed in world coordinates.\r\n     * @returns {boolean} `true` if the ray intersects the OBB.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:8]{index=8}\r\n     */\r\n    intersectsRay(ray) {\r\n\r\n        return this.intersectRay(ray, tempVector3) !== null;\r\n\r\n    }\r\n\r\n    /**\r\n     * Determine whether the OBB lies on the positive side of (or intersects) a plane.\r\n     *\r\n     * The plane is interpreted as **inside-facing** when its normal points toward\r\n     * the allowed half-space.\r\n     *\r\n     * @param {THREE.Plane} plane Plane used for the half-space test.\r\n     * @returns {boolean} `true` if any part of the OBB is inside or touching the plane.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:9]{index=9}\r\n     */insidePlane(plane) {\r\n        const n = plane.normal;\r\n        const nlen = n.length();\r\n        if (nlen === 0) return true;\r\n        const unit = tempVector3.copy(n).multiplyScalar(1 / nlen);\r\n        const r = this.halfSize.x * Math.abs(unit.dot(this.e1)) +\r\n                  this.halfSize.y * Math.abs(unit.dot(this.e2)) +\r\n                  this.halfSize.z * Math.abs(unit.dot(this.e3));\r\n        const d = n.dot(this.center) + plane.constant;\r\n        return d >= -r * nlen;\r\n    }\r\n\r\n    /**\r\n     * View-frustum culling test.\r\n     *\r\n     * @param {THREE.Frustum} frustum Frustum to test against.\r\n     * @returns {boolean} `true` if this OBB is at least partially inside the frustum.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:10]{index=10}\r\n     */\r\n    inFrustum(frustum) {\r\n\r\n        //this.rotationMatrix.extractBasis(this.e1, this.e2, this.e3);\r\n\r\n        for (let i = 0; i < 6; i++) {\r\n            const plane = frustum.planes[i];\r\n            const planeIntersection = this.insidePlane(plane);\r\n\r\n            if (!planeIntersection) {\r\n                return false;\r\n            }\r\n        }\r\n        return true;\r\n    }\r\n\r\n    /**\r\n     * Compute the shortest Euclidean distance from the OBB to a point.\r\n     *\r\n     * @param {THREE.Vector3} point Point in world coordinates.\r\n     * @returns {number} Distance (≥ 0). Zero indicates the point is inside.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:11]{index=11}\r\n     */distanceToPoint(point) {\r\n\r\n        tempVector3.copy(point);\r\n        tempVector3.sub(this.center);\r\n        const R_T = tempMatrix.copy(this.rotationMatrix).transpose();\r\n        tempVector3.applyMatrix3(R_T);\r\n\r\n        let dx = Math.max(0, Math.max(-this.halfSize.x - tempVector3.x, tempVector3.x - this.halfSize.x));\r\n        let dy = Math.max(0, Math.max(-this.halfSize.y - tempVector3.y, tempVector3.y - this.halfSize.y));\r\n        let dz = Math.max(0, Math.max(-this.halfSize.z - tempVector3.z, tempVector3.z - this.halfSize.z));\r\n        return Math.sqrt(dx * dx + dy * dy + dz * dz);\r\n    }\r\n\r\n    /**\r\n     * Create a red wire-frame visual helper for debugging purposes.\r\n     *\r\n     * @returns {THREE.LineSegments} A disposable wireframe object that\r\n     *          renders the eight corners and twelve edges of the OBB.\r\n     * @memberof OBB\r\n     * @see OBB implementation source :contentReference[oaicite:12]{index=12}\r\n     */\r\n    helper() {\r\n        const hs = this.halfSize;\r\n        const c = this.center;\r\n        const e1 = this.e1;\r\n        const e2 = this.e2;\r\n        const e3 = this.e3;\r\n\r\n        // Calculate all 8 corners\r\n        const corners = [\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(hs.x))\r\n                .add(e2.clone().multiplyScalar(hs.y))\r\n                .add(e3.clone().multiplyScalar(hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(-hs.x))\r\n                .add(e2.clone().multiplyScalar(hs.y))\r\n                .add(e3.clone().multiplyScalar(hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(-hs.x))\r\n                .add(e2.clone().multiplyScalar(-hs.y))\r\n                .add(e3.clone().multiplyScalar(hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(hs.x))\r\n                .add(e2.clone().multiplyScalar(-hs.y))\r\n                .add(e3.clone().multiplyScalar(hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(hs.x))\r\n                .add(e2.clone().multiplyScalar(hs.y))\r\n                .add(e3.clone().multiplyScalar(-hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(-hs.x))\r\n                .add(e2.clone().multiplyScalar(hs.y))\r\n                .add(e3.clone().multiplyScalar(-hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(-hs.x))\r\n                .add(e2.clone().multiplyScalar(-hs.y))\r\n                .add(e3.clone().multiplyScalar(-hs.z)),\r\n            new Vector3().copy(c)\r\n                .add(e1.clone().multiplyScalar(hs.x))\r\n                .add(e2.clone().multiplyScalar(-hs.y))\r\n                .add(e3.clone().multiplyScalar(-hs.z)),\r\n        ];\r\n\r\n        // Define the edges by connecting the corners\r\n        const edges = [\r\n            0, 1, 1, 2, 2, 3, 3, 0, // Top face\r\n            4, 5, 5, 6, 6, 7, 7, 4, // Bottom face\r\n            0, 4, 1, 5, 2, 6, 3, 7  // Side edges\r\n        ];\r\n\r\n        // Create geometry and add line segments\r\n        const geometry = new BufferGeometry().setFromPoints(corners);\r\n        geometry.setIndex(edges);\r\n        geometry.computeBoundingSphere();\r\n\r\n        // Create line material\r\n        const material = new LineBasicMaterial({ color: 0xff0000 });\r\n\r\n        // Create the wireframe mesh\r\n        const wireframe = new LineSegments(geometry, material);\r\n\r\n        wireframe.dispose = () => {\r\n            material.dispose();\r\n            geometry.dispose();\r\n        }\r\n        return wireframe;\r\n    }\r\n\r\n}\r\n\r\nexport { OBB };","/**\r\n * @copyright 2021 Aaron Zhao <yujianzhao2013@gmail.com>\r\n * @license MIT\r\n * Linked hash map data structure\r\n * @class LinkedHashMap\r\n */\r\nclass LinkedHashMap {\r\n    /**\r\n    * Creates a linked hash map instance\r\n    * @public\r\n    */\r\n    constructor() {\r\n        this._data = new Map();\r\n        this._link = new Map();\r\n        this._head = undefined;\r\n        this._tail = undefined;\r\n    }\r\n\r\n    /**\r\n    * Add or update an item to the list\r\n    * @public\r\n    * @param {any} key\r\n    * @param {any} item\r\n    * @param {boolean} head add to the head if true; tail otherwise\r\n    */\r\n    put(key, item, head = false) {\r\n        if (this.has(key)) {\r\n            this._data.set(key, item);\r\n            return;\r\n        }\r\n        this._data.set(key, item);\r\n        this._link.set(key, {\r\n            previous: undefined,\r\n            next: undefined\r\n        });\r\n        if (this._head == null) {\r\n            this._head = key;\r\n            this._tail = key;\r\n        } else if (head) {\r\n            this._link.get(this._head).previous = key;\r\n            this._link.get(key).next = this._head;\r\n            this._head = key;\r\n        } else {\r\n            this._link.get(this._tail).next = key;\r\n            this._link.get(key).previous = this._tail;\r\n            this._tail = key;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Returns the head key and item\r\n     * @public\r\n     * @returns {any} key, item, next(), previous()\r\n     */\r\n    head() {\r\n        return ({\r\n            key: this._head, value: this.get(this._head), next: () => this.next(this._head), previous: () => null\r\n        });\r\n    }\r\n\r\n    /**\r\n     * Returns the tail key and item\r\n     * @public\r\n     * @returns {any} key, item, next(), previous()\r\n     */\r\n    tail() {\r\n        return ({\r\n            key: this._tail, value: this.get(this._tail), next: () => null, previous: () => this.previous(this._tail)\r\n        });\r\n    }\r\n\r\n    /**\r\n     * Returns an item from the map by key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} item\r\n     */\r\n    get(key) {\r\n        return this._data.get(key);\r\n    }\r\n\r\n    /**\r\n     * Returns previous key item of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} key\r\n     */\r\n    previousKey(key) {\r\n        const link = this._link.get(key);\r\n        return link != null ? link.previous : undefined;\r\n    }\r\n\r\n    /**\r\n     * Returns previous item of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} item\r\n     */\r\n    previousValue(key) {\r\n        return this.get(this.previousKey(key));\r\n    }\r\n\r\n    /**\r\n     * Returns previous key, item of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} key, item, next(), previous()\r\n     */\r\n    previous(key) {\r\n        const prevKey = this.previousKey(key);\r\n        return ({\r\n            key: prevKey,\r\n            value: this.get(prevKey),\r\n            next: () => this.next(prevKey),\r\n            previous: () => this.previous(prevKey)\r\n        });\r\n    }\r\n\r\n    /**\r\n     * Returns next key of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} key\r\n     */\r\n    nextKey(key) {\r\n        const link = this._link.get(key);\r\n        return link != null ? link.next : undefined;\r\n    }\r\n\r\n    /**\r\n     * Returns next item of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} item\r\n     */\r\n    nextValue(key) {\r\n        return this.get(this.nextKey(key));\r\n    }\r\n\r\n    /**\r\n     * Returns next key, item of the key\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} key, item, next(), previous()\r\n     */\r\n    next(key) {\r\n        const nextKey = this.nextKey(key);\r\n        return ({\r\n            key: nextKey,\r\n            value: this.get(nextKey),\r\n            next: () => this.next(nextKey),\r\n            previous: () => this.previous(nextKey)\r\n        });\r\n    }\r\n\r\n    /**\r\n     * Removes and returns an item from the map\r\n     * @public\r\n     * @param {any} key\r\n     * @returns {any} item\r\n     */\r\n    remove(key) {\r\n        const item = this._data.get(key);\r\n        if (item != null) {\r\n            if (this.size() === 1) {\r\n                this.reset();\r\n            } else {\r\n                if (key === this._head) {\r\n                    const headLink = this._link.get(this._head);\r\n                    this._link.get(headLink.next).previous = null;\r\n                    this._head = headLink.next;\r\n                } else if (key === this._tail) {\r\n                    const tailLink = this._link.get(this._tail);\r\n                    this._link.get(tailLink.previous).next = null;\r\n                    this._tail = tailLink.previous;\r\n                } else {\r\n                    const cur = this._link.get(key);\r\n                    const prev = this._link.get(cur.previous);\r\n                    const nex = this._link.get(cur.next);\r\n                    prev.next = cur.next;\r\n                    nex.previous = cur.previous;\r\n                }\r\n                this._link.delete(key);\r\n                this._data.delete(key);\r\n            }\r\n        }\r\n        return item;\r\n    }\r\n\r\n    /**\r\n     * Return if the key exists in the map\r\n     * @public\r\n     * @param {any} key;\r\n     * @returns {boolean}\r\n     */\r\n    has(key) {\r\n        return this._data.has(key);\r\n    }\r\n\r\n    /**\r\n     * Returns the size of the map\r\n     * @public\r\n     * @returns {number}\r\n     */\r\n    size() {\r\n        return this._data.size;\r\n    }\r\n\r\n    /**\r\n     * Empties the map\r\n     * @public\r\n     */\r\n    reset() {\r\n        this._data.clear();\r\n        this._link.clear();\r\n        this._head = undefined;\r\n        this._tail = undefined;\r\n    }\r\n\r\n    /**\r\n     * Returns an iterator of keys\r\n     * @public\r\n     * @returns {Iterator[key]}\r\n     */\r\n    keys() {\r\n        return this._data.keys();\r\n    }\r\n\r\n    /**\r\n     * Returns an iterator of values\r\n     * @public\r\n     * @returns {Iterator[value]}\r\n     */\r\n    values() {\r\n        return this._data.values();\r\n    }\r\n\r\n    /**\r\n     * Returns an iterator of keys and values\r\n     * @public\r\n     * @returns {Iterator[key, value]}\r\n     */\r\n    entries() {\r\n        return this._data.entries();\r\n    }\r\n\r\n    /**\r\n     * Returns array representation of the map values\r\n     * @public\r\n     * @param {'orderByInsert' | 'orderByLink'} order return by inserting order (default) or link order\r\n     * @returns {Array<{key: any, value: any}>}\r\n     */\r\n    toArray(order = 'orderByInsert') {\r\n        if (order !== 'orderByInsert') {\r\n            const linkOrderArr = [];\r\n            let next = this._head;\r\n            while (next != null) {\r\n                linkOrderArr.push({ key: next, value: this.get(next) });\r\n                next = this.nextKey(next);\r\n            }\r\n            return linkOrderArr;\r\n        }\r\n        return Array.from(this.keys()).map((k) => ({ key: k, value: this.get(k) }));\r\n    }\r\n}\r\n\r\nexport { LinkedHashMap };\r\n","//\r\n// This class is taken straight from NASA-AMMOS library.\r\n// https://github.com/NASA-AMMOS/3DTilesRendererJS/blob/master/src/utilities/FeatureTable.js\r\n//\r\n\r\nconst utf8decoder = new TextDecoder();\r\nexport class FeatureTable {\r\n\r\n    constructor(buffer, start, headerLength, binLength) {\r\n\r\n        this.buffer = buffer;\r\n        this.binOffset = start + headerLength;\r\n        this.binLength = binLength;\r\n\r\n        let header = null;\r\n        if (headerLength !== 0) {\r\n\r\n            try {\r\n                const headerData = new Uint8Array(buffer, start, headerLength);\r\n                header = JSON.parse(utf8decoder.decode(headerData));\r\n              } catch (e) {\r\n                header = {};\r\n               }\r\n\r\n        } else {\r\n\r\n            header = {};\r\n\r\n        }\r\n        this.header = header;\r\n\r\n    }\r\n\r\n    getKeys() {\r\n\r\n        return Object.keys(this.header);\r\n\r\n    }\r\n\r\n    getData(key, count, defaultComponentType = null, defaultType = null) {\r\n\r\n        const header = this.header;\r\n\r\n        if (!(key in header)) {\r\n\r\n            return null;\r\n\r\n        }\r\n\r\n        const feature = header[key];\r\n        if (!(feature instanceof Object)) {\r\n\r\n            return feature;\r\n\r\n        } else if (Array.isArray(feature)) {\r\n\r\n            return feature;\r\n\r\n        } else {\r\n\r\n            const { buffer, binOffset, binLength } = this;\r\n            const byteOffset = feature.byteOffset || 0;\r\n            const featureType = feature.type || defaultType;\r\n            const featureComponentType = feature.componentType || defaultComponentType;\r\n\r\n            if ('type' in feature && defaultType && feature.type !== defaultType) {\r\n\r\n                throw new Error('FeatureTable: Specified type does not match expected type.');\r\n\r\n            }\r\n\r\n            let stride;\r\n            switch (featureType) {\r\n\r\n                case 'SCALAR':\r\n                    stride = 1;\r\n                    break;\r\n\r\n                case 'VEC2':\r\n                    stride = 2;\r\n                    break;\r\n\r\n                case 'VEC3':\r\n                    stride = 3;\r\n                    break;\r\n\r\n                case 'VEC4':\r\n                    stride = 4;\r\n                    break;\r\n\r\n                default:\r\n                    throw new Error(`FeatureTable : Feature type not provided for \"${key}\".`);\r\n\r\n            }\r\n\r\n            let data;\r\n            const arrayStart = binOffset + byteOffset;\r\n            const arrayLength = count * stride;\r\n\r\n            switch (featureComponentType) {\r\n\r\n                case 'BYTE':\r\n                    data = new Int8Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'UNSIGNED_BYTE':\r\n                    data = new Uint8Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'SHORT':\r\n                    data = new Int16Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'UNSIGNED_SHORT':\r\n                    data = new Uint16Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'INT':\r\n                    data = new Int32Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'UNSIGNED_INT':\r\n                    data = new Uint32Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'FLOAT':\r\n                    data = new Float32Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                case 'DOUBLE':\r\n                    data = new Float64Array(buffer, arrayStart, arrayLength);\r\n                    break;\r\n\r\n                default:\r\n                    throw new Error(`FeatureTable : Feature component type not provided for \"${key}\".`);\r\n\r\n            }\r\n\r\n            const dataEnd = arrayStart + arrayLength * data.BYTES_PER_ELEMENT;\r\n            if (dataEnd > binOffset + binLength) {\r\n\r\n                throw new Error('FeatureTable: Feature data read outside binary body length.');\r\n\r\n            }\r\n\r\n            return data;\r\n\r\n        }\r\n\r\n    }\r\n\r\n}\r\n\r\nexport class BatchTable extends FeatureTable {\r\n\r\n    constructor(buffer, batchSize, start, headerLength, binLength) {\r\n\r\n        super(buffer, start, headerLength, binLength);\r\n        this.batchSize = batchSize;\r\n\r\n    }\r\n\r\n    getData(key, componentType = null, type = null) {\r\n\r\n        return super.getData(key, this.batchSize, componentType, type);\r\n\r\n    }\r\n\r\n}\r\n","import {\n\tBufferAttribute,\n\tBufferGeometry,\n\tFloat32BufferAttribute,\n\tInstancedBufferAttribute,\n\tInterleavedBuffer,\n\tInterleavedBufferAttribute,\n\tTriangleFanDrawMode,\n\tTriangleStripDrawMode,\n\tTrianglesDrawMode,\n\tVector3,\n} from 'three';\n\n/**\n * @module BufferGeometryUtils\n * @three_import import * as BufferGeometryUtils from 'three/addons/utils/BufferGeometryUtils.js';\n */\n\n/**\n * Computes vertex tangents using the MikkTSpace algorithm. MikkTSpace generates the same tangents consistently,\n * and is used in most modelling tools and normal map bakers. Use MikkTSpace for materials with normal maps,\n * because inconsistent tangents may lead to subtle visual issues in the normal map, particularly around mirrored\n * UV seams.\n *\n * In comparison to this method, {@link BufferGeometry#computeTangents} (a custom algorithm) generates tangents that\n * probably will not match the tangents in other software. The custom algorithm is sufficient for general use with a\n * custom material, and may be faster than MikkTSpace.\n *\n * Returns the original BufferGeometry. Indexed geometries will be de-indexed. Requires position, normal, and uv attributes.\n *\n * @param {BufferGeometry} geometry - The geometry to compute tangents for.\n * @param {Object} MikkTSpace - Instance of `examples/jsm/libs/mikktspace.module.js`, or `mikktspace` npm package.\n * Await `MikkTSpace.ready` before use.\n * @param {boolean} [negateSign=true] - Whether to negate the sign component (.w) of each tangent.\n * Required for normal map conventions in some formats, including glTF.\n * @return {BufferGeometry} The updated geometry.\n */\nfunction computeMikkTSpaceTangents( geometry, MikkTSpace, negateSign = true ) {\n\n\tif ( ! MikkTSpace || ! MikkTSpace.isReady ) {\n\n\t\tthrow new Error( 'BufferGeometryUtils: Initialized MikkTSpace library required.' );\n\n\t}\n\n\tif ( ! geometry.hasAttribute( 'position' ) || ! geometry.hasAttribute( 'normal' ) || ! geometry.hasAttribute( 'uv' ) ) {\n\n\t\tthrow new Error( 'BufferGeometryUtils: Tangents require \"position\", \"normal\", and \"uv\" attributes.' );\n\n\t}\n\n\tfunction getAttributeArray( attribute ) {\n\n\t\tif ( attribute.normalized || attribute.isInterleavedBufferAttribute ) {\n\n\t\t\tconst dstArray = new Float32Array( attribute.count * attribute.itemSize );\n\n\t\t\tfor ( let i = 0, j = 0; i < attribute.count; i ++ ) {\n\n\t\t\t\tdstArray[ j ++ ] = attribute.getX( i );\n\t\t\t\tdstArray[ j ++ ] = attribute.getY( i );\n\n\t\t\t\tif ( attribute.itemSize > 2 ) {\n\n\t\t\t\t\tdstArray[ j ++ ] = attribute.getZ( i );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn dstArray;\n\n\t\t}\n\n\t\tif ( attribute.array instanceof Float32Array ) {\n\n\t\t\treturn attribute.array;\n\n\t\t}\n\n\t\treturn new Float32Array( attribute.array );\n\n\t}\n\n\t// MikkTSpace algorithm requires non-indexed input.\n\n\tconst _geometry = geometry.index ? geometry.toNonIndexed() : geometry;\n\n\t// Compute vertex tangents.\n\n\tconst tangents = MikkTSpace.generateTangents(\n\n\t\tgetAttributeArray( _geometry.attributes.position ),\n\t\tgetAttributeArray( _geometry.attributes.normal ),\n\t\tgetAttributeArray( _geometry.attributes.uv )\n\n\t);\n\n\t// Texture coordinate convention of glTF differs from the apparent\n\t// default of the MikkTSpace library; .w component must be flipped.\n\n\tif ( negateSign ) {\n\n\t\tfor ( let i = 3; i < tangents.length; i += 4 ) {\n\n\t\t\ttangents[ i ] *= - 1;\n\n\t\t}\n\n\t}\n\n\t//\n\n\t_geometry.setAttribute( 'tangent', new BufferAttribute( tangents, 4 ) );\n\n\tif ( geometry !== _geometry ) {\n\n\t\tgeometry.copy( _geometry );\n\n\t}\n\n\treturn geometry;\n\n}\n\n/**\n * Merges a set of geometries into a single instance. All geometries must have compatible attributes.\n *\n * @param {Array<BufferGeometry>} geometries - The geometries to merge.\n * @param {boolean} [useGroups=false] - Whether to use groups or not.\n * @return {?BufferGeometry} The merged geometry. Returns `null` if the merge does not succeed.\n */\nfunction mergeGeometries( geometries, useGroups = false ) {\n\n\tconst isIndexed = geometries[ 0 ].index !== null;\n\n\tconst attributesUsed = new Set( Object.keys( geometries[ 0 ].attributes ) );\n\tconst morphAttributesUsed = new Set( Object.keys( geometries[ 0 ].morphAttributes ) );\n\n\tconst attributes = {};\n\tconst morphAttributes = {};\n\n\tconst morphTargetsRelative = geometries[ 0 ].morphTargetsRelative;\n\n\tconst mergedGeometry = new BufferGeometry();\n\n\tlet offset = 0;\n\n\tfor ( let i = 0; i < geometries.length; ++ i ) {\n\n\t\tconst geometry = geometries[ i ];\n\t\tlet attributesCount = 0;\n\n\t\t// ensure that all geometries are indexed, or none\n\n\t\tif ( isIndexed !== ( geometry.index !== null ) ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. All geometries must have compatible attributes; make sure index attribute exists among all geometries, or in none of them.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\t// gather attributes, exit early if they're different\n\n\t\tfor ( const name in geometry.attributes ) {\n\n\t\t\tif ( ! attributesUsed.has( name ) ) {\n\n\t\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. All geometries must have compatible attributes; make sure \"' + name + '\" attribute exists among all geometries, or in none of them.' );\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t\tif ( attributes[ name ] === undefined ) attributes[ name ] = [];\n\n\t\t\tattributes[ name ].push( geometry.attributes[ name ] );\n\n\t\t\tattributesCount ++;\n\n\t\t}\n\n\t\t// ensure geometries have the same number of attributes\n\n\t\tif ( attributesCount !== attributesUsed.size ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. Make sure all geometries have the same number of attributes.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\t// gather morph attributes, exit early if they're different\n\n\t\tif ( morphTargetsRelative !== geometry.morphTargetsRelative ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. .morphTargetsRelative must be consistent throughout all geometries.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tfor ( const name in geometry.morphAttributes ) {\n\n\t\t\tif ( ! morphAttributesUsed.has( name ) ) {\n\n\t\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '.  .morphAttributes must be consistent throughout all geometries.' );\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t\tif ( morphAttributes[ name ] === undefined ) morphAttributes[ name ] = [];\n\n\t\t\tmorphAttributes[ name ].push( geometry.morphAttributes[ name ] );\n\n\t\t}\n\n\t\tif ( useGroups ) {\n\n\t\t\tlet count;\n\n\t\t\tif ( isIndexed ) {\n\n\t\t\t\tcount = geometry.index.count;\n\n\t\t\t} else if ( geometry.attributes.position !== undefined ) {\n\n\t\t\t\tcount = geometry.attributes.position.count;\n\n\t\t\t} else {\n\n\t\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed with geometry at index ' + i + '. The geometry must have either an index or a position attribute' );\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t\tmergedGeometry.addGroup( offset, count, i );\n\n\t\t\toffset += count;\n\n\t\t}\n\n\t}\n\n\t// merge indices\n\n\tif ( isIndexed ) {\n\n\t\tlet indexOffset = 0;\n\t\tconst mergedIndex = [];\n\n\t\tfor ( let i = 0; i < geometries.length; ++ i ) {\n\n\t\t\tconst index = geometries[ i ].index;\n\n\t\t\tfor ( let j = 0; j < index.count; ++ j ) {\n\n\t\t\t\tmergedIndex.push( index.getX( j ) + indexOffset );\n\n\t\t\t}\n\n\t\t\tindexOffset += geometries[ i ].attributes.position.count;\n\n\t\t}\n\n\t\tmergedGeometry.setIndex( mergedIndex );\n\n\t}\n\n\t// merge attributes\n\n\tfor ( const name in attributes ) {\n\n\t\tconst mergedAttribute = mergeAttributes( attributes[ name ] );\n\n\t\tif ( ! mergedAttribute ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the ' + name + ' attribute.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tmergedGeometry.setAttribute( name, mergedAttribute );\n\n\t}\n\n\t// merge morph attributes\n\n\tfor ( const name in morphAttributes ) {\n\n\t\tconst numMorphTargets = morphAttributes[ name ][ 0 ].length;\n\n\t\tif ( numMorphTargets === 0 ) break;\n\n\t\tmergedGeometry.morphAttributes = mergedGeometry.morphAttributes || {};\n\t\tmergedGeometry.morphAttributes[ name ] = [];\n\n\t\tfor ( let i = 0; i < numMorphTargets; ++ i ) {\n\n\t\t\tconst morphAttributesToMerge = [];\n\n\t\t\tfor ( let j = 0; j < morphAttributes[ name ].length; ++ j ) {\n\n\t\t\t\tmorphAttributesToMerge.push( morphAttributes[ name ][ j ][ i ] );\n\n\t\t\t}\n\n\t\t\tconst mergedMorphAttribute = mergeAttributes( morphAttributesToMerge );\n\n\t\t\tif ( ! mergedMorphAttribute ) {\n\n\t\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeGeometries() failed while trying to merge the ' + name + ' morphAttribute.' );\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t\tmergedGeometry.morphAttributes[ name ].push( mergedMorphAttribute );\n\n\t\t}\n\n\t}\n\n\treturn mergedGeometry;\n\n}\n\n/**\n * Merges a set of attributes into a single instance. All attributes must have compatible properties and types.\n * Instances of {@link InterleavedBufferAttribute} are not supported.\n *\n * @param {Array<BufferAttribute>} attributes - The attributes to merge.\n * @return {?BufferAttribute} The merged attribute. Returns `null` if the merge does not succeed.\n */\nfunction mergeAttributes( attributes ) {\n\n\tlet TypedArray;\n\tlet itemSize;\n\tlet normalized;\n\tlet gpuType = - 1;\n\tlet arrayLength = 0;\n\n\tfor ( let i = 0; i < attributes.length; ++ i ) {\n\n\t\tconst attribute = attributes[ i ];\n\n\t\tif ( TypedArray === undefined ) TypedArray = attribute.array.constructor;\n\t\tif ( TypedArray !== attribute.array.constructor ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.array must be of consistent array types across matching attributes.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tif ( itemSize === undefined ) itemSize = attribute.itemSize;\n\t\tif ( itemSize !== attribute.itemSize ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.itemSize must be consistent across matching attributes.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tif ( normalized === undefined ) normalized = attribute.normalized;\n\t\tif ( normalized !== attribute.normalized ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.normalized must be consistent across matching attributes.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tif ( gpuType === - 1 ) gpuType = attribute.gpuType;\n\t\tif ( gpuType !== attribute.gpuType ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils: .mergeAttributes() failed. BufferAttribute.gpuType must be consistent across matching attributes.' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tarrayLength += attribute.count * itemSize;\n\n\t}\n\n\tconst array = new TypedArray( arrayLength );\n\tconst result = new BufferAttribute( array, itemSize, normalized );\n\tlet offset = 0;\n\n\tfor ( let i = 0; i < attributes.length; ++ i ) {\n\n\t\tconst attribute = attributes[ i ];\n\t\tif ( attribute.isInterleavedBufferAttribute ) {\n\n\t\t\tconst tupleOffset = offset / itemSize;\n\t\t\tfor ( let j = 0, l = attribute.count; j < l; j ++ ) {\n\n\t\t\t\tfor ( let c = 0; c < itemSize; c ++ ) {\n\n\t\t\t\t\tconst value = attribute.getComponent( j, c );\n\t\t\t\t\tresult.setComponent( j + tupleOffset, c, value );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tarray.set( attribute.array, offset );\n\n\t\t}\n\n\t\toffset += attribute.count * itemSize;\n\n\t}\n\n\tif ( gpuType !== undefined ) {\n\n\t\tresult.gpuType = gpuType;\n\n\t}\n\n\treturn result;\n\n}\n\n/**\n * Performs a deep clone of the given buffer attribute.\n *\n * @param {BufferAttribute} attribute - The attribute to clone.\n * @return {BufferAttribute} The cloned attribute.\n */\nfunction deepCloneAttribute( attribute ) {\n\n\tif ( attribute.isInstancedInterleavedBufferAttribute || attribute.isInterleavedBufferAttribute ) {\n\n\t\treturn deinterleaveAttribute( attribute );\n\n\t}\n\n\tif ( attribute.isInstancedBufferAttribute ) {\n\n\t\treturn new InstancedBufferAttribute().copy( attribute );\n\n\t}\n\n\treturn new BufferAttribute().copy( attribute );\n\n}\n\n/**\n * Interleaves a set of attributes and returns a new array of corresponding attributes that share a\n * single {@link InterleavedBuffer} instance. All attributes must have compatible types.\n *\n * @param {Array<BufferAttribute>} attributes - The attributes to interleave.\n * @return {?Array<InterleavedBufferAttribute>} An array of interleaved attributes. If interleave does not succeed, the method returns `null`.\n */\nfunction interleaveAttributes( attributes ) {\n\n\t// Interleaves the provided attributes into an InterleavedBuffer and returns\n\t// a set of InterleavedBufferAttributes for each attribute\n\tlet TypedArray;\n\tlet arrayLength = 0;\n\tlet stride = 0;\n\n\t// calculate the length and type of the interleavedBuffer\n\tfor ( let i = 0, l = attributes.length; i < l; ++ i ) {\n\n\t\tconst attribute = attributes[ i ];\n\n\t\tif ( TypedArray === undefined ) TypedArray = attribute.array.constructor;\n\t\tif ( TypedArray !== attribute.array.constructor ) {\n\n\t\t\tconsole.error( 'AttributeBuffers of different types cannot be interleaved' );\n\t\t\treturn null;\n\n\t\t}\n\n\t\tarrayLength += attribute.array.length;\n\t\tstride += attribute.itemSize;\n\n\t}\n\n\t// Create the set of buffer attributes\n\tconst interleavedBuffer = new InterleavedBuffer( new TypedArray( arrayLength ), stride );\n\tlet offset = 0;\n\tconst res = [];\n\tconst getters = [ 'getX', 'getY', 'getZ', 'getW' ];\n\tconst setters = [ 'setX', 'setY', 'setZ', 'setW' ];\n\n\tfor ( let j = 0, l = attributes.length; j < l; j ++ ) {\n\n\t\tconst attribute = attributes[ j ];\n\t\tconst itemSize = attribute.itemSize;\n\t\tconst count = attribute.count;\n\t\tconst iba = new InterleavedBufferAttribute( interleavedBuffer, itemSize, offset, attribute.normalized );\n\t\tres.push( iba );\n\n\t\toffset += itemSize;\n\n\t\t// Move the data for each attribute into the new interleavedBuffer\n\t\t// at the appropriate offset\n\t\tfor ( let c = 0; c < count; c ++ ) {\n\n\t\t\tfor ( let k = 0; k < itemSize; k ++ ) {\n\n\t\t\t\tiba[ setters[ k ] ]( c, attribute[ getters[ k ] ]( c ) );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\treturn res;\n\n}\n\n/**\n * Returns a new, non-interleaved version of the given attribute.\n *\n * @param {InterleavedBufferAttribute} attribute - The interleaved attribute.\n * @return {BufferAttribute} The non-interleaved attribute.\n */\nfunction deinterleaveAttribute( attribute ) {\n\n\tconst cons = attribute.data.array.constructor;\n\tconst count = attribute.count;\n\tconst itemSize = attribute.itemSize;\n\tconst normalized = attribute.normalized;\n\n\tconst array = new cons( count * itemSize );\n\tlet newAttribute;\n\tif ( attribute.isInstancedInterleavedBufferAttribute ) {\n\n\t\tnewAttribute = new InstancedBufferAttribute( array, itemSize, normalized, attribute.meshPerAttribute );\n\n\t} else {\n\n\t\tnewAttribute = new BufferAttribute( array, itemSize, normalized );\n\n\t}\n\n\tfor ( let i = 0; i < count; i ++ ) {\n\n\t\tnewAttribute.setX( i, attribute.getX( i ) );\n\n\t\tif ( itemSize >= 2 ) {\n\n\t\t\tnewAttribute.setY( i, attribute.getY( i ) );\n\n\t\t}\n\n\t\tif ( itemSize >= 3 ) {\n\n\t\t\tnewAttribute.setZ( i, attribute.getZ( i ) );\n\n\t\t}\n\n\t\tif ( itemSize >= 4 ) {\n\n\t\t\tnewAttribute.setW( i, attribute.getW( i ) );\n\n\t\t}\n\n\t}\n\n\treturn newAttribute;\n\n}\n\n/**\n * Deinterleaves all attributes on the given geometry.\n *\n * @param {BufferGeometry} geometry - The geometry to deinterleave.\n */\nfunction deinterleaveGeometry( geometry ) {\n\n\tconst attributes = geometry.attributes;\n\tconst morphTargets = geometry.morphTargets;\n\tconst attrMap = new Map();\n\n\tfor ( const key in attributes ) {\n\n\t\tconst attr = attributes[ key ];\n\t\tif ( attr.isInterleavedBufferAttribute ) {\n\n\t\t\tif ( ! attrMap.has( attr ) ) {\n\n\t\t\t\tattrMap.set( attr, deinterleaveAttribute( attr ) );\n\n\t\t\t}\n\n\t\t\tattributes[ key ] = attrMap.get( attr );\n\n\t\t}\n\n\t}\n\n\tfor ( const key in morphTargets ) {\n\n\t\tconst attr = morphTargets[ key ];\n\t\tif ( attr.isInterleavedBufferAttribute ) {\n\n\t\t\tif ( ! attrMap.has( attr ) ) {\n\n\t\t\t\tattrMap.set( attr, deinterleaveAttribute( attr ) );\n\n\t\t\t}\n\n\t\t\tmorphTargets[ key ] = attrMap.get( attr );\n\n\t\t}\n\n\t}\n\n}\n\n/**\n * Returns the amount of bytes used by all attributes to represent the geometry.\n *\n * @param {BufferGeometry} geometry - The geometry.\n * @return {number} The estimate bytes used.\n */\nfunction estimateBytesUsed( geometry ) {\n\n\t// Return the estimated memory used by this geometry in bytes\n\t// Calculate using itemSize, count, and BYTES_PER_ELEMENT to account\n\t// for InterleavedBufferAttributes.\n\tlet mem = 0;\n\tfor ( const name in geometry.attributes ) {\n\n\t\tconst attr = geometry.getAttribute( name );\n\t\tmem += attr.count * attr.itemSize * attr.array.BYTES_PER_ELEMENT;\n\n\t}\n\n\tconst indices = geometry.getIndex();\n\tmem += indices ? indices.count * indices.itemSize * indices.array.BYTES_PER_ELEMENT : 0;\n\treturn mem;\n\n}\n\n/**\n * Returns a new geometry with vertices for which all similar vertex attributes (within tolerance) are merged.\n *\n * @param {BufferGeometry} geometry - The geometry to merge vertices for.\n * @param {number} [tolerance=1e-4] - The tolerance value.\n * @return {BufferGeometry} - The new geometry with merged vertices.\n */\nfunction mergeVertices( geometry, tolerance = 1e-4 ) {\n\n\ttolerance = Math.max( tolerance, Number.EPSILON );\n\n\t// Generate an index buffer if the geometry doesn't have one, or optimize it\n\t// if it's already available.\n\tconst hashToIndex = {};\n\tconst indices = geometry.getIndex();\n\tconst positions = geometry.getAttribute( 'position' );\n\tconst vertexCount = indices ? indices.count : positions.count;\n\n\t// next value for triangle indices\n\tlet nextIndex = 0;\n\n\t// attributes and new attribute arrays\n\tconst attributeNames = Object.keys( geometry.attributes );\n\tconst tmpAttributes = {};\n\tconst tmpMorphAttributes = {};\n\tconst newIndices = [];\n\tconst getters = [ 'getX', 'getY', 'getZ', 'getW' ];\n\tconst setters = [ 'setX', 'setY', 'setZ', 'setW' ];\n\n\t// Initialize the arrays, allocating space conservatively. Extra\n\t// space will be trimmed in the last step.\n\tfor ( let i = 0, l = attributeNames.length; i < l; i ++ ) {\n\n\t\tconst name = attributeNames[ i ];\n\t\tconst attr = geometry.attributes[ name ];\n\n\t\ttmpAttributes[ name ] = new attr.constructor(\n\t\t\tnew attr.array.constructor( attr.count * attr.itemSize ),\n\t\t\tattr.itemSize,\n\t\t\tattr.normalized\n\t\t);\n\n\t\tconst morphAttributes = geometry.morphAttributes[ name ];\n\t\tif ( morphAttributes ) {\n\n\t\t\tif ( ! tmpMorphAttributes[ name ] ) tmpMorphAttributes[ name ] = [];\n\t\t\tmorphAttributes.forEach( ( morphAttr, i ) => {\n\n\t\t\t\tconst array = new morphAttr.array.constructor( morphAttr.count * morphAttr.itemSize );\n\t\t\t\ttmpMorphAttributes[ name ][ i ] = new morphAttr.constructor( array, morphAttr.itemSize, morphAttr.normalized );\n\n\t\t\t} );\n\n\t\t}\n\n\t}\n\n\t// convert the error tolerance to an amount of decimal places to truncate to\n\tconst halfTolerance = tolerance * 0.5;\n\tconst exponent = Math.log10( 1 / tolerance );\n\tconst hashMultiplier = Math.pow( 10, exponent );\n\tconst hashAdditive = halfTolerance * hashMultiplier;\n\tfor ( let i = 0; i < vertexCount; i ++ ) {\n\n\t\tconst index = indices ? indices.getX( i ) : i;\n\n\t\t// Generate a hash for the vertex attributes at the current index 'i'\n\t\tlet hash = '';\n\t\tfor ( let j = 0, l = attributeNames.length; j < l; j ++ ) {\n\n\t\t\tconst name = attributeNames[ j ];\n\t\t\tconst attribute = geometry.getAttribute( name );\n\t\t\tconst itemSize = attribute.itemSize;\n\n\t\t\tfor ( let k = 0; k < itemSize; k ++ ) {\n\n\t\t\t\t// double tilde truncates the decimal value\n\t\t\t\thash += `${ ~ ~ ( attribute[ getters[ k ] ]( index ) * hashMultiplier + hashAdditive ) },`;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// Add another reference to the vertex if it's already\n\t\t// used by another index\n\t\tif ( hash in hashToIndex ) {\n\n\t\t\tnewIndices.push( hashToIndex[ hash ] );\n\n\t\t} else {\n\n\t\t\t// copy data to the new index in the temporary attributes\n\t\t\tfor ( let j = 0, l = attributeNames.length; j < l; j ++ ) {\n\n\t\t\t\tconst name = attributeNames[ j ];\n\t\t\t\tconst attribute = geometry.getAttribute( name );\n\t\t\t\tconst morphAttributes = geometry.morphAttributes[ name ];\n\t\t\t\tconst itemSize = attribute.itemSize;\n\t\t\t\tconst newArray = tmpAttributes[ name ];\n\t\t\t\tconst newMorphArrays = tmpMorphAttributes[ name ];\n\n\t\t\t\tfor ( let k = 0; k < itemSize; k ++ ) {\n\n\t\t\t\t\tconst getterFunc = getters[ k ];\n\t\t\t\t\tconst setterFunc = setters[ k ];\n\t\t\t\t\tnewArray[ setterFunc ]( nextIndex, attribute[ getterFunc ]( index ) );\n\n\t\t\t\t\tif ( morphAttributes ) {\n\n\t\t\t\t\t\tfor ( let m = 0, ml = morphAttributes.length; m < ml; m ++ ) {\n\n\t\t\t\t\t\t\tnewMorphArrays[ m ][ setterFunc ]( nextIndex, morphAttributes[ m ][ getterFunc ]( index ) );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\thashToIndex[ hash ] = nextIndex;\n\t\t\tnewIndices.push( nextIndex );\n\t\t\tnextIndex ++;\n\n\t\t}\n\n\t}\n\n\t// generate result BufferGeometry\n\tconst result = geometry.clone();\n\tfor ( const name in geometry.attributes ) {\n\n\t\tconst tmpAttribute = tmpAttributes[ name ];\n\n\t\tresult.setAttribute( name, new tmpAttribute.constructor(\n\t\t\ttmpAttribute.array.slice( 0, nextIndex * tmpAttribute.itemSize ),\n\t\t\ttmpAttribute.itemSize,\n\t\t\ttmpAttribute.normalized,\n\t\t) );\n\n\t\tif ( ! ( name in tmpMorphAttributes ) ) continue;\n\n\t\tfor ( let j = 0; j < tmpMorphAttributes[ name ].length; j ++ ) {\n\n\t\t\tconst tmpMorphAttribute = tmpMorphAttributes[ name ][ j ];\n\n\t\t\tresult.morphAttributes[ name ][ j ] = new tmpMorphAttribute.constructor(\n\t\t\t\ttmpMorphAttribute.array.slice( 0, nextIndex * tmpMorphAttribute.itemSize ),\n\t\t\t\ttmpMorphAttribute.itemSize,\n\t\t\t\ttmpMorphAttribute.normalized,\n\t\t\t);\n\n\t\t}\n\n\t}\n\n\t// indices\n\n\tresult.setIndex( newIndices );\n\n\treturn result;\n\n}\n\n/**\n * Returns a new indexed geometry based on `TrianglesDrawMode` draw mode.\n * This mode corresponds to the `gl.TRIANGLES` primitive in WebGL.\n *\n * @param {BufferGeometry} geometry - The geometry to convert.\n * @param {number} drawMode - The current draw mode.\n * @return {BufferGeometry} The new geometry using `TrianglesDrawMode`.\n */\nfunction toTrianglesDrawMode( geometry, drawMode ) {\n\n\tif ( drawMode === TrianglesDrawMode ) {\n\n\t\tconsole.warn( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Geometry already defined as triangles.' );\n\t\treturn geometry;\n\n\t}\n\n\tif ( drawMode === TriangleFanDrawMode || drawMode === TriangleStripDrawMode ) {\n\n\t\tlet index = geometry.getIndex();\n\n\t\t// generate index if not present\n\n\t\tif ( index === null ) {\n\n\t\t\tconst indices = [];\n\n\t\t\tconst position = geometry.getAttribute( 'position' );\n\n\t\t\tif ( position !== undefined ) {\n\n\t\t\t\tfor ( let i = 0; i < position.count; i ++ ) {\n\n\t\t\t\t\tindices.push( i );\n\n\t\t\t\t}\n\n\t\t\t\tgeometry.setIndex( indices );\n\t\t\t\tindex = geometry.getIndex();\n\n\t\t\t} else {\n\n\t\t\t\tconsole.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Undefined position attribute. Processing not possible.' );\n\t\t\t\treturn geometry;\n\n\t\t\t}\n\n\t\t}\n\n\t\t//\n\n\t\tconst numberOfTriangles = index.count - 2;\n\t\tconst newIndices = [];\n\n\t\tif ( drawMode === TriangleFanDrawMode ) {\n\n\t\t\t// gl.TRIANGLE_FAN\n\n\t\t\tfor ( let i = 1; i <= numberOfTriangles; i ++ ) {\n\n\t\t\t\tnewIndices.push( index.getX( 0 ) );\n\t\t\t\tnewIndices.push( index.getX( i ) );\n\t\t\t\tnewIndices.push( index.getX( i + 1 ) );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\t// gl.TRIANGLE_STRIP\n\n\t\t\tfor ( let i = 0; i < numberOfTriangles; i ++ ) {\n\n\t\t\t\tif ( i % 2 === 0 ) {\n\n\t\t\t\t\tnewIndices.push( index.getX( i ) );\n\t\t\t\t\tnewIndices.push( index.getX( i + 1 ) );\n\t\t\t\t\tnewIndices.push( index.getX( i + 2 ) );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tnewIndices.push( index.getX( i + 2 ) );\n\t\t\t\t\tnewIndices.push( index.getX( i + 1 ) );\n\t\t\t\t\tnewIndices.push( index.getX( i ) );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( ( newIndices.length / 3 ) !== numberOfTriangles ) {\n\n\t\t\tconsole.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unable to generate correct amount of triangles.' );\n\n\t\t}\n\n\t\t// build final geometry\n\n\t\tconst newGeometry = geometry.clone();\n\t\tnewGeometry.setIndex( newIndices );\n\t\tnewGeometry.clearGroups();\n\n\t\treturn newGeometry;\n\n\t} else {\n\n\t\tconsole.error( 'THREE.BufferGeometryUtils.toTrianglesDrawMode(): Unknown draw mode:', drawMode );\n\t\treturn geometry;\n\n\t}\n\n}\n\n/**\n * Calculates the morphed attributes of a morphed/skinned BufferGeometry.\n *\n * Helpful for Raytracing or Decals (i.e. a `DecalGeometry` applied to a morphed Object with a `BufferGeometry`\n * will use the original `BufferGeometry`, not the morphed/skinned one, generating an incorrect result.\n * Using this function to create a shadow `Object3`D the `DecalGeometry` can be correctly generated).\n *\n * @param {Mesh|Line|Points} object - The 3D object to compute morph attributes for.\n * @return {Object} An object with original position/normal attributes and morphed ones.\n */\nfunction computeMorphedAttributes( object ) {\n\n\tconst _vA = new Vector3();\n\tconst _vB = new Vector3();\n\tconst _vC = new Vector3();\n\n\tconst _tempA = new Vector3();\n\tconst _tempB = new Vector3();\n\tconst _tempC = new Vector3();\n\n\tconst _morphA = new Vector3();\n\tconst _morphB = new Vector3();\n\tconst _morphC = new Vector3();\n\n\tfunction _calculateMorphedAttributeData(\n\t\tobject,\n\t\tattribute,\n\t\tmorphAttribute,\n\t\tmorphTargetsRelative,\n\t\ta,\n\t\tb,\n\t\tc,\n\t\tmodifiedAttributeArray\n\t) {\n\n\t\t_vA.fromBufferAttribute( attribute, a );\n\t\t_vB.fromBufferAttribute( attribute, b );\n\t\t_vC.fromBufferAttribute( attribute, c );\n\n\t\tconst morphInfluences = object.morphTargetInfluences;\n\n\t\tif ( morphAttribute && morphInfluences ) {\n\n\t\t\t_morphA.set( 0, 0, 0 );\n\t\t\t_morphB.set( 0, 0, 0 );\n\t\t\t_morphC.set( 0, 0, 0 );\n\n\t\t\tfor ( let i = 0, il = morphAttribute.length; i < il; i ++ ) {\n\n\t\t\t\tconst influence = morphInfluences[ i ];\n\t\t\t\tconst morph = morphAttribute[ i ];\n\n\t\t\t\tif ( influence === 0 ) continue;\n\n\t\t\t\t_tempA.fromBufferAttribute( morph, a );\n\t\t\t\t_tempB.fromBufferAttribute( morph, b );\n\t\t\t\t_tempC.fromBufferAttribute( morph, c );\n\n\t\t\t\tif ( morphTargetsRelative ) {\n\n\t\t\t\t\t_morphA.addScaledVector( _tempA, influence );\n\t\t\t\t\t_morphB.addScaledVector( _tempB, influence );\n\t\t\t\t\t_morphC.addScaledVector( _tempC, influence );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t_morphA.addScaledVector( _tempA.sub( _vA ), influence );\n\t\t\t\t\t_morphB.addScaledVector( _tempB.sub( _vB ), influence );\n\t\t\t\t\t_morphC.addScaledVector( _tempC.sub( _vC ), influence );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\t_vA.add( _morphA );\n\t\t\t_vB.add( _morphB );\n\t\t\t_vC.add( _morphC );\n\n\t\t}\n\n\t\tif ( object.isSkinnedMesh ) {\n\n\t\t\tobject.applyBoneTransform( a, _vA );\n\t\t\tobject.applyBoneTransform( b, _vB );\n\t\t\tobject.applyBoneTransform( c, _vC );\n\n\t\t}\n\n\t\tmodifiedAttributeArray[ a * 3 + 0 ] = _vA.x;\n\t\tmodifiedAttributeArray[ a * 3 + 1 ] = _vA.y;\n\t\tmodifiedAttributeArray[ a * 3 + 2 ] = _vA.z;\n\t\tmodifiedAttributeArray[ b * 3 + 0 ] = _vB.x;\n\t\tmodifiedAttributeArray[ b * 3 + 1 ] = _vB.y;\n\t\tmodifiedAttributeArray[ b * 3 + 2 ] = _vB.z;\n\t\tmodifiedAttributeArray[ c * 3 + 0 ] = _vC.x;\n\t\tmodifiedAttributeArray[ c * 3 + 1 ] = _vC.y;\n\t\tmodifiedAttributeArray[ c * 3 + 2 ] = _vC.z;\n\n\t}\n\n\tconst geometry = object.geometry;\n\tconst material = object.material;\n\n\tlet a, b, c;\n\tconst index = geometry.index;\n\tconst positionAttribute = geometry.attributes.position;\n\tconst morphPosition = geometry.morphAttributes.position;\n\tconst morphTargetsRelative = geometry.morphTargetsRelative;\n\tconst normalAttribute = geometry.attributes.normal;\n\tconst morphNormal = geometry.morphAttributes.position;\n\n\tconst groups = geometry.groups;\n\tconst drawRange = geometry.drawRange;\n\tlet i, j, il, jl;\n\tlet group;\n\tlet start, end;\n\n\tconst modifiedPosition = new Float32Array( positionAttribute.count * positionAttribute.itemSize );\n\tconst modifiedNormal = new Float32Array( normalAttribute.count * normalAttribute.itemSize );\n\n\tif ( index !== null ) {\n\n\t\t// indexed buffer geometry\n\n\t\tif ( Array.isArray( material ) ) {\n\n\t\t\tfor ( i = 0, il = groups.length; i < il; i ++ ) {\n\n\t\t\t\tgroup = groups[ i ];\n\n\t\t\t\tstart = Math.max( group.start, drawRange.start );\n\t\t\t\tend = Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) );\n\n\t\t\t\tfor ( j = start, jl = end; j < jl; j += 3 ) {\n\n\t\t\t\t\ta = index.getX( j );\n\t\t\t\t\tb = index.getX( j + 1 );\n\t\t\t\t\tc = index.getX( j + 2 );\n\n\t\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tpositionAttribute,\n\t\t\t\t\t\tmorphPosition,\n\t\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\t\ta, b, c,\n\t\t\t\t\t\tmodifiedPosition\n\t\t\t\t\t);\n\n\t\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tnormalAttribute,\n\t\t\t\t\t\tmorphNormal,\n\t\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\t\ta, b, c,\n\t\t\t\t\t\tmodifiedNormal\n\t\t\t\t\t);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tstart = Math.max( 0, drawRange.start );\n\t\t\tend = Math.min( index.count, ( drawRange.start + drawRange.count ) );\n\n\t\t\tfor ( i = start, il = end; i < il; i += 3 ) {\n\n\t\t\t\ta = index.getX( i );\n\t\t\t\tb = index.getX( i + 1 );\n\t\t\t\tc = index.getX( i + 2 );\n\n\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\tobject,\n\t\t\t\t\tpositionAttribute,\n\t\t\t\t\tmorphPosition,\n\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\ta, b, c,\n\t\t\t\t\tmodifiedPosition\n\t\t\t\t);\n\n\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\tobject,\n\t\t\t\t\tnormalAttribute,\n\t\t\t\t\tmorphNormal,\n\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\ta, b, c,\n\t\t\t\t\tmodifiedNormal\n\t\t\t\t);\n\n\t\t\t}\n\n\t\t}\n\n\t} else {\n\n\t\t// non-indexed buffer geometry\n\n\t\tif ( Array.isArray( material ) ) {\n\n\t\t\tfor ( i = 0, il = groups.length; i < il; i ++ ) {\n\n\t\t\t\tgroup = groups[ i ];\n\n\t\t\t\tstart = Math.max( group.start, drawRange.start );\n\t\t\t\tend = Math.min( ( group.start + group.count ), ( drawRange.start + drawRange.count ) );\n\n\t\t\t\tfor ( j = start, jl = end; j < jl; j += 3 ) {\n\n\t\t\t\t\ta = j;\n\t\t\t\t\tb = j + 1;\n\t\t\t\t\tc = j + 2;\n\n\t\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tpositionAttribute,\n\t\t\t\t\t\tmorphPosition,\n\t\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\t\ta, b, c,\n\t\t\t\t\t\tmodifiedPosition\n\t\t\t\t\t);\n\n\t\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\t\tobject,\n\t\t\t\t\t\tnormalAttribute,\n\t\t\t\t\t\tmorphNormal,\n\t\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\t\ta, b, c,\n\t\t\t\t\t\tmodifiedNormal\n\t\t\t\t\t);\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tstart = Math.max( 0, drawRange.start );\n\t\t\tend = Math.min( positionAttribute.count, ( drawRange.start + drawRange.count ) );\n\n\t\t\tfor ( i = start, il = end; i < il; i += 3 ) {\n\n\t\t\t\ta = i;\n\t\t\t\tb = i + 1;\n\t\t\t\tc = i + 2;\n\n\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\tobject,\n\t\t\t\t\tpositionAttribute,\n\t\t\t\t\tmorphPosition,\n\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\ta, b, c,\n\t\t\t\t\tmodifiedPosition\n\t\t\t\t);\n\n\t\t\t\t_calculateMorphedAttributeData(\n\t\t\t\t\tobject,\n\t\t\t\t\tnormalAttribute,\n\t\t\t\t\tmorphNormal,\n\t\t\t\t\tmorphTargetsRelative,\n\t\t\t\t\ta, b, c,\n\t\t\t\t\tmodifiedNormal\n\t\t\t\t);\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\tconst morphedPositionAttribute = new Float32BufferAttribute( modifiedPosition, 3 );\n\tconst morphedNormalAttribute = new Float32BufferAttribute( modifiedNormal, 3 );\n\n\treturn {\n\n\t\tpositionAttribute: positionAttribute,\n\t\tnormalAttribute: normalAttribute,\n\t\tmorphedPositionAttribute: morphedPositionAttribute,\n\t\tmorphedNormalAttribute: morphedNormalAttribute\n\n\t};\n\n}\n\n/**\n * Merges the {@link BufferGeometry#groups} for the given geometry.\n *\n * @param {BufferGeometry} geometry - The geometry to modify.\n * @return {BufferGeometry} - The updated geometry\n */\nfunction mergeGroups( geometry ) {\n\n\tif ( geometry.groups.length === 0 ) {\n\n\t\tconsole.warn( 'THREE.BufferGeometryUtils.mergeGroups(): No groups are defined. Nothing to merge.' );\n\t\treturn geometry;\n\n\t}\n\n\tlet groups = geometry.groups;\n\n\t// sort groups by material index\n\n\tgroups = groups.sort( ( a, b ) => {\n\n\t\tif ( a.materialIndex !== b.materialIndex ) return a.materialIndex - b.materialIndex;\n\n\t\treturn a.start - b.start;\n\n\t} );\n\n\t// create index for non-indexed geometries\n\n\tif ( geometry.getIndex() === null ) {\n\n\t\tconst positionAttribute = geometry.getAttribute( 'position' );\n\t\tconst indices = [];\n\n\t\tfor ( let i = 0; i < positionAttribute.count; i += 3 ) {\n\n\t\t\tindices.push( i, i + 1, i + 2 );\n\n\t\t}\n\n\t\tgeometry.setIndex( indices );\n\n\t}\n\n\t// sort index\n\n\tconst index = geometry.getIndex();\n\n\tconst newIndices = [];\n\n\tfor ( let i = 0; i < groups.length; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\n\t\tconst groupStart = group.start;\n\t\tconst groupLength = groupStart + group.count;\n\n\t\tfor ( let j = groupStart; j < groupLength; j ++ ) {\n\n\t\t\tnewIndices.push( index.getX( j ) );\n\n\t\t}\n\n\t}\n\n\tgeometry.dispose(); // Required to force buffer recreation\n\tgeometry.setIndex( newIndices );\n\n\t// update groups indices\n\n\tlet start = 0;\n\n\tfor ( let i = 0; i < groups.length; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\n\t\tgroup.start = start;\n\t\tstart += group.count;\n\n\t}\n\n\t// merge groups\n\n\tlet currentGroup = groups[ 0 ];\n\n\tgeometry.groups = [ currentGroup ];\n\n\tfor ( let i = 1; i < groups.length; i ++ ) {\n\n\t\tconst group = groups[ i ];\n\n\t\tif ( currentGroup.materialIndex === group.materialIndex ) {\n\n\t\t\tcurrentGroup.count += group.count;\n\n\t\t} else {\n\n\t\t\tcurrentGroup = group;\n\t\t\tgeometry.groups.push( currentGroup );\n\n\t\t}\n\n\t}\n\n\treturn geometry;\n\n}\n\n/**\n * Modifies the supplied geometry if it is non-indexed, otherwise creates a new,\n * non-indexed geometry. Returns the geometry with smooth normals everywhere except\n * faces that meet at an angle greater than the crease angle.\n *\n * @param {BufferGeometry} geometry - The geometry to modify.\n * @param {number} [creaseAngle=Math.PI/3] - The crease angle in radians.\n * @return {BufferGeometry} - The updated geometry\n */\nfunction toCreasedNormals( geometry, creaseAngle = Math.PI / 3 /* 60 degrees */ ) {\n\n\tconst creaseDot = Math.cos( creaseAngle );\n\tconst hashMultiplier = ( 1 + 1e-10 ) * 1e2;\n\n\t// reusable vectors\n\tconst verts = [ new Vector3(), new Vector3(), new Vector3() ];\n\tconst tempVec1 = new Vector3();\n\tconst tempVec2 = new Vector3();\n\tconst tempNorm = new Vector3();\n\tconst tempNorm2 = new Vector3();\n\n\t// hashes a vector\n\tfunction hashVertex( v ) {\n\n\t\tconst x = ~ ~ ( v.x * hashMultiplier );\n\t\tconst y = ~ ~ ( v.y * hashMultiplier );\n\t\tconst z = ~ ~ ( v.z * hashMultiplier );\n\t\treturn `${x},${y},${z}`;\n\n\t}\n\n\t// BufferGeometry.toNonIndexed() warns if the geometry is non-indexed\n\t// and returns the original geometry\n\tconst resultGeometry = geometry.index ? geometry.toNonIndexed() : geometry;\n\tconst posAttr = resultGeometry.attributes.position;\n\tconst vertexMap = {};\n\n\t// find all the normals shared by commonly located vertices\n\tfor ( let i = 0, l = posAttr.count / 3; i < l; i ++ ) {\n\n\t\tconst i3 = 3 * i;\n\t\tconst a = verts[ 0 ].fromBufferAttribute( posAttr, i3 + 0 );\n\t\tconst b = verts[ 1 ].fromBufferAttribute( posAttr, i3 + 1 );\n\t\tconst c = verts[ 2 ].fromBufferAttribute( posAttr, i3 + 2 );\n\n\t\ttempVec1.subVectors( c, b );\n\t\ttempVec2.subVectors( a, b );\n\n\t\t// add the normal to the map for all vertices\n\t\tconst normal = new Vector3().crossVectors( tempVec1, tempVec2 ).normalize();\n\t\tfor ( let n = 0; n < 3; n ++ ) {\n\n\t\t\tconst vert = verts[ n ];\n\t\t\tconst hash = hashVertex( vert );\n\t\t\tif ( ! ( hash in vertexMap ) ) {\n\n\t\t\t\tvertexMap[ hash ] = [];\n\n\t\t\t}\n\n\t\t\tvertexMap[ hash ].push( normal );\n\n\t\t}\n\n\t}\n\n\t// average normals from all vertices that share a common location if they are within the\n\t// provided crease threshold\n\tconst normalArray = new Float32Array( posAttr.count * 3 );\n\tconst normAttr = new BufferAttribute( normalArray, 3, false );\n\tfor ( let i = 0, l = posAttr.count / 3; i < l; i ++ ) {\n\n\t\t// get the face normal for this vertex\n\t\tconst i3 = 3 * i;\n\t\tconst a = verts[ 0 ].fromBufferAttribute( posAttr, i3 + 0 );\n\t\tconst b = verts[ 1 ].fromBufferAttribute( posAttr, i3 + 1 );\n\t\tconst c = verts[ 2 ].fromBufferAttribute( posAttr, i3 + 2 );\n\n\t\ttempVec1.subVectors( c, b );\n\t\ttempVec2.subVectors( a, b );\n\n\t\ttempNorm.crossVectors( tempVec1, tempVec2 ).normalize();\n\n\t\t// average all normals that meet the threshold and set the normal value\n\t\tfor ( let n = 0; n < 3; n ++ ) {\n\n\t\t\tconst vert = verts[ n ];\n\t\t\tconst hash = hashVertex( vert );\n\t\t\tconst otherNormals = vertexMap[ hash ];\n\t\t\ttempNorm2.set( 0, 0, 0 );\n\n\t\t\tfor ( let k = 0, lk = otherNormals.length; k < lk; k ++ ) {\n\n\t\t\t\tconst otherNorm = otherNormals[ k ];\n\t\t\t\tif ( tempNorm.dot( otherNorm ) > creaseDot ) {\n\n\t\t\t\t\ttempNorm2.add( otherNorm );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\ttempNorm2.normalize();\n\t\t\tnormAttr.setXYZ( i3 + n, tempNorm2.x, tempNorm2.y, tempNorm2.z );\n\n\t\t}\n\n\t}\n\n\tresultGeometry.setAttribute( 'normal', normAttr );\n\treturn resultGeometry;\n\n}\n\nexport {\n\tcomputeMikkTSpaceTangents,\n\tmergeGeometries,\n\tmergeAttributes,\n\tdeepCloneAttribute,\n\tdeinterleaveAttribute,\n\tdeinterleaveGeometry,\n\tinterleaveAttributes,\n\testimateBytesUsed,\n\tmergeVertices,\n\ttoTrianglesDrawMode,\n\tcomputeMorphedAttributes,\n\tmergeGroups,\n\ttoCreasedNormals\n};\n","import * as THREE from 'three';\r\nimport { FeatureTable, BatchTable } from './FeatureTable';\r\nimport * as BufferGeometryUtils from 'three/addons/utils/BufferGeometryUtils.js';\r\n\r\n\r\n\r\n\r\nclass B3DMDecoder {\r\n\tconstructor(aGltfLoader) {\r\n\t\tthis.gltfLoader = aGltfLoader;\r\n\t\tthis.tempMatrix = new THREE.Matrix4();\r\n\r\n\t\tthis.zUpToYUpMatrix = new THREE.Matrix4();\r\n\t\tthis.zUpToYUpMatrix.set(\r\n\t\t\t1, 0, 0, 0,\r\n\t\t\t0, 0, -1, 0,\r\n\t\t\t0, 1, 0, 0,\r\n\t\t\t0, 0, 0, 1);\r\n\r\n\t}\r\n\r\n\tparseB3DM(arrayBuffer, meshCallback, sceneZupToYUp, meshZUpToYUp) {\r\n\t\tconst self = this;\r\n\t\tconst dataView = new DataView(arrayBuffer);\r\n\r\n\t\tconst magic =\r\n\t\t\tString.fromCharCode(dataView.getUint8(0)) +\r\n\t\t\tString.fromCharCode(dataView.getUint8(1)) +\r\n\t\t\tString.fromCharCode(dataView.getUint8(2)) +\r\n\t\t\tString.fromCharCode(dataView.getUint8(3));\r\n\t\tconsole.assert(magic === 'b3dm');\r\n\r\n\t\tconst byteLength = dataView.getUint32(8, true);\r\n\t\tconsole.assert(byteLength === arrayBuffer.byteLength);\r\n\r\n\t\tconst featureTableJSONByteLength = dataView.getUint32(12, true);\r\n\t\tconst featureTableBinaryByteLength = dataView.getUint32(16, true);\r\n\t\tconst batchTableJSONByteLength = dataView.getUint32(20, true);\r\n\t\tconst batchTableBinaryByteLength = dataView.getUint32(24, true);\r\n\r\n\t\tconst featureTableStart = 28;\r\n\t\tconst featureTable = new FeatureTable(arrayBuffer, featureTableStart, featureTableJSONByteLength, featureTableBinaryByteLength);\r\n\r\n\t\tconst batchTableStart = featureTableStart + featureTableJSONByteLength + featureTableBinaryByteLength;\r\n\t\tconst batchTable = new BatchTable(arrayBuffer, featureTable.getData('BATCH_LENGTH'), batchTableStart, batchTableJSONByteLength, batchTableBinaryByteLength);\r\n\r\n\t\tconst glbStart = batchTableStart + batchTableJSONByteLength + batchTableBinaryByteLength;\r\n\t\tconst glbBytes = new Uint8Array(arrayBuffer, glbStart, byteLength - glbStart);\r\n\r\n\r\n\t\tconst gltfBuffer = glbBytes.slice().buffer;\r\n\r\n\r\n\t\treturn new Promise(async (resolve, reject) => {\r\n\t\t\tawait this.checkLoaderInitialized();\r\n\t\t\tthis.gltfLoader.parse(gltfBuffer, null, model => {\r\n\t\t\t\tconst rtcCenter = featureTable.getData('RTC_CENTER');\r\n\t\t\t\tif (rtcCenter) {\r\n\t\t\t\t\tthis.tempMatrix.makeTranslation(rtcCenter[0], rtcCenter[1], rtcCenter[2])\r\n\t\t\t\t\tmodel.scene.applyMatrix4(this.tempMatrix);\r\n\t\t\t\t} else if (!!model.userData.gltfExtensions && !!model.userData.gltfExtensions.CESIUM_RTC) {\r\n\t\t\t\t\tthis.tempMatrix.makeTranslation(model.userData.gltfExtensions.CESIUM_RTC.center[0], model.userData.gltfExtensions.CESIUM_RTC.center[1], model.userData.gltfExtensions.CESIUM_RTC.center[2])\r\n\t\t\t\t\tmodel.scene.applyMatrix4(this.tempMatrix);\r\n\t\t\t\t}\r\n\r\n\t\t\t\tif (sceneZupToYUp) {\r\n\t\t\t\t\tmodel.scene.applyMatrix4(self.zUpToYUpMatrix);\r\n\t\t\t\t}\r\n\t\t\t\tmodel.scene.asset = model.asset;\r\n\t\t\t\tmodel.scene.traverse((o) => {\r\n\r\n\t\t\t\t\tif (o.isMesh) {\r\n\t\t\t\t\t\tif (meshZUpToYUp) {\r\n\t\t\t\t\t\t\to.applyMatrix4(self.zUpToYUpMatrix);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\tif (!!meshCallback) {\r\n\t\t\t\t\t\t\tmeshCallback(o);\r\n\t\t\t\t\t\t}\r\n\t\t\t\t\t\t\r\n\r\n\t\t\t\t\t}\r\n\t\t\t\t});\r\n\t\t\t\tresolve(model.scene);\r\n\t\t\t}, error => {\r\n\t\t\t\tconsole.error(error);\r\n\t\t\t});\r\n\t\t});\r\n\t}\r\n\r\n\tcheckLoaderInitialized = async () => {\r\n\t\treturn new Promise((resolve) => {\r\n\t\t\tconst interval = setInterval(() => {\r\n\t\t\t\tif ((!this.gltfLoader.hasDracoLoader || this.gltfLoader.dracoLoader) && (!this.gltfLoader.hasKTX2Loader || this.gltfLoader.ktx2Loader)) {\r\n\t\t\t\t\tclearInterval(interval);\r\n\t\t\t\t\tresolve();\r\n\t\t\t\t}\r\n\t\t\t}, 10); // check every 100ms\r\n\t\t});\r\n\t};\r\n\tparseB3DMInstanced(arrayBuffer, meshCallback, maxCount, sceneZupToYUp, meshZupToYup) { // expects GLTF with one node level\r\n\r\n\t\treturn this.parseB3DM(arrayBuffer, meshCallback, sceneZupToYUp, meshZupToYup).then(mesh => {\r\n\t\t\t// todo several meshes in a single gltf\r\n\t\t\tlet instancedMesh;\r\n\t\t\tlet geometries = [];\r\n\t\t\tlet materials = [];\r\n\t\t\tmesh.updateWorldMatrix(false, true)\r\n\t\t\tmesh.traverse(child => {\r\n\t\t\t\tif (child.isMesh) {\r\n\t\t\t\t\tchild.geometry.applyMatrix4(child.matrixWorld);\r\n\t\t\t\t\tgeometries.push(child.geometry);\r\n\t\t\t\t\tmaterials.push(child.material);\r\n\r\n\t\t\t\t}\r\n\t\t\t});\r\n\t\t\tlet mergedGeometry = normalizeAndMergeGeometries(geometries);\r\n\t\t\tinstancedMesh = new THREE.InstancedMesh(mergedGeometry, materials, maxCount);\r\n\t\t\tinstancedMesh.baseMatrix = new THREE.Matrix4().identity();\r\n\t\t\treturn instancedMesh;\r\n\t\t});\r\n\r\n\t}\r\n}\r\nexport { B3DMDecoder }\r\n\r\nfunction normalizeAndMergeGeometries(geometries) {\r\n\t// Identify all unique attributes across all geometries.\r\n\tlet allAttributes = new Set();\r\n\tgeometries.forEach(geometry => {\r\n\t\tfor (let attribute in geometry.attributes) {\r\n\t\t\tallAttributes.add(attribute);\r\n\t\t}\r\n\t});\r\n\r\n\t// Ensure every geometry has every attribute, adding default filled ones if necessary.\r\n\tgeometries.forEach(geometry => {\r\n\t\tallAttributes.forEach(attribute => {\r\n\t\t\tif (!geometry.attributes[attribute]) {\r\n\t\t\t\tconst attributeSize = getAttributeSize(attribute);\r\n\t\t\t\tconst buffer = new Float32Array(attributeSize * geometry.getAttribute('position').count).fill(0);\r\n\t\t\t\tgeometry.setAttribute(attribute, new THREE.BufferAttribute(buffer, attributeSize));\r\n\t\t\t}\r\n\t\t});\r\n\t});\r\n\r\n\t// Now merge the geometries.\r\n\tlet mergedGeometry = BufferGeometryUtils.mergeGeometries(geometries, true);\r\n\treturn mergedGeometry;\r\n}\r\n\r\nfunction getAttributeSize(attribute) {\r\n\tswitch (attribute) {\r\n\t\tcase 'position':\r\n\t\tcase 'normal':\r\n\t\tcase 'color':\r\n\t\t\treturn 3;\r\n\t\tcase 'uv':\r\n\t\tcase 'uv2':\r\n\t\t\treturn 2;\r\n\t\t// Add other attribute cases as needed.\r\n\t\tdefault:\r\n\t\t\tthrow new Error(`Unknown attribute ${attribute}`);\r\n\t}\r\n}\r\n\r\n","async function TI(R = {}) {\n  var DI;\n  var s, i = R, L = typeof window == \"object\", k = typeof WorkerGlobalScope < \"u\", f = typeof process == \"object\" && ((DI = process.versions) == null ? void 0 : DI.node) && process.type != \"renderer\";\n  if (f) {\n    const { createRequire: I } = await Promise.resolve().then(() => bI);\n    var r = I(import.meta.url);\n  }\n  var x = \"./this.program\", p = import.meta.url, $;\n  if (f) {\n    var wI = r(\"fs\");\n    p.startsWith(\"file:\") && r(\"path\").dirname(r(\"url\").fileURLToPath(p)), $ = (I) => (I = oI(I) ? new URL(I) : I, wI.readFileSync(I)), 1 < process.argv.length && (x = process.argv[1].replace(/\\\\/g, \"/\")), process.argv.slice(2);\n  } else if (L || k) {\n    try {\n      new URL(\".\", p);\n    } catch {\n    }\n    k && ($ = (I) => {\n      var A = new XMLHttpRequest();\n      return A.open(\"GET\", I, !1), A.responseType = \"arraybuffer\", A.send(null), new Uint8Array(A.response);\n    });\n  }\n  var qA = console.log.bind(console), _ = console.error.bind(console), GA, fA = !1, oI = (I) => I.startsWith(\"file://\"), AA, IA, gA, BA, c, O, P, W, a, eA, dA, lA, xA, WA = !1;\n  function ZA() {\n    var I = gA.buffer;\n    BA = new Int8Array(I), O = new Int16Array(I), i.HEAPU8 = c = new Uint8Array(I), P = new Uint16Array(I), W = new Int32Array(I), a = new Uint32Array(I), i.HEAPF32 = eA = new Float32Array(I), dA = new Float64Array(I), lA = new BigInt64Array(I), xA = new BigUint64Array(I);\n  }\n  var e = 0, u = null;\n  function jA(I) {\n    var A;\n    throw (A = i.onAbort) == null || A.call(i, I), I = \"Aborted(\" + I + \")\", _(I), fA = !0, I = new WebAssembly.RuntimeError(I + \". Build with -sASSERTIONS for more info.\"), IA == null || IA(I), I;\n  }\n  var RA;\n  async function FI(I) {\n    if (!ArrayBuffer.isView(I)) if (I == RA && GA) I = new Uint8Array(GA);\n    else if ($) I = $(I);\n    else throw \"both async and sync fetching of the wasm failed\";\n    return I;\n  }\n  async function GI(I) {\n    var A = RA;\n    try {\n      var g = await FI(A);\n      return await WebAssembly.instantiate(g, I);\n    } catch (B) {\n      _(`failed to asynchronously prepare wasm: ${B}`), jA(B);\n    }\n  }\n  async function RI(I) {\n    return GI(I);\n  }\n  var VA = (I) => {\n    for (; 0 < I.length; ) I.shift()(i);\n  }, XA = [], TA = [], sI = () => {\n    var I = i.preRun.shift();\n    TA.push(I);\n  }, yI = (I) => {\n    if (f) return I = Buffer.from(I, \"base64\"), new Uint8Array(I.buffer, I.byteOffset, I.length);\n    for (var A, g, B = 0, Q = 0, E = I.length, C = new Uint8Array((3 * E >> 2) - (I[E - 2] == \"=\") - (I[E - 1] == \"=\")); B < E; B += 4, Q += 3) A = t[I.charCodeAt(B + 1)], g = t[I.charCodeAt(B + 2)], C[Q] = t[I.charCodeAt(B)] << 2 | A >> 4, C[Q + 1] = A << 4 | g >> 2, C[Q + 2] = g << 6 | t[I.charCodeAt(B + 3)];\n    return C;\n  }, QA = {}, sA = (I) => {\n    for (; I.length; ) {\n      var A = I.pop();\n      I.pop()(A);\n    }\n  };\n  function m(I) {\n    return this.N(a[I >> 2]);\n  }\n  var Z = {}, d = {}, CA = {}, EA = class extends Error {\n    constructor(I) {\n      super(I), this.name = \"InternalError\";\n    }\n  }, l = (I, A, g) => {\n    function B(D) {\n      if (D = g(D), D.length !== I.length) throw new EA(\"Mismatched type converter count\");\n      for (var o = 0; o < I.length; ++o) J(I[o], D[o]);\n    }\n    I.forEach((D) => CA[D] = A);\n    var Q = Array(A.length), E = [], C = 0;\n    A.forEach((D, o) => {\n      d.hasOwnProperty(D) ? Q[o] = d[D] : (E.push(D), Z.hasOwnProperty(D) || (Z[D] = []), Z[D].push(() => {\n        Q[o] = d[D], ++C, C === E.length && B(Q);\n      }));\n    }), E.length === 0 && B(Q);\n  }, h = (I) => {\n    for (var A = \"\"; ; ) {\n      var g = c[I++];\n      if (!g) return A;\n      A += String.fromCharCode(g);\n    }\n  }, G = class extends Error {\n    constructor(I) {\n      super(I), this.name = \"BindingError\";\n    }\n  }, aI = (I) => {\n    throw new G(I);\n  };\n  function hI(I, A, g = {}) {\n    var B = A.name;\n    if (!I) throw new G(`type \"${B}\" must have a positive integer typeid pointer`);\n    if (d.hasOwnProperty(I)) {\n      if (g.wa) return;\n      throw new G(`Cannot register type '${B}' twice`);\n    }\n    d[I] = A, delete CA[I], Z.hasOwnProperty(I) && (A = Z[I], delete Z[I], A.forEach((Q) => Q()));\n  }\n  function J(I, A, g = {}) {\n    return hI(I, A, g);\n  }\n  var pA = (I, A, g) => {\n    switch (A) {\n      case 1:\n        return g ? (B) => BA[B] : (B) => c[B];\n      case 2:\n        return g ? (B) => O[B >> 1] : (B) => P[B >> 1];\n      case 4:\n        return g ? (B) => W[B >> 2] : (B) => a[B >> 2];\n      case 8:\n        return g ? (B) => lA[B >> 3] : (B) => xA[B >> 3];\n      default:\n        throw new TypeError(`invalid integer width (${A}): ${I}`);\n    }\n  }, yA = (I) => {\n    throw new G(I.L.P.M.name + \" instance already deleted\");\n  }, aA = !1, OA = () => {\n  }, b = (I) => typeof FinalizationRegistry > \"u\" ? (b = (A) => A, I) : (aA = new FinalizationRegistry((A) => {\n    A = A.L, --A.count.value, A.count.value === 0 && (A.S ? A.W.Y(A.S) : A.P.M.Y(A.O));\n  }), b = (A) => {\n    var g = A.L;\n    return g.S && aA.register(A, { L: g }, A), A;\n  }, OA = (A) => {\n    aA.unregister(A);\n  }, b(I));\n  function DA() {\n  }\n  var iA = (I, A) => Object.defineProperty(A, \"name\", { value: I }), PA = {}, uA = (I, A, g) => {\n    if (I[A].R === void 0) {\n      var B = I[A];\n      I[A] = function(...Q) {\n        if (!I[A].R.hasOwnProperty(Q.length)) throw new G(`Function '${g}' called with an invalid number of arguments (${Q.length}) - expects one of (${I[A].R})!`);\n        return I[A].R[Q.length].apply(this, Q);\n      }, I[A].R = [], I[A].R[B.aa] = B;\n    }\n  }, hA = (I, A, g) => {\n    if (i.hasOwnProperty(I)) {\n      if (g === void 0 || i[I].R !== void 0 && i[I].R[g] !== void 0) throw new G(`Cannot register public name '${I}' twice`);\n      if (uA(i, I, I), i[I].R.hasOwnProperty(g)) throw new G(`Cannot register multiple overloads of a function with the same number of arguments (${g})!`);\n      i[I].R[g] = A;\n    } else i[I] = A, i[I].aa = g;\n  }, MI = (I) => {\n    I = I.replace(/[^a-zA-Z0-9_]/g, \"$\");\n    var A = I.charCodeAt(0);\n    return 48 <= A && 57 >= A ? `_${I}` : I;\n  };\n  function NI(I, A, g, B, Q, E, C, D) {\n    this.name = I, this.constructor = A, this.$ = g, this.Y = B, this.U = Q, this.ra = E, this.ea = C, this.pa = D, this.ya = [];\n  }\n  var MA = (I, A, g) => {\n    for (; A !== g; ) {\n      if (!A.ea) throw new G(`Expected null or instance of ${g.name}, got an instance of ${A.name}`);\n      I = A.ea(I), A = A.U;\n    }\n    return I;\n  }, NA = (I) => {\n    if (I === null) return \"null\";\n    var A = typeof I;\n    return A === \"object\" || A === \"array\" || A === \"function\" ? I.toString() : \"\" + I;\n  };\n  function UI(I, A) {\n    if (A === null) {\n      if (this.ha) throw new G(`null is not a valid ${this.name}`);\n      return 0;\n    }\n    if (!A.L) throw new G(`Cannot pass \"${NA(A)}\" as a ${this.name}`);\n    if (!A.L.O) throw new G(`Cannot pass deleted object as a pointer of type ${this.name}`);\n    return MA(A.L.O, A.L.P.M, this.M);\n  }\n  function SI(I, A) {\n    if (A === null) {\n      if (this.ha) throw new G(`null is not a valid ${this.name}`);\n      if (this.ga) {\n        var g = this.ia();\n        return I !== null && I.push(this.Y, g), g;\n      }\n      return 0;\n    }\n    if (!A || !A.L) throw new G(`Cannot pass \"${NA(A)}\" as a ${this.name}`);\n    if (!A.L.O) throw new G(`Cannot pass deleted object as a pointer of type ${this.name}`);\n    if (!this.fa && A.L.P.fa) throw new G(`Cannot convert argument of type ${A.L.W ? A.L.W.name : A.L.P.name} to parameter type ${this.name}`);\n    if (g = MA(A.L.O, A.L.P.M, this.M), this.ga) {\n      if (A.L.S === void 0) throw new G(\"Passing raw pointer to smart pointer is illegal\");\n      switch (this.Da) {\n        case 0:\n          if (A.L.W === this) g = A.L.S;\n          else throw new G(`Cannot convert argument of type ${A.L.W ? A.L.W.name : A.L.P.name} to parameter type ${this.name}`);\n          break;\n        case 1:\n          g = A.L.S;\n          break;\n        case 2:\n          if (A.L.W === this) g = A.L.S;\n          else {\n            var B = A.clone();\n            g = this.za(g, LA(() => B.delete())), I !== null && I.push(this.Y, g);\n          }\n          break;\n        default:\n          throw new G(\"Unsupporting sharing policy\");\n      }\n    }\n    return g;\n  }\n  function JI(I, A) {\n    if (A === null) {\n      if (this.ha) throw new G(`null is not a valid ${this.name}`);\n      return 0;\n    }\n    if (!A.L) throw new G(`Cannot pass \"${NA(A)}\" as a ${this.name}`);\n    if (!A.L.O) throw new G(`Cannot pass deleted object as a pointer of type ${this.name}`);\n    if (A.L.P.fa) throw new G(`Cannot convert argument of type ${A.L.P.name} to parameter type ${this.name}`);\n    return MA(A.L.O, A.L.P.M, this.M);\n  }\n  var mA = (I, A, g) => A === g ? I : g.U === void 0 ? null : (I = mA(I, A, g.U), I === null ? null : g.pa(I)), YI = {}, LI = (I, A) => {\n    if (A === void 0) throw new G(\"ptr should not be undefined\");\n    for (; I.U; ) A = I.ea(A), I = I.U;\n    return YI[A];\n  }, wA = (I, A) => {\n    if (!A.P || !A.O) throw new EA(\"makeClassHandle requires ptr and ptrType\");\n    if (!!A.W != !!A.S) throw new EA(\"Both smartPtrType and smartPtr must be specified\");\n    return A.count = { value: 1 }, b(Object.create(I, { L: { value: A, writable: !0 } }));\n  };\n  function oA(I, A, g, B, Q, E, C, D, o, F, w) {\n    this.name = I, this.M = A, this.ha = g, this.fa = B, this.ga = Q, this.xa = E, this.Da = C, this.na = D, this.ia = o, this.za = F, this.Y = w, Q || A.U !== void 0 ? this.T = SI : (this.T = B ? UI : JI, this.V = null);\n  }\n  var bA = (I, A, g) => {\n    if (!i.hasOwnProperty(I)) throw new EA(\"Replacing nonexistent public symbol\");\n    i[I].R !== void 0 && g !== void 0 ? i[I].R[g] = A : (i[I] = A, i[I].aa = g);\n  }, zA, H = (I, A) => {\n    I = h(I);\n    var g = zA.get(A);\n    if (typeof g != \"function\") throw new G(`unknown function pointer with signature ${I}: ${A}`);\n    return g;\n  };\n  class kI extends Error {\n  }\n  var vA = (I) => {\n    I = EI(I);\n    var A = h(I);\n    return q(I), A;\n  }, FA = (I, A) => {\n    function g(E) {\n      Q[E] || d[E] || (CA[E] ? CA[E].forEach(g) : (B.push(E), Q[E] = !0));\n    }\n    var B = [], Q = {};\n    throw A.forEach(g), new kI(`${I}: ` + B.map(vA).join([\", \"]));\n  }, UA = (I, A) => {\n    for (var g = [], B = 0; B < I; B++) g.push(a[A + 4 * B >> 2]);\n    return g;\n  };\n  function $A(I) {\n    for (var A = 1; A < I.length; ++A) if (I[A] !== null && I[A].V === void 0) return !0;\n    return !1;\n  }\n  function SA(I, A, g, B, Q, E) {\n    var C = A.length;\n    if (2 > C) throw new G(\"argTypes array size mismatch! Must at least get return value and 'this' types!\");\n    var D = A[1] !== null && g !== null, o = $A(A);\n    g = !A[0].ma;\n    var F = A[0], w = A[1];\n    for (B = [I, aI, B, Q, sA, F.N.bind(F), w == null ? void 0 : w.T.bind(w)], Q = 2; Q < C; ++Q) F = A[Q], B.push(F.T.bind(F));\n    if (!o) for (Q = D ? 1 : 2; Q < A.length; ++Q) A[Q].V !== null && B.push(A[Q].V);\n    for (o = $A(A), Q = A.length - 2, w = [], F = [\"fn\"], D && F.push(\"thisWired\"), C = 0; C < Q; ++C) w.push(`arg${C}`), F.push(`arg${C}Wired`);\n    w = w.join(\",\"), F = F.join(\",\"), w = `return function (${w}) {\n`, o && (w += `var destructors = [];\n`);\n    var y = o ? \"destructors\" : \"null\", U = \"humanName throwBindingError invoker fn runDestructors fromRetWire toClassParamWire\".split(\" \");\n    for (D && (w += `var thisWired = toClassParamWire(${y}, this);\n`), C = 0; C < Q; ++C) {\n      var M = `toArg${C}Wire`;\n      w += `var arg${C}Wired = ${M}(${y}, arg${C});\n`, U.push(M);\n    }\n    if (w += (g || E ? \"var rv = \" : \"\") + `invoker(${F});\n`, o) w += `runDestructors(destructors);\n`;\n    else for (C = D ? 1 : 2; C < A.length; ++C) E = C === 1 ? \"thisWired\" : \"arg\" + (C - 2) + \"Wired\", A[C].V !== null && (w += `${E}_dtor(${E});\n`, U.push(`${E}_dtor`));\n    return g && (w += `var ret = fromRetWire(rv);\nreturn ret;\n`), A = new Function(U, w + `}\n`)(...B), iA(I, A);\n  }\n  for (var _A = (I) => {\n    I = I.trim();\n    const A = I.indexOf(\"(\");\n    return A === -1 ? I : I.slice(0, A);\n  }, AI = [], j = [0, 1, , 1, null, 1, !0, 1, !1, 1], JA = (I) => {\n    9 < I && --j[I + 1] === 0 && (j[I] = void 0, AI.push(I));\n  }, YA = (I) => {\n    if (!I) throw new G(`Cannot use deleted val. handle = ${I}`);\n    return j[I];\n  }, LA = (I) => {\n    switch (I) {\n      case void 0:\n        return 2;\n      case null:\n        return 4;\n      case !0:\n        return 6;\n      case !1:\n        return 8;\n      default:\n        const A = AI.pop() || j.length;\n        return j[A] = I, j[A + 1] = 1, A;\n    }\n  }, II = { name: \"emscripten::val\", N: (I) => {\n    var A = YA(I);\n    return JA(I), A;\n  }, T: (I, A) => LA(A), X: m, V: null }, cI = (I, A, g) => {\n    switch (A) {\n      case 1:\n        return g ? function(B) {\n          return this.N(BA[B]);\n        } : function(B) {\n          return this.N(c[B]);\n        };\n      case 2:\n        return g ? function(B) {\n          return this.N(O[B >> 1]);\n        } : function(B) {\n          return this.N(P[B >> 1]);\n        };\n      case 4:\n        return g ? function(B) {\n          return this.N(W[B >> 2]);\n        } : function(B) {\n          return this.N(a[B >> 2]);\n        };\n      default:\n        throw new TypeError(`invalid integer width (${A}): ${I}`);\n    }\n  }, gI = (I, A) => {\n    var g = d[I];\n    if (g === void 0) throw I = `${A} has unknown type ${vA(I)}`, new G(I);\n    return g;\n  }, HI = (I, A) => {\n    switch (A) {\n      case 4:\n        return function(g) {\n          return this.N(eA[g >> 2]);\n        };\n      case 8:\n        return function(g) {\n          return this.N(dA[g >> 3]);\n        };\n      default:\n        throw new TypeError(`invalid float width (${A}): ${I}`);\n    }\n  }, tI = Object.assign({ optional: !0 }, II), V = (I, A, g) => {\n    var B = c;\n    if (!(0 < g)) return 0;\n    var Q = A;\n    g = A + g - 1;\n    for (var E = 0; E < I.length; ++E) {\n      var C = I.codePointAt(E);\n      if (127 >= C) {\n        if (A >= g) break;\n        B[A++] = C;\n      } else if (2047 >= C) {\n        if (A + 1 >= g) break;\n        B[A++] = 192 | C >> 6, B[A++] = 128 | C & 63;\n      } else if (65535 >= C) {\n        if (A + 2 >= g) break;\n        B[A++] = 224 | C >> 12, B[A++] = 128 | C >> 6 & 63, B[A++] = 128 | C & 63;\n      } else {\n        if (A + 3 >= g) break;\n        B[A++] = 240 | C >> 18, B[A++] = 128 | C >> 12 & 63, B[A++] = 128 | C >> 6 & 63, B[A++] = 128 | C & 63, E++;\n      }\n    }\n    return B[A] = 0, A - Q;\n  }, BI = (I) => {\n    for (var A = 0, g = 0; g < I.length; ++g) {\n      var B = I.charCodeAt(g);\n      127 >= B ? A++ : 2047 >= B ? A += 2 : 55296 <= B && 57343 >= B ? (A += 4, ++g) : A += 3;\n    }\n    return A;\n  }, QI = new TextDecoder(), kA = (I, A, g, B) => {\n    if (g = A + g, B) return g;\n    for (; I[A] && !(A >= g); ) ++A;\n    return A;\n  }, KI = new TextDecoder(\"utf-16le\"), rI = (I, A, g) => (I >>= 1, KI.decode(P.subarray(I, kA(P, I, A / 2, g)))), nI = (I, A, g) => {\n    if (g ?? (g = 2147483647), 2 > g) return 0;\n    g -= 2;\n    var B = A;\n    g = g < 2 * I.length ? g / 2 : I.length;\n    for (var Q = 0; Q < g; ++Q) O[A >> 1] = I.charCodeAt(Q), A += 2;\n    return O[A >> 1] = 0, A - B;\n  }, qI = (I) => 2 * I.length, fI = (I, A, g) => {\n    var B = \"\";\n    I >>= 2;\n    for (var Q = 0; !(Q >= A / 4); Q++) {\n      var E = a[I + Q];\n      if (!E && !g) break;\n      B += String.fromCodePoint(E);\n    }\n    return B;\n  }, eI = (I, A, g) => {\n    if (g ?? (g = 2147483647), 4 > g) return 0;\n    var B = A;\n    g = B + g - 4;\n    for (var Q = 0; Q < I.length; ++Q) {\n      var E = I.codePointAt(Q);\n      if (65535 < E && Q++, W[A >> 2] = E, A += 4, A + 4 > g) break;\n    }\n    return W[A >> 2] = 0, A - B;\n  }, dI = (I) => {\n    for (var A = 0, g = 0; g < I.length; ++g) 65535 < I.codePointAt(g) && g++, A += 4;\n    return A;\n  }, cA = [], lI = (I) => {\n    var A = cA.length;\n    return cA.push(I), A;\n  }, xI = (I, A) => {\n    for (var g = Array(I), B = 0; B < I; ++B) g[B] = gI(a[A + 4 * B >> 2], `parameter ${B}`);\n    return g;\n  }, WI = (I, A, g) => {\n    var B = [];\n    return I = I(B, g), B.length && (a[A >> 2] = LA(B)), I;\n  }, ZI = {}, jI = (I) => {\n    var A = ZI[I];\n    return A === void 0 ? h(I) : A;\n  }, HA = {}, CI = () => {\n    if (!tA) {\n      var I = { USER: \"web_user\", LOGNAME: \"web_user\", PATH: \"/\", PWD: \"/\", HOME: \"/home/web_user\", LANG: (typeof navigator == \"object\" && navigator.language || \"C\").replace(\"-\", \"_\") + \".UTF-8\", _: x || \"./this.program\" }, A;\n      for (A in HA) HA[A] === void 0 ? delete I[A] : I[A] = HA[A];\n      var g = [];\n      for (A in I) g.push(`${A}=${I[A]}`);\n      tA = g;\n    }\n    return tA;\n  }, tA, VI = [null, [], []], t = new Uint8Array(123), n = 25; 0 <= n; --n) t[48 + n] = 52 + n, t[65 + n] = n, t[97 + n] = 26 + n;\n  t[43] = 62, t[47] = 63, (() => {\n    let I = DA.prototype;\n    Object.assign(I, { isAliasOf: function(g) {\n      if (!(this instanceof DA && g instanceof DA)) return !1;\n      var B = this.L.P.M, Q = this.L.O;\n      g.L = g.L;\n      var E = g.L.P.M;\n      for (g = g.L.O; B.U; ) Q = B.ea(Q), B = B.U;\n      for (; E.U; ) g = E.ea(g), E = E.U;\n      return B === E && Q === g;\n    }, clone: function() {\n      if (this.L.O || yA(this), this.L.da) return this.L.count.value += 1, this;\n      var g = b, B = Object, Q = B.create, E = Object.getPrototypeOf(this), C = this.L;\n      return g = g(Q.call(B, E, { L: { value: { count: C.count, ba: C.ba, da: C.da, O: C.O, P: C.P, S: C.S, W: C.W } } })), g.L.count.value += 1, g.L.ba = !1, g;\n    }, delete() {\n      if (this.L.O || yA(this), this.L.ba && !this.L.da) throw new G(\"Object already scheduled for deletion\");\n      OA(this);\n      var g = this.L;\n      --g.count.value, g.count.value === 0 && (g.S ? g.W.Y(g.S) : g.P.M.Y(g.O)), this.L.da || (this.L.S = void 0, this.L.O = void 0);\n    }, isDeleted: function() {\n      return !this.L.O;\n    }, deleteLater: function() {\n      if (this.L.O || yA(this), this.L.ba && !this.L.da) throw new G(\"Object already scheduled for deletion\");\n      return this.L.ba = !0, this;\n    } });\n    const A = Symbol.dispose;\n    A && (I[A] = I.delete);\n  })(), Object.assign(oA.prototype, { sa(I) {\n    return this.na && (I = this.na(I)), I;\n  }, ka(I) {\n    var A;\n    (A = this.Y) == null || A.call(this, I);\n  }, X: m, N: function(I) {\n    function A() {\n      return this.ga ? wA(this.M.$, { P: this.xa, O: g, W: this, S: I }) : wA(this.M.$, { P: this, O: I });\n    }\n    var g = this.sa(I);\n    if (!g) return this.ka(I), null;\n    var B = LI(this.M, g);\n    if (B !== void 0)\n      return B.L.count.value === 0 ? (B.L.O = g, B.L.S = I, B.clone()) : (B = B.clone(), this.ka(I), B);\n    if (B = this.M.ra(g), B = PA[B], !B) return A.call(this);\n    B = this.fa ? B.oa : B.pointerType;\n    var Q = mA(g, this.M, B.M);\n    return Q === null ? A.call(this) : this.ga ? wA(B.M.$, { P: B, O: Q, W: this, S: I }) : wA(B.M.$, { P: B, O: Q });\n  } }), i.print && (qA = i.print), i.printErr && (_ = i.printErr), i.wasmBinary && (GA = i.wasmBinary), i.thisProgram && (x = i.thisProgram);\n  var EI, KA, q, XI = { x: () => jA(\"\"), q: (I) => {\n    var A = QA[I];\n    delete QA[I];\n    var g = A.ia, B = A.Y, Q = A.la, E = Q.map((C) => C.va).concat(Q.map((C) => C.Ba));\n    l([I], E, (C) => {\n      var D = {};\n      return Q.forEach((o, F) => {\n        var w = C[F], y = o.ta, U = o.ua, M = C[F + Q.length], N = o.Aa, Y = o.Ca;\n        D[o.qa] = { read: (K) => w.N(y(U, K)), write: (K, z) => {\n          var S = [];\n          N(Y, K, M.T(S, z)), sA(S);\n        }, optional: C[F].optional };\n      }), [{ name: A.name, N: (o) => {\n        var F = {}, w;\n        for (w in D) F[w] = D[w].read(o);\n        return B(o), F;\n      }, T: (o, F) => {\n        for (var w in D) if (!(w in F || D[w].optional)) throw new TypeError(`Missing field: \"${w}\"`);\n        var y = g();\n        for (w in D) D[w].write(y, F[w]);\n        return o !== null && o.push(B, y), y;\n      }, X: m, V: B }];\n    });\n  }, n: (I, A, g, B, Q) => {\n    A = h(A), B = B === 0n;\n    let E = (C) => C;\n    if (B) {\n      const C = 8 * g;\n      E = (D) => BigInt.asUintN(C, D), Q = E(Q);\n    }\n    J(I, { name: A, N: E, T: (C, D) => (typeof D == \"number\" && (D = BigInt(D)), D), X: pA(A, g, !B), V: null });\n  }, B: (I, A, g, B) => {\n    A = h(A), J(I, { name: A, N: function(Q) {\n      return !!Q;\n    }, T: function(Q, E) {\n      return E ? g : B;\n    }, X: function(Q) {\n      return this.N(c[Q]);\n    }, V: null });\n  }, j: (I, A, g, B, Q, E, C, D, o, F, w, y, U) => {\n    w = h(w), E = H(Q, E), D && (D = H(C, D)), F && (F = H(o, F)), U = H(y, U);\n    var M = MI(w);\n    hA(M, function() {\n      FA(\n        `Cannot construct ${w} due to unbound types`,\n        [B]\n      );\n    }), l([I, A, g], B ? [B] : [], (N) => {\n      if (N = N[0], B)\n        var Y = N.M, K = Y.$;\n      else K = DA.prototype;\n      N = iA(w, function(...nA) {\n        if (Object.getPrototypeOf(this) !== z) throw new G(`Use 'new' to construct ${w}`);\n        if (S.Z === void 0) throw new G(`${w} has no accessible constructor`);\n        var iI = S.Z[nA.length];\n        if (iI === void 0) throw new G(`Tried to invoke ctor of ${w} with invalid number of parameters (${nA.length}) - expected (${Object.keys(S.Z).toString()}) parameters instead!`);\n        return iI.apply(this, nA);\n      });\n      var z = Object.create(K, { constructor: { value: N } });\n      N.prototype = z;\n      var S = new NI(w, N, z, U, Y, E, D, F);\n      if (S.U) {\n        var v;\n        (v = S.U).ja ?? (v.ja = []), S.U.ja.push(S);\n      }\n      return Y = new oA(w, S, !0, !1, !1), v = new oA(w + \"*\", S, !1, !1, !1), K = new oA(w + \" const*\", S, !1, !0, !1), PA[I] = { pointerType: v, oa: K }, bA(M, N), [Y, v, K];\n    });\n  }, g: (I, A, g, B, Q, E) => {\n    var C = UA(A, g);\n    Q = H(B, Q), l([], [I], (D) => {\n      D = D[0];\n      var o = `constructor ${D.name}`;\n      if (D.M.Z === void 0 && (D.M.Z = []), D.M.Z[A - 1] !== void 0) throw new G(`Cannot register multiple constructors with identical number of parameters (${A - 1}) for class '${D.name}'! Overload resolution is currently only performed using the parameter count, not actual type info!`);\n      return D.M.Z[A - 1] = () => {\n        FA(`Cannot construct ${D.name} due to unbound types`, C);\n      }, l([], C, (F) => (F.splice(1, 0, null), D.M.Z[A - 1] = SA(o, F, null, Q, E), [])), [];\n    });\n  }, b: (I, A, g, B, Q, E, C, D, o) => {\n    var F = UA(g, B);\n    A = h(A), A = _A(A), E = H(Q, E), l([], [I], (w) => {\n      function y() {\n        FA(`Cannot call ${U} due to unbound types`, F);\n      }\n      w = w[0];\n      var U = `${w.name}.${A}`;\n      A.startsWith(\"@@\") && (A = Symbol[A.substring(2)]), D && w.M.ya.push(A);\n      var M = w.M.$, N = M[A];\n      return N === void 0 || N.R === void 0 && N.className !== w.name && N.aa === g - 2 ? (y.aa = g - 2, y.className = w.name, M[A] = y) : (uA(\n        M,\n        A,\n        U\n      ), M[A].R[g - 2] = y), l([], F, (Y) => (Y = SA(U, Y, w, E, C, o), M[A].R === void 0 ? (Y.aa = g - 2, M[A] = Y) : M[A].R[g - 2] = Y, [])), [];\n    });\n  }, z: (I) => J(I, II), r: (I, A, g, B) => {\n    function Q() {\n    }\n    A = h(A), Q.values = {}, J(I, { name: A, constructor: Q, N: function(E) {\n      return this.constructor.values[E];\n    }, T: (E, C) => C.value, X: cI(A, g, B), V: null }), hA(A, Q);\n  }, d: (I, A, g) => {\n    var B = gI(I, \"enum\");\n    A = h(A), I = B.constructor, B = Object.create(B.constructor.prototype, { value: { value: g }, constructor: { value: iA(`${B.name}_${A}`, function() {\n    }) } }), I.values[g] = B, I[A] = B;\n  }, m: (I, A, g) => {\n    A = h(A), J(I, { name: A, N: (B) => B, T: (B, Q) => Q, X: HI(A, g), V: null });\n  }, l: (I, A, g, B, Q, E, C) => {\n    var D = UA(A, g);\n    I = h(I), I = _A(I), Q = H(B, Q), hA(I, function() {\n      FA(`Cannot call ${I} due to unbound types`, D);\n    }, A - 1), l([], D, (o) => (o = [o[0], null].concat(o.slice(1)), bA(I, SA(I, o, null, Q, E, C), A - 1), []));\n  }, c: (I, A, g, B, Q) => {\n    A = h(A);\n    let E = (D) => D;\n    if (B === 0) {\n      var C = 32 - 8 * g;\n      E = (D) => D << C >>> C, Q = E(Q);\n    }\n    J(I, { name: A, N: E, T: (D, o) => o, X: pA(A, g, B !== 0), V: null });\n  }, a: (I, A, g) => {\n    function B(E) {\n      return new Q(BA.buffer, a[E + 4 >> 2], a[E >> 2]);\n    }\n    var Q = [\n      Int8Array,\n      Uint8Array,\n      Int16Array,\n      Uint16Array,\n      Int32Array,\n      Uint32Array,\n      Float32Array,\n      Float64Array,\n      BigInt64Array,\n      BigUint64Array\n    ][A];\n    g = h(g), J(I, { name: g, N: B, X: B }, { wa: !0 });\n  }, h: (I) => {\n    J(I, tI);\n  }, A: (I, A) => {\n    A = h(A), J(I, { name: A, N(g) {\n      var B = (B = g + 4) ? QI.decode(c.subarray(B, kA(c, B, a[g >> 2], !0))) : \"\";\n      return q(g), B;\n    }, T(g, B) {\n      B instanceof ArrayBuffer && (B = new Uint8Array(B));\n      var Q = typeof B == \"string\";\n      if (!(Q || ArrayBuffer.isView(B) && B.BYTES_PER_ELEMENT == 1)) throw new G(\"Cannot pass non-string to std::string\");\n      var E = Q ? BI(B) : B.length, C = KA(4 + E + 1), D = C + 4;\n      return a[C >> 2] = E, Q ? V(B, D, E + 1) : c.set(B, D), g !== null && g.push(q, C), C;\n    }, X: m, V(g) {\n      q(g);\n    } });\n  }, f: (I, A, g) => {\n    if (g = h(g), A === 2)\n      var B = rI, Q = nI, E = qI;\n    else B = fI, Q = eI, E = dI;\n    J(I, { name: g, N: (C) => {\n      var D = B(C + 4, a[C >> 2] * A, !0);\n      return q(C), D;\n    }, T: (C, D) => {\n      if (typeof D != \"string\") throw new G(`Cannot pass non-string to C++ string type ${g}`);\n      var o = E(D), F = KA(4 + o + A);\n      return a[F >> 2] = o / A, Q(D, F + 4, o + A), C !== null && C.push(q, F), F;\n    }, X: m, V(C) {\n      q(C);\n    } });\n  }, i: (I, A, g, B, Q, E) => {\n    QA[I] = { name: h(A), ia: H(g, B), Y: H(Q, E), la: [] };\n  }, e: (I, A, g, B, Q, E, C, D, o, F) => {\n    QA[I].la.push({\n      qa: h(A),\n      va: g,\n      ta: H(B, Q),\n      ua: E,\n      Ba: C,\n      Aa: H(D, o),\n      Ca: F\n    });\n  }, C: (I, A) => {\n    A = h(A), J(I, { ma: !0, name: A, N: () => {\n    }, T: () => {\n    } });\n  }, p: (I, A, g) => {\n    var [B, ...Q] = xI(I, A);\n    A = B.T.bind(B);\n    var E = Q.map((o) => o.X.bind(o));\n    I--;\n    var C = { toValue: YA };\n    switch (I = E.map((o, F) => {\n      var w = `argFromPtr${F}`;\n      return C[w] = o, `${w}(args${F ? \"+\" + 8 * F : \"\"})`;\n    }), g) {\n      case 0:\n        var D = \"toValue(handle)\";\n        break;\n      case 2:\n        D = \"new (toValue(handle))\";\n        break;\n      case 3:\n        D = \"\";\n        break;\n      case 1:\n        C.getStringOrSymbol = jI, D = \"toValue(handle)[getStringOrSymbol(methodName)]\";\n    }\n    return D += `(${I})`, B.ma || (C.toReturnWire = A, C.emval_returnValue = WI, D = `return emval_returnValue(toReturnWire, destructorsRef, ${D})`), D = `return function (handle, methodName, destructorsRef, args) {\n  ${D}\n  }`, g = new Function(Object.keys(C), D)(...Object.values(C)), D = `methodCaller<(${Q.map((o) => o.name)}) => ${B.name}>`, lI(iA(D, g));\n  }, E: JA, o: (I, A, g, B, Q) => cA[I](A, g, B, Q), D: (I) => {\n    var A = YA(I);\n    sA(A), JA(I);\n  }, s: (I, A, g, B) => {\n    var Q = (/* @__PURE__ */ new Date()).getFullYear(), E = new Date(Q, 0, 1).getTimezoneOffset();\n    Q = new Date(Q, 6, 1).getTimezoneOffset(), a[I >> 2] = 60 * Math.max(E, Q), W[A >> 2] = +(E != Q), A = (C) => {\n      var D = Math.abs(C);\n      return `UTC${0 <= C ? \"-\" : \"+\"}${String(Math.floor(D / 60)).padStart(2, \"0\")}${String(D % 60).padStart(2, \"0\")}`;\n    }, I = A(E), A = A(Q), Q < E ? (V(I, g, 17), V(A, B, 17)) : (V(I, B, 17), V(A, g, 17));\n  }, y: (I) => {\n    var A = c.length;\n    if (I >>>= 0, 2147483648 < I) return !1;\n    for (var g = 1; 4 >= g; g *= 2) {\n      var B = A * (1 + 0.2 / g);\n      B = Math.min(B, I + 100663296);\n      A: {\n        B = (Math.min(2147483648, 65536 * Math.ceil(Math.max(I, B) / 65536)) - gA.buffer.byteLength + 65535) / 65536 | 0;\n        try {\n          gA.grow(B), ZA();\n          var Q = 1;\n          break A;\n        } catch {\n        }\n        Q = void 0;\n      }\n      if (Q) return !0;\n    }\n    return !1;\n  }, t: (I, A) => {\n    var g = 0, B = 0, Q;\n    for (Q of CI()) {\n      var E = A + g;\n      a[I + B >> 2] = E, g += V(Q, E, 1 / 0) + 1, B += 4;\n    }\n    return 0;\n  }, u: (I, A) => {\n    var g = CI();\n    a[I >> 2] = g.length, I = 0;\n    for (var B of g) I += BI(B) + 1;\n    return a[A >> 2] = I, 0;\n  }, v: () => 52, w: function() {\n    return 70;\n  }, k: (I, A, g, B) => {\n    for (var Q = 0, E = 0; E < g; E++) {\n      var C = a[A >> 2], D = a[A + 4 >> 2];\n      A += 8;\n      for (var o = 0; o < D; o++) {\n        var F = I, w = c[C + o], y = VI[F];\n        w === 0 || w === 10 ? (F = F === 1 ? qA : _, w = kA(y, 0), w = QI.decode(y.buffer ? y.subarray(0, w) : new Uint8Array(y.slice(0, w))), F(w), y.length = 0) : y.push(w);\n      }\n      Q += D;\n    }\n    return a[B >> 2] = Q, 0;\n  } }, X = await async function() {\n    var g;\n    function I(B) {\n      var Q;\n      return X = B.exports, gA = X.F, ZA(), zA = X.H, B = X, EI = B.I, i._malloc = KA = B.J, i._free = q = B.K, e--, (Q = i.monitorRunDependencies) == null || Q.call(i, e), e == 0 && u && (B = u, u = null, B()), X;\n    }\n    e++, (g = i.monitorRunDependencies) == null || g.call(i, e);\n    var A = { a: XI };\n    return i.instantiateWasm ? new Promise((B) => {\n      i.instantiateWasm(A, (Q, E) => {\n        B(I(Q));\n      });\n    }) : (RA ?? (RA = yI(\"AGFzbQEAAAAB2QM5YAF/AX9gAn9/AGABfwBgA39/fwF/YAJ/fwF/YAN/f38AYAZ/f39/f38Bf2AFf39/f38Bf2AEf39/fwBgBH9/f38Bf2AGf39/f39/AGAFf39/f38AYAAAYAh/f39/f39/fwF/YAd/f39/f39/AX9gAAF/YAV/fn5+fgBgCn9/f39/f39/f38AYAd/f39/f39/AGAFf39/f34Bf2AIf39/f39/f38AYAR/fn5/AGADf35/AX5gBX9/fn9/AGACf34AYAp/f39/f39/f39/AX9gDH9/f39/f39/f39/fwF/YAN/f38BfmAGf39/f35/AX9gD39/f39/f39/f39/f39/fwBgC39/f39/f39/f39/AX9gBH9/f38BfmAGf3x/f39/AX9gB39/f39/fn4Bf2AGf39/f35+AX9gBX9/f398AX9gDX9/f39/f39/f39/f38AYAV/f39+fgBgBX9/f39/AXxgBH9+f38Bf2ACf3wAYAR+fn5+AX9gAn5/AX9gBH9/f34BfmACfn4BfGABfwF8YAN/f38BfGADf39/AX1gA39/fgBgAn5+AX1gAn9/AX5gBH9+fn4AYAN+fn4Bf2ACfH8BfGAEf39/fQF/YAR/f399AGADf399AAK7AR8BYQFhAAUBYQFiABEBYQFjAAsBYQFkAAUBYQFlABEBYQFmAAUBYQFnAAoBYQFoAAEBYQFpAAoBYQFqACQBYQFrAAkBYQFsABQBYQFtAAUBYQFuACUBYQFvACYBYQFwAAMBYQFxAAIBYQFyAAgBYQFzAAgBYQF0AAQBYQF1AAQBYQF2AAABYQF3ACcBYQF4AAwBYQF5AAABYQF6AAIBYQFBAAEBYQFCAAgBYQFDAAEBYQFEAAIBYQFFAAIDjQWLBQAAAQQAAAIAAQABAQQEAg8QAgAEBQACAwAAAAIDAQwAABAEBQgVCwAAAAAQBAAFAAEBAwQAAAQBAQEAAAwBAQADAwACBBgFBQcHAwAAKA0NCAEDAQABAAQAAAgEAQEAAAwGBAQBAQYDKQUAFQMMAAQBAAEBBQQEBwMZABkAAQABAAQBBAABACoBAAEHAQAFBAUBAAgDBAIECwEUAgIBAAACCQABBAAACQEJAwcIBA4EDgQJCQQAAQABAAACAQQAAgADAgAGAQoFCAQFAQwAAAMBBAAABAsEAgACAxoLAAMaCwgCGwArAQAJEAAEAgIDAgAABBgBACwEAQUtAQIMAAgCBBwGHAYACQkBBAwIAwECFAUFBQAEBAIABQACBQ8FAwUFAAIAAAcNDQcNDQUABw0EAAQCAgIBAAIBAQIAAwMdEQMBHREAAAADCwEeAQAABQEeAQEBCgsKCgsKCg8AAxICEgcJBxIJBwkHCRIDBgMILgwvHwkGCR8JAQUbCQAABwQCAAQEAzAxMggQEBUzNAEAAAAAAAMEAAEFAQUBAAACAQgCBAAAAgICBAAMAgQDCAAOBzUAAQMAAAkDCAU2Azc4CgoKCwsLAwgICAMCDwIAAgACAAIAAgUAAgACAAIAAgACBAACAAIAAgACAAUBAQEBAQEAAAIEAgAHAAcNDQIHBwMJAwQDBAIHAwkDBAMEAgkJCQMCAg8DCgoGIQUGIQUODgEADg4DDg4NBQYGBgYGBQ0GBgYGBgciIxMHEwcHAAciBCMTBxMJBwcGBgYGBgYGBgYGBgYGBgAGBgYIAQYDCAcDCAcDAwICAAIACAIXBAQAAAACAgAAAgACAAMAAAMIFwMCABYBIBYDDAQHAXABgAOAAwUHAQGCAoCAAgYIAX8BQfD+BQsHGwYBRgIAAUcAqQUBSAEAAUkA1gMBSgA0AUsALQm/BQEAQQEL/wKQA/sE9wTmBOEE3gT/AvsC/ATPBGvJBMUEwgT/AvsCwQS+BNcDuwS2BLUErgTPAssClQSLBIEE9gPsAzDPAssCpQLfA94DoALdA9wDpQLbA9oDoALZA9gDnALVA9QDRqgFpwWmBaUFlAKiBZMCoQWgBZ8FRkaeBZ0FnAXIA5sFyAOQAsYDmgWZBY8CwQOYBZcF2AGOApYFlAWVBZMF/AGMBY0FiwWQBY8FjgWxAYwCigWJBYgFhwWJAoYFhQWEBS3hAdICiQSHBIUEgwSABP4D/AP6A/gD9QPzA/ED7wPtA9YCtASzBNACpgSlBKQEowSiBNECoQSgBJ8E2wKdBJwEmwSaBJkERpgElwTEApYEkwSSBJEEjwSNBMMClASSBZEFkASOBIwEiQEwMLIEsQSwBK8ErQSsBKsEqgTRAqkEqASnBDDOAs4CqgHiAeIBngTiATDKAskCqgFGRsgCvgEwygLJAqoBRkbIAr4BMMcCxgKqAUZGxQK+ATDHAsYCqgFGRsUCvgGJATCDBYIFgQWJATCABf8E/gQw/QT6BPkE+ASUA5QD9gT1BPQE8wTyBDDxBPAE7wTuBIwDjAPtBOwE6wTqBOkEMOgE5wTlBOQE4wTiBOAE3wQw3QTcBNsE2gTZBNgE1wTWBIkBMPwC1QTUBNME0gTRBNAEigSGBIIE9APwA/0D+QOJATD8As4EzQTMBMsEygTIBIgEhAT/A/ID7gP7A/cD7QHCAscE7QHCAsYEMMUBxQFXV1fyAkZ0dDDFAcUBV1dX8gJGdHQwxAHEAVdXV/ECRnR0MMQBxAFXV1fxAkZ0dDDEBMMEMMAEvwQwvQS8BDC6BLkEMNwCuASTAjDcArcEkwKJAesD6wGjBaQFiQEw4QHhAawCMKwCMOoD4APjA+kDMOED5APoAzDiA+UD5wMw5gMMASoKwLAIiwUTACAAEEcEQCAAKAIEDwsgABBeCxoBAX8gABBHBEAgACgCACAAEH4aEIsCCyAAC4sBAQN/IAAQHyICIAFJBEAjAEEQayIEJAAgASACayICBEAgAiAAECgiAyAAEB8iAWtLBEAgACADIAIgA2sgAWogASABEPQBCyABIAAQIyIDaiACQQAQsgIgACABIAJqIgAQgwEgBEEAOgAPIAAgA2ogBEEPahBdCyAEQRBqJAAPCyAAIAAQIyABEMACCwkAIAAQIyABagsRACAAEEcEQCAAKAIADwsgAAsSACAAQgA3AgAgAEEANgIIIAALFgAgACgCACIAQaDxAUcEQCAAEL8BCwuLAgIDfwJ+AkAgACkDcCIEUEUgBCAAKQN4IAAoAgQiASAAKAIsIgJrrHwiBVdxRQRAIwBBEGsiAiQAQX8hAQJAIAAQyQMNACAAIAJBD2pBASAAKAIgEQMAQQFHDQAgAi0ADyEBCyACQRBqJAAgASIDQQBODQEgACgCBCEBIAAoAiwhAgsgAEJ/NwNwIAAgATYCaCAAIAUgAiABa6x8NwN4QX8PCyAFQgF8IQUgACgCBCEBIAAoAgghAgJAIAApA3AiBFANACAEIAV9IgQgAiABa6xZDQAgASAEp2ohAgsgACACNgJoIAAgBSAAKAIsIgAgAWusfDcDeCAAIAFPBEAgAUEBayADOgAACyADCwwAIAAgAUEcahDVAgsZAQF/QQohASAAEEcEfyAAEH5BAWsFQQoLC3kBA38CQCABELcCIQIgABDxASEDIAAQHyEEIAIgA00EQCAAECMiAyABIAIQZSMAQRBrIgEkACAAEB8aIAAgAhCDASABQQA2AgwgAyACQQJ0aiABQQxqEFYgAUEQaiQADAELIAAgAyACIANrIARBACAEIAIgARCvAgsLDgAgACABIAEQqAEQsQILEAAgABCyAyABELIDc0EBcwsQACAAELMDIAEQswNzQQFzC4EMAQh/AkAgAEUNACAAQQhrIgMgAEEEaygCACICQXhxIgBqIQUCQCACQQFxDQAgAkECcUUNASADIAMoAgAiBGsiA0Gc6gEoAgBJDQEgACAEaiEAAkACQAJAQaDqASgCACADRwRAIAMoAgwhASAEQf8BTQRAIAEgAygCCCICRw0CQYzqAUGM6gEoAgBBfiAEQQN2d3E2AgAMBQsgAygCGCEHIAEgA0cEQCADKAIIIgIgATYCDCABIAI2AggMBAsgAygCFCICBH8gA0EUagUgAygCECICRQ0DIANBEGoLIQQDQCAEIQYgAiIBQRRqIQQgASgCFCICDQAgAUEQaiEEIAEoAhAiAg0ACyAGQQA2AgAMAwsgBSgCBCICQQNxQQNHDQNBlOoBIAA2AgAgBSACQX5xNgIEIAMgAEEBcjYCBCAFIAA2AgAPCyACIAE2AgwgASACNgIIDAILQQAhAQsgB0UNAAJAIAMoAhwiBEECdCICKAK87AEgA0YEQCACQbzsAWogATYCACABDQFBkOoBQZDqASgCAEF+IAR3cTYCAAwCCwJAIAMgBygCEEYEQCAHIAE2AhAMAQsgByABNgIUCyABRQ0BCyABIAc2AhggAygCECICBEAgASACNgIQIAIgATYCGAsgAygCFCICRQ0AIAEgAjYCFCACIAE2AhgLIAMgBU8NACAFKAIEIgRBAXFFDQACQAJAAkACQCAEQQJxRQRAQaTqASgCACAFRgRAQaTqASADNgIAQZjqAUGY6gEoAgAgAGoiADYCACADIABBAXI2AgQgA0Gg6gEoAgBHDQZBlOoBQQA2AgBBoOoBQQA2AgAPC0Gg6gEoAgAiByAFRgRAQaDqASADNgIAQZTqAUGU6gEoAgAgAGoiADYCACADIABBAXI2AgQgACADaiAANgIADwsgBEF4cSAAaiEAIAUoAgwhASAEQf8BTQRAIAUoAggiAiABRgRAQYzqAUGM6gEoAgBBfiAEQQN2d3E2AgAMBQsgAiABNgIMIAEgAjYCCAwECyAFKAIYIQggASAFRwRAIAUoAggiAiABNgIMIAEgAjYCCAwDCyAFKAIUIgIEfyAFQRRqBSAFKAIQIgJFDQIgBUEQagshBANAIAQhBiACIgFBFGohBCABKAIUIgINACABQRBqIQQgASgCECICDQALIAZBADYCAAwCCyAFIARBfnE2AgQgAyAAQQFyNgIEIAAgA2ogADYCAAwDC0EAIQELIAhFDQACQCAFKAIcIgRBAnQiAigCvOwBIAVGBEAgAkG87AFqIAE2AgAgAQ0BQZDqAUGQ6gEoAgBBfiAEd3E2AgAMAgsCQCAFIAgoAhBGBEAgCCABNgIQDAELIAggATYCFAsgAUUNAQsgASAINgIYIAUoAhAiAgRAIAEgAjYCECACIAE2AhgLIAUoAhQiAkUNACABIAI2AhQgAiABNgIYCyADIABBAXI2AgQgACADaiAANgIAIAMgB0cNAEGU6gEgADYCAA8LIABB/wFNBEAgAEF4cUG06gFqIQICf0GM6gEoAgAiBEEBIABBA3Z0IgBxRQRAQYzqASAAIARyNgIAIAIMAQsgAigCCAshACACIAM2AgggACADNgIMIAMgAjYCDCADIAA2AggPC0EfIQEgAEH///8HTQRAIABBJiAAQQh2ZyICa3ZBAXEgAkEBdGtBPmohAQsgAyABNgIcIANCADcCECABQQJ0QbzsAWohBAJ/AkACf0GQ6gEoAgAiBkEBIAF0IgJxRQRAQZDqASACIAZyNgIAIAQgAzYCAEEYIQFBCAwBCyAAQRkgAUEBdmtBACABQR9HG3QhASAEKAIAIQQDQCAEIgIoAgRBeHEgAEYNAiABQR12IQQgAUEBdCEBIAIgBEEEcWoiBigCECIEDQALIAYgAzYCEEEYIQEgAiEEQQgLIQAgAyICDAELIAIoAggiBCADNgIMIAIgAzYCCEEYIQBBCCEBQQALIQYgASADaiAENgIAIAMgAjYCDCAAIANqIAY2AgBBrOoBQazqASgCAEEBayIAQX8gABs2AgALC+kCAQZ/QZzxAS0AAARAQZjxASgCAA8LIwBBIGsiAiQAAkACQANAIAJBCGoiBCAAQQJ0IgNqAn9BASAAdEH/////B3EiBUEBckUEQCADKAIADAELIABBjBZBxh8gBRsQogMLIgM2AgAgA0F/Rg0BIABBAWoiAEEGRw0AC0EAEKEDRQRAQZiDASEBIARBmIMBQRgQiwFFDQJBsIMBIQEgBEGwgwFBGBCLAUUNAkEAIQBBvO4BLQAARQRAA0AgAEECdCAAQcYfEKIDNgKM7gEgAEEBaiIAQQZHDQALQbzuAUEBOgAAQaTuAUGM7gEoAgA2AgALQYzuASEBIAJBCGoiAEGM7gFBGBCLAUUNAkGk7gEhASAAQaTuAUEYEIsBRQ0CQRgQNCIBRQ0BCyABIAIpAgg3AgAgASACKQIYNwIQIAEgAikCEDcCCAwBC0EAIQELIAJBIGokAEGc8QFBAToAAEGY8QEgATYCACABC80KAgV/CX4jAEHgAGsiBSQAIARC////////P4MhCiACIASFQoCAgICAgICAgH+DIQsgAkL///////8/gyIMQiCIIQ8gBEIwiKdB//8BcSEHAkACQCACQjCIp0H//wFxIglB//8Ba0GCgH5PBEAgB0H//wFrQYGAfksNAQsgAVAgAkL///////////8AgyINQoCAgICAgMD//wBUIA1CgICAgICAwP//AFEbRQRAIAJCgICAgICAIIQhCwwCCyADUCAEQv///////////wCDIgJCgICAgICAwP//AFQgAkKAgICAgIDA//8AURtFBEAgBEKAgICAgIAghCELIAMhAQwCCyABIA1CgICAgICAwP//AIWEUARAIAIgA4RQBEBCgICAgICA4P//ACELQgAhAQwDCyALQoCAgICAgMD//wCEIQtCACEBDAILIAMgAkKAgICAgIDA//8AhYRQBEAgASANhEIAIQFQBEBCgICAgICA4P//ACELDAMLIAtCgICAgICAwP//AIQhCwwCCyABIA2EUARAQgAhAQwCCyACIAOEUARAQgAhAQwCCyANQv///////z9YBEAgBUHQAGogASAMIAEgDCAMUCIGG3lCwABCACAGG3ynIgZBD2sQREEQIAZrIQYgBSkDWCIMQiCIIQ8gBSkDUCEBCyACQv///////z9WDQAgBUFAayADIAogAyAKIApQIggbeULAAEIAIAgbfKciCEEPaxBEIAYgCGtBEGohBiAFKQNIIQogBSkDQCEDCyAHIAlqIAZqQf//AGshBgJAIApCD4YiDkIgiEKAgICACIQiAiABQiCIIgR+IhAgA0IPhiIRQiCIIgogD0KAgASEIg1+fCIPIBBUrSAPIANCMYggDoRC/////w+DIgMgDEL/////D4MiDH58Ig4gD1StfCACIA1+fCAOIA4gEUKAgP7/D4MiDyAMfiIRIAQgCn58IhAgEVStIBAgECADIAFC/////w+DIgF+fCIQVq18fCIOVq18IAMgDX4iEiACIAx+fCIRIBJUrUIghiARQiCIhHwgDiAOIBFCIIZ8Ig5WrXwgDiANIA9+Ig0gCiAMfnwiDCABIAJ+fCICIAMgBH58IgNCIIggAiADVq0gDCANVK0gAiAMVK18fEIghoR8IgIgDlStfCACIBAgBCAPfiIMIAEgCn58IgRCIIggBCAMVK1CIIaEfCIKIBBUrSAKIANCIIZ8IgMgClStfHwiCiACVK18IAogAyAEQiCGIgIgASAPfnwiASACVK18IgIgA1StfCIEIApUrXwiA0KAgICAgIDAAINQRQRAIAZBAWohBgwBCyABQj+IIANCAYYgBEI/iIQhAyAEQgGGIAJCP4iEIQQgAUIBhiEBIAJCAYaEIQILIAZB//8BTgRAIAtCgICAgICAwP//AIQhC0IAIQEMAQsCfiAGQQBMBEBBASAGayIHQf8ATQRAIAVBMGogASACIAZB/wBqIgYQRCAFQSBqIAQgAyAGEEQgBUEQaiABIAIgBxCKASAFIAQgAyAHEIoBIAUpAzAgBSkDOIRCAFKtIAUpAyAgBSkDEISEIQEgBSkDKCAFKQMYhCECIAUpAwAhBCAFKQMIDAILQgAhAQwCCyADQv///////z+DIAatQjCGhAsgC4QhCyABUCACQgBZIAJCgICAgICAgICAf1EbRQRAIAsgBEIBfCIBUK18IQsMAQsgASACQoCAgICAgICAgH+FhFBFBEAgBCEBDAELIAsgBCAEQgGDfCIBIARUrXwhCwsgACABNwMAIAAgCzcDCCAFQeAAaiQACwYAIAAQLQt8AQN/IwBBEGsiASQAIAEgADYCDCMAQRBrIgIkACAAKAIAQX9HBEAgAkEIaiACQQxqIAFBDGoQVRBVIQMDQCAAKAIAQQFGDQALIAAoAgBFBEAgAEEBNgIAIAMQ0gIgAEF/NgIACwsgAkEQaiQAIAAoAgQgAUEQaiQAQQFrCyAAIAAgAUEBazYCBCAAQeDVATYCACAAQZCtATYCACAAC/cFAQl/IwBBEGsiCSQAIAEQ1wIgCUEMaiABEFUhCCAAQQhqIgMQayACTQRAAkAgAkEBaiIAIAMQayIBSwRAIwBBIGsiCiQAAkAgACABayIHIAMoAgggAygCBGtBAnVNBEAgAyAHENkCDAELIApBDGohAQJ/IAMQayAHaiEFIwBBEGsiACQAIAAgBTYCDCAFELwCIgRNBEAgAxC5AiIFIARBAXZJBEAgACAFQQF0NgIIIABBCGogAEEMahCgASgCACEECyAAQRBqJAAgBAwBCxCMAQALIQQgAxBrIQUjAEEQayIAJAAgASADQQxqIgs2AhAgAUEANgIMIAQEfyAAQQhqIAsgBBC7AiAAKAIIIQYgACgCDAVBAAshBCABIAY2AgAgASAGIAVBAnRqIgU2AgggASAGIARBAnRqNgIMIAEgBTYCBCAAQRBqJAAjAEEQayIGJAAgASgCCCEEIAZBBGoiACABQQhqNgIIIAAgBDYCACAAIAQgB0ECdGo2AgQgACgCACEEA0AgACgCBCAERwRAIAEoAhAaIAQQugIgACAAKAIAQQRqIgQ2AgAMAQsLIAAoAgggACgCADYCACAGQRBqJAAgASgCBCADKAIAIgAgAygCBGtqIQQgAygCBCAAayIHBEAgBCAAIAf8CgAACyABIAQ2AgQgAyADKAIANgIEIAMgAUEEahDXASADQQRqIAFBCGoQ1wEgA0EIaiABQQxqENcBIAEgASgCBDYCACADEGsaIAEoAgQhAANAIAEoAggiBCAARwRAIAEgBEEEazYCCCABKAIQGgwBCwsgASgCACIABEAgASgCECAAIAEoAgwgASgCAGtBAnUQuAILCyAKQSBqJAAMAQsgACABSQRAIAMoAgAgAEECdGohACADEGsaIAMgABDYAgsLCyADIAIQggEoAgAEQCADIAIQggEoAgAQvwELIAgQrAEhACADIAIQggEgADYCACAIKAIAIQAgCEEANgIAIAAEQCAAEL8BCyAJQRBqJAALySgBC38jAEEQayIKJAACQAJAAkACQAJAAkACQAJAAkACQCAAQfQBTQRAQYzqASgCACIEQRAgAEELakH4A3EgAEELSRsiBkEDdiIAdiIBQQNxBEACQCABQX9zQQFxIABqIgJBA3QiAUG06gFqIgAgASgCvOoBIgEoAggiBUYEQEGM6gEgBEF+IAJ3cTYCAAwBCyAFIAA2AgwgACAFNgIICyABQQhqIQAgASACQQN0IgJBA3I2AgQgASACaiIBIAEoAgRBAXI2AgQMCwsgBkGU6gEoAgAiCE0NASABBEACQEECIAB0IgJBACACa3IgASAAdHFoIgFBA3QiAEG06gFqIgIgACgCvOoBIgAoAggiBUYEQEGM6gEgBEF+IAF3cSIENgIADAELIAUgAjYCDCACIAU2AggLIAAgBkEDcjYCBCAAIAZqIgcgAUEDdCIBIAZrIgVBAXI2AgQgACABaiAFNgIAIAgEQCAIQXhxQbTqAWohAUGg6gEoAgAhAgJ/IARBASAIQQN2dCIDcUUEQEGM6gEgAyAEcjYCACABDAELIAEoAggLIQMgASACNgIIIAMgAjYCDCACIAE2AgwgAiADNgIICyAAQQhqIQBBoOoBIAc2AgBBlOoBIAU2AgAMCwtBkOoBKAIAIgtFDQEgC2hBAnQoArzsASICKAIEQXhxIAZrIQMgAiEBA0ACQCABKAIQIgBFBEAgASgCFCIARQ0BCyAAKAIEQXhxIAZrIgEgAyABIANJIgEbIQMgACACIAEbIQIgACEBDAELCyACKAIYIQkgAiACKAIMIgBHBEAgAigCCCIBIAA2AgwgACABNgIIDAoLIAIoAhQiAQR/IAJBFGoFIAIoAhAiAUUNAyACQRBqCyEFA0AgBSEHIAEiAEEUaiEFIAAoAhQiAQ0AIABBEGohBSAAKAIQIgENAAsgB0EANgIADAkLQX8hBiAAQb9/Sw0AIABBC2oiAUF4cSEGQZDqASgCACIHRQ0AQR8hCEEAIAZrIQMgAEH0//8HTQRAIAZBJiABQQh2ZyIAa3ZBAXEgAEEBdGtBPmohCAsCQAJAAkAgCEECdCgCvOwBIgFFBEBBACEADAELQQAhACAGQRkgCEEBdmtBACAIQR9HG3QhAgNAAkAgASgCBEF4cSAGayIEIANPDQAgASEFIAQiAw0AQQAhAyABIQAMAwsgACABKAIUIgQgBCABIAJBHXZBBHFqKAIQIgFGGyAAIAQbIQAgAkEBdCECIAENAAsLIAAgBXJFBEBBACEFQQIgCHQiAEEAIABrciAHcSIARQ0DIABoQQJ0KAK87AEhAAsgAEUNAQsDQCAAKAIEQXhxIAZrIgIgA0khASACIAMgARshAyAAIAUgARshBSAAKAIQIgEEfyABBSAAKAIUCyIADQALCyAFRQ0AIANBlOoBKAIAIAZrTw0AIAUoAhghCCAFIAUoAgwiAEcEQCAFKAIIIgEgADYCDCAAIAE2AggMCAsgBSgCFCIBBH8gBUEUagUgBSgCECIBRQ0DIAVBEGoLIQIDQCACIQQgASIAQRRqIQIgACgCFCIBDQAgAEEQaiECIAAoAhAiAQ0ACyAEQQA2AgAMBwsgBkGU6gEoAgAiBU0EQEGg6gEoAgAhAAJAIAUgBmsiAUEQTwRAIAAgBmoiAiABQQFyNgIEIAAgBWogATYCACAAIAZBA3I2AgQMAQsgACAFQQNyNgIEIAAgBWoiASABKAIEQQFyNgIEQQAhAkEAIQELQZTqASABNgIAQaDqASACNgIAIABBCGohAAwJCyAGQZjqASgCACICSQRAQZjqASACIAZrIgE2AgBBpOoBQaTqASgCACIAIAZqIgI2AgAgAiABQQFyNgIEIAAgBkEDcjYCBCAAQQhqIQAMCQtBACEAIAZBL2oiAwJ/QeTtASgCAARAQeztASgCAAwBC0Hw7QFCfzcCAEHo7QFCgKCAgICABDcCAEHk7QEgCkEMakFwcUHYqtWqBXM2AgBB+O0BQQA2AgBByO0BQQA2AgBBgCALIgFqIgRBACABayIHcSIBIAZNDQhBxO0BKAIAIgUEQEG87QEoAgAiCCABaiIJIAhNIAUgCUlyDQkLAkBByO0BLQAAQQRxRQRAAkACQAJAAkBBpOoBKAIAIgUEQEHM7QEhAANAIAAoAgAiCCAFTQRAIAUgCCAAKAIEakkNAwsgACgCCCIADQALC0EAEKUBIgJBf0YNAyABIQRB6O0BKAIAIgBBAWsiBSACcQRAIAEgAmsgAiAFakEAIABrcWohBAsgBCAGTQ0DQcTtASgCACIABEBBvO0BKAIAIgUgBGoiByAFTSAAIAdJcg0ECyAEEKUBIgAgAkcNAQwFCyAEIAJrIAdxIgQQpQEiAiAAKAIAIAAoAgRqRg0BIAIhAAsgAEF/Rg0BIAZBMGogBE0EQCAAIQIMBAtB7O0BKAIAIgIgAyAEa2pBACACa3EiAhClAUF/Rg0BIAIgBGohBCAAIQIMAwsgAkF/Rw0CC0HI7QFByO0BKAIAQQRyNgIACyABEKUBIgJBf0ZBABClASIAQX9GciAAIAJNcg0FIAAgAmsiBCAGQShqTQ0FC0G87QFBvO0BKAIAIARqIgA2AgBBwO0BKAIAIABJBEBBwO0BIAA2AgALAkBBpOoBKAIAIgMEQEHM7QEhAANAIAIgACgCACIBIAAoAgQiBWpGDQIgACgCCCIADQALDAQLQZzqASgCACIAQQAgACACTRtFBEBBnOoBIAI2AgALQQAhAEHQ7QEgBDYCAEHM7QEgAjYCAEGs6gFBfzYCAEGw6gFB5O0BKAIANgIAQdjtAUEANgIAA0AgAEEDdCIBIAFBtOoBaiIFNgK86gEgASAFNgLA6gEgAEEBaiIAQSBHDQALQZjqASAEQShrIgBBeCACa0EHcSIBayIFNgIAQaTqASABIAJqIgE2AgAgASAFQQFyNgIEIAAgAmpBKDYCBEGo6gFB9O0BKAIANgIADAQLIAIgA00gASADS3INAiAAKAIMQQhxDQIgACAEIAVqNgIEQaTqASADQXggA2tBB3EiAGoiATYCAEGY6gFBmOoBKAIAIARqIgIgAGsiADYCACABIABBAXI2AgQgAiADakEoNgIEQajqAUH07QEoAgA2AgAMAwtBACEADAYLQQAhAAwEC0Gc6gEoAgAgAksEQEGc6gEgAjYCAAsgAiAEaiEFQcztASEAAkADQCAFIAAoAgAiAUcEQCAAKAIIIgANAQwCCwsgAC0ADEEIcUUNAwtBzO0BIQADQAJAIAAoAgAiASADTQRAIAMgASAAKAIEaiIFSQ0BCyAAKAIIIQAMAQsLQZjqASAEQShrIgBBeCACa0EHcSIBayIHNgIAQaTqASABIAJqIgE2AgAgASAHQQFyNgIEIAAgAmpBKDYCBEGo6gFB9O0BKAIANgIAIAMgBUEnIAVrQQdxakEvayIAIAAgA0EQakkbIgFBGzYCBCABQdTtASkCADcCECABQcztASkCADcCCEHU7QEgAUEIajYCAEHQ7QEgBDYCAEHM7QEgAjYCAEHY7QFBADYCACABQRhqIQADQCAAQQc2AgQgAEEIaiAAQQRqIQAgBUkNAAsgASADRg0AIAEgASgCBEF+cTYCBCADIAEgA2siAkEBcjYCBCABIAI2AgACfyACQf8BTQRAIAJBeHFBtOoBaiEAAn9BjOoBKAIAIgFBASACQQN2dCICcUUEQEGM6gEgASACcjYCACAADAELIAAoAggLIQEgACADNgIIIAEgAzYCDEEMIQJBCAwBC0EfIQAgAkH///8HTQRAIAJBJiACQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAAsgAyAANgIcIANCADcCECAAQQJ0QbzsAWohAQJAAkBBkOoBKAIAIgVBASAAdCIEcUUEQEGQ6gEgBCAFcjYCACABIAM2AgAMAQsgAkEZIABBAXZrQQAgAEEfRxt0IQAgASgCACEFA0AgBSIBKAIEQXhxIAJGDQIgAEEddiEFIABBAXQhACABIAVBBHFqIgQoAhAiBQ0ACyAEIAM2AhALIAMgATYCGEEIIQIgAyIBIQBBDAwBCyABKAIIIgAgAzYCDCABIAM2AgggAyAANgIIQQAhAEEYIQJBDAsgA2ogATYCACACIANqIAA2AgALQZjqASgCACIAIAZNDQBBmOoBIAAgBmsiATYCAEGk6gFBpOoBKAIAIgAgBmoiAjYCACACIAFBAXI2AgQgACAGQQNyNgIEIABBCGohAAwEC0GI6gFBMDYCAEEAIQAMAwsgACACNgIAIAAgACgCBCAEajYCBCACQXggAmtBB3FqIgggBkEDcjYCBCABQXggAWtBB3FqIgQgBiAIaiIDayEHAkBBpOoBKAIAIARGBEBBpOoBIAM2AgBBmOoBQZjqASgCACAHaiIANgIAIAMgAEEBcjYCBAwBC0Gg6gEoAgAgBEYEQEGg6gEgAzYCAEGU6gFBlOoBKAIAIAdqIgA2AgAgAyAAQQFyNgIEIAAgA2ogADYCAAwBCyAEKAIEIgBBA3FBAUYEQCAAQXhxIQkgBCgCDCECAkAgAEH/AU0EQCAEKAIIIgEgAkYEQEGM6gFBjOoBKAIAQX4gAEEDdndxNgIADAILIAEgAjYCDCACIAE2AggMAQsgBCgCGCEGAkAgAiAERwRAIAQoAggiACACNgIMIAIgADYCCAwBCwJAIAQoAhQiAAR/IARBFGoFIAQoAhAiAEUNASAEQRBqCyEBA0AgASEFIAAiAkEUaiEBIAAoAhQiAA0AIAJBEGohASACKAIQIgANAAsgBUEANgIADAELQQAhAgsgBkUNAAJAIAQoAhwiAEECdCIBKAK87AEgBEYEQCABQbzsAWogAjYCACACDQFBkOoBQZDqASgCAEF+IAB3cTYCAAwCCwJAIAQgBigCEEYEQCAGIAI2AhAMAQsgBiACNgIUCyACRQ0BCyACIAY2AhggBCgCECIABEAgAiAANgIQIAAgAjYCGAsgBCgCFCIARQ0AIAIgADYCFCAAIAI2AhgLIAcgCWohByAEIAlqIgQoAgQhAAsgBCAAQX5xNgIEIAMgB0EBcjYCBCADIAdqIAc2AgAgB0H/AU0EQCAHQXhxQbTqAWohAAJ/QYzqASgCACIBQQEgB0EDdnQiAnFFBEBBjOoBIAEgAnI2AgAgAAwBCyAAKAIICyEBIAAgAzYCCCABIAM2AgwgAyAANgIMIAMgATYCCAwBC0EfIQIgB0H///8HTQRAIAdBJiAHQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAgsgAyACNgIcIANCADcCECACQQJ0QbzsAWohAAJAAkBBkOoBKAIAIgFBASACdCIFcUUEQEGQ6gEgASAFcjYCACAAIAM2AgAMAQsgB0EZIAJBAXZrQQAgAkEfRxt0IQIgACgCACEBA0AgASIAKAIEQXhxIAdGDQIgAkEddiEBIAJBAXQhAiAAIAFBBHFqIgUoAhAiAQ0ACyAFIAM2AhALIAMgADYCGCADIAM2AgwgAyADNgIIDAELIAAoAggiASADNgIMIAAgAzYCCCADQQA2AhggAyAANgIMIAMgATYCCAsgCEEIaiEADAILAkAgCEUNAAJAIAUoAhwiAUECdCICKAK87AEgBUYEQCACQbzsAWogADYCACAADQFBkOoBIAdBfiABd3EiBzYCAAwCCwJAIAUgCCgCEEYEQCAIIAA2AhAMAQsgCCAANgIUCyAARQ0BCyAAIAg2AhggBSgCECIBBEAgACABNgIQIAEgADYCGAsgBSgCFCIBRQ0AIAAgATYCFCABIAA2AhgLAkAgA0EPTQRAIAUgAyAGaiIAQQNyNgIEIAAgBWoiACAAKAIEQQFyNgIEDAELIAUgBkEDcjYCBCAFIAZqIgQgA0EBcjYCBCADIARqIAM2AgAgA0H/AU0EQCADQXhxQbTqAWohAAJ/QYzqASgCACIBQQEgA0EDdnQiAnFFBEBBjOoBIAEgAnI2AgAgAAwBCyAAKAIICyEBIAAgBDYCCCABIAQ2AgwgBCAANgIMIAQgATYCCAwBC0EfIQAgA0H///8HTQRAIANBJiADQQh2ZyIAa3ZBAXEgAEEBdGtBPmohAAsgBCAANgIcIARCADcCECAAQQJ0QbzsAWohAQJAAkAgB0EBIAB0IgJxRQRAQZDqASACIAdyNgIAIAEgBDYCACAEIAE2AhgMAQsgA0EZIABBAXZrQQAgAEEfRxt0IQAgASgCACEBA0AgASICKAIEQXhxIANGDQIgAEEddiEBIABBAXQhACACIAFBBHFqIgcoAhAiAQ0ACyAHIAQ2AhAgBCACNgIYCyAEIAQ2AgwgBCAENgIIDAELIAIoAggiACAENgIMIAIgBDYCCCAEQQA2AhggBCACNgIMIAQgADYCCAsgBUEIaiEADAELAkAgCUUNAAJAIAIoAhwiAUECdCIFKAK87AEgAkYEQCAFQbzsAWogADYCACAADQFBkOoBIAtBfiABd3E2AgAMAgsCQCACIAkoAhBGBEAgCSAANgIQDAELIAkgADYCFAsgAEUNAQsgACAJNgIYIAIoAhAiAQRAIAAgATYCECABIAA2AhgLIAIoAhQiAUUNACAAIAE2AhQgASAANgIYCwJAIANBD00EQCACIAMgBmoiAEEDcjYCBCAAIAJqIgAgACgCBEEBcjYCBAwBCyACIAZBA3I2AgQgAiAGaiIFIANBAXI2AgQgAyAFaiADNgIAIAgEQCAIQXhxQbTqAWohAEGg6gEoAgAhAQJ/QQEgCEEDdnQiByAEcUUEQEGM6gEgBCAHcjYCACAADAELIAAoAggLIQQgACABNgIIIAQgATYCDCABIAA2AgwgASAENgIIC0Gg6gEgBTYCAEGU6gEgAzYCAAsgAkEIaiEACyAKQRBqJAAgAAsIACAAQQAQPAsVACAAIAE2AgAgACACKAIANgIEIAALCgAgACgCABC9AwsLACAAKAIAEMMDwAsXACAAEEcEQCAAKAIAIAAQfhCpAQsgAAs7AQJ/IwBBEGsiASQAIAEgADYCDCABKAIMIgAoAgAiAgRAIAAgAjYCBCAAKAIIGiACEC0LIAFBEGokAAstACACRQRAIAAoAgQgASgCBEYPCyAAIAFGBEBBAQ8LIAAoAgQgASgCBBDQAUULIQEBfyAAKAIAIQIgACABNgIAIAIEQCACIAAoAgQRAgALCwYAEMoDAAsNACAAKAIAELwDGiAACw0AIAAoAgAQnQIaIAALdQEBfiAAIAEgBH4gAiADfnwgA0IgiCICIAFCIIgiBH58IANC/////w+DIgMgAUL/////D4MiAX4iBUIgiCADIAR+fCIDQiCIfCABIAJ+IANC/////w+DfCIBQiCIfDcDCCAAIAVC/////w+DIAFCIIaENwMACxEAIAAgASAAKAIAKAIcEQQAC8EBAQN/IAAtAABBIHFFBEACQCAAKAIQIgMEfyADBSAAEN8BDQEgACgCEAsgACgCFCIEayACSQRAIAAgASACIAAoAiQRAwAaDAELAkACQCACRSAAKAJQQQBIcg0AIAIhAwNAIAEgA2oiBUEBay0AAEEKRwRAIANBAWsiAw0BDAILCyAAIAEgAyAAKAIkEQMAIANJDQIgAiADayECIAAoAhQhBAwBCyABIQULIAQgBSACEHEaIAAgACgCFCACajYCFAsLC6EBAQJ/AkAgABAfRSACIAFrQQVIcg0AIAEgAhDHASACQQRrIQQgABAjIgIgABAfaiEFAkADQAJAIAIsAAAhACABIARPDQAgAEEATCAAQf8ATnJFBEAgASgCACACLAAARw0DCyABQQRqIQEgAiAFIAJrQQFKaiECDAELCyAAQQBMIABB/wBOcg0BIAIsAAAgBCgCAEEBa0sNAQsgA0EENgIACwtQAQF+AkAgA0HAAHEEQCABIANBQGqthiECQgAhAQwBCyADRQ0AIAIgA60iBIYgAUHAACADa62IhCECIAEgBIYhAQsgACABNwMAIAAgAjcDCAtpAQF/IwBBgAJrIgUkACAEQYDABHEgAiADTHJFBEAgBSABIAIgA2siA0GAAiADQYACSSIBGxCYAiABRQRAA0AgACAFQYACEEIgA0GAAmsiA0H/AUsNAAsLIAAgBSADEEILIAVBgAJqJAALBABBAAsKACAALQALQQd2CwoAIABB0PIBEHoLCgAgAEHY8gEQegvPCQIEfwR+IwBB8ABrIgYkACAEQv///////////wCDIQkCQAJAIAFQIgUgAkL///////////8AgyIKQoCAgICAgMD//wB9QoCAgICAgMCAgH9UIApQG0UEQCADQgBSIAlCgICAgICAwP//AH0iC0KAgICAgIDAgIB/ViALQoCAgICAgMCAgH9RGw0BCyAFIApCgICAgICAwP//AFQgCkKAgICAgIDA//8AURtFBEAgAkKAgICAgIAghCEEIAEhAwwCCyADUCAJQoCAgICAgMD//wBUIAlCgICAgICAwP//AFEbRQRAIARCgICAgICAIIQhBAwCCyABIApCgICAgICAwP//AIWEUARAQoCAgICAgOD//wAgAiABIAOFIAIgBIVCgICAgICAgICAf4WEUCIFGyEEQgAgASAFGyEDDAILIAMgCUKAgICAgIDA//8AhYRQDQEgASAKhFAEQCADIAmEQgBSDQIgASADgyEDIAIgBIMhBAwCCyADIAmEUEUNACABIQMgAiEEDAELIAMgASABIANUIAkgClYgCSAKURsiCBshCiAEIAIgCBsiDEL///////8/gyEJIAIgBCAIGyILQjCIp0H//wFxIQcgDEIwiKdB//8BcSIFRQRAIAZB4ABqIAogCSAKIAkgCVAiBRt5QsAAQgAgBRt8pyIFQQ9rEEQgBikDaCEJIAYpA2AhCkEQIAVrIQULIAEgAyAIGyEDIAtC////////P4MhASAHBH4gAQUgBkHQAGogAyABIAMgASABUCIHG3lCwABCACAHG3ynIgdBD2sQREEQIAdrIQcgBikDUCEDIAYpA1gLQgOGIANCPYiEQoCAgICAgIAEhCEBIAlCA4YgCkI9iIQgAiAEhSEEAn4gA0IDhiICIAUgB0YNABogBSAHayIHQf8ASwRAQgAhAUIBDAELIAZBQGsgAiABQYABIAdrEEQgBkEwaiACIAEgBxCKASAGKQM4IQEgBikDMCAGKQNAIAYpA0iEQgBSrYQLIQlCgICAgICAgASEIQsgCkIDhiEKAkAgBEIAUwRAQgAhA0IAIQQgCSAKhSABIAuFhFANAiAKIAl9IQIgCyABfSAJIApWrX0iBEL/////////A1YNASAGQSBqIAIgBCACIAQgBFAiBxt5QsAAQgAgBxt8p0EMayIHEEQgBSAHayEFIAYpAyghBCAGKQMgIQIMAQsgCSAKfCICIAlUrSABIAt8fCIEQoCAgICAgIAIg1ANACAJQgGDIARCP4YgAkIBiISEIQIgBUEBaiEFIARCAYghBAsgDEKAgICAgICAgIB/gyEDIAVB//8BTgRAIANCgICAgICAwP//AIQhBEIAIQMMAQtBACEHAkAgBUEASgRAIAUhBwwBCyAGQRBqIAIgBCAFQf8AahBEIAYgAiAEQQEgBWsQigEgBikDACAGKQMQIAYpAxiEQgBSrYQhAiAGKQMIIQQLIARCPYYgAkIDiIQhASAEQgOIQv///////z+DIAetQjCGhCADhCEEAkACQCACp0EHcSIFQQRHBEAgBCABIAEgBUEES618IgNWrXwhBAwBCyAEIAEgASABQgGDfCIDVq18IQQMAQsgBUUNAQsLIAAgAzcDACAAIAQ3AwggBkHwAGokAAsRACAAIAEgACgCACgCLBEEAAsIACAAQYABSQsRACACBEAgACABIAL8CgAACwsJACAAECMQ9wELhAECAn8BfiMAQRBrIgMkACAAAn4gAUUEQEIADAELIAMgASABQR91IgJzIAJrIgKtQgAgAmciAkHRAGoQRCADKQMIQoCAgICAgMAAhUGegAEgAmutQjCGfEKAgICAgICAgIB/QgAgAUEASBuEIQQgAykDAAs3AwAgACAENwMIIANBEGokAAsNACAAIAFB/wBxOgALC6oMAQh/An9BACABRQ0AGiAAQX9zIQMgAkEXTwRAAkAgAUEDcUUNACABLQAAIANzQf8BcUECdCgC0DMgA0EIdnMhAyACQQFrIgBFIAFBAWoiBEEDcUVyRQRAIAEtAAEgA3NB/wFxQQJ0KALQMyADQQh2cyEDIAJBAmsiAEUgAUECaiIEQQNxRXJFBEAgAS0AAiADc0H/AXFBAnQoAtAzIANBCHZzIQMgAkEDayIARSABQQNqIgRBA3FFckUEQCABLQADIANzQf8BcUECdCgC0DMgA0EIdnMhAyABQQRqIQEgAkEEayECDAMLIAAhAiAEIQEMAgsgACECIAQhAQwBCyAAIQIgBCEBCyACQRRuIghBbGwhCgJAIAhBAWsiCUUEQEEAIQQMAQsgASEAQQAhBANAIAAoAhAgB3MiB0EWdkH8B3EoAtBTIAdBDnZB/AdxKALQSyAHQQZ2QfwHcSgC0EMgB0H/AXFBAnQoAtA7c3NzIQcgACgCDCAGcyIGQRZ2QfwHcSgC0FMgBkEOdkH8B3EoAtBLIAZBBnZB/AdxKALQQyAGQf8BcUECdCgC0Dtzc3MhBiAAKAIIIARzIgRBFnZB/AdxKALQUyAEQQ52QfwHcSgC0EsgBEEGdkH8B3EoAtBDIARB/wFxQQJ0KALQO3NzcyEEIAAoAgQgBXMiBUEWdkH8B3EoAtBTIAVBDnZB/AdxKALQSyAFQQZ2QfwHcSgC0EMgBUH/AXFBAnQoAtA7c3NzIQUgACgCACADcyIDQRZ2QfwHcSgC0FMgA0EOdkH8B3EoAtBLIANBBnZB/AdxKALQQyADQf8BcUECdCgC0Dtzc3MhAyAAQRRqIQAgCUEBayIJDQALIAEgCEEUbGpBFGshAQsgAiAKaiECIAEoAhAgASgCDCABKAIIIAEoAgQgASgCACADcyIAQQh2IABB/wFxQQJ0KALQM3MiAEEIdiAAQf8BcUECdCgC0DNzIgBBCHYgAEH/AXFBAnQoAtAzcyIAQf8BcUECdCgC0DMgBXNzIABBCHZzIgBBCHYgAEH/AXFBAnQoAtAzcyIAQQh2IABB/wFxQQJ0KALQM3MiAEEIdiAAQf8BcUECdCgC0DNzIgBB/wFxQQJ0KALQMyAEc3MgAEEIdnMiAEEIdiAAQf8BcUECdCgC0DNzIgBBCHYgAEH/AXFBAnQoAtAzcyIAQQh2IABB/wFxQQJ0KALQM3MiAEH/AXFBAnQoAtAzIAZzcyAAQQh2cyIAQQh2IABB/wFxQQJ0KALQM3MiAEEIdiAAQf8BcUECdCgC0DNzIgBBCHYgAEH/AXFBAnQoAtAzcyIAQf8BcUECdCgC0DMgB3NzIABBCHZzIgBBCHYgAEH/AXFBAnQoAtAzcyIAQQh2IABB/wFxQQJ0KALQM3MiAEEIdiAAQf8BcUECdCgC0DNzIgBBCHYgAEH/AXFBAnQoAtAzcyEDIAFBFGohAQsgAkEHSwRAA0AgAS0AACADc0H/AXFBAnQoAtAzIANBCHZzIgBBCHYgAS0AASAAc0H/AXFBAnQoAtAzcyIAQQh2IAEtAAIgAHNB/wFxQQJ0KALQM3MiAEEIdiABLQADIABzQf8BcUECdCgC0DNzIgBBCHYgAS0ABCAAc0H/AXFBAnQoAtAzcyIAQQh2IAEtAAUgAHNB/wFxQQJ0KALQM3MiAEEIdiABLQAGIABzQf8BcUECdCgC0DNzIgBBCHYgAS0AByAAc0H/AXFBAnQoAtAzcyEDIAFBCGohASACQQhrIgJBB0sNAAsLAkAgAkUNACABLQAAIANzQf8BcUECdCgC0DMgA0EIdnMhAyACQQFGDQAgAS0AASADc0H/AXFBAnQoAtAzIANBCHZzIQMgAkECRg0AIAEtAAIgA3NB/wFxQQJ0KALQMyADQQh2cyEDIAJBA0YNACABLQADIANzQf8BcUECdCgC0DMgA0EIdnMhAyACQQRGDQAgAS0ABCADc0H/AXFBAnQoAtAzIANBCHZzIQMgAkEFRg0AIAEtAAUgA3NB/wFxQQJ0KALQMyADQQh2cyEDIAJBBkYNACABLQAGIANzQf8BcUECdCgC0DMgA0EIdnMhAwsgA0F/cwsL5QMBBX8jAEEQayIDJAAgAyAAKAIAIgRBCGsoAgAiAjYCDCADIAAgAmo2AgQgAyAEQQRrKAIANgIIIAMoAggiBCABQQAQOyECIAMoAgQhBQJAIAIEQCADKAIMIQAjAEFAaiIBJAAgAUFAayQAQQAgBSAAGyECDAELIwBBQGoiAiQAIAAgBU4EQCACQgA3AhwgAkIANwIkIAJCADcCLCACQgA3AhQgAkEANgIQIAIgATYCDCACIAQ2AgQgAkEANgI8IAJCgYCAgICAgIABNwI0IAIgADYCCCAEIAJBBGogBSAFQQFBACAEKAIAKAIUEQoAIABBACACKAIcGyEGCyACQUBrJAAgBiICDQAjAEFAaiICJAAgAkEANgIQIAJBlNYBNgIMIAIgADYCCCACIAE2AgRBACEAIAJBFGpBAEEn/AsAIAJBADYCPCACQQE6ADsgBCACQQRqIAVBAUEAIAQoAgAoAhgRCwACQAJAAkAgAigCKA4CAAECCyACKAIYQQAgAigCJEEBRhtBACACKAIgQQFGG0EAIAIoAixBAUYbIQAMAQsgAigCHEEBRwRAIAIoAiwNASACKAIgQQFHDQEgAigCJEEBRw0BCyACKAIUIQALIAJBQGskACAAIQILIANBEGokACACCzwBAn9BASAAIABBAU0bIQEDQAJAIAEQNCIADQBB5P4BKAIAIgJFDQAgAhEMAAwBCwsgAEUEQBDrAQsgAAsUAQF/QQQQUyIBIAAoAgA2AgAgAQsLACAAIAE2AgAgAAsMACAAIAEoAgA2AgALBwAgABAkGgsRACAAIAEgASgCACgCFBEBAAsPACAAIAAoAgAoAhARAAALBwAgABAfRQsJAEGFEBCuAgALEAAgACABQYCAgIB4cjYCCAsMACAAIAEtAAA6AAALCwAgAC0AC0H/AHELEwAgACABIAIgACgCACgCDBEDAAsiAQF/IAIQTAR/IAAoAgggAkECdGooAgAgAXFBAEcFQQALC+wBAQN/IABFBEBB0N4BKAIABEBB0N4BKAIAEGEhAQtBgOABKAIABEBBgOABKAIAEGEgAXIhAQtBwOABKAIAIgAEQANAIAAoAkwaIAAoAhQgACgCHEcEQCAAEGEgAXIhAQsgACgCOCIADQALCyABDwsgACgCTEEASCECAkACQCAAKAIUIAAoAhxGDQAgAEEAQQAgACgCJBEDABogACgCFA0AQX8hAQwBCyAAKAIEIgEgACgCCCIDRwRAIAAgASADa6xBASAAKAIoERYAGgtBACEBIABBADYCHCAAQgA3AxAgAEIANwIEIAINAAsgAQsSACAAKAIAIgAEQCAAEJwDGgsLEQAgACABKAIAEJwDNgIAIAALQQEBfyAAIAE3A3AgACAAKAIsIAAoAgQiAmusNwN4IAAgAVAgASAAKAIIIgAgAmusWXIEfyAABSACIAGnags2AmgLHgACQCACRQ0AIAJBAnQiAkUNACAAIAEgAvwKAAALCxYAIAAgASgCADYCACAAIAIoAgA2AgQLtQEBAn8jAEEQayIFJAAgBSABNgIMQQAhAQJAIAICf0EGIAAgBUEMahArDQAaQQQgA0HAACAAEDciBhBfRQ0AGiADIAYQlAEhAQNAAkAgABA+GiABQTBrIQEgACAFQQxqECsgBEECSHINACADQcAAIAAQNyIGEF9FDQMgBEEBayEEIAMgBhCUASABQQpsaiEBDAELCyAAIAVBDGoQK0UNAUECCyACKAIAcjYCAAsgBUEQaiQAIAELtQEBAn8jAEEQayIFJAAgBSABNgIMQQAhAQJAIAICf0EGIAAgBUEMahAsDQAaQQQgA0HAACAAEDgiBhBgRQ0AGiADIAYQlQEhAQNAAkAgABA/GiABQTBrIQEgACAFQQxqECwgBEECSHINACADQcAAIAAQOCIGEGBFDQMgBEEBayEEIAMgBhCVASABQQpsaiEBDAELCyAAIAVBDGoQLEUNAUECCyACKAIAcjYCAAsgBUEQaiQAIAELYwAgAigCBEGwAXEiAkEgRgRAIAEPCwJAIAJBEEcNAAJAAkAgAC0AACICQStrDgMAAQABCyAAQQFqDwsgAkEwRyABIABrQQJIcg0AIAAtAAFBIHJB+ABHDQAgAEECaiEACyAACy4AAkAgACgCBEHKAHEiAARAIABBwABGBEBBCA8LIABBCEcNAUEQDwtBAA8LQQoLEAAgACgCBCAAKAIAa0ECdQvOAQIEfgJ/IwBBEGsiBiQAIAG9IgVC/////////weDIQIgAAJ+IAVCNIhC/w+DIgNQRQRAIANC/w9SBEAgAkIEiCEEIANCgPgAfCEDIAJCPIYMAgsgAkIEiCEEQv//ASEDIAJCPIYMAQsgAlAEQEIAIQNCAAwBCyAGIAJCACACeaciB0ExahBEIAYpAwhCgICAgICAwACFIQRBjPgAIAdrrSEDIAYpAwALNwMAIAAgBUKAgICAgICAgIB/gyADQjCGhCAEhDcDCCAGQRBqJAALsgMBA38jAEEQayIIJAAgCCACNgIIIAggATYCDCAIQQRqIgEgAxAnIAEQSCEJIAEQJSAEQQA2AgBBACEBAkADQCAGIAdGIAFyDQECQCAIQQxqIAhBCGoQKw0AAkAgCSAGKAIAEJQBQSVGBEAgBkEEaiAHRg0CQQAhAgJ/AkAgCSAGKAIEEJQBIgFBxQBGDQBBBCEKIAFB/wFxQTBGDQAgAQwBCyAGQQhqIAdGDQNBCCEKIAEhAiAJIAYoAggQlAELIQEgCCAAIAgoAgwgCCgCCCADIAQgBSABIAIgACgCACgCJBENADYCDCAGIApqQQRqIQYMAQsgCUEBIAYoAgAQXwRAA0AgByAGQQRqIgZHBEAgCUEBIAYoAgAQXw0BCwsDQCAIQQxqIgEgCEEIahArDQIgCUEBIAEQNxBfRQ0CIAEQPhoMAAsACyAJIAhBDGoiARA3EEEgCSAGKAIAEEFGBEAgBkEEaiEGIAEQPhoMAQsgBEEENgIACyAEKAIAIQEMAQsLIARBBDYCAAsgCEEMaiAIQQhqECsEQCAEIAQoAgBBAnI2AgALIAgoAgwgCEEQaiQAC7QDAQN/IwBBEGsiCCQAIAggAjYCCCAIIAE2AgwgCEEEaiIBIAMQJyABEEkhCSABECUgBEEANgIAQQAhAQJAA0AgBiAHRiABcg0BAkAgCEEMaiAIQQhqECwNAAJAIAkgBiwAABCVAUElRgRAIAZBAWogB0YNAkEAIQICfwJAIAkgBiwAARCVASIBQcUARg0AQQEhCiABQf8BcUEwRg0AIAEMAQsgBkECaiAHRg0DQQIhCiABIQIgCSAGLAACEJUBCyEBIAggACAIKAIMIAgoAgggAyAEIAUgASACIAAoAgAoAiQRDQA2AgwgBiAKakEBaiEGDAELIAlBASAGLAAAEGAEQANAIAcgBkEBaiIGRwRAIAlBASAGLAAAEGANAQsLA0AgCEEMaiIBIAhBCGoQLA0CIAlBASABEDgQYEUNAiABED8aDAALAAsgCSAIQQxqIgEQOBDOASAJIAYsAAAQzgFGBEAgBkEBaiEGIAEQPxoMAQsgBEEENgIACyAEKAIAIQEMAQsLIARBBDYCAAsgCEEMaiAIQQhqECwEQCAEIAQoAgBBAnI2AgALIAgoAgwgCEEQaiQACxYAIAAgASACIAMgACgCACgCMBEJABoLPAAgACwAC0EASARAIAAoAggaIAAoAgAQLQsgACABKQIANwIAIAAgASgCCDYCCCABQQA6AAsgAUEAOgAACxMAIAIEQCAAIAEgAvwKAAALIAALKwEBfyMAQRBrIgIkACACIAE2AgxBwN0BIAAgAUEAQQAQ0QMaIAJBEGokAAsjAQF/IwBBEGsiASQAIAEgADYCDCABQQxqEOwBIAFBEGokAAsMACAAQYKGgCA2AAALEQAgABAjIAAQH0ECdGoQ9wELDQAgACgCACABKAIARgsOACAAECMgABAfahD3AQsPACAAIAAoAgAoAgwRAAALFgAgACABIAIgAyAAKAIAKAIgEQkAGgtEAQF/IAAoAgAhAiABEDEhACACQQhqIgEQayAASwR/IAEgABCCASgCAEEARwVBAAtFBEAQPQALIAJBCGogABCCASgCAAsRACAAIAEgASgCACgCHBEBAAsRACAAIAEgASgCACgCGBEBAAsQACAAQSBGIABBCWtBBUlyCw4AIAAoAghB/////wdxC9cBAQF/AkBBjN4BKAIAIgBBAE4EQCAARQ0BQZThASgCACAAQf////8DcUcNAQsCQEGQ3gEoAgBBCkYNAEHU3QEoAgAiAEHQ3QEoAgBGDQBB1N0BIABBAWo2AgAgAEEKOgAADwtBwN0BEN4BDwtBjN4BQYzeASgCACIAQf////8DIAAbNgIAAkACQEGQ3gEoAgBBCkYNAEHU3QEoAgAiAEHQ3QEoAgBGDQBB1N0BIABBAWo2AgAgAEEKOgAADAELQcDdARDeAQtBjN4BKAIAGkGM3gFBADYCAAvDAQEEfyMAQRBrIgckAAJAIABFDQAgBCgCDCEJIAIgAWsiBkEASgRAIAAgASAGIAAoAgAoAjARAwAgBkcNAQsgAyABayIBIAlIBEAgB0EEaiIGIAkgAWsiASAFELACIAAgBygCBCAGIAcsAA9BAEgbIAEgACgCACgCMBEDACEFIAYQIBogASAFRw0BCyADIAJrIgFBAEoEQCAAIAIgASAAKAIAKAIwEQMAIAFHDQELIARBADYCDCAAIQgLIAdBEGokACAIC14BA38gAEEANgIIIABCADcCACABKAIAIQMgASgCBCIBIANrIgRBAnUiAgRAIAAgAhCuAyAAKAIEIQIgBEUgASADRnJFBEAgAiADIAT8CgAACyAAIAIgBGo2AgQLIAALDQAgACgCACABQQJ0agsXACAAEEcEQCAAIAE2AgQPCyAAIAEQUAthAQF/IwBBEGsiAiQAIAIgADYCDAJAIAAgAUYNAANAIAIgAUEBayIBNgIIIAAgAU8NASACKAIMIAIoAggQ8wIgAiACKAIMQQFqIgA2AgwgAigCCCEBDAALAAsgAkEQaiQAC6wBAQR/IwBBEGsiByQAAkAgAEUNACAEKAIMIQYgAiABa0ECdSIIQQBKBEAgACABIAgQjQIgCEcNAQsgAyABa0ECdSIBIAZIBEAgACAHQQRqIAYgAWsiASAFEP0CIgUQIyABEI0CIQYgBRA5GiABIAZHDQELIAMgAmtBAnUiAUEASgRAIAAgAiABEI0CIAFHDQELIAQoAgwaIARBADYCDCAAIQkLIAdBEGokACAJCycBAX8jAEEQayIDJAAgAyACNgIMIABB5AAgASACENEBIANBEGokAAvbAQIBfwJ+QQEhBAJAIABCAFIgAUL///////////8AgyIFQoCAgICAgMD//wBWIAVCgICAgICAwP//AFEbDQAgAkIAUiADQv///////////wCDIgZCgICAgICAwP//AFYgBkKAgICAgIDA//8AURsNACAAIAKEIAUgBoSEUARAQQAPCyABIAODQgBZBEAgACACVCABIANTIAEgA1EbBEBBfw8LIAAgAoUgASADhYRCAFIPCyAAIAJWIAEgA1UgASADURsEQEF/DwsgACAChSABIAOFhEIAUiEECyAEC+wBAQR/IwBBEGsiBCQAIABBADYCBCMAQRBrIgUkACAEQQA6AA8gACAAKAIAQQxrKAIAahDZASEGIAAgACgCAEEMaygCAGohAwJAIAYEQCADKAJIBEAgACAAKAIAQQxrKAIAaigCSBDFAwsgBCAAIAAoAgBBDGsoAgBqENkBOgAPDAELIANBBBDVAQsgBUEQaiQAQQQhAyAELQAPBEAgACAAIAAoAgBBDGsoAgBqKAIYIgMgASACIAMoAgAoAiARAwAiATYCBEEGQQAgASACRxshAwsgACAAKAIAQQxrKAIAaiADENUBIARBEGokAAsEACAAC1ABAX4CQCADQcAAcQRAIAIgA0FAaq2IIQFCACECDAELIANFDQAgAkHAACADa62GIAEgA60iBIiEIQEgAiAEiCECCyAAIAE3AwAgACACNwMIC0MBA38CQCACRQ0AA0AgAC0AACIEIAEtAAAiBUYEQCABQQFqIQEgAEEBaiEAIAJBAWsiAg0BDAILCyAEIAVrIQMLIAMLCQBB+gsQrgIACxQBAX9BCBBTIgEgACkCADcDACABCwoAIAAgASAAa2oLGQEBfyABEMECIQIgACABNgIEIAAgAjYCAAskACAAQQJPBH8gAEECakF+cSIAIABBAWsiACAAQQJGGwVBAQsLlgEBA38CQCABELcCIQIjAEEQayIDJAAgAkH3////A00EQAJAIAIQvQEEQCAAIAIQUCAAIQQMAQsgA0EIaiACEJABQQFqEI8BIAMoAgwaIAAgAygCCCIENgIAIAAgAygCDBBcIAAgAjYCBAsgBCABIAIQZSADQQA2AgQgBCACQQJ0aiADQQRqEFYgA0EQaiQADAELEFsACwsRACAAIAEgASgCACgCLBEBAAvHAQEGfyMAQRBrIgQkACAAEPIBKAIAIQUCfyACKAIAIAAoAgBrIgNB/////wdJBEAgA0EBdAwBC0F/CyIDQQQgAxshAyABKAIAIQYgACgCACEHIAVB5ABGBH9BAAUgACgCAAsgAxDcASIIBEAgBUHkAEcEQCAAEKwBGgsgBEHjADYCBCAAIARBCGogCCAEQQRqEDYiBRDrAiAFEDUgASAAKAIAIAYgB2tqNgIAIAIgACgCACADQXxxajYCACAEQRBqJAAPCxA9AAsTACAAIAFBACAAKAIAKAI0EQMACxMAIAAgAUEAIAAoAgAoAiQRAwALQgEBfyMAQRBrIgUkACAFIAI2AgwgBSAENgIIIAVBBGogBUEMahBjIAAgASADIAUoAggQ0QEhABBiIAVBEGokACAAC0EBAX8jAEEQayIDJAAgAyACNgIMQaAgIAFB7CBBzSxBHCADQQxqIgEQVEHsIEHRLEEdIAEQVBAEIANBEGokACAAC+oCAQJ/IwBBEGsiCiQAIAogADYCDAJAAkACQCADKAIAIgsgAkcNACAJKAJgIABGBH9BKwUgACAJKAJkRw0BQS0LIQAgAyALQQFqNgIAIAsgADoAAAwBCyAGEB9FIAAgBUdyRQRAQQAhACAIKAIAIgEgB2tBnwFKDQIgBCgCACEAIAggAUEEajYCACABIAA2AgAMAQtBfyEAIAkgCUHoAGogCkEMahD5ASAJa0ECdSIFQRdKDQECQAJAAkAgAUEIaw4DAAIAAQsgASAFSg0BDAMLIAFBEEcgBUEWSHINACADKAIAIgEgAkYgASACa0ECSnINAiABQQFrLQAAQTBHDQJBACEAIARBADYCACADIAFBAWo2AgAgASAFLQDQnwE6AAAMAgsgAyADKAIAIgBBAWo2AgAgACAFQdCfAWotAAA6AAAgBCAEKAIAQQFqNgIAQQAhAAwBC0EAIQAgBEEANgIACyAKQRBqJAAgAAsKACAAQZjzARB6C+wCAQN/IwBBEGsiCiQAIAogADoADwJAAkACQCADKAIAIgsgAkcNACAAQf8BcSIMIAktABhGBH9BKwUgDCAJLQAZRw0BQS0LIQAgAyALQQFqNgIAIAsgADoAAAwBCyAGEB9FIAAgBUdyRQRAQQAhACAIKAIAIgEgB2tBnwFKDQIgBCgCACEAIAggAUEEajYCACABIAA2AgAMAQtBfyEAIAkgCUEaaiAKQQ9qEP0BIAlrIgVBF0oNAQJAAkACQCABQQhrDgMAAgABCyABIAVKDQEMAwsgAUEQRyAFQRZIcg0AIAMoAgAiASACRiABIAJrQQJKcg0CIAFBAWstAABBMEcNAkEAIQAgBEEANgIAIAMgAUEBajYCACABIAUtANCfAToAAAwCCyADIAMoAgAiAEEBajYCACAAIAVB0J8Bai0AADoAACAEIAQoAgBBAWo2AgBBACEADAELQQAhACAEQQA2AgALIApBEGokACAACwoAIABBkPMBEHoLZgIBfwF+IwBBEGsiAiQAIAACfiABRQRAQgAMAQsgAiABrUIAQfAAIAFnIgFBH3NrEEQgAikDCEKAgICAgIDAAIVBnoABIAFrrUIwhnwhAyACKQMACzcDACAAIAM3AwggAkEQaiQACxQAIABB3wBxIAAgAEHhAGtBGkkbCywBAX8Cf0EBENYBBEAgAUEBELQCDAELIAEQUwshAiAAIAE2AgQgACACNgIACyQAIABBC08EfyAAQQhqQXhxIgAgAEEBayIAIABBC0YbBUEKCwskAQJ/IwBBEGsiAiQAIAAgARDTASEDIAJBEGokACABIAAgAxsLPAAgAEEANgIIIABCADcCACAAIAEoAgA2AgAgACABKAIENgIEIAAgASgCCDYCCCABQQA2AgggAUIANwIACywBAX8gAEEANgIIIABCADcCACAAIAEoAgAiAiABKAIEIgEgASACaxDAAyAACwgAIABB/wFxC/wBAQN/IAAoAgQgACgCACIDa0ECdSICIAFJBEAjAEEgayIDJAACQCABIAJrIgIgACgCCCAAKAIEIgFrQQJ1TQRAIAAoAgQiASACQQJ0aiECA0AgASACRgRAIAAgAjYCBAUgAUEANgIAIAFBBGohAQwBCwsMAQsgA0EMaiAAIAEgACgCAGtBAnUgAmoQtgEgACgCBCAAKAIAa0ECdSAAEIcCIgQoAggiASACQQJ0aiECA0AgASACRwRAIAFBADYCACABQQRqIQEMAQsLIAQgAjYCCCAAIAQQhQIgBBCBAgsgA0EgaiQADwsgASACSQRAIAAgAyABQQJ0ajYCBAsLUgECf0HU3gEoAgAiASAAQQdqQXhxIgJqIQACQCACQQAgACABTRtFBEAgAD8AQRB0TQ0BIAAQGA0BC0GI6gFBMDYCAEF/DwtB1N4BIAA2AgAgAQt/AgF+A38CQCAAQoCAgIAQVARAIAAhAgwBCwNAIAFBAWsiASAAIABCCoAiAkIKfn2nQTByOgAAIABC/////58BViACIQANAAsLIAJQRQRAIAKnIQMDQCABQQFrIgEgAyADQQpuIgRBCmxrQTByOgAAIANBCUsgBCEDDQALCyABC78BAQN/IAAoAgQgACgCACIDayICIAFJBEAjAEEgayIDJAACQCABIAJrIgIgACgCCCAAKAIEIgFrTQRAIAAgAhCYAwwBCyACIANBDGogACABIAJqIAAoAgBrELQBIAAoAgQgACgCAGsgABDGASIEKAIIIgFqIQIDQCABIAJHBEAgAUEAOgAAIAFBAWohAQwBCwsgBCACNgIIIAAgBBDvASAEELoBCyADQSBqJAAPCyABIAJJBEAgACABIANqNgIECwt9AQN/AkACQCAAIgFBA3FFDQAgAS0AAEUEQEEADwsDQCABQQFqIgFBA3FFDQEgAS0AAA0ACwwBCwNAIAEiAkEEaiEBQYCChAggAigCACIDayADckGAgYKEeHFBgIGChHhGDQALA0AgAiIBQQFqIQIgAS0AAA0ACwsgASAAawsTAEEEENYBBEAgABAtDwsgABAtCwsAIAQgAjYCAEEDC3wBAn8jAEEQayICJAAgABBHBEAgACgCACAAEH4QqQELIAEQHxogARBHIQMgACABKAIINgIIIAAgASkCADcCACABQQAQUCACQQA2AgwgASACQQxqEFYCQCADIAAgAUYiAXJFDQALIAAQRyABckUEQCAAEF4aCyACQRBqJAALEAEBfyAAKAIAIABBADYCAAs3AQJ/IwBBEGsiAyQAIANBDGoiBCABECcgAiAEEJkBIgEQWTYCACAAIAEQWCAEECUgA0EQaiQACzUBAn8jAEEQayICJAAgAkEMaiIDIAAQJyADEEhB0J8BQeqfASABEG8gAxAlIAJBEGokACABCzcBAn8jAEEQayIDJAAgA0EMaiIEIAEQJyACIAQQmwEiARBZOgAAIAAgARBYIAQQJSADQRBqJAALkwEBA38CQCABEKgBIQIjAEEQayIDJAAgAkH3////B00EQAJAIAIQ1AEEQCAAIAIQUCAAIQQMAQsgA0EIaiACEJ8BQQFqEJ4BIAMoAgwaIAAgAygCCCIENgIAIAAgAygCDBBcIAAgAjYCBAsgBCABIAIQTSADQQA6AAcgAiAEaiADQQdqEF0gA0EQaiQADAELEFsACwtGAQF/IABB+PsAKAIAIgE2AgAgACABQQxrKAIAakGY/AAoAgA2AgAgAEGc/AAoAgA2AgggAEEMahD8ARogAEFAaxDaASAACxcAIAAgAzYCECAAIAI2AgwgACABNgIIC7kHAQV/An8gAEH//wNxIQMgAEEQdiEEIAJBAUYEQCADIAEtAABqIgBB8f8DayAAIABB8P8DSxsiACAEaiIBQRB0IgJBgIA8aiACIAFB8P8DSxsgAHIMAQsgAQR/AkACQAJAAkAgAkEQTwRAAkAgAkGvK0sEQANAQdsCIQUgASEAA0AgAyAALQAAaiIDIARqIAMgAC0AAWoiA2ogAyAALQACaiIDaiADIAAtAANqIgNqIAMgAC0ABGoiA2ogAyAALQAFaiIDaiADIAAtAAZqIgNqIAMgAC0AB2oiA2ogAyAALQAIaiIDaiADIAAtAAlqIgNqIAMgAC0ACmoiA2ogAyAALQALaiIDaiADIAAtAAxqIgNqIAMgAC0ADWoiA2ogAyAALQAOaiIDaiADIAAtAA9qIgNqIQQgAEEQaiEAIAVBAWsiBQ0ACyAEQfH/A3AhBCADQfH/A3AhAyABQbAraiEBIAJBsCtrIgJBrytLDQALIAJFDQYgAkEQSQ0BCwNAIAMgAS0AAGoiACAEaiAAIAEtAAFqIgBqIAAgAS0AAmoiAGogACABLQADaiIAaiAAIAEtAARqIgBqIAAgAS0ABWoiAGogACABLQAGaiIAaiAAIAEtAAdqIgBqIAAgAS0ACGoiAGogACABLQAJaiIAaiAAIAEtAApqIgBqIAAgAS0AC2oiAGogACABLQAMaiIAaiAAIAEtAA1qIgBqIAAgAS0ADmoiAGogACABLQAPaiIDaiEEIAFBEGohASACQRBrIgJBD0sNAAsgAkUNBAsgAkEDcSIHDQEgAiEADAILAkAgAkUNAAJAIAJBA3EiB0UEQCACIQAMAQsgAiEAIAEhBQNAIABBAWshACADIAUtAABqIgMgBGohBCAFQQFqIgEhBSAGQQFqIgYgB0cNAAsLIAJBBEkNAANAIAMgAS0AAGoiAiABLQABaiIFIAEtAAJqIgYgAS0AA2oiAyAGIAUgAiAEampqaiEEIAFBBGohASAAQQRrIgANAAsLIARB8f8DcEEQdCADQfH/A2sgAyADQfD/A0sbcgwFCyACIQAgASEFA0AgAEEBayEAIAMgBS0AAGoiAyAEaiEEIAVBAWoiASEFIAZBAWoiBiAHRw0ACwsgAkEESQ0AA0AgAyABLQAAaiICIAEtAAFqIgUgAS0AAmoiBiABLQADaiIDIAYgBSACIARqampqIQQgAUEEaiEBIABBBGsiAA0ACwsgBEHx/wNwIQQgA0Hx/wNwIQMLIARBEHQgA3IFQQELCws6AQF/IAFBAEgEQBCMAQALQf////8HIAAoAgggACgCAGsiAEEBdCICIAEgASACSRsgAEH/////A08bCxwBAX8gACgCBCIBQQlPBEAgARAeIABBADYCBAsLPgEBfyABQYCAgIAETwRAEIwBAAtB/////wMgACgCCCAAKAIAayIAQQF1IgIgASABIAJJGyAAQfz///8HTxsLSQECfyAAKAIEIgZBCHUhBSAGQQFxBEAgAigCACAFEOgBIQULIAAoAgAiACABIAIgBWogA0ECIAZBAnEbIAQgACgCACgCGBELAAuqAQEDfyMAQRBrIgIkACACIAE6AA8CQAJAAn8gABBHIgRFBEBBCiEBIAAQXgwBCyAAEH5BAWshASAAKAIECyIDIAFGBEAgACABQQEgASABEPQBIAAQIxoMAQsgABAjGiAEDQAgACIBIANBAWoQUAwBCyAAKAIAIQEgACADQQFqNgIECyABIANqIgAgAkEPahBdIAJBADoADiAAQQFqIAJBDmoQXSACQRBqJAALoQIBA38jAEEgayIIJABB9////wciCSABQX9zaiACTwRAIAAQIyEKIAFB8////wNJBEAgCCABQQF0NgIcIAggASACajYCECAIQRBqIAhBHGoQoAEoAgAQnwFBAWohCQsgCEEcaiAIQRhqIAAQVSgCABC8ASAIQRBqIAkQngEgCCgCECECIAgoAhQaIAQEQCACIAogBBBNCyAGBEAgAiAEaiAHIAYQTQsgAyAEIAVqIglrIQcgAyAJRwRAIAIgBGogBmogBCAKaiAFaiAHEE0LIAFBCkcEQCAKEIsCCyAAIAI2AgAgACAIKAIUEFwgACAEIAZqIAdqIgA2AgQgCEEAOgAPIAAgAmogCEEPahBdIAhBHGoQuwEgCEEgaiQADwsQWwALCQAgAEEBEKgCCwoAIAAoAgAQHxoLCQAgACABEFUaCwcAIABBAkkLBABBBAsoAQF/IAAgACgCBEEBayIBNgIEIAFBf0YEQCAAIAAoAgAoAggRAgALC5UBAQN/IwBBEGsiBCQAIAQgATYCDCAEIAM2AgggBEEEaiAEQQxqEGMgBCgCCCEDIwBBEGsiASQAIAEgAzYCDCABIAM2AghBfyEFAkBBAEEAIAIgAxDRASIDQQBIDQAgACADQQFqIgMQNCIANgIAIABFDQAgACADIAIgASgCDBDRASEFCyABQRBqJAAQYiAEQRBqJAAgBQsPACAAIAAoAgAoAiQRAAALEQAgACABIAEoAgAoAiARAQALDgAgACABKAIANgIAIAALCABB/////wcLBQBB/wALOwAgACADNgIQIAAgAQR/IAEQUwVBAAsiAzYCACAAIAIgA2oiAjYCCCAAIAEgA2o2AgwgACACNgIEIAALYQEBfyMAQRBrIgIkACACIAA2AgwCQCAAIAFGDQADQCACIAFBBGsiATYCCCAAIAFPDQEgAigCDCACKAIIENcBIAIgAigCDEEEaiIANgIMIAIoAgghAQwACwALIAJBEGokAAs5AgF/AX4jAEEQayIEJAAgAykDACEFIAQgAykDCDcDCCAEIAU3AwAgACABIAIgBBDAASAEQRBqJAAL0AEBAn8gAkGAEHEEQCAAQSs6AAAgAEEBaiEACyACQYAIcQRAIABBIzoAACAAQQFqIQALIAJBhAJxIgNBhAJHBEAgAEGu1AA7AAAgAEECaiEACyACQYCAAXEhAgNAIAEtAAAiBARAIAAgBDoAACAAQQFqIQAgAUEBaiEBDAELCyAAAn8CQCADQYACRwRAIANBBEcNAUHGAEHmACACGwwCC0HFAEHlACACGwwBC0HBAEHhACACGyADQYQCRg0AGkHHAEHnACACGws6AAAgA0GEAkcLKwEBfyMAQRBrIgUkACAFIAQoAgA2AgAgACABIAIgAyAFEJYBIAVBEGokAAuqAQEBfwJAIANBgBBxRSACRXINACADQcoAcSIEQQhGIARBwABGcg0AIABBKzoAACAAQQFqIQALIANBgARxBEAgAEEjOgAAIABBAWohAAsDQCABLQAAIgQEQCAAIAQ6AAAgAEEBaiEAIAFBAWohAQwBCwsgAAJ/Qe8AIANBygBxIgFBwABGDQAaQdgAQfgAIANBgIABcRsgAUEIRg0AGkHkAEH1ACACGws6AAALDAAgABAjIAFBAnRqC5IEAQt/IwBBgAFrIgokACAKIAE2AnwgAiADELUCIQggCkHjADYCECAKQQhqQQAgCkEQaiIJEDYhDwJAAkACQCAIQeUATwRAIAgQNCIJRQ0BIA8gCRA8CyAJIQcgAiEBA0AgASADRgRAA0AgACAKQfwAaiIBECtBASAIGwRAIAAgARArBEAgBSAFKAIAQQJyNgIACwNAIAIgA0YNBiAJLQAAQQJGDQcgCUEBaiEJIAJBDGohAgwACwALIAAQNyEOIAZFBEAgBCAOEEEhDgsgDUEBaiEMQQAhECAJIQcgAiEBA0AgASADRgRAIAwhDSAQRQ0CIAAQPhogCSEHIAIhASAIIAtqQQJJDQIDQCABIANGBEAMBAUCQCAHLQAAQQJHDQAgARAfIA1GDQAgB0EAOgAAIAtBAWshCwsgB0EBaiEHIAFBDGohAQwBCwALAAUCQCAHLQAAQQFHDQAgASANEMwBKAIAIRECQCAGBH8gEQUgBCAREEELIA5GBEBBASEQIAEQHyAMRw0CIAdBAjoAACALQQFqIQsMAQsgB0EAOgAACyAIQQFrIQgLIAdBAWohByABQQxqIQEMAQsACwALAAUgB0ECQQEgARBaIgwbOgAAIAdBAWohByABQQxqIQEgCyAMaiELIAggDGshCAwBCwALAAsQPQALIAUgBSgCAEEEcjYCAAsgDxA1IApBgAFqJAAgAgsRACAAIAEgACgCACgCDBEEAAuTBAELfyMAQYABayIKJAAgCiABNgJ8IAIgAxC1AiEIIApB4wA2AhAgCkEIakEAIApBEGoiCRA2IQ8CQAJAAkAgCEHlAE8EQCAIEDQiCUUNASAPIAkQPAsgCSEHIAIhAQNAIAEgA0YEQANAIAAgCkH8AGoiARAsQQEgCBsEQCAAIAEQLARAIAUgBSgCAEECcjYCAAsDQCACIANGDQYgCS0AAEECRg0HIAlBAWohCSACQQxqIQIMAAsACyAAEDghDiAGRQRAIAQgDhDOASEOCyANQQFqIQxBACEQIAkhByACIQEDQCABIANGBEAgDCENIBBFDQIgABA/GiAJIQcgAiEBIAggC2pBAkkNAgNAIAEgA0YEQAwEBQJAIActAABBAkcNACABEB8gDUYNACAHQQA6AAAgC0EBayELCyAHQQFqIQcgAUEMaiEBDAELAAsABQJAIActAABBAUcNACABIA0QIiwAACERAkAgBgR/IBEFIAQgERDOAQsgDkYEQEEBIRAgARAfIAxHDQIgB0ECOgAAIAtBAWohCwwBCyAHQQA6AAALIAhBAWshCAsgB0EBaiEHIAFBDGohAQwBCwALAAsABSAHQQJBASABEFoiDBs6AAAgB0EBaiEHIAFBDGohASALIAxqIQsgCCAMayEIDAELAAsACxA9AAsgBSAFKAIAQQRyNgIACyAPEDUgCkGAAWokACACC0oBAn8CQCAALQAAIgJFIAIgAS0AACIDR3INAANAIAEtAAEhAyAALQABIgJFDQEgAUEBaiEBIABBAWohACACIANGDQALCyACIANrC4QBAQJ/IwBBoAFrIgQkACAEIAAgBEGeAWogARsiADYClAEgBCABQQFrIgVBACABIAVPGzYCmAEgBEEAQZAB/AsAIARBfzYCTCAEQeIANgIkIARBfzYCUCAEIARBnwFqNgIsIAQgBEGUAWo2AlQgAEEAOgAAIAQgAiADEM0DIARBoAFqJAALuwIBBH8gA0H87QEgAxsiBSgCACEDAkACfwJAIAFFBEAgAw0BQQAPC0F+IAJFDQEaAkAgAwRAIAIhBAwBCyABLQAAIgPAIgRBAE4EQCAABEAgACADNgIACyAEQQBHDwtB3OEBKAIAKAIARQRAQQEgAEUNAxogACAEQf+/A3E2AgBBAQ8LIANBwgFrIgNBMksNASADQQJ0KAKQgQEhAyACQQFrIgRFDQMgAUEBaiEBCyABLQAAIgZBA3YiB0EQayADQRp1IAdqckEHSw0AA0AgBEEBayEEIAZB/wFxQYABayADQQZ0ciIDQQBOBEAgBUEANgIAIAAEQCAAIAM2AgALIAIgBGsPCyAERQ0DIAFBAWoiASwAACIGQUBIDQALCyAFQQA2AgBBiOoBQRk2AgBBfwsPCyAFIAM2AgBBfgsNACAAKAIAIAEoAgBJCwcAIABBC0kLJgAgACAAKAIYRSAAKAIQIAFyciIBNgIQIAAoAhQgAXEEQBA9AAsLBwAgAEEISwscAQF/IAAoAgAhAiAAIAEoAgA2AgAgASACNgIACwwAIABBDGoQ2gEgAAsIACAAKAIQRQsIACAAEIkCGgusCwEHfyAAIAFqIQUCQAJAIAAoAgQiAkEBcQ0AIAJBAnFFDQEgACgCACICIAFqIQECQAJAAkAgACACayIAQaDqASgCAEcEQCAAKAIMIQMgAkH/AU0EQCADIAAoAggiBEcNAkGM6gFBjOoBKAIAQX4gAkEDdndxNgIADAULIAAoAhghBiAAIANHBEAgACgCCCICIAM2AgwgAyACNgIIDAQLIAAoAhQiBAR/IABBFGoFIAAoAhAiBEUNAyAAQRBqCyECA0AgAiEHIAQiA0EUaiECIAMoAhQiBA0AIANBEGohAiADKAIQIgQNAAsgB0EANgIADAMLIAUoAgQiAkEDcUEDRw0DQZTqASABNgIAIAUgAkF+cTYCBCAAIAFBAXI2AgQgBSABNgIADwsgBCADNgIMIAMgBDYCCAwCC0EAIQMLIAZFDQACQCAAKAIcIgJBAnQiBCgCvOwBIABGBEAgBEG87AFqIAM2AgAgAw0BQZDqAUGQ6gEoAgBBfiACd3E2AgAMAgsCQCAAIAYoAhBGBEAgBiADNgIQDAELIAYgAzYCFAsgA0UNAQsgAyAGNgIYIAAoAhAiAgRAIAMgAjYCECACIAM2AhgLIAAoAhQiAkUNACADIAI2AhQgAiADNgIYCwJAAkACQAJAIAUoAgQiAkECcUUEQEGk6gEoAgAgBUYEQEGk6gEgADYCAEGY6gFBmOoBKAIAIAFqIgE2AgAgACABQQFyNgIEIABBoOoBKAIARw0GQZTqAUEANgIAQaDqAUEANgIADwtBoOoBKAIAIgggBUYEQEGg6gEgADYCAEGU6gFBlOoBKAIAIAFqIgE2AgAgACABQQFyNgIEIAAgAWogATYCAA8LIAJBeHEgAWohASAFKAIMIQMgAkH/AU0EQCAFKAIIIgQgA0YEQEGM6gFBjOoBKAIAQX4gAkEDdndxNgIADAULIAQgAzYCDCADIAQ2AggMBAsgBSgCGCEGIAMgBUcEQCAFKAIIIgIgAzYCDCADIAI2AggMAwsgBSgCFCIEBH8gBUEUagUgBSgCECIERQ0CIAVBEGoLIQIDQCACIQcgBCIDQRRqIQIgAygCFCIEDQAgA0EQaiECIAMoAhAiBA0ACyAHQQA2AgAMAgsgBSACQX5xNgIEIAAgAUEBcjYCBCAAIAFqIAE2AgAMAwtBACEDCyAGRQ0AAkAgBSgCHCICQQJ0IgQoArzsASAFRgRAIARBvOwBaiADNgIAIAMNAUGQ6gFBkOoBKAIAQX4gAndxNgIADAILAkAgBSAGKAIQRgRAIAYgAzYCEAwBCyAGIAM2AhQLIANFDQELIAMgBjYCGCAFKAIQIgIEQCADIAI2AhAgAiADNgIYCyAFKAIUIgJFDQAgAyACNgIUIAIgAzYCGAsgACABQQFyNgIEIAAgAWogATYCACAAIAhHDQBBlOoBIAE2AgAPCyABQf8BTQRAIAFBeHFBtOoBaiECAn9BjOoBKAIAIgNBASABQQN2dCIBcUUEQEGM6gEgASADcjYCACACDAELIAIoAggLIQEgAiAANgIIIAEgADYCDCAAIAI2AgwgACABNgIIDwtBHyEDIAFB////B00EQCABQSYgAUEIdmciAmt2QQFxIAJBAXRrQT5qIQMLIAAgAzYCHCAAQgA3AhAgA0ECdEG87AFqIQICQAJAQZDqASgCACIEQQEgA3QiB3FFBEBBkOoBIAQgB3I2AgAgAiAANgIAIAAgAjYCGAwBCyABQRkgA0EBdmtBACADQR9HG3QhAyACKAIAIQIDQCACIgQoAgRBeHEgAUYNAiADQR12IQIgA0EBdCEDIAQgAkEEcWoiBygCECICDQALIAcgADYCECAAIAQ2AhgLIAAgADYCDCAAIAA2AggPCyAEKAIIIgEgADYCDCAEIAA2AgggAEEANgIYIAAgBDYCDCAAIAE2AggLC40IAQt/IABFBEAgARA0DwsgAUFATwRAQYjqAUEwNgIAQQAPCwJ/QRAgAUELakF4cSABQQtJGyEGIABBCGsiBCgCBCIJQXhxIQgCQCAJQQNxRQRAIAZBgAJJDQEgBkEEaiAITQRAIAQhAiAIIAZrQeztASgCAEEBdE0NAgtBAAwCCyAEIAhqIQcCQCAGIAhNBEAgCCAGayIDQRBJDQEgBCAGIAlBAXFyQQJyNgIEIAQgBmoiAiADQQNyNgIEIAcgBygCBEEBcjYCBCACIAMQ2wEMAQtBpOoBKAIAIAdGBEBBmOoBKAIAIAhqIgggBk0NAiAEIAYgCUEBcXJBAnI2AgQgBCAGaiIDIAggBmsiAkEBcjYCBEGY6gEgAjYCAEGk6gEgAzYCAAwBC0Gg6gEoAgAgB0YEQEGU6gEoAgAgCGoiAyAGSQ0CAkAgAyAGayICQRBPBEAgBCAGIAlBAXFyQQJyNgIEIAQgBmoiCCACQQFyNgIEIAMgBGoiAyACNgIAIAMgAygCBEF+cTYCBAwBCyAEIAlBAXEgA3JBAnI2AgQgAyAEaiICIAIoAgRBAXI2AgRBACECQQAhCAtBoOoBIAg2AgBBlOoBIAI2AgAMAQsgBygCBCIDQQJxDQEgA0F4cSAIaiILIAZJDQEgCyAGayEMIAcoAgwhBQJAIANB/wFNBEAgBygCCCICIAVGBEBBjOoBQYzqASgCAEF+IANBA3Z3cTYCAAwCCyACIAU2AgwgBSACNgIIDAELIAcoAhghCgJAIAUgB0cEQCAHKAIIIgIgBTYCDCAFIAI2AggMAQsCQCAHKAIUIgIEfyAHQRRqBSAHKAIQIgJFDQEgB0EQagshCANAIAghAyACIgVBFGohCCACKAIUIgINACAFQRBqIQggBSgCECICDQALIANBADYCAAwBC0EAIQULIApFDQACQCAHKAIcIgNBAnQiAigCvOwBIAdGBEAgAkG87AFqIAU2AgAgBQ0BQZDqAUGQ6gEoAgBBfiADd3E2AgAMAgsCQCAHIAooAhBGBEAgCiAFNgIQDAELIAogBTYCFAsgBUUNAQsgBSAKNgIYIAcoAhAiAgRAIAUgAjYCECACIAU2AhgLIAcoAhQiAkUNACAFIAI2AhQgAiAFNgIYCyAMQQ9NBEAgBCAJQQFxIAtyQQJyNgIEIAQgC2oiAiACKAIEQQFyNgIEDAELIAQgBiAJQQFxckECcjYCBCAEIAZqIgMgDEEDcjYCBCAEIAtqIgIgAigCBEEBcjYCBCADIAwQ2wELIAQhAgsgAgsiAgRAIAJBCGoPCyABEDQiBEUEQEEADwsgBCAAQXxBeCAAQQRrKAIAIgJBA3EbIAJBeHFqIgIgASABIAJLGxBxGiAAEC0gBAsWACAARQRAQQAPC0GI6gEgADYCAEF/C30BAn8jAEEQayIBJAAgAUEKOgAPAkACQCAAKAIQIgIEfyACBSAAEN8BDQIgACgCEAsgACgCFCICRg0AIAAoAlBBCkYNACAAIAJBAWo2AhQgAkEKOgAADAELIAAgAUEPakEBIAAoAiQRAwBBAUcNACABLQAPGgsgAUEQaiQAC1kBAX8gACAAKAJIIgFBAWsgAXI2AkggACgCACIBQQhxBEAgACABQSByNgIAQX8PCyAAQgA3AgQgACAAKAIsIgE2AhwgACABNgIUIAAgASAAKAIwajYCEEEAC+IBAQJ/IAJBAEchAwJAAkACQCAAQQNxRSACRXINACABQf8BcSEEA0AgAC0AACAERg0CIAJBAWsiAkEARyEDIABBAWoiAEEDcUUNASACDQALCyADRQ0BIAFB/wFxIgMgAC0AAEYgAkEESXJFBEAgA0GBgoQIbCEDA0BBgIKECCAAKAIAIANzIgRrIARyQYCBgoR4cUGAgYKEeEcNAiAAQQRqIQAgAkEEayICQQNLDQALCyACRQ0BCyABQf8BcSEBA0AgASAALQAARgRAIAAPCyAAQQFqIQAgAkEBayICDQALC0EACwIACwQAQQELoBABFn8jAEFAaiIGQgA3AzAgBkIANwM4IAZCADcDICAGQgA3AygCQAJAAn8CQAJ/IAIEQCACQQRPBEAgAUEGaiEIIAFBBGohDSABQQJqIQsgAkF8cSEMA0AgBkEgaiIPIAEgCkEBdCIJai8BAEEBdGoiESARLwEAQQFqOwEAIAkgC2ovAQBBAXQgD2oiESARLwEAQQFqOwEAIAkgDWovAQBBAXQgD2oiESARLwEAQQFqOwEAIAggCWovAQBBAXQgD2oiCSAJLwEAQQFqOwEAIApBBGohCiAOQQRqIg4gDEcNAAsLIAJBA3EiCQRAA0AgBkEgaiABIApBAXRqLwEAQQF0aiIIIAgvAQBBAWo7AQAgCkEBaiEKIAdBAWoiByAJRw0ACwsgBCgCACIKIAYvAT4iEEUNARpBDyELDAILIAQoAgALIQpBACEQIAYvATwEQEEOIQsMAQsgBi8BOgRAQQ0hCwwBCyAGLwE4BEBBDCELDAELIAYvATYEQEELIQsMAQsgBi8BNARAQQohCwwBCyAGLwEyBEBBCSELDAELIAYvATAEQEEIIQsMAQsgBi8BLgRAQQchCwwBCyAGLwEsBEBBBiELDAELIAYvASoEQEEFIQsMAQsgBi8BKARAQQQhCwwBCyAGLwEmBEBBAyELDAELIAYvASQEQEECIQsMAQsgBi8BIkUEQCADIAMoAgAiAEEEajYCACAAQcACNgEAIAMgAygCACIAQQRqNgIAIABBwAI2AQBBASEMDAMLIApBAEchCUEBIQtBASEKQQAMAQsgCiALIAogC0kbIQlBASEKAkADQCAGQSBqIApBAXRqLwEADQEgCkEBaiIKIAtHDQALIAshCgtBAQshD0F/IQcgBi8BIiIIQQJLDQFBBCAIQQF0a0H+/wNxIAYvASQiDWsiDkEASA0BIA5BAXQgBi8BJiIOayIMQQBIDQEgDEEBdCAGLwEoIgxrIhFBAEgNASARQQF0IAYvASoiEWsiGEEASA0BIBhBAXQgBi8BLCIYayISQQBIDQEgEkEBdCAGLwEuIhJrIhNBAEgNASATQQF0IAYvATAiE2siFEEASA0BIBRBAXQgBi8BMiIUayIVQQBIDQEgFUEBdCAGLwE0IhVrIhdBAEgNASAXQQF0IAYvATYiF2siFkEASA0BIBZBAXQgBi8BOCIWayIZQQBIDQEgGUEBdCAGLwE6IhlrIhpBAEgNASAaQQF0IAYvATwiGmsiG0EASA0BIBtBAXQiGyAQSSAQIBtHQQAgAEUgD3Ibcg0BIAkgCkshEEEAIQcgBkEAOwECIAYgCDsBBCAGIAggDWoiCDsBBiAGIAggDmoiCDsBCCAGIAggDGoiCDsBCiAGIAggEWoiCDsBDCAGIAggGGoiCDsBDiAGIAggEmoiCDsBECAGIAggE2oiCDsBEiAGIAggFGoiCDsBFCAGIAggFWoiCDsBFiAGIAggF2oiCDsBGCAGIAggFmoiCDsBGiAGIAggGWoiCDsBHCAGIAggGmo7AR4CQCACRQ0AIAJBAUcEQCACQX5xIQhBACEOA0AgASAHQQF0ai8BACINBEAgBiANQQF0aiINIA0vAQAiDUEBajsBACAFIA1BAXRqIAc7AQALIAEgB0EBciINQQF0ai8BACIMBEAgBiAMQQF0aiIMIAwvAQAiDEEBajsBACAFIAxBAXRqIA07AQALIAdBAmohByAOQQJqIg4gCEcNAAsLIAJBAXFFDQAgASAHQQF0ai8BACICRQ0AIAYgAkEBdGoiAiACLwEAIgJBAWo7AQAgBSACQQF0aiAHOwEACyAJIAogEBshDEEUIRJBACEXIAUiCCERQQAhEwJAAkACQCAADgICAAELQQEhByAMQQlLDQNBgQIhEkHA7QAhEUGA7QAhCEEBIRMMAQsgAEECRiEXQQAhEkHA7gAhEUGA7gAhCCAAQQJHBEAMAQtBASEHIAxBCUsNAgtBASAMdCIUQQFrIRkgAygCACEVQQAhAiAMIQlBACEAQQAhEEF/IQ0DQEEBIAl0IRgCQANAAn9BACASIAUgAkEBdGovAQAiCUEBaksNABogCSASSQRAQQAhCUHgAAwBCyAIIAkgEmtBAXQiB2ovAQAhCSAHIBFqLQAACyEOQX8gCiAAayIPdCEaIBUgECAAdkECdGohGyAYIQcDQCAbIAcgGmoiB0ECdGoiFiAJOwECIBYgDzoAASAWIA46AAAgBw0AC0EBIApBAWt0IQ4DQCAOIgdBAXYhDiAHIBBxDQALIAZBIGogCkEBdGoiCSAJLwEAQQFrIgk7AQAgB0EBayAQcSAHakEAIAcbIRAgAkEBaiECIAlB//8DcUUEQCAKIAtGDQIgASAFIAJBAXRqLwEAQQF0ai8BACEKCyAKIAxNDQAgECAZcSIOIA1GDQALQQEgCiAAIAwgABsiAGsiCXQhDyAKIAtJBEAgAEEBaiEWIAsgAGshDSAKIQcCQANAIA8gBkEgaiAHQQF0ai8BAGsiB0EATA0BIAdBAXQhDyAJIBZqIQcgCUEBaiEJIAcgC0kNAAsgDSEJC0EBIAl0IQ8LQQEhByATIA8gFGoiFEHUBktxIBcgFEHQBEtxcg0DIAMoAgAiDSAOQQJ0aiIHIAw6AAEgByAJOgAAIAcgFSAYQQJ0aiIVIA1rQQJ2OwECIA4hDQwBCwsgEARAIBUgEEECdGoiAEEAOwECIAAgDzoAASAAQcAAOgAACyADIAMoAgAgFEECdGo2AgALIAQgDDYCAEEAIQcLIAcLqgEBA38gASwAC0EATgRAIAAgASkCADcCACAAIAEoAgg2AggPCyABKAIAIQQgASgCBCECIwBBEGsiAyQAAkACQAJAIAIQ1AEEQCAAIgEgAhBQDAELIAJB9////wdLDQEgA0EIaiACEJ8BQQFqEJ4BIAMoAgwaIAAgAygCCCIBNgIAIAAgAygCDBBcIAAgAjYCBAsgASAEIAJBAWoQTSADQRBqJAAMAQsQWwALC0sBAn8gACgCBCIHQQh1IQYgB0EBcQRAIAMoAgAgBhDoASEGCyAAKAIAIgAgASACIAMgBmogBEECIAdBAnEbIAUgACgCACgCFBEKAAsgAAJAIAEgACgCBEcNACAAKAIcQQFGDQAgACACNgIcCwuaAQAgAEEBOgA1AkAgAiAAKAIERw0AIABBAToANAJAIAAoAhAiAkUEQCAAQQE2AiQgACADNgIYIAAgATYCECADQQFHDQIgACgCMEEBRg0BDAILIAEgAkYEQCAAKAIYIgJBAkYEQCAAIAM2AhggAyECCyAAKAIwQQFHDQIgAkEBRg0BDAILIAAgACgCJEEBajYCJAsgAEEBOgA2CwsKACAAIAFqKAIAC3YBAX8gACgCJCIDRQRAIAAgAjYCGCAAIAE2AhAgAEEBNgIkIAAgACgCODYCFA8LAkACQCAAKAIUIAAoAjhHDQAgACgCECABRw0AIAAoAhhBAkcNASAAIAI2AhgPCyAAQQE6ADYgAEECNgIYIAAgA0EBajYCJAsLrQEBA38jAEEQayICJAAgAiABNgIMAkACQAJ/IAAQRyIERQRAQQEhASAAEF4MAQsgABB+QQFrIQEgACgCBAsiAyABRgRAIAAgAUEBIAEgARDoAiAAECMaDAELIAAQIxogBA0AIAAiASADQQFqEFAMAQsgACgCACEBIAAgA0EBajYCBAsgASADQQJ0aiIAIAJBDGoQViACQQA2AgggAEEEaiACQQhqEFYgAkEQaiQACwUAED0ACycBAX8gACgCACEBIwBBEGsiACQAIAAgATYCDCAAKAIMIABBEGokAAsXACAAKAIIEC5HBEAgACgCCBCgAwsgAAs0AQF/IwBBEGsiAyQAIAMgAjYCDCADQQhqIANBDGoQYyAAIAEQlgIhABBiIANBEGokACAAC40BAQN/IAEoAgQgACgCACICIAAoAgQiA2tqIQQgAyACayIDBEAgBCACIAP8CgAACyABIAQ2AgQgACAAKAIAIgI2AgQgACABKAIENgIAIAEgAjYCBCAAKAIEIQIgACABKAIINgIEIAEgAjYCCCAAKAIIIQIgACABKAIMNgIIIAEgAjYCDCABIAEoAgQ2AgALMwEBfyMAQRBrIgIkACACIAAoAgA2AgwgAiACKAIMIAFBAnRqNgIMIAIoAgwgAkEQaiQACxkBAX9BASEBIAAQRwR/IAAQfkEBawVBAQsLBwAgAEEEagswAQF/IwBBEGsiAiQAIAIgACgCADYCDCACIAIoAgwgAWo2AgwgAigCDCACQRBqJAAL9wEBBX8jAEEQayIGJAAgBkEMaiIIIAZBCGogABBVKAIAELwBIwBBEGsiBSQAAkBB9////wcgAWsgAk8EQCAAECMhByAFQQRqIgkgAUHz////A0kEfyAFIAFBAXQ2AgwgBSABIAJqNgIEIAkgBUEMahCgASgCABCfAUEBagVB9////wcLEJ4BIAUoAgQhAiAFKAIIGiAEBEAgAiAHIAQQTQsgAyAERwRAIAIgBGogBCAHaiADIARrEE0LIAFBCkcEQCAHEIsCCyAAIAI2AgAgACAFKAIIEFwgBUEQaiQADAELEFsACyAAIAM2AgQgCBC7ASAGQRBqJAALCgAgASAAa0ECdQsPACAAIAAoAgBBBGo2AgALIAEBfyMAQRBrIgEkACABQQxqIAAQVSgCACABQRBqJAALDwAgACAAKAIAQQFqNgIAC1kBAn8jAEEQayIDJAAgAigCACEEIAACfyABIABrQQJ1IgIEQANAIAAgBCAAKAIARg0CGiAAQQRqIQAgAkEBayICDQALC0EACyIAIAEgABsQjgEgA0EQaiQAC/gDAQF/IwBBEGsiDCQAIAwgADYCDAJAAkAgACAFRgRAIAEtAABBAUcNAUEAIQAgAUEAOgAAIAQgBCgCACIBQQFqNgIAIAFBLjoAACAHEB9FDQIgCSgCACIBIAhrQZ8BSg0CIAooAgAhAiAJIAFBBGo2AgAgASACNgIADAILAkACQCAAIAZHDQAgBxAfRQ0AIAEtAABBAUcNAiAJKAIAIgAgCGtBnwFKDQEgCigCACEBIAkgAEEEajYCACAAIAE2AgBBACEAIApBADYCAAwDCyALIAtB8ABqIAxBDGoQ+QEgC2siAEECdSIGQRtKDQEgBkHQnwFqLAAAIQUCQAJAIABBe3EiAEHYAEcEQCAAQeAARw0BIAMgBCgCACIBRwRAQX8hACABQQFrLAAAEJ0BIAIsAAAQnQFHDQYLIAQgAUEBajYCACABIAU6AAAMAwsgAkHQADoAAAwBCyAFEJ0BIgAgAiwAAEcNACACIAAQsQM6AAAgAS0AAEEBRw0AIAFBADoAACAHEB9FDQAgCSgCACIAIAhrQZ8BSg0AIAooAgAhASAJIABBBGo2AgAgACABNgIACyAEIAQoAgAiAEEBajYCACAAIAU6AABBACEAIAZBFUoNAiAKIAooAgBBAWo2AgAMAgtBACEADAELQX8hAAsgDEEQaiQAIAALUAECfyMAQRBrIgYkACAGQQxqIgUgARAnIAUQSEHQnwFB7J8BIAIQbyADIAUQmQEiARB4NgIAIAQgARBZNgIAIAAgARBYIAUQJSAGQRBqJAALGAAgAEGQ9wA2AgAgAEEgahAgGiAAEJQCCy8BAX8jAEEQayIDJAAgACAAIAIsAAAgASAAaxDgASIAIAEgABsQjgEgA0EQaiQAC/ADAQF/IwBBEGsiDCQAIAwgADoADwJAAkAgACAFRgRAIAEtAABBAUcNAUEAIQAgAUEAOgAAIAQgBCgCACIBQQFqNgIAIAFBLjoAACAHEB9FDQIgCSgCACIBIAhrQZ8BSg0CIAooAgAhAiAJIAFBBGo2AgAgASACNgIADAILAkACQCAAIAZHDQAgBxAfRQ0AIAEtAABBAUcNAiAJKAIAIgAgCGtBnwFKDQEgCigCACEBIAkgAEEEajYCACAAIAE2AgBBACEAIApBADYCAAwDCyALIAtBHGogDEEPahD9ASALayIFQRtKDQEgBUHQnwFqLAAAIQYCQAJAAkACQCAFQX5xQRZrDgMBAgACCyADIAQoAgAiAUcEQEF/IQAgAUEBaywAABCdASACLAAAEJ0BRw0GCyAEIAFBAWo2AgAgASAGOgAADAMLIAJB0AA6AAAMAQsgBhCdASIAIAIsAABHDQAgAiAAELEDOgAAIAEtAABBAUcNACABQQA6AAAgBxAfRQ0AIAkoAgAiACAIa0GfAUoNACAKKAIAIQEgCSAAQQRqNgIAIAAgATYCAAsgBCAEKAIAIgBBAWo2AgAgACAGOgAAQQAhACAFQRVKDQIgCiAKKAIAQQFqNgIADAILQQAhAAwBC0F/IQALIAxBEGokACAAC1ABAn8jAEEQayIGJAAgBkEMaiIFIAEQJyAFEElB0J8BQeyfASACEHkgAyAFEJsBIgEQeDoAACAEIAEQWToAACAAIAEQWCAFECUgBkEQaiQAC34CAn8CfiMAQaABayIEJAAgBCABNgI8IAQgATYCFCAEQX82AhggBEEQaiIFQgAQZCAEIAUgA0EBEKgDIAQpAwghBiAEKQMAIQcgAgRAIAIgBCgCiAEgASAEKAIUIAQoAjxramo2AgALIAAgBjcDCCAAIAc3AwAgBEGgAWokAAsJACAAQQQQqAILDQAgACABIAJCfxCEAgucAQEDf0E1IQECQCAAKAIcIgIgACgCGCIDQQZqQQdwa0EHakEHbiADIAJrIgJB8QJqQQdwQQNJaiIDQTVHBEAgAyIBDQFBNCEBAkACQCACQQZqQQdwQQRrDgIBAAMLIAAoAhRBkANvQQFrEJ0DRQ0CC0E1DwsCQAJAIAJB8wJqQQdwQQNrDgIAAgELIAAoAhQQnQMNAQtBASEBCyABC5sEAgd/BH4jAEEQayIIJAACQAJAAkAgAkEkTARAIAAtAAAiBQ0BIAAhBAwCC0GI6gFBHDYCAEIAIQMMAgsgACEEAkADQCAFwBB9RQ0BIAQtAAEhBSAEQQFqIQQgBQ0ACwwBCwJAIAVB/wFxIgZBK2sOAwABAAELQX9BACAGQS1GGyEHIARBAWohBAsCfwJAIAJBEHJBEEcNACAELQAAQTBHDQBBASEJIAQtAAFB3wFxQdgARgRAIARBAmohBEEQDAILIARBAWohBCACQQggAhsMAQsgAkEKIAIbCyIKrSEMQQAhAgNAAkACQCAELQAAIgZBMGsiBUH/AXFBCkkNACAGQeEAa0H/AXFBGU0EQCAGQdcAayEFDAELIAZBwQBrQf8BcUEZSw0BIAZBN2shBQsgCiAFQf8BcUwNACAIIAxCACALQgAQQEEBIQYCQCAIKQMIQgBSDQAgCyAMfiINIAWtQv8BgyIOQn+FVg0AIA0gDnwhC0EBIQkgAiEGCyAEQQFqIQQgBiECDAELCyABBEAgASAEIAAgCRs2AgALAkACQCACBEBBiOoBQcQANgIAIAdBACADQgGDIgxQGyEHIAMhCwwBCyADIAtWDQEgA0IBgyEMCyAMpyAHckUEQEGI6gFBxAA2AgAgA0IBfSEDDAILIAMgC1oNAEGI6gFBxAA2AgAMAQsgCyAHrCIDhSADfSEDCyAIQRBqJAAgAwuIAQEDfyABKAIEIAAoAgQgACgCACIEayICayEDIAIEQCADIAQgAvwKAAALIAEgAzYCBCAAIAAoAgAiAjYCBCAAIAEoAgQ2AgAgASACNgIEIAAoAgQhAiAAIAEoAgg2AgQgASACNgIIIAAoAgghAiAAIAEoAgw2AgggASACNgIMIAEgASgCBDYCAAuaAwEIfwJAIAAiAUEDcQRAA0AgAS0AACICRSACQT1Gcg0CIAFBAWoiAUEDcQ0ACwsCQAJAQYCChAggASgCACIDayADckGAgYKEeHFBgIGChHhHDQADQEGAgoQIIANBvfr06QNzIgJrIAJyQYCBgoR4cUGAgYKEeEcNASABKAIEIQMgAUEEaiICIQEgA0GAgoQIIANrckGAgYKEeHFBgIGChHhGDQALDAELIAEhAgsDQCACIgEtAAAiA0UNASABQQFqIQIgA0E9Rw0ACwsgACABRgRAQQAPCwJAIAAgASAAayIDai0AAA0AQYDuASgCACIERQ0AIAQoAgAiAUUNAANAAkACfyAAIQJBACADIgZFDQAaIAAtAAAiBQR/AkADQCAFIAEtAAAiB0cgB0VyDQEgBkEBayIGRQ0BIAFBAWohASACLQABIQUgAkEBaiECIAUNAAtBACEFCyAFBUEACyABLQAAawtFBEAgBCgCACADaiIBLQAAQT1GDQELIAQoAgQhASAEQQRqIQQgAQ0BDAILCyABQQFqIQgLIAgLSgEBfyAAIAM2AhAgAEEANgIMIAEEQCABELMCIQQLIAAgBDYCACAAIAQgAkECdGoiAjYCCCAAIAQgAUECdGo2AgwgACACNgIEIAALRAEBfyMAQRBrIgUkACAFIAEgAiADIARCgICAgICAgICAf4UQSiAFKQMAIQEgACAFKQMINwMIIAAgATcDACAFQRBqJAALcgECfyAAQYj+ADYCACAAKAIcBEAgACgCKCEBA0AgAQRAQQAgACABQQFrIgFBAnQiAiAAKAIkaigCACAAKAIgIAJqKAIAEQUADAELCyAAQRxqECUgACgCIBAtIAAoAiQQLSAAKAIwEC0gACgCPBAtCyAACwcAIAEgAGsLDABBARDWARogABAtCwkAIAAQsQEQLQsTACAAIAEgAiAAKAIAKAIwEQMACwkAIAAQ2AEQLQsMACAAQQRqENoBIAALDAAgAEEIahDaASAACygBAn8jAEEQayICJAAgASgCACAAKAIASCEDIAJBEGokACABIAAgAxsLEAAgACABNwMIIABCADcDAAsCAAsUACAAQZj1ADYCACAAQQRqECUgAAvyAwICfgV/IwBBIGsiBSQAIAFC////////P4MhAgJ+IAFCMIhC//8BgyIDpyIEQYH4AGtB/Q9NBEAgAkIEhiAAQjyIhCECIARBgPgAa60hAwJAIABC//////////8PgyIAQoGAgICAgICACFoEQCACQgF8IQIMAQsgAEKAgICAgICAgAhSDQAgAkIBgyACfCECC0IAIAIgAkL/////////B1YiBBshACAErSADfAwBCyAAIAKEUCADQv//AVJyRQRAIAJCBIYgAEI8iIRCgICAgICAgASEIQBC/w8MAQsgBEH+hwFLBEBCACEAQv8PDAELQYD4AEGB+AAgA1AiBxsiCCAEayIGQfAASgRAQgAhAEIADAELIAVBEGogACACIAJCgICAgICAwACEIAcbIgJBgAEgBmsQRCAFIAAgAiAGEIoBIAUpAwhCBIYgBSkDACICQjyIhCEAAkAgBCAIRyAFKQMQIAUpAxiEQgBSca0gAkL//////////w+DhCICQoGAgICAgICACFoEQCAAQgF8IQAMAQsgAkKAgICAgICAgAhSDQAgAEIBgyAAfCEACyAAQoCAgICAgIAIhSAAIABC/////////wdWIgQbIQAgBK0LIQIgBUEgaiQAIAFCgICAgICAgICAf4MgAkI0hoQgAIS/C4kCAAJAIAAEfyABQf8ATQ0BAkBB3OEBKAIAKAIARQRAIAFBgH9xQYC/A0YNAwwBCyABQf8PTQRAIAAgAUE/cUGAAXI6AAEgACABQQZ2QcABcjoAAEECDwsgAUGAQHFBgMADRyABQYCwA09xRQRAIAAgAUE/cUGAAXI6AAIgACABQQx2QeABcjoAACAAIAFBBnZBP3FBgAFyOgABQQMPCyABQYCABGtB//8/TQRAIAAgAUE/cUGAAXI6AAMgACABQRJ2QfABcjoAACAAIAFBBnZBP3FBgAFyOgACIAAgAUEMdkE/cUGAAXI6AAFBBA8LC0GI6gFBGTYCAEF/BUEBCw8LIAAgAToAAEEBCzABAX8jAEEQayICJAAgAiABKAIANgIAIAAgAhByEH9BoPEAKAIAEGEaIAJBEGokAAsRACACBEAgACABwCAC/AsACwupAQEBfEQAAAAAAADwPyEBAkAgAEGACE4EQEQAAAAAAADgfyEBIABB/w9JBEAgAEH/B2shAAwCC0QAAAAAAADwfyEBQf0XIAAgAEH9F08bQf4PayEADAELIABBgXhKDQBEAAAAAAAAYAMhASAAQbhwSwRAIABByQdqIQAMAQtEAAAAAAAAAAAhAUHwaCAAIABB8GhNG0GSD2ohAAsgASAAQf8Haq1CNIa/ogtEAQF/IwBBEGsiAiQAIAAoAgAhACACIAE2AgggAiAANgIEIAJB/BQ2AgBByAsgAhByEH9BoPEAKAIAEGEaIAJBEGokAAt4AQN/AkAgAEUNACAAKAIgRQ0AIAAoAiQiAkUNACAAKAIcIgFFDQAgASgCACAARw0AIAEoAgRBtP4Aa0EfSw0AIAEoAjgiAwRAIAAoAiggAyACEQEAIAAoAiQhAiAAKAIcIQELIAAoAiggASACEQEAIABBADYCHAsL6QMAQZTZAUGFExAcQazZAUGUDkEBQQAQG0G42QFB8QxBAUGAf0H/ABACQdDZAUHqDEEBQYB/Qf8AEAJBxNkBQegMQQFBAEH/ARACQdzZAUGjCUECQYCAfkH//wEQAkHo2QFBmglBAkEAQf//AxACQfTZAUGyCUEEQYCAgIB4Qf////8HEAJBgNoBQakJQQRBAEF/EAJBjNoBQfMPQQRBgICAgHhB/////wcQAkGY2gFB6g9BBEEAQX8QAkGk2gFB4A9BCEKAgICAgICAgIB/Qv///////////wAQDUGw2gFB1w9BCEIAQn8QDUG82gFBogpBBBAMQcjaAUGMEUEIEAxBmC1BkhAQGkHgLUEEQfgPEAVBqC5BAkGeEBAFQfQuQQRBrRAQBUHMJhAZQcAvQQBB9RkQAEHoL0EAQboaEABBkDBBAUGTGhAAQbgwQQJBwhYQAEHgMEEDQeEWEABBiDFBBEGJFxAAQbAxQQVBphcQAEHYMUEEQd8aEABBgDJBBUH9GhAAQegvQQBBjBgQAEGQMEEBQesXEABBuDBBAkHOGBAAQeAwQQNBrBgQAEGIMUEEQdQZEABBsDFBBUGyGRAAQagyQQhBkRkQAEHQMkEJQe8YEABB+DJBBkHMFxAAQaAzQQdBpBsQAAsxAQF/IAAoAgwiASAAKAIQRgRAIAAgACgCACgCKBEAAA8LIAAgAUEBajYCDCABLQAAC2ABBH8gASAAKAIEIgYgA2siB2ohBCAGIQUDQCACIARNBEAgACAFNgIEIAdFIAMgBkZyRQRAIAYgB2sgASAH/AoAAAsFIAUgBC0AADoAACAFQQFqIQUgBEEBaiEEDAELCwsQACAAKAIAIgAEQCAAEB0LCzUBAX8gASAAKAIEIgJBAXVqIQEgACgCACEAIAEgAkEBcQR/IAEoAgAgAGooAgAFIAALEQAAC6ABAQR/IwBBgAJrIgAkACAAIAQ3A/gBIABCJTcD8AEgAEHwAWoiB0EBckGZDiAFIAIoAgQQywEgAEHQAWoiBiAGEC4gByAAQfgBahCJAyAGaiIIIAIQaSEJIABBBGoiByACECcgBiAJIAggAEEQaiIGIABBDGogAEEIaiAHEIADIAcQJSABIAYgACgCDCAAKAIIIAIgAxCFASAAQYACaiQAC6IBAQN/IwBBkAFrIgAkACAAIAQ2AowBIABCJTcDgAEgAEGAAWoiBkEBckGgDiAFIAIoAgQQywEgAEHzAGoiBCAEQQ0QLiAGIABBjAFqEMoBIARqIgcgAhBpIQggAEEEaiIGIAIQJyAEIAggByAAQRBqIgQgAEEMaiAAQQhqIAYQgAMgBhAlIAEgBCAAKAIMIAAoAgggAiADEIUBIABBkAFqJAALnQEBBH8jAEHwAGsiACQAIAAgBDcDaCAAQiU3A2AgAEHgAGoiB0EBckGZDiAFIAIoAgQQywEgAEFAayIGIAYQLiAHIABB6ABqEIkDIAZqIgggAhBpIQkgAEEEaiIHIAIQJyAGIAkgCCAAQRBqIgYgAEEMaiAAQQhqIAcQigMgBxAlIAEgBiAAKAIMIAAoAgggAiADEIABIABB8ABqJAALngEBA38jAEHQAGsiACQAIAAgBDYCTCAAQiU3A0AgAEFAayIGQQFyQaAOIAUgAigCBBDLASAAQTNqIgQgBEENEC4gBiAAQcwAahDKASAEaiIHIAIQaSEIIABBBGoiBiACECcgBCAIIAcgAEEQaiIEIABBDGogAEEIaiAGEIoDIAYQJSABIAQgACgCDCAAKAIIIAIgAxCAASAAQdAAaiQACwcAIAARDwALQgADQCABIAJHBEAgAQJ/IAEsAAAQTARAIAMoAgAgASwAAEECdGooAgAMAQsgAS0AAAs6AAAgAUEBaiEBDAELCyABCz0AA0AgASACRwRAIAEiACAAKAIAEEwEfyADKAIAIAAoAgBBAnRqBSAACygCADYCACAAQQRqIQEMAQsLIAELPwECfyAAKAIEIQMgACgCCCECA0AgAiADRwRAIAAgAiABayICNgIIDAELCyAAKAIAIgIEQCAAKAIMGiACEC0LC0wBAX8CQCABRQ0AIAFBiNgBEFIiAUUNACABKAIIIAAoAghBf3NxDQAgACgCDCABKAIMQQAQO0UNACAAKAIQIAEoAhBBABA7IQILIAILCwBBnBFBABCtAgALgQEBA38gACgCBCIEQQFxIQUCfyABLQA3QQFGBEAgBEEIdSIGIAVFDQEaIAIoAgAgBhDoAQwBCyAEQQh1IAVFDQAaIAEgACgCACgCBDYCOCAAKAIEIQRBACECQQALIQUgACgCACIAIAEgAiAFaiADQQIgBEECcRsgACgCACgCHBEIAAsKACAAIAFBABA7C/gBAQF/IwBBEGsiAiQAIAIgATYCDEGQ1gEoAgAiAiAAIAEQzQMaIAAQqAEgAGpBAWstAABBCkcEQAJAAkAgAigCTCIAQQBOBEAgAEUNAUGU4QEoAgAgAEH/////A3FHDQELAkAgAigCUEEKRg0AIAIoAhQiACACKAIQRg0AIAIgAEEBajYCFCAAQQo6AAAMAgsgAhDeAQwBCyACQcwAaiIBIgAgACgCACIAQf////8DIAAbNgIAAkACQCACKAJQQQpGDQAgAigCFCIAIAIoAhBGDQAgAiAAQQFqNgIUIABBCjoAAAwBCyACEN4BCyABEKwBGgsLEMoDAAsdAQF/IwBBEGsiASQAIAEgADYCAEG9HiABEK0CAAu5AgEDfyMAQSBrIggkAEH3////AyIJIAFBf3NqIAJPBEAgABAjIQogAUHz////AUkEQCAIIAFBAXQ2AhwgCCABIAJqNgIQIAhBEGogCEEcahCgASgCABCQAUEBaiEJCyAIQRxqIAhBGGogABBVKAIAELwBIAhBEGogCRCPASAIKAIQIQIgCCgCFBogBARAIAIgCiAEEGULIAYEQCAEQQJ0IAJqIAcgBhBlCyADIAQgBWoiCWshByADIAlHBEAgBEECdCIDIAJqIAZBAnRqIAMgCmogBUECdGogBxBlCyABQQFqIgFBAkcEQCAKIAEQqQELIAAgAjYCACAAIAgoAhQQXCAAIAQgBmogB2oiADYCBCAIQQA2AgwgAiAAQQJ0aiAIQQxqEFYgCEEcahC7ASAIQSBqJAAPCxBbAAuJAQECfyMAQRBrIgMkACABQff///8HTQRAAkAgARDUAQRAIAAgARBQIAAhBAwBCyADQQhqIAEQnwFBAWoQngEgAygCDBogACADKAIIIgQ2AgAgACADKAIMEFwgACABNgIECyAEIAEgAhCyAiADQQA6AAcgASAEaiADQQdqEF0gA0EQaiQADwsQWwALRAECfyAAECghAyAAEB8hBCACIANNBEAgABAjIgMgASACEE0gACADIAIQwAIPCyAAIAMgAiADayAEQQAgBCACIAEQuQELPQEBfyMAQRBrIgMkACADIAI6AA8DQCABBEAgACADLQAPOgAAIAFBAWshASAAQQFqIQAMAQsLIANBEGokAAsZACAAQYCAgIAETwRAEKoCAAsgAEECdBBTC5IFAQh/QQQgASABQQRNGyEDQQEgACAAQQFNGyEHA0ACQCAHIAMgB2pBAWtBACADa3EiACAAIAdJGyEEQQAhASMAQRBrIggkAAJAIANBA3ENACAEIANwDQACfwJAQTACfyADQQhGBEAgBBA0DAELQRwhASADQQNxIANBBElyDQEgA0ECdiIAIABBAWtxDQFBMEFAIANrIARJDQIaAn9BECEBAkBBEEEQIAMgA0EQTRsiACAAQRBNGyICIAJBAWtxRQRAIAIhAAwBCwNAIAEiAEEBdCEBIAAgAkkNAAsLQUAgAGsgBE0EQEGI6gFBMDYCAEEADAELQQBBECAEQQtqQXhxIARBC0kbIgUgAGpBDGoQNCICRQ0AGiACQQhrIQECQCAAQQFrIAJxRQRAIAEhAAwBCyACQQRrIgkoAgAiBEF4cSAAIAJqQQFrQQAgAGtxQQhrIgIgAEEAIAIgAWtBD00baiIAIAFrIgZrIQIgBEEDcUUEQCABKAIAIQEgACACNgIEIAAgASAGajYCAAwBCyAAIAIgACgCBEEBcXJBAnI2AgQgACACaiICIAIoAgRBAXI2AgQgCSAGIAkoAgBBAXFyQQJyNgIAIAEgBmoiAiACKAIEQQFyNgIEIAEgBhDbAQsCQCAAKAIEIgJBA3FFDQAgAkF4cSIBIAVBEGpNDQAgACAFIAJBAXFyQQJyNgIEIAAgBWoiBCABIAVrIgJBA3I2AgQgACABaiIBIAEoAgRBAXI2AgQgBCACENsBCyAAQQhqCwsiAEUNARogCCAANgIMQQAhAQsgAQshAEEAIAgoAgwgABshAQsgCEEQaiQAIAENAEHk/gEoAgAiAEUNACAAEQwADAELCyABRQRAEOsBCyABCwoAIAEgAGtBDG0LCQAgABAuNgIACyMBAn8gACEBA0AgASICQQRqIQEgAigCAA0ACyACIABrQQJ1Cy8BAX8jAEEQayIDJAACQCAAIAFGBEAgAEEAOgB4DAELIAEgAhCpAQsgA0EQaiQACxAAIAAoAgggACgCAGtBAnULCQAgAEEANgIAC0kBAX8jAEEQayIDJAACQAJAIAJBHksNACABLQB4QQFxDQAgAUEBOgB4DAELIAIQwQIhAQsgA0EQaiQAIAAgAjYCBCAAIAE2AgALOgECfyMAQRBrIgAkACAAQf////8DNgIMIABB/////wc2AgggAEEMaiAAQQhqELUDKAIAIABBEGokAAs0AQF/IwBBEGsiAyQAIAMgARBzNgIMIAMgAhBzNgIIIAAgA0EMaiADQQhqEGYgA0EQaiQAC04BAX8jAEEQayIDJAAgAyABNgIIIAMgADYCDCADIAI2AgRBACEBIANBBGoiACADQQxqENMBRQRAIAAgA0EIahDTASEBCyADQRBqJAAgAQswAQF/IwBBEGsiAyQAIAMgATYCDCADIAI2AgggACADQQxqIANBCGoQZiADQRBqJAALMwEBfyMAQRBrIgMkACAAEB8aIAAgAhCDASADQQA6AA8gASACaiADQQ9qEF0gA0EQaiQACzEAIABB/////wNLBEAQqgIACwJ/IABBAnQhAEEEENYBBEAgAEEEELQCDAELIAAQUwsLCQAgABDtARAtCxUAIABB8KoBNgIAIABBEGoQIBogAAsVACAAQciqATYCACAAQQxqECAaIAALgAMBBH8gAiEAA0ACQCAEIAdNIAAgA09yDQAgACwAACIBQf8BcSEFAn9BASABQQBODQAaIAFBQkkNASABQV9NBEAgAyAAa0ECSA0CIAAtAAFBwAFxQYABRw0CQQIMAQsgAUFvTQRAIAMgAGtBA0gNAiAALQACIAAsAAEhAQJAAkAgBUHtAUcEQCAFQeABRw0BIAFBYHFBoH9GDQIMBQsgAUGgf04NBAwBCyABQb9/Sg0DC0HAAXFBgAFHDQJBAwwBCyADIABrQQRIIAFBdEtyDQEgAC0AAyEGIAAtAAIhCCAALAABIQECQAJAAkACQCAFQfABaw4FAAICAgECCyABQfAAakH/AXFBME8NBAwCCyABQZB/Tg0DDAELIAFBv39KDQILIAhBwAFxQYABRyAGQcABcUGAAUdyIAZBP3EgCEEGdEHAH3EgBUESdEGAgPAAcSABQT9xQQx0cnJyQf//wwBLcg0BQQQLIQEgB0EBaiEHIAAgAWohAAwBCwsgACACawu4BAEEfyMAQRBrIgAkAAJ/IAAgAjYCDCAAIAU2AggCQAJAA0AgAiADTyAFIAZPckUEQCACLAAAIghB/wFxIQECfyAIQQBOBEAgAUH//8MASw0FQQEMAQsgCEFCSQ0EIAhBX00EQEEBIAMgAmtBAkgNBhpBAiEIIAItAAEiCUHAAXFBgAFHDQQgCUE/cSABQQZ0QcAPcXIhAUECDAELIAhBb00EQEEBIQggAyACayIKQQJIDQQgAiwAASEJAkACQCABQe0BRwRAIAFB4AFHDQEgCUFgcUGgf0YNAgwICyAJQaB/SA0BDAcLIAlBv39KDQYLIApBAkYNBCACLQACIghBwAFxQYABRw0FIAhBP3EgAUEMdEGA4ANxIAlBP3FBBnRyciEBQQMMAQsgCEF0Sw0EQQEhCCADIAJrIgpBAkgNAyACLAABIQkCQAJAAkACQCABQfABaw4FAAICAgECCyAJQfAAakH/AXFBME8NBwwCCyAJQZB/Tg0GDAELIAlBv39KDQULIApBAkYNAyACLQACIgtBwAFxQYABRw0EIApBA0YNAyACLQADIgpBwAFxQYABRw0EQQIhCCAKQT9xIAtBBnRBwB9xIAFBEnRBgIDwAHEgCUE/cUEMdHJyciIBQf//wwBLDQNBBAshCCAFIAE2AgAgACACIAhqIgI2AgwgACAFQQRqIgU2AggMAQsLIAIgA0khCAsgCAwBC0ECCyAEIAAoAgw2AgAgByAAKAIINgIAIABBEGokAAv1AwAjAEEQayIAJAACfyAAIAI2AgwgACAFNgIIAkADQAJAIAIgA08EQEEAIQUMAQtBAiEFIAIoAgAiAUH//8MASyABQYBwcUGAsANGcg0AAkAgAUH/AE0EQEEBIQUgBiAAKAIIIgJrQQBMDQIgACACQQFqNgIIIAIgAToAAAwBCyABQf8PTQRAIAYgACgCCCICa0ECSA0EIAAgAkEBajYCCCACIAFBBnZBwAFyOgAAIAAgACgCCCICQQFqNgIIIAIgAUE/cUGAAXI6AAAMAQsgBiAAKAIIIgJrIQUgAUH//wNNBEAgBUEDSA0EIAAgAkEBajYCCCACIAFBDHZB4AFyOgAAIAAgACgCCCICQQFqNgIIIAIgAUEGdkE/cUGAAXI6AAAgACAAKAIIIgJBAWo2AgggAiABQT9xQYABcjoAAAwBCyAFQQRIDQMgACACQQFqNgIIIAIgAUESdkHwAXI6AAAgACAAKAIIIgJBAWo2AgggAiABQQx2QT9xQYABcjoAACAAIAAoAggiAkEBajYCCCACIAFBBnZBP3FBgAFyOgAAIAAgACgCCCICQQFqNgIIIAIgAUE/cUGAAXI6AAALIAAgACgCDEEEaiICNgIMDAELCyAFDAELQQELIAQgACgCDDYCACAHIAAoAgg2AgAgAEEQaiQAC5IDAQR/IAIhAANAAkAgBCAGTSAAIANPcg0AAn8gAEEBaiAALQAAIgHAQQBODQAaIAFBwgFJDQEgAUHfAU0EQCADIABrQQJIDQIgAC0AAUHAAXFBgAFHDQIgAEECagwBCyABQe8BTQRAIAMgAGtBA0gNAiAALQACIAAsAAEhBQJAAkAgAUHtAUcEQCABQeABRw0BIAVBYHFBoH9GDQIMBQsgBUGgf04NBAwBCyAFQb9/Sg0DC0HAAXFBgAFHDQIgAEEDagwBCyADIABrQQRIIAFB9AFLciAEIAZrQQJJcg0BIAAtAAMhByAALQACIQggACwAASEFAkACQAJAAkAgAUHwAWsOBQACAgIBAgsgBUHwAGpB/wFxQTBPDQQMAgsgBUGQf04NAwwBCyAFQb9/Sg0CCyAIQcABcUGAAUcgB0HAAXFBgAFHciAHQT9xIAhBBnRBwB9xIAFBEnRBgIDwAHEgBUE/cUEMdHJyckH//8MAS3INASAGQQFqIQYgAEEEagshACAGQQFqIQYMAQsLIAAgAmsLgQUBBX8jAEEQayIAJAACfyAAIAI2AgwgACAFNgIIAkACQANAIAIgA08gBSAGT3JFBEBBAiEJIAACfyACLQAAIgHAQQBOBEAgBSABOwEAQQEMAQsgAUHCAUkNBCABQd8BTQRAQQEgAyACa0ECSA0GGiACLQABIghBwAFxQYABRw0EIAUgCEE/cSABQQZ0QcAPcXI7AQBBAgwBCyABQe8BTQRAQQEhCSADIAJrIgpBAkgNBCACLAABIQgCQAJAIAFB7QFHBEAgAUHgAUcNASAIQWBxQaB/Rw0IDAILIAhBoH9ODQcMAQsgCEG/f0oNBgsgCkECRg0EIAItAAIiCUHAAXFBgAFHDQUgBSAJQT9xIAhBP3FBBnQgAUEMdHJyOwEAQQMMAQsgAUH0AUsNBEEBIQkgAyACayIKQQJIDQMgAi0AASILwCEIAkACQAJAAkAgAUHwAWsOBQACAgIBAgsgCEHwAGpB/wFxQTBPDQcMAgsgCEGQf04NBgwBCyAIQb9/Sg0FCyAKQQJGDQMgAi0AAiIIQcABcUGAAUcNBCAKQQNGDQMgAi0AAyIKQcABcUGAAUcNBCAGIAVrQQNIDQNBAiEJIApBP3EiCiAIQQZ0IgxBwB9xIAtBDHRBgOAPcSABQQdxIgFBEnRycnJB///DAEsNAyAFIAogDEHAB3FyQYC4A3I7AQIgBSAIQQR2QQNxIAtBAnQiCUHAAXEgAUEIdHIgCUE8cXJyQcD/AGpBgLADcjsBACAFQQJqIQVBBAsgAmoiAjYCDCAAIAVBAmoiBTYCCAwBCwsgAiADSSEJCyAJDAELQQILIAQgACgCDDYCACAHIAAoAgg2AgAgAEEQaiQAC8sFAQJ/IwBBEGsiACQAAn8gACACNgIMIAAgBTYCCAJAAkADQCACIANPBEBBACEFDAILQQIhBQJAAkAgAi8BACIBQf8ATQRAQQEhBSAGIAAoAggiAmtBAEwNBCAAIAJBAWo2AgggAiABOgAADAELIAFB/w9NBEAgBiAAKAIIIgJrQQJIDQUgACACQQFqNgIIIAIgAUEGdkHAAXI6AAAgACAAKAIIIgJBAWo2AgggAiABQT9xQYABcjoAAAwBCyABQf+vA00EQCAGIAAoAggiAmtBA0gNBSAAIAJBAWo2AgggAiABQQx2QeABcjoAACAAIAAoAggiAkEBajYCCCACIAFBBnZBP3FBgAFyOgAAIAAgACgCCCICQQFqNgIIIAIgAUE/cUGAAXI6AAAMAQsgAUH/twNNBEBBASEFIAMgAmtBA0gNBCACLwECIghBgPgDcUGAuANHDQIgBiAAKAIIIglrQQRIDQQgCEH/B3EgAUEKdEGA+ANxIAFBwAdxIgVBCnRyckH//z9LDQIgACACQQJqNgIMIAAgCUEBajYCCCAJIAVBBnZBAWoiAkECdkHwAXI6AAAgACAAKAIIIgVBAWo2AgggBSACQQR0QTBxIAFBAnZBD3FyQYABcjoAACAAIAAoAggiAkEBajYCCCACIAhBBnZBD3EgAUEEdEEwcXJBgAFyOgAAIAAgACgCCCIBQQFqNgIIIAEgCEE/cUGAAXI6AAAMAQsgAUGAwANJDQMgBiAAKAIIIgJrQQNIDQQgACACQQFqNgIIIAIgAUEMdkHgAXI6AAAgACAAKAIIIgJBAWo2AgggAiABQQZ2Qb8BcToAACAAIAAoAggiAkEBajYCCCACIAFBP3FBgAFyOgAACyAAIAAoAgxBAmoiAjYCDAwBCwtBAgwCCyAFDAELQQELIAQgACgCDDYCACAHIAAoAgg2AgAgAEEQaiQACw8AIAEgACgCAGogAjYCAAs8AQJ/IwBBEGsiASQAIAEgADYCDCABQQhqIAFBDGoQY0EEQQFB3OEBKAIAKAIAGyECEGIgAUEQaiQAIAILOAEBfyMAQRBrIgUkACAFIAQ2AgwgBUEIaiAFQQxqEGMgACABIAIgAxDSASEAEGIgBUEQaiQAIAALEgAgBCACNgIAIAcgBTYCAEEDCw0AIAEgACgCAGooAgALKwEBfyAAQdyhATYCAAJAIAAoAggiAUUNACAALQAMQQFxRQ0AIAEQLQsgAAsEACABCycBAX8gACgCACgCACgCAEHM8gFBzPIBKAIAQQFqIgA2AgAgADYCBAu0CgEHf0HI8gEtAABFBEAjAEEQayIFJABBwPIBLQAARQRAIwBBEGsiBiQAIAZBATYCDEGg8QEgBigCDBAyIgFByKEBNgIAIwBBEGsiAyQAIAFBCGoiAkEANgIIIAJCADcCACACQQA6AIQBIANBCGogAhBVKAIAGiADQQA6AA8jAEEQayIEJAAQvAJBHkkEQBCMAQALIARBCGogAkEMakEeELsCIAIgBCgCCCIHNgIEIAIgBzYCACACIAcgBCgCDEECdGo2AgggBEEQaiQAIAJBHhDZAiADQQE6AA8gA0EQaiQAIAFBkAFqQYwWELABIAIQ2gJBrPwBQQEQMkHotQE2AgAgAUGs/AFB+O8BEDEQM0G0/AFBARAyQYi2ATYCACABQbT8AUGA8AEQMRAzQbz8AUEBEDIiAkEAOgAMIAJBADYCCCACQdyhATYCACACQZCiATYCCCABQbz8AUHY8gEQMRAzQcz8AUEBEDJByK0BNgIAIAFBzPwBQdDyARAxEDNB1PwBQQEQMkHgrgE2AgAgAUHU/AFB4PIBEDEQM0Hc/AFBARAyIgJBmKoBNgIAIAIQLjYCCCABQdz8AUHo8gEQMRAzQej8AUEBEDJB9K8BNgIAIAFB6PwBQfDyARAxEDNB8PwBQQEQMkHcsQE2AgAgAUHw/AFBgPMBEDEQM0H4/AFBARAyQeiwATYCACABQfj8AUH48gEQMRAzQYD9AUEBEDJB0LIBNgIAIAFBgP0BQYjzARAxEDNBiP0BQQEQMiICQa7YADsBCCACQciqATYCACACQQxqECQaIAFBiP0BQZDzARAxEDNBoP0BQQEQMiICQq6AgIDABTcCCCACQfCqATYCACACQRBqECQaIAFBoP0BQZjzARAxEDNBvP0BQQEQMkGotgE2AgAgAUG8/QFBiPABEDEQM0HE/QFBARAyQaC4ATYCACABQcT9AUGQ8AEQMRAzQcz9AUEBEDJB9LkBNgIAIAFBzP0BQZjwARAxEDNB1P0BQQEQMkHguwE2AgAgAUHU/QFBoPABEDEQM0Hc/QFBARAyQcTDATYCACABQdz9AUHI8AEQMRAzQeT9AUEBEDJB2MQBNgIAIAFB5P0BQdDwARAxEDNB7P0BQQEQMkHMxQE2AgAgAUHs/QFB2PABEDEQM0H0/QFBARAyQcDGATYCACABQfT9AUHg8AEQMRAzQfz9AUEBEDJBtMcBNgIAIAFB/P0BQejwARAxEDNBhP4BQQEQMkHcyAE2AgAgAUGE/gFB8PABEDEQM0GM/gFBARAyQYTKATYCACABQYz+AUH48AEQMRAzQZT+AUEBEDJBrMsBNgIAIAFBlP4BQYDxARAxEDNBnP4BQQEQMiICQZjVATYCCCACQai9ATYCACACQdi9ATYCCCABQZz+AUGo8AEQMRAzQaj+AUEBEDIiAkG81QE2AgggAkG0vwE2AgAgAkHkvwE2AgggAUGo/gFBsPABEDEQM0G0/gFBARAyIgJBCGoQtgIgAkGkwQE2AgAgAUG0/gFBuPABEDEQM0HA/gFBARAyIgJBCGoQtgIgAkHEwgE2AgAgAUHA/gFBwPABEDEQM0HM/gFBARAyQdTMATYCACABQcz+AUGI8QEQMRAzQdT+AUEBEDJBzM0BNgIAIAFB1P4BQZDxARAxEDMgBkEQaiQAIAVBoPEBNgIIQbzyASAFKAIIEFUaQcDyAUEBOgAACyAFQRBqJABBxPIBQbzyARDVAkHI8gFBAToAAAsgAEHE8gEoAgAiADYCACAAENQCCxEAIABBoPEBRwRAIAAQ1wILCxMAIAAgASgCACIANgIAIAAQ1AILlwEBA38gAEHIoQE2AgAgAEEIaiEBA0AgARBrIAJLBEAgASACEIIBKAIABEAgASACEIIBKAIAEL8BCyACQQFqIQIMAQsLIABBkAFqECAaIwBBEGsiAiQAIAJBDGogARBVIgEoAgAiAygCAARAIAMQ2gIgASgCABogASgCACIBQQxqIAEoAgAgARC5AhC4AgsgAkEQaiQAIAALDwAgACAAKAIEQQFqNgIECyYBAX8gACgCBCECA0AgASACRwRAIAJBBGshAgwBCwsgACABNgIEC3UBAn8jAEEQayIDJAAgA0EEaiICIAA2AgAgAiAAKAIEIgA2AgQgAiAAIAFBAnRqNgIIIAIiASgCBCEAIAIoAgghAgNAIAAgAkYEQCABKAIAIAEoAgQ2AgQgA0EQaiQABSAAELoCIAEgAEEEaiIANgIEDAELCwsRACAAEGsaIAAgACgCABDYAgsgACAAQZiqATYCACAAKAIIEC5HBEAgACgCCBCgAwsgAAsEAEF/C+EBAQR/IwBBEGsiBSQAIwBBIGsiAyQAIANBGGogACABEL0CIAMoAhghBCADKAIcIQYjAEEQayIBJAAgASAGNgIMIAIgBCAGIARrIgRBAnUQZSABIAIgBGo2AgggA0EQaiABQQxqIAFBCGoQZiABQRBqJAAgAygCECEEIwBBEGsiASQAIAEgADYCDCABQQxqIgAgBCAAEOwBa0ECdRDwASEAIAFBEGokACADIAA2AgwgAyACIAMoAhQQjgE2AgggBUEIaiADQQxqIANBCGoQZiADQSBqJAAgBSgCDCAFQRBqJAAL9gUBCn8jAEEQayITJAAgAiAANgIAQQRBACAHGyEVIANBgARxIRYDQCAUQQRGBEAgDRAfQQFLBEAgEyANEE42AgwgAiATQQxqQQEQ8AEgDRB1IAIoAgAQ3QI2AgALIANBsAFxIgNBEEcEQCABIANBIEYEfyACKAIABSAACzYCAAsgE0EQaiQABQJAAkACQAJAAkACQCAIIBRqLQAADgUAAQMCBAULIAEgAigCADYCAAwECyABIAIoAgA2AgAgBkEgEEshByACIAIoAgAiD0EEajYCACAPIAc2AgAMAwsgDRBaDQIgDUEAEMwBKAIAIQcgAiACKAIAIg9BBGo2AgAgDyAHNgIADAILIAwQWiAWRXINASACIAwQTiAMEHUgAigCABDdAjYCAAwBCyACKAIAIAQgFWoiBCEHA0ACQCAFIAdNDQAgBkHAACAHKAIAEF9FDQAgB0EEaiEHDAELCyAOQQBKBEAgAigCACEPIA4hEANAIBBFIAQgB09yRQRAIBBBAWshECAHQQRrIgcoAgAhESACIA9BBGoiEjYCACAPIBE2AgAgEiEPDAELCyAQBH8gBkEwEEsFQQALIREgAigCACEPA0AgEEEASgRAIAIgD0EEaiISNgIAIA8gETYCACAQQQFrIRAgEiEPDAELCyACIAIoAgAiD0EEajYCACAPIAk2AgALAkAgBCAHRgRAIAZBMBBLIQcgAiACKAIAIg9BBGo2AgAgDyAHNgIADAELIAsQWgR/QX8FIAtBABAiLAAACyESQQAhEEEAIREDQCAEIAdGDQECQCAQIBJHBEAgECEPDAELIAIgAigCACIPQQRqNgIAIA8gCjYCAEEAIQ8gCxAfIBFBAWoiEU0EQCAQIRIMAQsgCyARECItAABB/wBGBEBBfyESDAELIAsgERAiLAAAIRILIAdBBGsiBygCACEQIAIgAigCACIYQQRqNgIAIBggEDYCACAPQQFqIRAMAAsACyACKAIAEMcBCyAUQQFqIRQMAQsLC70BAQF/IwBBEGsiCiQAAn8gAARAIAIQ5gIMAQsgAhDlAgshAAJAIAEEQCAKQQRqIgEgABCSASADIAooAgQ2AAAgASAAEMIBDAELIApBBGoiASAAEOECIAMgCigCBDYAACABIAAQewsgCCABEKsBIAEQORogBCAAEHg2AgAgBSAAEFk2AgAgCkEEaiIBIAAQWCAGIAEQcCABECAaIAEgABB8IAcgARCrASABEDkaIAkgABDBATYCACAKQRBqJAAL2wEBBH8jAEEQayIFJAAjAEEgayIDJAAgA0EYaiAAIAEQvQIgAygCGCEEIAMoAhwhBiMAQRBrIgEkACABIAY2AgwgAiAEIAYgBGsiBBBNIAEgAiAEajYCCCADQRBqIAFBDGogAUEIahBmIAFBEGokACADKAIQIQQjAEEQayIBJAAgASAANgIMIAFBDGoiACAEIAAQ7AFrEPMBIQAgAUEQaiQAIAMgADYCDCADIAIgAygCFBCOATYCCCAFQQhqIANBDGogA0EIahBmIANBIGokACAFKAIMIAVBEGokAAsRACAAIAEgASgCACgCKBEBAAvLBQEKfyMAQRBrIhQkACACIAA2AgAgA0GABHEhFgNAIBVBBEYEQCANEB9BAUsEQCAUIA0QTjYCDCACIBRBDGpBARDzASANEHcgAigCABDgAjYCAAsgA0GwAXEiA0EQRwRAIAEgA0EgRgR/IAIoAgAFIAALNgIACyAUQRBqJAAFAkACQAJAAkACQAJAIAggFWotAAAOBQABAwIEBQsgASACKAIANgIADAQLIAEgAigCADYCACAGQSAQQSEPIAIgAigCACIQQQFqNgIAIBAgDzoAAAwDCyANEFoNAiANQQAQIi0AACEPIAIgAigCACIQQQFqNgIAIBAgDzoAAAwCCyAMEFogFkVyDQEgAiAMEE4gDBB3IAIoAgAQ4AI2AgAMAQsgAigCACAEIAdqIgQhEQNAAkAgBSARTQ0AIAZBwAAgESwAABBgRQ0AIBFBAWohEQwBCwsgDiIPQQBKBEADQCAPRSAEIBFPckUEQCAPQQFrIQ8gEUEBayIRLQAAIRAgAiACKAIAIhJBAWo2AgAgEiAQOgAADAELCyAPBH8gBkEwEEEFQQALIRIDQCACIAIoAgAiEEEBajYCACAPQQBKBEAgECASOgAAIA9BAWshDwwBCwsgECAJOgAACwJAIAQgEUYEQCAGQTAQQSEPIAIgAigCACIQQQFqNgIAIBAgDzoAAAwBCyALEFoEf0F/BSALQQAQIiwAAAshEEEAIQ9BACETA0AgBCARRg0BAkAgDyAQRwRAIA8hEgwBCyACIAIoAgAiEEEBajYCACAQIAo6AABBACESIAsQHyATQQFqIhNNBEAgDyEQDAELIAsgExAiLQAAQf8ARgRAQX8hEAwBCyALIBMQIiwAACEQCyARQQFrIhEtAAAhDyACIAIoAgAiGEEBajYCACAYIA86AAAgEkEBaiEPDAALAAsgAigCABCEAQsgFUEBaiEVDAELCwu7AQEBfyMAQRBrIgokAAJ/IAAEQCACEO0CDAELIAIQ7AILIQACQCABBEAgCkEEaiIBIAAQkgEgAyAKKAIENgAAIAEgABDCAQwBCyAKQQRqIgEgABDhAiADIAooAgQ2AAAgASAAEHsLIAggARBwIAEQIBogBCAAEHg6AAAgBSAAEFk6AAAgCkEEaiIBIAAQWCAGIAEQcCABECAaIAEgABB8IAcgARBwIAEQIBogCSAAEMEBNgIAIApBEGokAAsIACAAKAIARQsKACAAQdjwARB6CwoAIABB4PABEHoLFwAgAiAAIAEgAGsiAEECdRBlIAAgAmoLgwIBBX8jAEEQayIGJAAgBkEMaiIJIAZBCGogABBVKAIAELwBIwBBEGsiBSQAAkBB9////wMgAWsgAk8EQCAAECMhByAFQQRqIgggAUHz////AUkEfyAFIAFBAXQ2AgwgBSABIAJqNgIEIAggBUEMahCgASgCABCQAUEBagVB9////wMLEI8BIAUoAgQhAiAFKAIIGiAEBEAgAiAHIAQQZQsgAyAERwRAIARBAnQiCCACaiAHIAhqIAMgBGsQZQsgAUEBaiIBQQJHBEAgByABEKkBCyAAIAI2AgAgACAFKAIIEFwgBUEQaiQADAELEFsACyAAIAM2AgQgCRC7ASAGQRBqJAALHwEBfyABKAIAELwDIQIgACABKAIANgIEIAAgAjYCAAuyDgEKfyMAQZAEayILJAAgCyAKNgKIBCALIAE2AowEAkAgACALQYwEahArBEAgBSAFKAIAQQRyNgIAQQAhAAwBCyALQeQANgJIIAsgC0HoAGogC0HwAGogC0HIAGoiARA2Ig8oAgAiCjYCZCALIApBkANqNgJgIAEQJCERIAtBPGoQJCEMIAtBMGoQJCEOIAtBJGoQJCENIAtBGGoQJCEQIwBBEGsiASQAAkAgAgRAIAFBBGoiCiADEOYCIgIQkgEMAQsgAUEEaiIKIAMQ5QIiAhCSAQsgCyABKAIENgBcIAogAhDCASANIAoQqwEgChA5GiAKIAIQeyAOIAoQqwEgChA5GiALIAIQeDYCWCALIAIQWTYCVCAKIAIQWCARIAoQcCAKECAaIAogAhB8IAwgChCrASAKEDkaIAsgAhDBATYCFCABQRBqJAAgCSAIKAIANgIAIARBgARxIRJBACEDQQAhAQNAIAEhAgJAAkACQAJAIANBBEYNACAAIAtBjARqECsNAEEAIQoCQAJAAkACQAJAAkAgC0HcAGogA2otAAAOBQEABAMFCQsgA0EDRg0HIAdBASAAEDcQXwRAIAtBDGogABDpAiAQIAsoAgwQ6gEMAgsgBSAFKAIAQQRyNgIAQQAhAAwGCyADQQNGDQYLA0AgACALQYwEahArDQYgB0EBIAAQNxBfRQ0GIAtBDGogABDpAiAQIAsoAgwQ6gEMAAsACwJAIA4QH0UNACAAEDcgDhAjKAIARw0AIAAQPhogBkEAOgAAIA4gAiAOEB9BAUsbIQEMBgsCQCANEB9FDQAgABA3IA0QIygCAEcNACAAED4aIAZBAToAACANIAIgDRAfQQFLGyEBDAYLAkAgDhAfRQ0AIA0QH0UNACAFIAUoAgBBBHI2AgBBACEADAQLIA4QH0UEQCANEB9FDQULIAYgDRAfRToAAAwECyASIAIgA0ECSXJyRQRAQQAhASADQQJGIAstAF9BAEdxRQ0FCyALIAwQTjYCCCALQQxqIAtBCGoQwwEhAQJAIANFDQAgAyALai0AW0EBSw0AA0ACQCALIAwQdTYCCCABIAtBCGoQdg0AIAdBASABKAIAKAIAEF9FDQAgARD2AQwBCwsgCyAMEE42AgggASgCACALQQhqIgQoAgBrQQJ1IgogEBAfTQRAIAsgEBB1NgIIIARBACAKaxDwASAQEHUhCiAMEE4hEyMAQRBrIhQkABBzIQQgChBzIQogBCATEHMgCiAEa0F8cRCLAUUgFEEQaiQADQELIAsgDBBONgIEIAEgC0EIaiALQQRqEMMBKAIANgIACyALIAEoAgA2AggDQAJAIAsgDBB1NgIEIAtBCGoiASALQQRqEHYNACAAIAtBjARqECsNACAAEDcgASgCACgCAEcNACAAED4aIAEQ9gEMAQsLIBJFDQMgCyAMEHU2AgQgC0EIaiALQQRqEHYNAyAFIAUoAgBBBHI2AgBBACEADAILA0ACQCAAIAtBjARqECsNAAJ/IAdBwAAgABA3IgEQXwRAIAkoAgAiBCALKAKIBEYEQCAIIAkgC0GIBGoQkwEgCSgCACEECyAJIARBBGo2AgAgBCABNgIAIApBAWoMAQsgERAfRSAKRXINASABIAsoAlRHDQEgCygCZCIBIAsoAmBGBEAgDyALQeQAaiALQeAAahCTASALKAJkIQELIAsgAUEEajYCZCABIAo2AgBBAAshCiAAED4aDAELCyAKRSALKAJkIgEgDygCAEZyRQRAIAsoAmAgAUYEQCAPIAtB5ABqIAtB4ABqEJMBIAsoAmQhAQsgCyABQQRqNgJkIAEgCjYCAAsCQCALKAIUQQBMDQACQCAAIAtBjARqECtFBEAgABA3IAsoAlhGDQELIAUgBSgCAEEEcjYCAEEAIQAMAwsDQCAAED4aIAsoAhRBAEwNAQJAIAAgC0GMBGoQK0UEQCAHQcAAIAAQNxBfDQELIAUgBSgCAEEEcjYCAEEAIQAMBAsgCSgCACALKAKIBEYEQCAIIAkgC0GIBGoQkwELIAAQNyEBIAkgCSgCACIEQQRqNgIAIAQgATYCACALIAsoAhRBAWs2AhQMAAsACyACIQEgCCgCACAJKAIARw0DIAUgBSgCAEEEcjYCAEEAIQAMAQsCQCACRQ0AQQEhCgNAIAIQHyAKTQ0BAkAgACALQYwEahArRQRAIAAQNyACIAoQzAEoAgBGDQELIAUgBSgCAEEEcjYCAEEAIQAMAwsgABA+GiAKQQFqIQoMAAsAC0EBIQAgDygCACALKAJkRg0AQQAhACALQQA2AgwgESAPKAIAIAsoAmQgC0EMahBDIAsoAgwEQCAFIAUoAgBBBHI2AgAMAQtBASEACyAQEDkaIA0QORogDhA5GiAMEDkaIBEQIBogDxA1DAMLIAIhAQsgA0EBaiEDDAALAAsgC0GQBGokACAACxgAIAAgARCsARA8IAAgARDyASgCADYCBAsKACAAQcjwARB6CwoAIABB0PABEHoLxwEBBn8jAEEQayIEJAAgABDyASgCACEFQQECfyACKAIAIAAoAgBrIgNB/////wdJBEAgA0EBdAwBC0F/CyIDIANBAU0bIQMgASgCACEGIAAoAgAhByAFQeQARgR/QQAFIAAoAgALIAMQ3AEiCARAIAVB5ABHBEAgABCsARoLIARB4wA2AgQgACAEQQhqIAggBEEEahA2IgUQ6wIgBRA1IAEgACgCACAGIAdrajYCACACIAMgACgCAGo2AgAgBEEQaiQADwsQPQALIAEBfyABKAIAEJ0CwCECIAAgASgCADYCBCAAIAI6AAALxA4BCn8jAEGQBGsiCyQAIAsgCjYCiAQgCyABNgKMBAJAIAAgC0GMBGoQLARAIAUgBSgCAEEEcjYCAEEAIQAMAQsgC0HkADYCTCALIAtB6ABqIAtB8ABqIAtBzABqIgEQNiIPKAIAIgo2AmQgCyAKQZADajYCYCABECQhESALQUBrECQhDCALQTRqECQhDiALQShqECQhDSALQRxqECQhECMAQRBrIgEkAAJAIAIEQCABQQRqIgogAxDtAiICEJIBDAELIAFBBGoiCiADEOwCIgIQkgELIAsgASgCBDYAXCAKIAIQwgEgDSAKEHAgChAgGiAKIAIQeyAOIAoQcCAKECAaIAsgAhB4OgBbIAsgAhBZOgBaIAogAhBYIBEgChBwIAoQIBogCiACEHwgDCAKEHAgChAgGiALIAIQwQE2AhggAUEQaiQAIAkgCCgCADYCACAEQYAEcSESQQAhA0EAIQEDQCABIQICQAJAAkACQCADQQRGDQAgACALQYwEahAsDQBBACEKAkACQAJAAkACQAJAIAtB3ABqIANqLQAADgUBAAQDBQkLIANBA0YNByAHQQEgABA4EGAEQCALQRBqIAAQ7wIgECALLAAQELgBDAILIAUgBSgCAEEEcjYCAEEAIQAMBgsgA0EDRg0GCwNAIAAgC0GMBGoQLA0GIAdBASAAEDgQYEUNBiALQRBqIAAQ7wIgECALLAAQELgBDAALAAsCQCAOEB9FDQAgABA4Qf8BcSAOQQAQIi0AAEcNACAAED8aIAZBADoAACAOIAIgDhAfQQFLGyEBDAYLAkAgDRAfRQ0AIAAQOEH/AXEgDUEAECItAABHDQAgABA/GiAGQQE6AAAgDSACIA0QH0EBSxshAQwGCwJAIA4QH0UNACANEB9FDQAgBSAFKAIAQQRyNgIAQQAhAAwECyAOEB9FBEAgDRAfRQ0FCyAGIA0QH0U6AAAMBAsgEiACIANBAklyckUEQEEAIQEgA0ECRiALLQBfQQBHcUUNBQsgCyAMEE42AgwgC0EQaiALQQxqEMMBIQECQCADRQ0AIAMgC2otAFtBAUsNAANAAkAgCyAMEHc2AgwgASALQQxqEHYNACAHQQEgASgCACwAABBgRQ0AIAEQ+AEMAQsLIAsgDBBONgIMIAEoAgAgC0EMaiIEKAIAayIKIBAQH00EQCALIBAQdzYCDCAEQQAgCmsQ8wEgEBB3IQogDBBOIRMjAEEQayIUJAAQcyEEIAoQcyEKIAQgExBzIAogBGsQiwFFIBRBEGokAA0BCyALIAwQTjYCCCABIAtBDGogC0EIahDDASgCADYCAAsgCyABKAIANgIMA0ACQCALIAwQdzYCCCALQQxqIgEgC0EIahB2DQAgACALQYwEahAsDQAgABA4Qf8BcSABKAIALQAARw0AIAAQPxogARD4AQwBCwsgEkUNAyALIAwQdzYCCCALQQxqIAtBCGoQdg0DIAUgBSgCAEEEcjYCAEEAIQAMAgsDQAJAIAAgC0GMBGoQLA0AAn8gB0HAACAAEDgiARBgBEAgCSgCACIEIAsoAogERgRAIAggCSALQYgEahDuAiAJKAIAIQQLIAkgBEEBajYCACAEIAE6AAAgCkEBagwBCyAREB9FIApFcg0BIAstAFogAUH/AXFHDQEgCygCZCIBIAsoAmBGBEAgDyALQeQAaiALQeAAahCTASALKAJkIQELIAsgAUEEajYCZCABIAo2AgBBAAshCiAAED8aDAELCyAKRSALKAJkIgEgDygCAEZyRQRAIAsoAmAgAUYEQCAPIAtB5ABqIAtB4ABqEJMBIAsoAmQhAQsgCyABQQRqNgJkIAEgCjYCAAsCQCALKAIYQQBMDQACQCAAIAtBjARqECxFBEAgABA4Qf8BcSALLQBbRg0BCyAFIAUoAgBBBHI2AgBBACEADAMLA0AgABA/GiALKAIYQQBMDQECQCAAIAtBjARqECxFBEAgB0HAACAAEDgQYA0BCyAFIAUoAgBBBHI2AgBBACEADAQLIAkoAgAgCygCiARGBEAgCCAJIAtBiARqEO4CCyAAEDghASAJIAkoAgAiBEEBajYCACAEIAE6AAAgCyALKAIYQQFrNgIYDAALAAsgAiEBIAgoAgAgCSgCAEcNAyAFIAUoAgBBBHI2AgBBACEADAELAkAgAkUNAEEBIQoDQCACEB8gCk0NAQJAIAAgC0GMBGoQLEUEQCAAEDhB/wFxIAIgChAiLQAARg0BCyAFIAUoAgBBBHI2AgBBACEADAMLIAAQPxogCkEBaiEKDAALAAtBASEAIA8oAgAgCygCZEYNAEEAIQAgC0EANgIQIBEgDygCACALKAJkIAtBEGoQQyALKAIQBEAgBSAFKAIAQQRyNgIADAELQQEhAAsgEBAgGiANECAaIA4QIBogDBAgGiARECAaIA8QNQwDCyACIQELIANBAWohAwwACwALIAtBkARqJAAgAAsMACAAQQFBLRD9AhoLCwAgAEEBQS0QsAILHAEBfyAALQAAIQIgACABLQAAOgAAIAEgAjoAAAtlAQF/IwBBEGsiBiQAIAZBADoADyAGIAU6AA4gBiAEOgANIAZBJToADCAFBEAgBkENaiAGQQ5qEPMCCyACIAEgASACKAIAEIoCIAZBDGogAyAAKAIAEJ4DIAFqNgIAIAZBEGokAAtBACABIAIgAyAEQQQQZyEBIAMtAABBBHFFBEAgACABQdAPaiABQewOaiABIAFB5ABJGyABQcUASBtB7A5rNgIACwtAACACIAMgAEEIaiAAKAIIKAIEEQAAIgAgAEGgAmogBSAEQQAQzQEgAGsiAEGfAkwEQCABIABBDG1BDG82AgALC0AAIAIgAyAAQQhqIAAoAggoAgARAAAiACAAQagBaiAFIARBABDNASAAayIAQacBTARAIAEgAEEMbUEHbzYCAAsLQQAgASACIAMgBEEEEGghASADLQAAQQRxRQRAIAAgAUHQD2ogAUHsDmogASABQeQASRsgAUHFAEgbQewOazYCAAsLQAAgAiADIABBCGogACgCCCgCBBEAACIAIABBoAJqIAUgBEEAEM8BIABrIgBBnwJMBEAgASAAQQxtQQxvNgIACwtAACACIAMgAEEIaiAAKAIIKAIAEQAAIgAgAEGoAWogBSAEQQAQzwEgAGsiAEGnAUwEQCABIABBDG1BB282AgALCxgBAX9BDBBTIgBBADYCCCAAQgA3AgAgAAsEAEECC8oBAQR/IwBBEGsiAyQAAkAgAUH3////A00EQAJAIAEQvQEEQCAAIAEQUCAAIQQMAQsgA0EIaiABEJABQQFqEI8BIAMoAgwaIAAgAygCCCIENgIAIAAgAygCDBBcIAAgATYCBAsjAEEQayIFJAAgBSACNgIMIAQhBiABIQIDQCACBEAgBiAFKAIMNgIAIAJBAWshAiAGQQRqIQYMAQsLIAVBEGokACADQQA2AgQgBCABQQJ0aiADQQRqEFYgA0EQaiQADAELEFsACyAAC7IFAQp/IwBBEGsiCyQAIAYQSCEKIAtBBGogBhCZASIOEFggBSADNgIAAkACQCAAIggtAAAiBkEraw4DAAEAAQsgCiAGwBBLIQYgBSAFKAIAIgdBBGo2AgAgByAGNgIAIABBAWohCAsCQAJAIAIgCCIGa0EBTA0AIAYtAABBMEcNACAGLQABQSByQfgARw0AIApBMBBLIQcgBSAFKAIAIghBBGo2AgAgCCAHNgIAIAogBiwAARBLIQcgBSAFKAIAIghBBGo2AgAgCCAHNgIAIAZBAmoiCCEGA0AgAiAGTQ0CIAYsAAAQLhoQsANFDQIgBkEBaiEGDAALAAsDQCACIAZNDQEgBiwAABAuGhCvA0UNASAGQQFqIQYMAAsACwJAIAtBBGoQWgRAIAogCCAGIAUoAgAQbyAFIAUoAgAgBiAIa0ECdGo2AgAMAQsgCCAGEIQBIA4QWSEPIAghBwNAIAYgB00EQCADIAggAGtBAnRqIAUoAgAQxwEFAkAgC0EEaiIMIA0QIiwAAEEATA0AIAkgDCANECIsAABHDQAgBSAFKAIAIglBBGo2AgAgCSAPNgIAIA0gDSAMEB9BAWtJaiENQQAhCQsgCiAHLAAAEEshDCAFIAUoAgAiEEEEajYCACAQIAw2AgAgB0EBaiEHIAlBAWohCQwBCwsLAkACQANAIAIgBk0NASAGQQFqIQcgBiwAACIGQS5HBEAgCiAGEEshBiAFIAUoAgAiCEEEajYCACAIIAY2AgAgByEGDAELCyAOEHghBiAFIAUoAgAiCEEEaiIJNgIAIAggBjYCAAwBCyAFKAIAIQkgBiEHCyAKIAcgAiAJEG8gBSAFKAIAIAIgB2tBAnRqIgU2AgAgBCAFIAMgASAAa0ECdGogASACRhs2AgAgC0EEahAgGiALQRBqJAALDwAgAARAIAAQOgsgABAtC90DAQh/IwBBEGsiCyQAIAYQSCEKIAtBBGoiByAGEJkBIgYQWAJAIAcQWgRAIAogACACIAMQbyAFIAMgAiAAa0ECdGoiBjYCAAwBCyAFIAM2AgACQAJAIAAiBy0AACIIQStrDgMAAQABCyAKIAjAEEshByAFIAUoAgAiCEEEajYCACAIIAc2AgAgAEEBaiEHCwJAIAIgB2tBAkgNACAHLQAAQTBHDQAgBy0AAUEgckH4AEcNACAKQTAQSyEIIAUgBSgCACIJQQRqNgIAIAkgCDYCACAKIAcsAAEQSyEIIAUgBSgCACIJQQRqNgIAIAkgCDYCACAHQQJqIQcLIAcgAhCEAUEAIQkgBhBZIQ1BACEIIAchBgN/IAIgBk0EfyADIAcgAGtBAnRqIAUoAgAQxwEgBSgCAAUCQCALQQRqIgwgCBAiLQAARQ0AIAkgDCAIECIsAABHDQAgBSAFKAIAIglBBGo2AgAgCSANNgIAIAggCCAMEB9BAWtJaiEIQQAhCQsgCiAGLAAAEEshDCAFIAUoAgAiDkEEajYCACAOIAw2AgAgBkEBaiEGIAlBAWohCQwBCwshBgsgBCAGIAMgASAAa0ECdGogASACRhs2AgAgC0EEahAgGiALQRBqJAALRwIBfwF+IwBBIGsiBSQAIAMoAgAhAyAEKQMAIQYgBSAEKQMINwMQIAUgBjcDCCAFIAM2AgAgACABIAIgBRDAASAFQSBqJAALOwIBfwF+IwBBEGsiBCQAIAMpAwAhBSAEIAMpAwg3AwggBCAFNwMAIABBHiABIAIgBBCWASAEQRBqJAALSQIBfwF+IwBBIGsiBSQAIAMoAgAhAyAEKQMAIQYgBSAEKQMINwMQIAUgBjcDCCAFIAM2AgAgAEEeIAEgAiAFEJYBIAVBIGokAAuiBQEKfyMAQRBrIgokACAGEEkhCSAKQQRqIAYQmwEiDhBYIAUgAzYCAAJAAkAgACIILQAAIgZBK2sOAwABAAELIAkgBsAQQSEGIAUgBSgCACIHQQFqNgIAIAcgBjoAACAAQQFqIQgLAkACQCACIAgiBmtBAUwNACAGLQAAQTBHDQAgBi0AAUEgckH4AEcNACAJQTAQQSEHIAUgBSgCACIIQQFqNgIAIAggBzoAACAJIAYsAAEQQSEHIAUgBSgCACIIQQFqNgIAIAggBzoAACAGQQJqIgghBgNAIAIgBk0NAiAGLAAAEC4aELADRQ0CIAZBAWohBgwACwALA0AgAiAGTQ0BIAYsAAAQLhoQrwNFDQEgBkEBaiEGDAALAAsCQCAKQQRqEFoEQCAJIAggBiAFKAIAEHkgBSAFKAIAIAYgCGtqNgIADAELIAggBhCEASAOEFkhDyAIIQcDQCAGIAdNBEAgAyAIIABraiAFKAIAEIQBBQJAIApBBGoiDCANECIsAABBAEwNACALIAwgDRAiLAAARw0AIAUgBSgCACILQQFqNgIAIAsgDzoAACANIA0gDBAfQQFrSWohDUEAIQsLIAkgBywAABBBIQwgBSAFKAIAIhBBAWo2AgAgECAMOgAAIAdBAWohByALQQFqIQsMAQsLCwNAAkACQCACIAZNBEAgBiEHDAELIAZBAWohByAGLAAAIgZBLkcNASAOEHghBiAFIAUoAgAiCEEBajYCACAIIAY6AAALIAkgByACIAUoAgAQeSAFIAUoAgAgAiAHa2oiBTYCACAEIAUgAyABIABraiABIAJGGzYCACAKQQRqECAaIApBEGokAA8LIAkgBhBBIQYgBSAFKAIAIghBAWo2AgAgCCAGOgAAIAchBgwACwALKQEBfyMAQRBrIgQkACAEIAMrAwA5AwAgACABIAIgBBDAASAEQRBqJAALNwEBfyMAQRBrIgUkACADKAIAIQMgBSAEKwMAOQMIIAUgAzYCACAAIAEgAiAFEMABIAVBEGokAAsrAQF/IwBBEGsiBCQAIAQgAysDADkDACAAQR4gASACIAQQlgEgBEEQaiQACzkBAX8jAEEQayIFJAAgAygCACEDIAUgBCsDADkDCCAFIAM2AgAgAEEeIAEgAiAFEJYBIAVBEGokAAsrAQF/IwBBEGsiBCQAIAQgAykDADcDACAAQRggASACIAQQlgEgBEEQaiQAC9QDAQh/IwBBEGsiCyQAIAYQSSEKIAtBBGoiByAGEJsBIgYQWAJAIAcQWgRAIAogACACIAMQeSAFIAMgAiAAa2oiBjYCAAwBCyAFIAM2AgACQAJAIAAiBy0AACIIQStrDgMAAQABCyAKIAjAEEEhByAFIAUoAgAiCEEBajYCACAIIAc6AAAgAEEBaiEHCwJAIAIgB2tBAkgNACAHLQAAQTBHDQAgBy0AAUEgckH4AEcNACAKQTAQQSEIIAUgBSgCACIJQQFqNgIAIAkgCDoAACAKIAcsAAEQQSEIIAUgBSgCACIJQQFqNgIAIAkgCDoAACAHQQJqIQcLIAcgAhCEAUEAIQkgBhBZIQ1BACEIIAchBgN/IAIgBk0EfyADIAcgAGtqIAUoAgAQhAEgBSgCAAUCQCALQQRqIgwgCBAiLQAARQ0AIAkgDCAIECIsAABHDQAgBSAFKAIAIglBAWo2AgAgCSANOgAAIAggCCAMEB9BAWtJaiEIQQAhCQsgCiAGLAAAEEEhDCAFIAUoAgAiDkEBajYCACAOIAw6AAAgBkEBaiEGIAlBAWohCQwBCwshBgsgBCAGIAMgASAAa2ogASACRhs2AgAgC0EEahAgGiALQRBqJAALQwEBfyMAQRBrIgMkACADIAI2AgxBoCAgAUH02QFBuyxBGCADQQxqIgEQVEH02QFBvyxBGSABEFQQBCADQRBqJAAgAAuWAwECfyMAQdACayIAJAAgACACNgLIAiAAIAE2AswCIAMQaiEGIAMgAEHQAWoQrgEhByAAQcQBaiADIABBxAJqEK0BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABBzAJqIABByAJqECsNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABBzAJqIgMQNyAGIAIgAEG0AWogAEEIaiAAKALEAiAAQcQBaiAAQRBqIABBDGogBxCYAQ0AIAMQPhoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCTAzYCACAAQcQBaiAAQRBqIAAoAgwgBBBDIABBzAJqIABByAJqECsEQCAEIAQoAgBBAnI2AgALIAAoAswCIAEQIBogAEHEAWoQIBogAEHQAmokAAtbAQF/IwBBEGsiAyQAIAMgAigCADYCACMAQRBrIgIkACACIAE2AgwgAiADNgIIIAJBBGogAkEMahBjIABB1w0gAigCCBCkAyEAEGIgAkEQaiQAIANBEGokACAAC9kCAgR+Bn8jAEEgayIIJAACQAJAAkAgASACRwRAQYjqASgCACENQYjqAUEANgIAIwBBEGsiCSQAEC4aIwBBEGsiCiQAIwBBEGsiCyQAIwBBEGsiDCQAIAwgASAIQRxqQQIQgAIgDCkDACEEIAsgDCkDCDcDCCALIAQ3AwAgDEEQaiQAIAspAwAhBCAKIAspAwg3AwggCiAENwMAIAtBEGokACAKKQMAIQQgCSAKKQMINwMIIAkgBDcDACAKQRBqJAAgCSkDACEEIAggCSkDCDcDECAIIAQ3AwggCUEQaiQAIAgpAxAhBCAIKQMIIQVBiOoBKAIAIgFFDQEgCCgCHCACRw0CIAUhBiAEIQcgAUHEAEcNAwwCCyADQQQ2AgAMAgtBiOoBIA02AgAgCCgCHCACRg0BCyADQQQ2AgAgBiEFIAchBAsgACAFNwMAIAAgBDcDCCAIQSBqJAALwAECA38BfCMAQRBrIgMkAAJAAkACQCAAIAFHBEBBiOoBKAIAIQVBiOoBQQA2AgAQLhojAEEQayIEJAAgBCAAIANBDGpBARCAAiAEKQMAIAQpAwgQlQIhBiAEQRBqJAACQEGI6gEoAgAiAARAIAMoAgwgAUYNAQwDC0GI6gEgBTYCACADKAIMIAFHDQIMBAsgAEHEAEcNAwwCCyACQQQ2AgAMAgtEAAAAAAAAAAAhBgsgAkEENgIACyADQRBqJAAgBgubCgEEfyMAQRBrIgIkAEGACEEEQZAgQd4gQQRBAkEAQQAQC0HtC0ECQeQgQZghQQVBA0EAQQAQCyMAQSBrIgEkAEGY4AEtAABFBEBBmOABQQE6AABBnCFBvNoBEAcLQewgQYwlQcQlQQBB+iVBBkH9JUEAQf0lQQBB1xtB/yVBBxAJQewgQQFBhCZBiCZBIkEIEAYgAUEANgIcIAFBCTYCGCABIAEpAhg3AxAjAEEQayIAJAAgACABKQIQNwIIQewgQYoPQQNBjCZBmCZBIyAAQQhqEI0BQQBBAEEAEAEgAEEQaiQAIAFBADYCHCABQQo2AhggASABKQIYNwMIIwBBEGsiACQAIAAgASkCCDcCCEHsIEHKEEEEQaAmQbAmQSQgAEEIahCNAUEAQQBBABABIABBEGokACABQQA2AhwgAUELNgIYIAEgASkCGDcDACMAQRBrIgAkACAAIAEpAgA3AghB7CBB4BBBAkG4JkHAJkElIABBCGoQjQFBAEEAQQAQASAAQRBqJAAjAEEQayIAJAAgAEEMNgIMQewgQZoKQQNB6CZB9CZBJiAAQQxqEFRBAEEAQQAQASAAQRBqJAAjAEEQayIAJAAgAEENNgIMQewgQZYKQQRBgCdBkCdBJyAAQQxqEFRBAEEAQQAQASAAQRBqJAAgAUEgaiQAIwBBIGsiASQAQaTgAS0AAEUEQEGk4AFBAToAAEGYJ0HE2QEQBwtBpCpB0CpBiCtBAEG+K0EOQf0lQQBB/SVBAEG0FUHBK0EPEAlBpCpBAUHEK0HIK0EoQRAQBiABQQA2AhwgAUERNgIYIAEgASkCGDcDECMAQRBrIgAkACAAIAEpAhA3AghBpCpBig9BA0HMK0HYK0EpIABBCGoQjQFBAEEAQQAQASAAQRBqJAAgAUEANgIcIAFBEjYCGCABIAEpAhg3AwgjAEEQayIAJAAgACABKQIINwIIQaQqQcoQQQRB4CtB8CtBKiAAQQhqEI0BQQBBAEEAEAEgAEEQaiQAIAFBADYCHCABQRM2AhggASABKQIYNwMAIwBBEGsiACQAIAAgASkCADcCCEGkKkHgEEECQfgrQYAsQSsgAEEIahCNAUEAQQBBABABIABBEGokACMAQRBrIgAkACAAQRQ2AgxBpCpBmgpBA0GMLEGYLEEsIABBDGoQVEEAQQBBABABIABBEGokACMAQRBrIgAkACAAQRU2AgxBpCpBlgpBBEGgLEGwLEEtIABBDGoQVEEAQQBBABABIABBEGokACABQSBqJABBoCBBhhJBtixBFkG4LEEXEAggAkEPakHGCkEAEIsDQZMRQQQQiwMjAEEQayIBJAAgAUEINgIMQaAgQZ8TQazZAUHELEEaIAFBDGoiAxBUQazZAUHILEEbIAMQVBAEIAFBEGokAEHlCkEMEJcBQboLQRgQlwFB7wpBJBCXAUHBC0EwEJcBQdAKQTwQlwFBtg9ByAAQlwEaQaAgEBBB2CxB/w1BBEEBEBFB2CxBgBZBABADQdgsQZoWQQEQA0HYLEGWFkECEANB2CxBkhZBAxADQdgsQY4WQQQQA0HYLEH8FUEFEANB2CxB+BVBBhADQdgsQfAVQQcQA0HYLEHsFUEIEANBwCBB1wpB+SxBHkH7LEEfEAgjAEEQayIBJAAgAUEANgIMQcAgQe4NQdgsQf4sQSAgAUEMaiIAEFRB2CxBgi1BISAAEFQQBCABQRBqJABBwCAQECACQRBqJAALvAECA38BfSMAQRBrIgMkAAJAAkACQCAAIAFHBEBBiOoBKAIAIQVBiOoBQQA2AgAQLhojAEEQayIEJAAgBCAAIANBDGpBABCAAiAEKQMAIAQpAwgQpgMhBiAEQRBqJAACQEGI6gEoAgAiAARAIAMoAgwgAUYNAQwDC0GI6gEgBTYCACADKAIMIAFHDQIMBAsgAEHEAEcNAwwCCyACQQQ2AgAMAgtDAAAAACEGCyACQQQ2AgALIANBEGokACAGC8MBAgN/AX4jAEEQayIEJAACfgJAAkAgACABRwRAAkACQCAALQAAIgVBLUcNACAAQQFqIgAgAUcNAAwBC0GI6gEoAgAhBkGI6gFBADYCABAuGiAAIARBDGogAxCCAiEHAkBBiOoBKAIAIgAEQCAEKAIMIAFHDQEgAEHEAEYNBAwFC0GI6gEgBjYCACAEKAIMIAFGDQQLCwsgAkEENgIAQgAMAgsgAkEENgIAQn8MAQtCACAHfSAHIAVBLUYbCyAEQRBqJAAL1AECA38BfiMAQRBrIgQkAAJ/AkACQAJAIAAgAUcEQAJAAkAgAC0AACIFQS1HDQAgAEEBaiIAIAFHDQAMAQtBiOoBKAIAIQZBiOoBQQA2AgAQLhogACAEQQxqIAMQggIhBwJAQYjqASgCACIABEAgBCgCDCABRw0BIABBxABGDQUMBAtBiOoBIAY2AgAgBCgCDCABRg0DCwsLIAJBBDYCAEEADAMLIAdC/////w9YDQELIAJBBDYCAEF/DAELQQAgB6ciAGsgACAFQS1GGwsgBEEQaiQAC4sDAQF/IwBBgAJrIgAkACAAIAI2AvgBIAAgATYC/AEgAxBqIQYgAEHEAWogAyAAQfcBahCvASAAQbgBahAkIgEgARAoECEgACABQQAQIiICNgK0ASAAIABBEGo2AgwgAEEANgIIA0ACQCAAQfwBaiAAQfgBahAsDQAgACgCtAEgARAfIAJqRgRAIAEQHyEDIAEgARAfQQF0ECEgASABECgQISAAIAMgAUEAECIiAmo2ArQBCyAAQfwBaiIDEDggBiACIABBtAFqIABBCGogACwA9wEgAEHEAWogAEEQaiAAQQxqQdCfARCaAQ0AIAMQPxoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCTAzYCACAAQcQBaiAAQRBqIAAoAgwgBBBDIABB/AFqIABB+AFqECwEQCAEIAQoAgBBAnI2AgALIAAoAvwBIAEQIBogAEHEAWoQIBogAEGAAmokAAvZAQIDfwF+IwBBEGsiBCQAAn8CQAJAAkAgACABRwRAAkACQCAALQAAIgVBLUcNACAAQQFqIgAgAUcNAAwBC0GI6gEoAgAhBkGI6gFBADYCABAuGiAAIARBDGogAxCCAiEHAkBBiOoBKAIAIgAEQCAEKAIMIAFHDQEgAEHEAEYNBQwEC0GI6gEgBjYCACAEKAIMIAFGDQMLCwsgAkEENgIAQQAMAwsgB0L//wNYDQELIAJBBDYCAEH//wMMAQtBACAHpyIAayAAIAVBLUYbCyAEQRBqJABB//8DcQu3AQIBfgJ/IwBBEGsiBSQAAkACQCAAIAFHBEBBiOoBKAIAIQZBiOoBQQA2AgAQLhogACAFQQxqIAMQmgMhBAJAQYjqASgCACIABEAgBSgCDCABRw0BIABBxABGDQMMBAtBiOoBIAY2AgAgBSgCDCABRg0DCwsgAkEENgIAQgAhBAwBCyACQQQ2AgAgBEIAVQRAQv///////////wAhBAwBC0KAgICAgICAgIB/IQQLIAVBEGokACAEC8ABAgJ/AX4jAEEQayIEJAACfwJAAkAgACABRwRAQYjqASgCACEFQYjqAUEANgIAEC4aIAAgBEEMaiADEJoDIQYCQEGI6gEoAgAiAARAIAQoAgwgAUcNASAAQcQARg0EDAMLQYjqASAFNgIAIAQoAgwgAUYNAgsLIAJBBDYCAEEADAILIAZCgICAgHhTIAZC/////wdVcg0AIAanDAELIAJBBDYCAEH/////ByAGQgBVDQAaQYCAgIB4CyAEQRBqJAALMwEBfyABIAAoAgQiAWohAgNAIAEgAkYEQCAAIAI2AgQFIAFBADoAACABQQFqIQEMAQsLC5EBAQN/AkAgASACEPUBIQQjAEEQayIDJAAgBEH3////A00EQAJAIAQQvQEEQCAAIAQQUCAAIQUMAQsgA0EIaiAEEJABQQFqEI8BIAMoAgwaIAAgAygCCCIFNgIAIAAgAygCDBBcIAAgBDYCBAsgASACIAUQ5wIgA0EANgIEIANBBGoQViADQRBqJAAMAQsQWwALCxYAIAAgASACQoCAgICAgICAgH8QhAILhwgBBX8gASgCACEEAkACQAJAAkACQAJAAkACfwJAAkACQAJAIANFDQAgAygCACIFRQ0AIABFBEAgAiEDDAMLIANBADYCACACIQMMAQsCQEHc4QEoAgAoAgBFBEAgAEUNASACRQ0MIAIhBQNAIAQsAAAiAwRAIAAgA0H/vwNxNgIAIABBBGohACAEQQFqIQQgBUEBayIFDQEMDgsLIABBADYCACABQQA2AgAgAiAFaw8LIAIhAyAARQ0DDAULIAQQqAEPC0EBIQYMAwtBAAwBC0EBCyEGA0AgBkUEQCAELQAAQQN2IgZBEGsgBUEadSAGanJBB0sNAwJ/IARBAWoiBiAFQYCAgBBxRQ0AGiAGLAAAQUBOBEAgBEEBayEEDAcLIARBAmoiBiAFQYCAIHFFDQAaIAYsAABBQE4EQCAEQQFrIQQMBwsgBEEDagshBCADQQFrIQNBASEGDAELA0ACQCAEQQNxIAQsAAAiBUEATHINACAEKAIAIgVBgYKECGsgBXJBgIGChHhxDQADQCADQQRrIQMgBCgCBCEFIARBBGohBCAFIAVBgYKECGtyQYCBgoR4cUUNAAsLIAXAQQBKBEAgA0EBayEDIARBAWohBAwBCwsgBUH/AXFBwgFrIgZBMksNAyAEQQFqIQQgBkECdCgCkIEBIQVBACEGDAALAAsDQCAGRQRAIANFDQcDQAJAIAQtAAAiBsAiBUEATA0AIARBA3EgA0EFSXJFBEACQANAIAQoAgAiBUGBgoQIayAFckGAgYKEeHENASAAIAVB/wFxNgIAIAAgBC0AATYCBCAAIAQtAAI2AgggACAELQADNgIMIABBEGohACAEQQRqIQQgA0EEayIDQQRLDQALIAQtAAAhBQsgBUH/AXEhBiAFwEEATA0BCyAAIAY2AgAgAEEEaiEAIARBAWohBCADQQFrIgMNAQwJCwsgBkHCAWsiBkEySw0DIARBAWohBCAGQQJ0KAKQgQEhBUEBIQYMAQsgBC0AACIGQQN2IgdBEGsgByAFQRp1anJBB0sNAQJAAkACfyAEQQFqIgcgBkGAAWsgBUEGdHIiBkEATg0AGiAHLQAAQYABayIHQT9LDQEgByAGQQZ0IghyIQYgBEECaiIHIAhBAE4NABogBy0AAEGAAWsiB0E/Sw0BIAcgBkEGdHIhBiAEQQNqCyEEIAAgBjYCACADQQFrIQMgAEEEaiEADAELQYjqAUEZNgIAIARBAWshBAwFC0EAIQYMAAsACyAEQQFrIQQgBQ0BIAQtAAAhBQsgBUH/AXENACAABEAgAEEANgIAIAFBADYCAAsgAiADaw8LQYjqAUEZNgIAIABFDQELIAEgBDYCAAtBfw8LIAEgBDYCACACCzEBAX9B3OEBKAIAIQEgAARAQdzhAUHk4AEgACAAQX9GGzYCAAtBfyABIAFB5OABRhsLOAAgAEHQD2sgACAAQZPx//8HShsiAEEDcQRAQQAPCyAAQewOaiIAQeQAbwRAQQEPCyAAQZADb0ULlxMCD38EfiMAQYABayIIJAAgAQRAAn8DQAJAAn8CQAJAAkAgAi0AACIGQSVHBEAgBg0BIAoMBwtBACEFQQEhCQJAIAItAAEiB0Etaw4EAgMDAgALIAdB3wBGDQEgBw0CCyAAIApqIAY6AAAgCkEBagwCCyAHIQUgAi0AAiEHQQIhCQtBACEOAkACfyACIAlqIAciEkErRmoiCSwAAEEwa0EJTQRAIAkgCEEMakEKQv////8PEIQCpyECIAgoAgwMAQsgCCAJNgIMQQAhAiAJCyIHLQAAIgZBwwBrIgtBFktBASALdEGZgIACcUVyDQAgAiIODQAgByAJRyEOCyAGQc8ARiAGQcUARnIEfyAHLQABIQYgB0EBagUgBwshAiAIQRBqIQcgBSEJQQAhBSMAQdAAayILJABB5QghDUEwIRBBqIAIIQwCQCAIAn8CQAJAAkACQAJAAkACQAJ/AkACQAJAAkACQAJAAkACQAJAAn4CQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIAbAIgZBJWsOViEtLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0tLS0BAwQnLQcICQotLS0NLS0tLRASFBYYFxweIC0tLS0tLQACJgYFLQgCLQstLQwOLQ8tJRETFS0ZGx0fLQsgAygCGCIFQQZNDSIMKgsgAygCGCIFQQZLDSkgBUGHgAhqDCILIAMoAhAiBUELSw0oIAVBjoAIagwhCyADKAIQIgVBC0sNJyAFQZqACGoMIAsgAzQCFELsDnxC5AB/IRQMIwtB3wAhEAsgAzQCDCEUDCELQa8TIQ0MHwsgAzQCFCIVQuwOfCEUAkAgAygCHCIFQQJMBEAgFCAVQusOfCADEIMCQQFGGyEUDAELIAVB6QJJDQAgFULtDnwgFCADEIMCQQFGGyEUCyAGQecARg0ZDCALIAM0AgghFAweC0ECIQUgAygCCCIGRQRAQgwhFAwgCyAGrCIUQgx9IBQgBkEMShshFAwfCyADKAIcQQFqrCEUQQMhBQweCyADKAIQQQFqrCEUDBsLIAM0AgQhFAwaCyAIQQE2AnxBwx8hBQweC0GngAhBpoAIIAMoAghBC0obDBQLQdQVIQ0MFgtBACEMQQAhESMAQRBrIg8kACADNAIUIRQCfiADKAIQIg1BDE8EQCANIA1BDG0iBkEMbGsiBUEMaiAFIAVBAEgbIQ0gBiAFQR91aqwgFHwhFAsgD0EMaiEGIBRCAn1CiAFYBEAgFKciDEHEAGtBAnUhBQJAIAYCfyAMQQNxRQRAIAVBAWshBSAGRQ0CQQEMAQsgBkUNAUEACzYCAAsgDEGA54QPbCAFQYCjBWxqQYDWr+MHaqwMAQsgFELkAH0iFCAUQpADfyIWQpADfn0iFUI/h6cgFqdqIRMCQAJAAkAgFaciBUGQA2ogBSAVQgBTGyIFBH8CfyAFQcgBTgRAIAVBrAJPBEBBAyEMIAVBrAJrDAILQQIhDCAFQcgBawwBCyAFQeQAayAFIAVB4wBKIgwbCyIFDQFBAAVBAQshBSAGDQEMAgsgBUECdiERIAVBA3FFIQUgBkUNAQsgBiAFNgIACyAUQoDnhA9+IBEgDEEYbCATQeEAbGpqIAVrrEKAowV+fEKAqrrDA3wLIRQgDUECdEGwnAFqKAIAIgVBgKMFaiAFIA8oAgwbIAUgDUEBShshBSADKAIMIQYgAzQCCCEVIAM0AgQhFiADNAIAIA9BEGokACAUIAWsfCAGQQFrrEKAowV+fCAVQpAcfnwgFkI8fnx8IAM0AiR9DAgLIAM0AgAhFAwVCyAIQQE2AnxBxR8hBQwZC0HBFSENDBILIAMoAhgiBUEHIAUbrAwECyADKAIcIAMoAhhrQQdqQQdurSEUDBELIAMoAhwgAygCGEEGakEHcGtBB2pBB26tIRQMEAsgAxCDAq0hFAwPCyADNAIYCyEUQQEhBQwPC0GpgAghDAwKC0GqgAghDAwJCyADNAIUQuwOfELkAIEiFCAUQj+HIhSFIBR9IRQMCgsgAzQCFCIVQuwOfCEUIBVCpD9TDQogCyAUNwMwIAggB0H4EiALQTBqEIYBNgJ8IAchBQwOCyADKAIgQQBIBEAgCEEANgJ8QcYfIQUMDgsgCyADKAIkIgVBkBxtIgZB5ABsIAUgBkGQHGxrwUE8bcFqNgJAIAggB0H+EiALQUBrEIYBNgJ8IAchBQwNCyADKAIgQQBIBEAgCEEANgJ8QcYfIQUMDQsgAygCKEG07wEtAABBAXFFBEBBiO8BQYzvAUHA7wFB4O8BEBJBlO8BQeDvATYCAEGQ7wFBwO8BNgIAQbTvAUEBOgAACwwLCyAIQQE2AnxBux4hBQwLCyAUQuQAgSEUDAULIAVBgIAIcgsgBBCfAwwHC0GrgAghDAsgDCAEEJ8DIQ0LIAggB0HkACANIAMgBBCeAyIFNgJ8IAdBACAFGyEFDAULQQIhBQwBC0EEIQULAkAgCSAQIAkbIgZB3wBHBEAgBkEtRw0BIAsgFDcDECAIIAdB+RIgC0EQahCGATYCfCAHIQUMBAsgCyAUNwMoIAsgBTYCICAIIAdB8hIgC0EgahCGATYCfCAHIQUMAwsgCyAUNwMIIAsgBTYCACAIIAdB6xIgCxCGATYCfCAHIQUMAgtB7RsLIgUQqAE2AnwLIAtB0ABqJAAgBUUNAQJAIA5FBEAgCCgCfCEJDAELAn8CQAJAIAUtAAAiBkEraw4DAQABAAsgCCgCfAwBCyAFLQABIQYgBUEBaiEFIAgoAnxBAWsLIQkCQCAGQf8BcUEwRw0AA0AgBSwAASIHQTBrQQlLDQEgBUEBaiEFIAlBAWshCSAHQTBGDQALCyAIIAk2AnxBACEGA0AgBiIHQQFqIQYgBSAHaiwAAEEwa0EKSQ0ACyAOIAkgCSAOSRshBgJAIAAgCmogAygCFEGUcUgEf0EtBSASQStHDQEgBiAJayAHakEDQQUgCCgCDC0AAEHDAEYbSQ0BQSsLOgAAIAZBAWshBiAKQQFqIQoLIAYgCU0gASAKTXINAANAIAAgCmpBMDoAACAKQQFqIQogBkEBayIGIAlNDQEgASAKSw0ACwsgCCAJIAEgCmsiByAHIAlLGyIHNgJ8IAAgCmogBSAHEHEaIAgoAnwgCmoLIQogAkEBaiECIAEgCksNAQsLIAFBAWsgCiABIApGGyEKQQALIQYgACAKakEAOgAACyAIQYABaiQAIAYLugEBAn8gAEEORgRAQdEbQeEVIAEoAgAbDwsgAEH//wNxIgJB//8DRyAAQRB1IgNBBUpyRQRAIAEgA0ECdGooAgAiAEEIakGMFiAAGw8LQcYfIQACQAJ/AkACQAJAIANBAWsOBQABBAQCBAsgAkEBSw0DQeCcAQwCCyACQTFLDQJB8JwBDAELIAJBA0sNAUGwnwELIQAgAkUEQCAADwsDQCAALQAAIABBAWohAA0AIAJBAWsiAg0ACwsgAAsOACAAEKEDBEAgABAtCwsnACAAQQBHIABBmIMBR3EgAEGwgwFHcSAAQYzuAUdxIABBpO4BR3EL5AIBA38CQCABLQAADQBB2hUQhgIiAQRAIAEtAAANAQsgAEEMbEHQgwFqEIYCIgEEQCABLQAADQELQecVEIYCIgEEQCABLQAADQELQc8bIQELAkADQCABIAJqLQAAIgRFIARBL0ZyRQRAQRchBCACQQFqIgJBF0cNAQwCCwsgAiEEC0HPGyEDAkACQAJAAkACQCABLQAAIgJBLkYNACABIARqLQAADQAgASEDIAJBwwBHDQELIAMtAAFFDQELIANBzxsQ0AFFDQAgA0GuFRDQAQ0BCyAARQRAQfSCASECIAMtAAFBLkYNAgtBAA8LQYjuASgCACICBEADQCADIAJBCGoQ0AFFDQIgAigCICICDQALC0EkEDQiAgRAIAJB9IIBKQIANwIAIAJBCGoiASADIAQQcRogASAEakEAOgAAIAJBiO4BKAIANgIgQYjuASACNgIACyACQfSCASAAIAJyGyECCyACCyUBAX8jAEEQayICJAAgAiABNgIMIABBxhAgARCkAyACQRBqJAALwR4CD38FfiMAQZABayIDJAAgA0EAQZAB/AsAIANBfzYCTCADIAA2AiwgA0HhADYCICADIAA2AlQgASEEIAIhDyMAQbACayIFJAAgAygCTBoCQAJAIAMoAgRFBEAgAxDJAxogAygCBEUNAQsgBC0AACIBRQ0BAkACQANAAkACQCABQf8BcSIAEH0EQANAIAQiAUEBaiEEIAEtAAEQfQ0ACyADQgAQZANAAn8gAygCBCIAIAMoAmhHBEAgAyAAQQFqNgIEIAAtAAAMAQsgAxAmCxB9DQALIAMoAgQhBCADKQNwQgBZBEAgAyAEQQFrIgQ2AgQLIAQgAygCLGusIAMpA3ggFHx8IRQMAQsCfwJAAkAgAEElRgRAIAQtAAEiAEEqRg0BIABBJUcNAgsgA0IAEGQCQCAELQAAQSVGBEADQAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiARB9DQALIARBAWohBAwBCyADKAIEIgAgAygCaEcEQCADIABBAWo2AgQgAC0AACEBDAELIAMQJiEBCyAELQAAIAFHBEAgAykDcEIAWQRAIAMgAygCBEEBazYCBAsgAUEATiANcg0KDAkLIAMoAgQgAygCLGusIAMpA3ggFHx8IRQgBCEBDAMLQQAhByAEQQJqDAELAkAgAEEwayIAQQlLDQAgBC0AAkEkRw0AIwBBEGsiASAPNgIMIAEgDyAAQQJ0akEEayAPIABBAUsbIgBBBGo2AgggACgCACEHIARBA2oMAQsgDygCACEHIA9BBGohDyAEQQFqCyEBQQAhC0EAIQIgAS0AACIEQTBrQf8BcUEJTQRAA0AgAkEKbCAEQf8BcWpBMGshAiABLQABIQQgAUEBaiEBIARBMGtB/wFxQQpJDQALCyAEQf8BcUHtAEcEfyABBUEAIQkgB0EARyELIAEtAAEhBEEAIQogAUEBagsiBkEBaiEBQQMhAAJAAkACQAJAAkACQCAEQf8BcUHBAGsOOgQJBAkEBAQJCQkJAwkJCQkJCQQJCQkJBAkJBAkJCQkJBAkEBAQEBAAEBQkBCQQEBAkJBAIECQkECQIJCyAGQQJqIAEgBi0AAUHoAEYiABshAUF+QX8gABshAAwECyAGQQJqIAEgBi0AAUHsAEYiABshAUEDQQEgABshAAwDC0EBIQAMAgtBAiEADAELQQAhACAGIQELQQEgACABLQAAIgBBL3FBA0YiBBshEAJAIABBIHIgACAEGyIMQdsARg0AAkAgDEHuAEcEQCAMQeMARw0BQQEgAiACQQFMGyECDAILIAcgECAUEKUDDAILIANCABBkA0ACfyADKAIEIgAgAygCaEcEQCADIABBAWo2AgQgAC0AAAwBCyADECYLEH0NAAsgAygCBCEEIAMpA3BCAFkEQCADIARBAWsiBDYCBAsgBCADKAIsa6wgAykDeCAUfHwhFAsgAyACrCISEGQCQCADKAIEIgAgAygCaEcEQCADIABBAWo2AgQMAQsgAxAmQQBIDQQLIAMpA3BCAFkEQCADIAMoAgRBAWs2AgQLQRAhBAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAMQdgAaw4hBgsLAgsLCwsLAQsCBAEBAQsFCwsLCwsDBgsLAgsECwsGAAsgDEHBAGsiAEEGS0EBIAB0QfEAcUVyDQoLIAVBCGogAyAQQQAQqAMgAykDeEIAIAMoAgQgAygCLGusfVENDiAHRQ0JIAUpAxAhEiAFKQMIIRMgEA4DBQYHCQsgDEEQckHzAEYEQCAFQSBqQX9BgQIQmAIgBUEAOgAgIAxB8wBHDQggBUEAOgBBIAVBADoALiAFQQA2ASoMCAsgBUEgaiABLQABIgBB3gBGIgRBgQIQmAIgBUEAOgAgIAFBAmogAUEBaiAEGyEGAn8CQAJAIAFBAkEBIAQbai0AACIBQS1HBEAgAUHdAEYNASAAQd4ARyEIIAYMAwsgBSAAQd4ARyIIOgBODAELIAUgAEHeAEciCDoAfgsgBkEBagshAQNAAkAgAS0AACIAQS1HBEAgAEUNDyAAQd0ARg0KDAELQS0hACABLQABIgZFIAZB3QBGcg0AIAFBAWohDgJAIAYgAUEBay0AACIETQRAIAYhAAwBCwNAIARBAWoiBCAFQSBqaiAIOgAAIAQgDi0AACIASQ0ACwsgDiEBCyAAIAVBIGpqIAg6AAEgAUEBaiEBDAALAAtBCCEEDAILQQohBAwBC0EAIQQLQgAhEkEAIQJBACEGQQAhDiMAQRBrIggkAAJAIARBAUcgBEEkTXFFBEBBiOoBQRw2AgAMAQsDQAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiABB9DQALAkACQCAAQStrDgMAAQABC0F/QQAgAEEtRhshDiADKAIEIgAgAygCaEcEQCADIABBAWo2AgQgAC0AACEADAELIAMQJiEACwJAAkACQAJAIARBAEcgBEEQR3EgAEEwR3JFBEACfyADKAIEIgAgAygCaEcEQCADIABBAWo2AgQgAC0AAAwBCyADECYLIgBBX3FB2ABGBEBBECEEAn8gAygCBCIAIAMoAmhHBEAgAyAAQQFqNgIEIAAtAAAMAQsgAxAmCyIAQYH/AGotAABBEEkNAyADKQNwQgBZBEAgAyADKAIEQQFrNgIECyADQgAQZAwGCyAEDQFBCCEEDAILIARBCiAEGyIEIABBgf8Aai0AAEsNACADKQNwQgBZBEAgAyADKAIEQQFrNgIECyADQgAQZEGI6gFBHDYCAAwECyAEQQpHDQAgAEEwayICQQlNBEBBACEAA0AgAEEKbCACaiIAQZmz5swBSQJ/IAMoAgQiAiADKAJoRwRAIAMgAkEBajYCBCACLQAADAELIAMQJgtBMGsiAkEJTXENAAsgAK0hEgsgAkEJSw0CIBJCCn4hEyACrSEVA0ACQAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiAEEwayICQQlNIBMgFXwiEkKas+bMmbPmzBlUcUUEQCACQQlNDQEMBQsgEkIKfiITIAKtIhVCf4VYDQELC0EKIQQMAQsgBCAEQQFrcQRAIABBgf8Aai0AACIGIARJBEADQCAGIAIgBGxqIgJBx+PxOEkCfyADKAIEIgAgAygCaEcEQCADIABBAWo2AgQgAC0AAAwBCyADECYLIgBBgf8Aai0AACIGIARJcQ0ACyACrSESCyAEIAZNDQEgBK0hEwNAIBIgE34iFSAGrUL/AYMiFkJ/hVYNAiAVIBZ8IRIgBAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiAEGB/wBqLQAAIgZNDQIgCCATQgAgEkIAEEAgCCkDCFANAAsMAQsgBEEXbEEFdkEHcSwAgYEBIREgAEGB/wBqLQAAIgIgBEkEQANAIAIgBiARdCIAciEGIABBgICAwABJAn8gAygCBCIAIAMoAmhHBEAgAyAAQQFqNgIEIAAtAAAMAQsgAxAmCyIAQYH/AGotAAAiAiAESXENAAsgBq0hEgsgAiAETw0AQn8gEa0iE4giFSASVA0AA0AgAq1C/wGDIBIgE4aEIRIgBAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiAEGB/wBqLQAAIgJNDQEgEiAVWA0ACwsgBCAAQYH/AGotAABNDQADQCAEAn8gAygCBCIAIAMoAmhHBEAgAyAAQQFqNgIEIAAtAAAMAQsgAxAmC0GB/wBqLQAASw0AC0GI6gFBxAA2AgBBACEOQn8hEgsgAykDcEIAWQRAIAMgAygCBEEBazYCBAsgDkEBckUgEkJ/UXEEQEGI6gFBxAA2AgBCfiESDAELIBIgDqwiE4UgE30hEgsgCEEQaiQAIAMpA3hCACADKAIEIAMoAixrrH1RDQkgB0UgDEHwAEdyRQRAIAcgEj4CAAwFCyAHIBAgEhClAwwECyAHIBMgEhCmAzgCAAwDCyAHIBMgEhCVAjkDAAwCCyAHIBM3AwAgByASNwMIDAELQR8gAkEBaiAMQeMARyIGGyEIAn8gEEEBRgRAIAchAiALBEAgCEECdBA0IgJFDQULIAVCADcCqAJBACEEAkACQANAIAIhAANAAn8gAygCBCICIAMoAmhHBEAgAyACQQFqNgIEIAItAAAMAQsgAxAmCyICIAVqLQAhRQ0CIAUgAjoAGyAFQRxqIAVBG2pBASAFQagCahDSASICQX5GDQAgAkF/RgRAQQAhCQwECyAABEAgACAEQQJ0aiAFKAIcNgIAIARBAWohBAsgC0UgBCAIR3INAAsgACAIQQF0QQFyIghBAnQQ3AEiAg0AC0EAIQkgACEKQQEhCwwIC0EAIQkgACAFQagCagR/IAUoAqgCBUEAC0UNAhoLIAAhCgwGCyALBEBBACEEIAgQNCICRQ0EA0AgAiEAA0ACfyADKAIEIgIgAygCaEcEQCADIAJBAWo2AgQgAi0AAAwBCyADECYLIgIgBWotACFFBEAgACEJQQAMBAsgACAEaiACOgAAIARBAWoiBCAIRw0ACyAAIAhBAXRBAXIiCBDcASICDQALQQAhCiAAIQlBASELDAYLQQAhBCAHBEADQAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsiACAFai0AIQRAIAQgB2ogADoAACAEQQFqIQQMAQUgByIAIQlBAAwDCwALAAsDQAJ/IAMoAgQiACADKAJoRwRAIAMgAEEBajYCBCAALQAADAELIAMQJgsgBWotACENAAtBACEAQQAhCUEACyEKIAMoAgQhAiADKQNwQgBZBEAgAyACQQFrIgI2AgQLIAMpA3ggAiADKAIsa6x8IhNQIAYgEiATUXJFcg0FIAsEQCAHIAA2AgALIAxB4wBGDQAgCgRAIAogBEECdGpBADYCAAsgCUUEQEEAIQkMAQsgBCAJakEAOgAACyADKAIEIAMoAixrrCADKQN4IBR8fCEUIA0gB0EAR2ohDQsgAUEBaiEEIAEtAAEiAQ0BDAULC0EBIQtBACEJQQAhCgsgDUF/IA0bIQ0LIAtFDQEgCRAtIAoQLQwBC0F/IQ0LIAVBsAJqJAAgA0GQAWokACANC0MAAkAgAEUNAAJAAkACQAJAIAFBAmoOBgABAgIEAwQLIAAgAjwAAA8LIAAgAj0BAA8LIAAgAj4CAA8LIAAgAjcDAAsL2QMCBX8CfiMAQSBrIgQkACABQv///////z+DIQcCQCABQjCIQv//AYMiCKciA0GB/wBrQf0BTQRAIAdCGYinIQICQCAAUCABQv///w+DIgdCgICACFQgB0KAgIAIURtFBEAgAkEBaiECDAELIAAgB0KAgIAIhYRCAFINACACQQFxIAJqIQILQQAgAiACQf///wNLIgUbIQJBgYF/QYCBfyAFGyADaiEDDAELIAAgB4RQIAhC//8BUnJFBEAgB0IZiKdBgICAAnIhAkH/ASEDDAELIANB/oABSwRAQf8BIQMMAQtBgP8AQYH/ACAIUCIFGyIGIANrIgJB8ABKBEBBACECQQAhAwwBCyAEQRBqIAAgByAHQoCAgICAgMAAhCAFGyIHQYABIAJrEEQgBCAAIAcgAhCKASAEKQMIIgBCGYinIQICQCAEKQMAIAMgBkcgBCkDECAEKQMYhEIAUnGthCIHUCAAQv///w+DIgBCgICACFQgAEKAgIAIURtFBEAgAkEBaiECDAELIAcgAEKAgIAIhYRCAFINACACQQFxIAJqIQILIAJBgICABHMgAiACQf///wNLIgMbIQILIARBIGokACABQiCIp0GAgICAeHEgA0EXdHIgAnK+C4kEAgN/AX4CQAJAAn8CQAJAAn8gACgCBCICIAAoAmhHBEAgACACQQFqNgIEIAItAAAMAQsgABAmCyICQStrDgMAAQABCyACQS1GIAFFAn8gACgCBCIDIAAoAmhHBEAgACADQQFqNgIEIAMtAAAMAQsgABAmCyIDQTprIgFBdUtyDQEaIAApA3BCAFMNAiAAIAAoAgRBAWs2AgQMAgsgAkE6ayEBIAIhA0EACyEEIAFBdkkNAAJAIANBMGtBCk8NAEEAIQIDQCADIAJBCmxqAn8gACgCBCICIAAoAmhHBEAgACACQQFqNgIEIAItAAAMAQsgABAmCyEDQTBrIQIgAkHMmbPmAEggA0EwayIBQQlNcQ0ACyACrCEFIAFBCk8NAANAIAOtIAVCCn58IQUCfyAAKAIEIgEgACgCaEcEQCAAIAFBAWo2AgQgAS0AAAwBCyAAECYLIgNBMGsiAUEJTSAFQjB9IgVCro+F18fC66MBU3ENAAsgAUEKTw0AA0ACfyAAKAIEIgEgACgCaEcEQCAAIAFBAWo2AgQgAS0AAAwBCyAAECYLQTBrQQpJDQALCyAAKQNwQgBZBEAgACAAKAIEQQFrNgIEC0IAIAV9IAUgBBshBQwBC0KAgICAgICAgIB/IQUgACkDcEIAUw0AIAAgACgCBEEBazYCBEKAgICAgICAgIB/DwsgBQuJMgMRfwd+AXwjAEEwayIMJAACQAJAIAJBAksNACACQQJ0IgIoAux+IREgAigC4H4hEANAAn8gASgCBCICIAEoAmhHBEAgASACQQFqNgIEIAItAAAMAQsgARAmCyICEH0NAAtBASEIAkACQCACQStrDgMAAQABC0F/QQEgAkEtRhshCCABKAIEIgIgASgCaEcEQCABIAJBAWo2AgQgAi0AACECDAELIAEQJiECCwJAAkAgAkFfcUHJAEYEQANAIAZBB0YNAgJ/IAEoAgQiAiABKAJoRwRAIAEgAkEBajYCBCACLQAADAELIAEQJgshAiAGLACKCCAGQQFqIQYgAkEgckYNAAsLIAZBA0cEQCAGQQhGIgcNASADRSAGQQRJcg0CIAcNAQsgASkDcCIVQgBZBEAgASABKAIEQQFrNgIECyADRSAGQQRJcg0AIBVCAFMhAgNAIAJFBEAgASABKAIEQQFrNgIECyAGQQFrIgZBA0sNAAsLQgAhFSMAQRBrIgckACAIskMAAIB/lLwiA0H///8DcSEIAn8gA0EXdiICQf8BcSIBBEAgAUH/AUcEQCAIrUIZhiEVIAJB/wFxQYD/AGoMAgsgCK1CGYYhFUH//wEMAQtBACAIRQ0AGiAHIAitQgAgCGciAUHRAGoQRCAHKQMIQoCAgICAgMAAhSEVIAcpAwAhFkGJ/wAgAWsLIQEgDCAWNwMAIAwgAa1CMIYgA0Efdq1CP4aEIBWENwMIIAdBEGokACAMKQMIIRUgDCkDACEWDAILAkACQAJAAkACQAJAIAYNAEEAIQYgAkFfcUHOAEcNAANAIAZBAkYNAgJ/IAEoAgQiAiABKAJoRwRAIAEgAkEBajYCBCACLQAADAELIAEQJgshAiAGLADnDSAGQQFqIQYgAkEgckYNAAsLIAYOBAMBAQABCwJAAn8gASgCBCICIAEoAmhHBEAgASACQQFqNgIEIAItAAAMAQsgARAmC0EoRgRAQQEhBgwBC0KAgICAgIDg//8AIRUgASkDcEIAUw0GIAEgASgCBEEBazYCBAwGCwNAAn8gASgCBCICIAEoAmhHBEAgASACQQFqNgIEIAItAAAMAQsgARAmCyICQTBrQQpJIAJBwQBrQRpJciACQd8ARnJFIAJB4QBrQRpPcUUEQCAGQQFqIQYMAQsLQoCAgICAgOD//wAhFSACQSlGDQUgASkDcCIWQgBZBEAgASABKAIEQQFrNgIECwJAIAMEQCAGDQEMBQtBiOoBQRw2AgBCACEWDAILA0AgFkIAWQRAIAEgASgCBEEBazYCBAsgBkEBayIGDQALDAMLIAEpA3BCAFkEQCABIAEoAgRBAWs2AgQLQYjqAUEcNgIACyABQgAQZAwCCwJAIAJBMEcNAAJ/IAEoAgQiByABKAJoRwRAIAEgB0EBajYCBCAHLQAADAELIAEQJgtBX3FB2ABGBEAjAEGwA2siBSQAAn8gASgCBCICIAEoAmhHBEAgASACQQFqNgIEIAItAAAMAQsgARAmCyECAkACfwNAIAJBMEcEQAJAIAJBLkcNBCABKAIEIgIgASgCaEYNACABIAJBAWo2AgQgAi0AAAwDCwUgASgCBCICIAEoAmhHBH9BASEPIAEgAkEBajYCBCACLQAABUEBIQ8gARAmCyECDAELCyABECYLIgJBMEcEQEEBIQsMAQsDQCAYQgF9IRgCfyABKAIEIgIgASgCaEcEQCABIAJBAWo2AgQgAi0AAAwBCyABECYLIgJBMEYNAAtBASELQQEhDwtCgICAgICAwP8/IRYDQAJAIAIhBgJAAkAgAkEwayINQQpJDQAgAkEuRyIHIAJBIHIiBkHhAGtBBUtxDQIgBw0AIAsNAkEBIQsgFSEYDAELIAZB1wBrIA0gAkE5ShshAgJAIBVCB1cEQCACIAlBBHRqIQkMAQsgFUIcWARAIAVBMGogAhBPIAVBIGogGiAWQgBCgICAgICAwP0/EC8gBUEQaiAFKQMwIAUpAzggBSkDICIaIAUpAygiFhAvIAUgBSkDECAFKQMYIBcgGRBKIAUpAwghGSAFKQMAIRcMAQsgAkUgCnINACAFQdAAaiAaIBZCAEKAgICAgICA/z8QLyAFQUBrIAUpA1AgBSkDWCAXIBkQSkEBIQogBSkDSCEZIAUpA0AhFwsgFUIBfCEVQQEhDwsgASgCBCICIAEoAmhHBH8gASACQQFqNgIEIAItAAAFIAEQJgshAgwBCwsCfiAPRQRAAkACQCABKQNwQgBZBEAgASABKAIEIgJBAWs2AgQgA0UNASABIAJBAms2AgQgC0UNAiABIAJBA2s2AgQMAgsgAw0BCyABQgAQZAsgBUHgAGpEAAAAAAAAAAAgCLemEGwgBSkDYCEXIAUpA2gMAQsgFUIHVwRAIBUhFgNAIAlBBHQhCSAWQgF8IhZCCFINAAsLAkACQAJAIAJBX3FB0ABGBEAgASADEKcDIhZCgICAgICAgICAf1INAyADBEAgASkDcEIAWQ0CDAMLQgAhFyABQgAQZEIADAQLQgAhFiABKQNwQgBTDQILIAEgASgCBEEBazYCBAtCACEWCyAJRQRAIAVB8ABqRAAAAAAAAAAAIAi3phBsIAUpA3AhFyAFKQN4DAELIBggFSALG0IChiAWfEIgfSIVQQAgEWutVQRAQYjqAUHEADYCACAFQaABaiAIEE8gBUGQAWogBSkDoAEgBSkDqAFCf0L///////+///8AEC8gBUGAAWogBSkDkAEgBSkDmAFCf0L///////+///8AEC8gBSkDgAEhFyAFKQOIAQwBCyARQeIBa6wgFVcEQCAJQQBOBEADQCAFQaADaiAXIBlCAEKAgICAgIDA/79/EEogFyAZQoCAgICAgID/PxCtAyEBIAVBkANqIBcgGSAFKQOgAyAXIAFBAE4iAhsgBSkDqAMgGSACGxBKIAIgCUEBdCIBciEJIBVCAX0hFSAFKQOYAyEZIAUpA5ADIRcgAUEATg0ACwsCfiAVQSAgEWutfCIWpyIBQQAgAUEAShsgECAWIBCtUxsiAUHxAE8EQCAFQYADaiAIEE8gBSkDiAMhFiAFKQOAAyEaQgAMAQsgBUHgAmpBkAEgAWsQmQIQbCAFQdACaiAIEE8gBSkD0AIhGiAFQfACaiAFKQPgAiAFKQPoAiAFKQPYAiIWEKwDIAUpA/gCIRsgBSkD8AILIRggBUHAAmogCSAJQQFxRSAXIBlCAEIAEIcBQQBHIAFBIElxcSIBchCcASAFQbACaiAaIBYgBSkDwAIgBSkDyAIQLyAFQZACaiAFKQOwAiAFKQO4AiAYIBsQSiAFQaACaiAaIBZCACAXIAEbQgAgGSABGxAvIAVBgAJqIAUpA6ACIAUpA6gCIAUpA5ACIAUpA5gCEEogBUHwAWogBSkDgAIgBSkDiAIgGCAbEIgCIAUpA/ABIhggBSkD+AEiFkIAQgAQhwFFBEBBiOoBQcQANgIACyAFQeABaiAYIBYgFacQqwMgBSkD4AEhFyAFKQPoAQwBC0GI6gFBxAA2AgAgBUHQAWogCBBPIAVBwAFqIAUpA9ABIAUpA9gBQgBCgICAgICAwAAQLyAFQbABaiAFKQPAASAFKQPIAUIAQoCAgICAgMAAEC8gBSkDsAEhFyAFKQO4AQshFSAMIBc3AxAgDCAVNwMYIAVBsANqJAAgDCkDGCEVIAwpAxAhFgwECyABKQNwQgBTDQAgASABKAIEQQFrNgIECyABIQYgAiEHIAghDSADIQhBACEDIwBBkMYAayIEJABBACARayIPIBBrIRQCQAJ/A0ACQCAHQTBHBEAgB0EuRw0EIAYoAgQiASAGKAJoRg0BIAYgAUEBajYCBCABLQAADAMLIAYoAgQiASAGKAJoRwRAIAYgAUEBajYCBCABLQAAIQcFIAYQJiEHC0EBIQMMAQsLIAYQJgsiB0EwRgRAA0AgFUIBfSEVAn8gBigCBCIBIAYoAmhHBEAgBiABQQFqNgIEIAEtAAAMAQsgBhAmCyIHQTBGDQALQQEhAwtBASELCyAEQQA2ApAGAn4CQAJAAkACQCAHQS5GIgEgB0EwayICQQlNcgRAA0ACQCABQQFxBEAgC0UEQCAWIRVBASELDAILIANFIQEMBAsgFkIBfCEWIAlB/A9MBEAgDiAWpyAHQTBGGyEOIARBkAZqIAlBAnRqIgEgCgR/IAcgASgCAEEKbGpBMGsFIAILNgIAQQEhA0EAIApBAWoiASABQQlGIgEbIQogASAJaiEJDAELIAdBMEYNACAEIAQoAoBGQQFyNgKARkHcjwEhDgsCfyAGKAIEIgEgBigCaEcEQCAGIAFBAWo2AgQgAS0AAAwBCyAGECYLIgdBLkYiASAHQTBrIgJBCklyDQALCyAVIBYgCxshFSADRSAHQV9xQcUAR3JFBEACQCAGIAgQpwMiF0KAgICAgICAgIB/Ug0AIAhFDQRCACEXIAYpA3BCAFMNACAGIAYoAgRBAWs2AgQLIBUgF3whFQwECyADRSEBIAdBAEgNAQsgBikDcEIAUw0AIAYgBigCBEEBazYCBAsgAUUNAUGI6gFBHDYCAAsgBkIAEGRCACEVQgAMAQsgBCgCkAYiAUUEQCAERAAAAAAAAAAAIA23phBsIAQpAwghFSAEKQMADAELIBUgFlIgFkIJVXIgEEEeTUEAIAEgEHYbckUEQCAEQTBqIA0QTyAEQSBqIAEQnAEgBEEQaiAEKQMwIAQpAzggBCkDICAEKQMoEC8gBCkDGCEVIAQpAxAMAQsgD0EBdq0gFVMEQEGI6gFBxAA2AgAgBEHgAGogDRBPIARB0ABqIAQpA2AgBCkDaEJ/Qv///////7///wAQLyAEQUBrIAQpA1AgBCkDWEJ/Qv///////7///wAQLyAEKQNIIRUgBCkDQAwBCyARQeIBa6wgFVUEQEGI6gFBxAA2AgAgBEGQAWogDRBPIARBgAFqIAQpA5ABIAQpA5gBQgBCgICAgICAwAAQLyAEQfAAaiAEKQOAASAEKQOIAUIAQoCAgICAgMAAEC8gBCkDeCEVIAQpA3AMAQsgCgRAIApBCEwEQCAEQZAGaiAJQQJ0aiIBKAIAIQYDQCAGQQpsIQYgCkEBaiIKQQlHDQALIAEgBjYCAAsgCUEBaiEJCwJAIA5BCU4gFUIRVXIgFaciCiAOSHINACAVQglRBEAgBEHAAWogDRBPIARBsAFqIAQoApAGEJwBIARBoAFqIAQpA8ABIAQpA8gBIAQpA7ABIAQpA7gBEC8gBCkDqAEhFSAEKQOgAQwCCyAVQghXBEAgBEGQAmogDRBPIARBgAJqIAQoApAGEJwBIARB8AFqIAQpA5ACIAQpA5gCIAQpA4ACIAQpA4gCEC8gBEHgAWpBCCAKa0ECdCgCwH4QTyAEQdABaiAEKQPwASAEKQP4ASAEKQPgASAEKQPoARCqAyAEKQPYASEVIAQpA9ABDAILIBAgCkF9bGpBG2oiAkEeTEEAIAQoApAGIgEgAnYbDQAgBEHgAmogDRBPIARB0AJqIAEQnAEgBEHAAmogBCkD4AIgBCkD6AIgBCkD0AIgBCkD2AIQLyAEQbACaiAKQQJ0QZj+AGooAgAQTyAEQaACaiAEKQPAAiAEKQPIAiAEKQOwAiAEKQO4AhAvIAQpA6gCIRUgBCkDoAIMAQsDQCAEQZAGaiAJIgFBAWsiCUECdGooAgBFDQALQQAhDgJAIApBCW8iAkUEQEEAIQIMAQsgAkEJaiACIBVCAFMbIRICQCABRQRAQQAhAkEAIQEMAQtBgJTr3ANBACASa0ECdEHg/gBqKAIAIgVtIQtBACEHQQAhBkEAIQIDQCAEQZAGaiIPIAZBAnRqIgMgByADKAIAIgkgBW4iCGoiAzYCACACQQFqQf8PcSACIANFIAIgBkZxIgMbIQIgCkEJayAKIAMbIQogCyAJIAUgCGxrbCEHIAZBAWoiBiABRw0ACyAHRQ0AIAFBAnQgD2ogBzYCACABQQFqIQELIAogEmtBCWohCgsDQCAEQZAGaiACQQJ0aiEPIApBJEghBgJAA0AgBkUEQCAKQSRHDQIgDygCAEHR6fkETw0CCyABQf8PaiEJQQAhAwNAIAEhCCADrSAEQZAGaiAJQf8PcSILQQJ0aiIBNQIAQh2GfCIVQoGU69wDVAR/QQAFIBUgFUKAlOvcA4AiFkKAlOvcA359IRUgFqcLIQMgASAVPgIAIAggCCALIAggFVAbIAIgC0YbIAsgCEEBa0H/D3EiB0cbIQEgC0EBayEJIAIgC0cNAAsgDkEdayEOIAghASADRQ0ACyACQQFrQf8PcSICIAFGBEAgBEGQBmoiCCABQf4PakH/D3FBAnRqIgEgASgCACAHQQJ0IAhqKAIAcjYCACAHIQELIApBCWohCiAEQZAGaiACQQJ0aiADNgIADAELCwJAA0AgAUEBakH/D3EhCCAEQZAGaiABQQFrQf8PcUECdGohEgNAQQlBASAKQS1KGyETAkADQCACIQNBACEGAkADQAJAIAMgBmpB/w9xIgIgAUYNACAEQZAGaiACQQJ0aigCACIHIAZBAnQoArB+IgJJDQAgAiAHSQ0CIAZBAWoiBkEERw0BCwsgCkEkRw0AQgAhFUEAIQZCACEWA0AgASADIAZqQf8PcSICRgRAIAFBAWpB/w9xIgFBAnQgBGpBADYCjAYLIARBgAZqIARBkAZqIAJBAnRqKAIAEJwBIARB8AVqIBUgFkIAQoCAgIDlmreOwAAQLyAEQeAFaiAEKQPwBSAEKQP4BSAEKQOABiAEKQOIBhBKIAQpA+gFIRYgBCkD4AUhFSAGQQFqIgZBBEcNAAsgBEHQBWogDRBPIARBwAVqIBUgFiAEKQPQBSAEKQPYBRAvQgAhFSAEKQPIBSEWIAQpA8AFIRcgDkHxAGoiByARayIJQQAgCUEAShsgECAJIBBIIggbIgZB8ABNDQIMBQsgDiATaiEOIAEhAiABIANGDQALQYCU69wDIBN2IQVBfyATdEF/cyELQQAhBiADIQIDQCAEQZAGaiIPIANBAnRqIgcgBiAHKAIAIgkgE3ZqIgc2AgAgAkEBakH/D3EgAiAHRSACIANGcSIHGyECIApBCWsgCiAHGyEKIAkgC3EgBWwhBiADQQFqQf8PcSIDIAFHDQALIAZFDQEgAiAIRwRAIAFBAnQgD2ogBjYCACAIIQEMAwsgEiASKAIAQQFyNgIADAELCwsgBEGQBWpB4QEgBmsQmQIQbCAEQbAFaiAEKQOQBSAEKQOYBSAWEKwDIAQpA7gFIRogBCkDsAUhGSAEQYAFakHxACAGaxCZAhBsIARBoAVqIBcgFiAEKQOABSAEKQOIBRCpAyAEQfAEaiAXIBYgBCkDoAUiFSAEKQOoBSIYEIgCIARB4ARqIBkgGiAEKQPwBCAEKQP4BBBKIAQpA+gEIRYgBCkD4AQhFwsCQCADQQRqQf8PcSICIAFGDQACQCAEQZAGaiACQQJ0aigCACICQf/Jte4BTQRAIAJFIANBBWpB/w9xIAFGcQ0BIARB8ANqIA23RAAAAAAAANA/ohBsIARB4ANqIBUgGCAEKQPwAyAEKQP4AxBKIAQpA+gDIRggBCkD4AMhFQwBCyACQYDKte4BRwRAIARB0ARqIA23RAAAAAAAAOg/ohBsIARBwARqIBUgGCAEKQPQBCAEKQPYBBBKIAQpA8gEIRggBCkDwAQhFQwBCyANtyEcIAEgA0EFakH/D3FGBEAgBEGQBGogHEQAAAAAAADgP6IQbCAEQYAEaiAVIBggBCkDkAQgBCkDmAQQSiAEKQOIBCEYIAQpA4AEIRUMAQsgBEGwBGogHEQAAAAAAADoP6IQbCAEQaAEaiAVIBggBCkDsAQgBCkDuAQQSiAEKQOoBCEYIAQpA6AEIRULIAZB7wBLDQAgBEHQA2ogFSAYQgBCgICAgICAwP8/EKkDIAQpA9ADIAQpA9gDQgBCABCHAQ0AIARBwANqIBUgGEIAQoCAgICAgMD/PxBKIAQpA8gDIRggBCkDwAMhFQsgBEGwA2ogFyAWIBUgGBBKIARBoANqIAQpA7ADIAQpA7gDIBkgGhCIAiAEKQOoAyEWIAQpA6ADIRcCQCAUQQJrIAdB/////wdxTg0AIAQgFkL///////////8AgzcDmAMgBCAXNwOQAyAEQYADaiAXIBZCAEKAgICAgICA/z8QLyAEKQOQAyAEKQOYA0KAgICAgICAuMAAEK0DIQIgBCkDiAMgFiACQQBOIgEbIRYgBCkDgAMgFyABGyEXIAggBiAJRyACQQBIcnEgFSAYQgBCABCHAUEAR3FFIBQgASAOaiIOQe4Aak5xDQBBiOoBQcQANgIACyAEQfACaiAXIBYgDhCrAyAEKQP4AiEVIAQpA/ACCyEWIAwgFTcDKCAMIBY3AyAgBEGQxgBqJAAgDCkDKCEVIAwpAyAhFgwCC0IAIRYMAQtCACEVCyAAIBY3AwAgACAVNwMIIAxBMGokAAvDBgIEfwN+IwBBgAFrIgUkAAJAAkACQCADIARCAEIAEIcBRQ0AAn8gBEL///////8/gyEKAn8gBEIwiKdB//8BcSIHQf//AUcEQEEEIAcNARpBAkEDIAMgCoRQGwwCCyADIAqEUAsLRQ0AIAJCMIinIghB//8BcSIGQf//AUcNAQsgBUEQaiABIAIgAyAEEC8gBSAFKQMQIgIgBSkDGCIBIAIgARCqAyAFKQMIIQIgBSkDACEEDAELIAEgAkL///////////8AgyIKIAMgBEL///////////8AgyIJEIcBQQBMBEAgASAKIAMgCRCHAQRAIAEhBAwCCyAFQfAAaiABIAJCAEIAEC8gBSkDeCECIAUpA3AhBAwBCyAEQjCIp0H//wFxIQcgBgR+IAEFIAVB4ABqIAEgCkIAQoCAgICAgMC7wAAQLyAFKQNoIgpCMIinQfgAayEGIAUpA2ALIQQgB0UEQCAFQdAAaiADIAlCAEKAgICAgIDAu8AAEC8gBSkDWCIJQjCIp0H4AGshByAFKQNQIQMLIAlC////////P4NCgICAgICAwACEIQsgCkL///////8/g0KAgICAgIDAAIQhCiAGIAdKBEADQAJ+IAogC30gAyAEVq19IglCAFkEQCAJIAQgA30iBIRQBEAgBUEgaiABIAJCAEIAEC8gBSkDKCECIAUpAyAhBAwFCyAJQgGGIARCP4iEDAELIApCAYYgBEI/iIQLIQogBEIBhiEEIAZBAWsiBiAHSg0ACyAHIQYLAkAgCiALfSADIARWrX0iCUIAUwRAIAohCQwBCyAJIAQgA30iBIRCAFINACAFQTBqIAEgAkIAQgAQLyAFKQM4IQIgBSkDMCEEDAELIAlC////////P1gEQANAIARCP4ggBkEBayEGIARCAYYhBCAJQgGGhCIJQoCAgICAgMAAVA0ACwsgCEGAgAJxIQcgBkEATARAIAVBQGsgBCAJQv///////z+DIAZB+ABqIAdyrUIwhoRCAEKAgICAgIDAwz8QLyAFKQNIIQIgBSkDQCEEDAELIAlC////////P4MgBiAHcq1CMIaEIQILIAAgBDcDACAAIAI3AwggBUGAAWokAAuIEAIFfw9+IwBB0AJrIgUkACAEQv///////z+DIQsgAkL///////8/gyEKIAIgBIVCgICAgICAgICAf4MhDCAEQjCIp0H//wFxIQcCQAJAIAJCMIinQf//AXEiCEH//wFrQYKAfk8EQCAHQf//AWtBgYB+Sw0BCyABUCACQv///////////wCDIg5CgICAgICAwP//AFQgDkKAgICAgIDA//8AURtFBEAgAkKAgICAgIAghCEMDAILIANQIARC////////////AIMiAkKAgICAgIDA//8AVCACQoCAgICAgMD//wBRG0UEQCAEQoCAgICAgCCEIQwgAyEBDAILIAEgDkKAgICAgIDA//8AhYRQBEAgAyACQoCAgICAgMD//wCFhFAEQEIAIQFCgICAgICA4P//ACEMDAMLIAxCgICAgICAwP//AIQhDEIAIQEMAgsgAyACQoCAgICAgMD//wCFhFAEQEIAIQEMAgsgASAOhFAEQEKAgICAgIDg//8AIAwgAiADhFAbIQxCACEBDAILIAIgA4RQBEAgDEKAgICAgIDA//8AhCEMQgAhAQwCCyAOQv///////z9YBEAgBUHAAmogASAKIAEgCiAKUCIGG3lCwABCACAGG3ynIgZBD2sQREEQIAZrIQYgBSkDyAIhCiAFKQPAAiEBCyACQv///////z9WDQAgBUGwAmogAyALIAMgCyALUCIJG3lCwABCACAJG3ynIglBD2sQRCAGIAlqQRBrIQYgBSkDuAIhCyAFKQOwAiEDCyAFQaACaiALQoCAgICAgMAAhCISQg+GIANCMYiEIgJCAEKAgICAsOa8gvUAIAJ9IgRCABBAIAVBkAJqQgAgBSkDqAJ9QgAgBEIAEEAgBUGAAmogBSkDmAJCAYYgBSkDkAJCP4iEIgRCACACQgAQQCAFQfABaiAEQgBCACAFKQOIAn1CABBAIAVB4AFqIAUpA/gBQgGGIAUpA/ABQj+IhCIEQgAgAkIAEEAgBUHQAWogBEIAQgAgBSkD6AF9QgAQQCAFQcABaiAFKQPYAUIBhiAFKQPQAUI/iIQiBEIAIAJCABBAIAVBsAFqIARCAEIAIAUpA8gBfUIAEEAgBUGgAWogAkIAIAUpA7gBQgGGIAUpA7ABQj+IhEIBfSICQgAQQCAFQZABaiADQg+GQgAgAkIAEEAgBUHwAGogAkIAQgAgBSkDqAEgBSkDoAEiDiAFKQOYAXwiBCAOVK18IARCAVatfH1CABBAIAVBgAFqQgEgBH1CACACQgAQQCAGIAggB2tqIghB//8AaiEGAn4gBSkDcCITQgGGIg0gBSkDiAEiD0IBhiAFKQOAAUI/iIR8IhBC5+wAfSIUQiCIIgIgCkKAgICAgIDAAIQiFUIBhiIWQiCIIgR+IhEgAUIBhiIOQiCIIgsgECAUVq0gDSAQVq0gBSkDeEIBhiATQj+IhCAPQj+IfHx8QgF9IhNCIIgiEH58Ig0gEVStIA0gDSATQv////8PgyITIAFCP4giFyAKQgGGhEL/////D4MiCn58Ig1WrXwgBCAQfnwgBCATfiIRIAogEH58Ig8gEVStQiCGIA9CIIiEfCANIA9CIIZ8Ig8gDVStfCAPIA8gFEL/////D4MiFCAKfiINIAIgC358IhEgDVStIBEgESATIA5C/v///w+DIg1+fCIRVq18fCIPVq18IA8gBCAUfiIYIA0gEH58IgQgAiAKfnwiCiALIBN+fCIQQiCIIAogEFatIAQgGFStIAQgClatfHxCIIaEfCIEIA9UrXwgBCAEIBEgAiANfiIKIAsgFH58IgJCIIggAiAKVK1CIIaEfCIKIBFUrSAKIAogEEIghnwiClatfHwiBFatfCAEIAQgCiACQiCGIgIgDSAUfnwgAlStQn+FIgJWIAIgClJxrXwiBFatfCICQv////////8AWARAIBYgF4QhFSAFQdAAaiAEIAJCgICAgICAwABUIgetIguGIgogAiALhiAEQgGIIAdBP3OtiIQiBCADIBIQQCAIQf7/AGogBiAHG0EBayEGIAFCMYYgBSkDWH0gBSkDUCIBQgBSrX0hC0IAIAF9DAELIAVB4ABqIAJCP4YgBEIBiIQiCiACQgGIIgQgAyASEEAgAUIwhiAFKQNofSAFKQNgIgJCAFKtfSELIAEhDkIAIAJ9CyECIAZB//8BTgRAIAxCgICAgICAwP//AIQhDEIAIQEMAQsCfiAGQQBKBEAgC0IBhiACQj+IhCEBIARC////////P4MgBq1CMIaEIQsgAkIBhgwBCyAGQY9/TARAQgAhAQwCCyAFQUBrIAogBEEBIAZrEIoBIAVBMGogDiAVIAZB8ABqEEQgBUEgaiADIBIgBSkDQCIKIAUpA0giCxBAIAUpAzggBSkDKEIBhiAFKQMgIgFCP4iEfSAFKQMwIgIgAUIBhiIEVK19IQEgAiAEfQshAiAFQRBqIAMgEkIDQgAQQCAFIAMgEkIFQgAQQCALIAogAyAKQgGDIgMgAnwiAlQgASACIANUrXwiASASViABIBJRG618IgMgClStfCIEIAMgAyAEQoCAgICAgMD//wBUIAIgBSkDEFYgASAFKQMYIgRWIAEgBFEbca18IgNWrXwiBCADIARCgICAgICAwP//AFQgAiAFKQMAViABIAUpAwgiAlYgASACURtxrXwiASADVK18IAyEIQwLIAAgATcDACAAIAw3AwggBUHQAmokAAu/AgEBfyMAQdAAayIEJAACQCADQYCAAU4EQCAEQSBqIAEgAkIAQoCAgICAgID//wAQLyAEKQMoIQIgBCkDICEBIANB//8BSQRAIANB//8AayEDDAILIARBEGogASACQgBCgICAgICAgP//ABAvQf3/AiADIANB/f8CTxtB/v8BayEDIAQpAxghAiAEKQMQIQEMAQsgA0GBgH9KDQAgBEFAayABIAJCAEKAgICAgICAORAvIAQpA0ghAiAEKQNAIQEgA0H0gH5LBEAgA0GN/wBqIQMMAQsgBEEwaiABIAJCAEKAgICAgICAORAvQeiBfSADIANB6IF9TRtBmv4BaiEDIAQpAzghAiAEKQMwIQELIAQgASACQgAgA0H//wBqrUIwhhAvIAAgBCkDCDcDCCAAIAQpAwA3AwAgBEHQAGokAAs8ACAAIAE3AwAgACACQv///////z+DIAJCgICAgICAwP//AINCMIinIANCMIinQYCAAnFyrUIwhoQ3AwgLwAECAX8CfkF/IQMCQCAAQgBSIAFC////////////AIMiBEKAgICAgIDA//8AViAEQoCAgICAgMD//wBRGw0AIAJC////////////AIMiBUKAgICAgIDA//8AViAFQoCAgICAgMD//wBScQ0AIAAgBCAFhIRQBEBBAA8LIAEgAoNCAFkEQCABIAJSIAEgAlNxDQEgACABIAKFhEIAUg8LIABCAFIgASACVSABIAJRGw0AIAAgASAChYRCAFIhAwsgAws0AQF/IAFBgICAgARPBEAQjAEACyAAIAEQswIiAjYCBCAAIAI2AgAgACACIAFBAnRqNgIICwoAIABBMGtBCkkLFwAgAEEwa0EKSSAAQSByQeEAa0EGSXILEwAgAEEgciAAIABBwQBrQRpJGwspAQF/IAAoAgAiAQRAIAEQvQNBf0cEQCAAKAIARQ8LIABBADYCAAtBAQspAQF/IAAoAgAiAQRAIAEQwwNBf0cEQCAAKAIARQ8LIABBADYCAAtBAQsUACACIAAgASAAayIAEE0gACACagskAQJ/IwBBEGsiAiQAIAEgABDTASEDIAJBEGokACABIAAgAxsLDAAgAEEAIABBf0cbCywBAX8gAUEASARAEIwBAAsgACABEFMiAjYCBCAAIAI2AgAgACABIAJqNgIIC5EBAQN/AkAgASACEIoCIQQjAEEQayIDJAAgBEH3////B00EQAJAIAQQ1AEEQCAAIAQQUCAAIQUMAQsgA0EIaiAEEJ8BQQFqEJ4BIAMoAgwaIAAgAygCCCIFNgIAIAAgAygCDBBcIAAgBDYCBAsgASACIAUQtAMgA0EAOgAHIANBB2oQXSADQRBqJAAMAQsQWwALCw8AIAAgACgCGCABajYCGAsXACAAIAI2AhwgACABNgIUIAAgATYCGAtUAQJ/AkAgACgCACICRQ0AAn8gAigCGCIDIAIoAhxGBEAgAiABIAIoAgAoAjQRBAAMAQsgAiADQQRqNgIYIAMgATYCACABC0F/Rw0AIABBADYCAAsLMQEBfyAAKAIMIgEgACgCEEYEQCAAIAAoAgAoAigRAAAPCyAAIAFBBGo2AgwgASgCAAsnAQF/IAAoAgwiASAAKAIQRgRAIAAgACgCACgCJBEAAA8LIAEoAgALLgEBfyMAQRBrIgEkACABIAA2AgBB6gsgARByEH9BoPEAKAIAEGEaIAFBEGokAAskAQF/AkAgACgCACICRQ0AIAIgARDCA0F/Rw0AIABBADYCAAsLPQEBfyADBEAgACADELcDIAAoAgQhAyACIAFrIgRFIAEgAkZyRQRAIAMgASAE/AoAAAsgACADIARqNgIECwsJACAAEI8CEC0LPQEBfyAAKAIYIgIgACgCHEYEQCAAIAEQowEgACgCACgCNBEEAA8LIAAgAkEBajYCGCACIAE6AAAgARCjAQsqAQF/IAAoAgwiASAAKAIQRgRAIAAgACgCACgCJBEAAA8LIAEsAAAQowELDwAgACAAKAIAKAIYEQAAC6wCAQJ/IwBBEGsiASQAIAAgACgCAEEMaygCAGooAhgEQCABIAA2AgwgAUEAOgAIIAAgACgCAEEMaygCAGoQ2QEEQCAAIAAoAgBBDGsoAgBqKAJIIgIEQCACEMUDCyABQQE6AAgLAkAgAS0ACEUNACAAIAAoAgBBDGsoAgBqKAIYEMQDQX9HDQAgACAAKAIAQQxrKAIAakEBENUBCwJAIAEoAgwiACAAKAIAQQxrKAIAaigCGEUNACABKAIMIgAgACgCAEEMaygCAGoQ2QFFDQAgASgCDCIAIAAoAgBBDGsoAgBqKAIEQYDAAHFFDQAgASgCDCIAIAAoAgBBDGsoAgBqKAIYEMQDQX9HDQAgASgCDCIAIAAoAgBBDGsoAgBqQQEQ1QELCyABQRBqJAALCQAgABCQAhAtCy0AIABByABqEDogAEE8ahA6IABBMGoQOiAAQSRqEDogAEEYahA6IABBDGoQOgsEAEF/C3wBAn8gACAAKAJIIgFBAWsgAXI2AkggACgCFCAAKAIcRwRAIABBAEEAIAAoAiQRAwAaCyAAQQA2AhwgAEIANwMQIAAoAgAiAUEEcQRAIAAgAUEgcjYCAEF/DwsgACAAKAIsIAAoAjBqIgI2AgggACACNgIEIAFBG3RBH3ULBQAQFwALLQAgAEHMAGoQOiAAQUBrEDogAEE0ahA6IABBKGoQOiAAQRxqEDogAEEQahA6CxIAIABFBEBBAA8LIAAgARCWAgsPACAAIAEgAkE0QTUQ0QMLvAIAAkACQAJAAkACQAJAAkACQAJAAkACQCABQQlrDhIACAkKCAkBAgMECgkKCggJBQYHCyACIAIoAgAiAUEEajYCACAAIAEoAgA2AgAPCyACIAIoAgAiAUEEajYCACAAIAEyAQA3AwAPCyACIAIoAgAiAUEEajYCACAAIAEzAQA3AwAPCyACIAIoAgAiAUEEajYCACAAIAEwAAA3AwAPCyACIAIoAgAiAUEEajYCACAAIAExAAA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAErAwA5AwAPCyAAIAIgAxEBAAsPCyACIAIoAgAiAUEEajYCACAAIAE0AgA3AwAPCyACIAIoAgAiAUEEajYCACAAIAE1AgA3AwAPCyACIAIoAgBBB2pBeHEiAUEIajYCACAAIAEpAwA3AwALbwEFfyAAKAIAIgMsAABBMGsiAUEJSwRAQQAPCwNAQX8hBCACQcyZs+YATQRAQX8gASACQQpsIgVqIAEgBUH/////B3NLGyEECyAAIANBAWoiBTYCACADLAABIAQhAiAFIQNBMGsiAUEKSQ0ACyACC/oSAhN/An4jAEFAaiIIJAAgCCABNgI8IAhBKWohFyAIQSdqIRggCEEoaiERAkACQAJAAkADQEEAIQcDQCABIQ0gByAOQf////8Hc0oNAiAHIA5qIQ4CQAJAAkACQCABIgctAAAiCwRAA0ACQAJAIAtB/wFxIgFFBEAgByEBDAELIAFBJUcNASAHIQsDQCALLQABQSVHBEAgCyEBDAILIAdBAWohByALLQACIAtBAmoiASELQSVGDQALCyAHIA1rIgcgDkH/////B3MiGUoNCSAABEAgACANIAcQQgsgBw0HIAggATYCPCABQQFqIQdBfyEQAkAgASwAAUEwayIKQQlLDQAgAS0AAkEkRw0AIAFBA2ohB0EBIRIgCiEQCyAIIAc2AjxBACEMAkAgBywAACILQSBrIgFBH0sEQCAHIQoMAQsgByEKQQEgAXQiAUGJ0QRxRQ0AA0AgCCAHQQFqIgo2AjwgASAMciEMIAcsAAEiC0EgayIBQSBPDQEgCiEHQQEgAXQiAUGJ0QRxDQALCwJAIAtBKkYEQAJ/AkAgCiwAAUEwayIBQQlLDQAgCi0AAkEkRw0AAn8gAEUEQCAEIAFBAnRqQQo2AgBBAAwBCyADIAFBA3RqKAIACyEPIApBA2ohAUEBDAELIBINBiAKQQFqIQEgAEUEQCAIIAE2AjxBACESQQAhDwwDCyACIAIoAgAiB0EEajYCACAHKAIAIQ9BAAshEiAIIAE2AjwgD0EATg0BQQAgD2shDyAMQYDAAHIhDAwBCyAIQTxqEM8DIg9BAEgNCiAIKAI8IQELQQAhB0F/IQkCf0EAIAEtAABBLkcNABogAS0AAUEqRgRAAn8CQCABLAACQTBrIgpBCUsNACABLQADQSRHDQAgAUEEaiEBAn8gAEUEQCAEIApBAnRqQQo2AgBBAAwBCyADIApBA3RqKAIACwwBCyASDQYgAUECaiEBQQAgAEUNABogAiACKAIAIgpBBGo2AgAgCigCAAshCSAIIAE2AjwgCUEATgwBCyAIIAFBAWo2AjwgCEE8ahDPAyEJIAgoAjwhAUEBCyEUA0AgByEVQRwhCiABIhMsAAAiB0H7AGtBRkkNCyABQQFqIQEgByAVQTpsakHv8ABqLQAAIgdBAWtB/wFxQQhJDQALIAggATYCPAJAIAdBG0cEQCAHRQ0MIBBBAE4EQCAARQRAIAQgEEECdGogBzYCAAwMCyAIIAMgEEEDdGopAwA3AzAMAgsgAEUNCCAIQTBqIAcgAiAGEM4DDAELIBBBAE4NC0EAIQcgAEUNCAsgAC0AAEEgcQ0LIAxB//97cSILIAwgDEGAwABxGyEMQQAhEEHuCCEWIBEhCgJAAkACfwJAAkACQAJAAkACQAJ/AkACQAJAAkACQAJAAkAgEy0AACIHwCITQVNxIBMgB0EPcUEDRhsgEyAVGyIHQdgAaw4hBBYWFhYWFhYWEBYJBhAQEBYGFhYWFgIFAxYWChYBFhYEAAsCQCAHQcEAaw4HEBYLFhAQEAALIAdB0wBGDQsMFQsgCCkDMCEbQe4IDAULQQAhBwJAAkACQAJAAkACQAJAIBUOCAABAgMEHAUGHAsgCCgCMCAONgIADBsLIAgoAjAgDjYCAAwaCyAIKAIwIA6sNwMADBkLIAgoAjAgDjsBAAwYCyAIKAIwIA46AAAMFwsgCCgCMCAONgIADBYLIAgoAjAgDqw3AwAMFQtBCCAJIAlBCE0bIQkgDEEIciEMQfgAIQcLIBEhASAHQSBxIQsgCCkDMCIbIhpQRQRAA0AgAUEBayIBIBqnQQ9xLQCAdSALcjoAACAaQg9WIBpCBIghGg0ACwsgASENIAxBCHFFIBtQcg0DIAdBBHZB7ghqIRZBAiEQDAMLIBEhASAIKQMwIhsiGlBFBEADQCABQQFrIgEgGqdBB3FBMHI6AAAgGkIHViAaQgOIIRoNAAsLIAEhDSAMQQhxRQ0CIAkgFyABayIBIAEgCUgbIQkMAgsgCCkDMCIbQgBTBEAgCEIAIBt9Ihs3AzBBASEQQe4IDAELIAxBgBBxBEBBASEQQe8IDAELQfAIQe4IIAxBAXEiEBsLIRYgGyAREKYBIQ0LIBQgCUEASHENESAMQf//e3EgDCAUGyEMIBtCAFIgCXJFBEAgESENQQAhCQwOCyAJIBtQIBEgDWtqIgEgASAJSBshCQwNCyAILQAwIQcMCwsgCCgCMCIBQZUcIAEbIg1BAEH/////ByAJIAlB/////wdPGyIHEOABIgEgDWsgByABGyIBIA1qIQogCUEATgRAIAshDCABIQkMDAsgCyEMIAEhCSAKLQAADQ8MCwsgCCkDMCIaUEUNAUEAIQcMCQsgCQRAIAgoAjAMAgtBACEHIABBICAPQQAgDBBFDAILIAhBADYCDCAIIBo+AgggCCAIQQhqIgc2AjBBfyEJIAcLIQtBACEHA0ACQCALKAIAIg1FDQAgCEEEaiANEMwDIg1BAEgNDyANIAkgB2tLDQAgC0EEaiELIAcgDWoiByAJSQ0BCwtBPSEKIAdBAEgNDCAAQSAgDyAHIAwQRSAHRQRAQQAhBwwBC0EAIQogCCgCMCELA0AgCygCACINRQ0BIAhBBGoiCSANEMwDIg0gCmoiCiAHSw0BIAAgCSANEEIgC0EEaiELIAcgCksNAAsLIABBICAPIAcgDEGAwABzEEUgDyAHIAcgD0gbIQcMCAsgFCAJQQBIcQ0JQT0hCiAAIAgrAzAgDyAJIAwgByAFESAAIgdBAE4NBwwKCyAHLQABIQsgB0EBaiEHDAALAAsgAA0JIBJFDQNBASEHA0AgBCAHQQJ0aigCACIABEAgAyAHQQN0aiAAIAIgBhDOA0EBIQ4gB0EBaiIHQQpHDQEMCwsLIAdBCk8EQEEBIQ4MCgsDQCAEIAdBAnRqKAIADQFBASEOIAdBAWoiB0EKRw0ACwwJC0EcIQoMBgsgCCAHOgAnQQEhCSAYIQ0gCyEMCyAJIAogDWsiCyAJIAtKGyIBIBBB/////wdzSg0DQT0hCiAPIAEgEGoiCSAJIA9IGyIHIBlLDQQgAEEgIAcgCSAMEEUgACAWIBAQQiAAQTAgByAJIAxBgIAEcxBFIABBMCABIAtBABBFIAAgDSALEEIgAEEgIAcgCSAMQYDAAHMQRSAIKAI8IQEMAQsLC0EAIQ4MAwtBPSEKC0GI6gEgCjYCAAtBfyEOCyAIQUBrJAAgDgvCAgEEfyMAQdABayIFJAAgBSACNgLMASAFQaABaiICQQBBKPwLACAFIAUoAswBNgLIAQJAQQAgASAFQcgBaiAFQdAAaiACIAMgBBDQA0EASARAQX8hBAwBCyAAKAJMQQBIIAAgACgCACIIQV9xNgIAAn8CQAJAIAAoAjBFBEAgAEHQADYCMCAAQQA2AhwgAEIANwMQIAAoAiwhBiAAIAU2AiwMAQsgACgCEA0BC0F/IAAQ3wENARoLIAAgASAFQcgBaiAFQdAAaiAFQaABaiADIAQQ0AMLIQIgBgRAIABBAEEAIAAoAiQRAwAaIABBADYCMCAAIAY2AiwgAEEANgIcIAAoAhQhASAAQgA3AxAgAkF/IAEbIQILIAAgACgCACIAIAhBIHFyNgIAQX8gAiAAQSBxGyEEDQALIAVB0AFqJAAgBAt/AgF/AX4gAL0iA0I0iKdB/w9xIgJB/w9HBHwgAkUEQCABIABEAAAAAAAAAABhBH9BAAUgAEQAAAAAAADwQ6IgARDSAyEAIAEoAgBBQGoLNgIAIAAPCyABIAJB/gdrNgIAIANC/////////4eAf4NCgICAgICAgPA/hL8FIAALCz4BAX8jAEEQayIBJAAgASAANgIMAn8gAEEETwRAQZ0fIAFBDGoQlwJBAAwBCyAAQQJ0KAKILQsgAUEQaiQACwYAIAEQLQsJACABIAJsEDQLJQECfyAAKAIEIgAQqAFBAWoiARA0IgIEfyACIAAgARBxBUEACwsNACAAKAIEIAAoAgBrCzABAX8jAEEQayIEJAAgACgCACEAIAQgAzoADyABIAIgBEEPaiAAEQMAIARBEGokAAuNAgIBfwF8IwBBEGsiAyQAIANBDmogASACIAAoAgARBQAgAyADLwAOOwEMIwBBEGsiASQAAkAgAy0ADUEBRgRAIwBBEGsiAiQAQazgAS0AAEEBcUUEQEECQYQsQQMQDyEAQazgAUEBOgAAQajgASAANgIACyACIAMtAAw2AgggAkEANgIEQajgASgCAEEAQQAgAkEEaiACQQhqEA4hBCACIAIoAgQ2AgAgAUEIaiIAIAT8AzYCBCAAQfzgATYCACACEJ8CIAJBEGokACAAKAIEIQIgAEEANgIEIAAQtQEMAQsgAUEANgIMIAFB/OABNgIIIAFBCGoQtQFBAiECCyABQRBqJAAgA0EQaiQAIAILVAECfyMAQRBrIgQkACABIAAoAgQiBUEBdWohASAAKAIAIQAgBUEBcQRAIAEoAgAgAGooAgAhAAsgBCADOgAPIAEgAiAEQQ9qIAARBQAgBEEQaiQAC1IBAn8jAEEQayIDJAAgASAAKAIEIgRBAXVqIQEgACgCACEAIARBAXEEQCABKAIAIABqKAIAIQALIAMgAjoADyABIANBD2ogABEBACADQRBqJAALMAEBfyMAQRBrIgQkACAAKAIAIQAgBCADOAIMIAEgAiAEQQxqIAARAwAgBEEQaiQAC40CAgF/AXwjAEEQayIDJAAgA0EIaiABIAIgACgCABEFACADIAMpAgg3AwAjAEEQayIBJAACQCADLQAEQQFGBEAjAEEQayICJABBoOABLQAAQQFxRQRAQQJBxCZBAxAPIQBBoOABQQE6AABBnOABIAA2AgALIAIgAyoCADgCCCACQQA2AgRBnOABKAIAQQBBACACQQRqIAJBCGoQDiEEIAIgAigCBDYCACABQQhqIgAgBPwDNgIEIABB/OABNgIAIAIQnwIgAkEQaiQAIAAoAgQhAiAAQQA2AgQgABC1AQwBCyABQQA2AgwgAUH84AE2AgggAUEIahC1AUECIQILIAFBEGokACADQRBqJAAgAgtUAQJ/IwBBEGsiBCQAIAEgACgCBCIFQQF1aiEBIAAoAgAhACAFQQFxBEAgASgCACAAaigCACEACyAEIAM4AgwgASACIARBDGogABEFACAEQRBqJAALUgECfyMAQRBrIgMkACABIAAoAgQiBEEBdWohASAAKAIAIQAgBEEBcQRAIAEoAgAgAGooAgAhAAsgAyACOAIMIAEgA0EMaiAAEQEAIANBEGokAAsbACAAIAEoAgggBRA7BEAgASACIAMgBBDnAQsLOAAgACABKAIIIAUQOwRAIAEgAiADIAQQ5wEPCyAAKAIIIgAgASACIAMgBCAFIAAoAgAoAhQRCgALkgIBBn8gACABKAIIIAUQOwRAIAEgAiADIAQQ5wEPCyABLQA1IAAoAgwhBiABQQA6ADUgAS0ANCABQQA6ADQgAEEQaiIJIAEgAiADIAQgBRDlASABLQA0IgpyIQggAS0ANSILciEHAkAgBkECSQ0AIAkgBkEDdGohCSAAQRhqIQYDQCABLQA2DQECQCAKQQFxBEAgASgCGEEBRg0DIAAtAAhBAnENAQwDCyALQQFxRQ0AIAAtAAhBAXFFDQILIAFBADsBNCAGIAEgAiADIAQgBRDlASABLQA1IgsgB3JBAXEhByABLQA0IgogCHJBAXEhCCAGQQhqIgYgCUkNAAsLIAEgB0EBcToANSABIAhBAXE6ADQLkgEAIAAgASgCCCAEEDsEQCABIAIgAxDmAQ8LAkAgACABKAIAIAQQO0UNAAJAIAEoAhAgAkcEQCACIAEoAhRHDQELIANBAUcNASABQQE2AiAPCyABIAI2AhQgASADNgIgIAEgASgCKEEBajYCKAJAIAEoAiRBAUcNACABKAIYQQJHDQAgAUEBOgA2CyABQQQ2AiwLC/YBACAAIAEoAgggBBA7BEAgASACIAMQ5gEPCwJAIAAgASgCACAEEDsEQAJAIAEoAhAgAkcEQCACIAEoAhRHDQELIANBAUcNAiABQQE2AiAPCyABIAM2AiACQCABKAIsQQRGDQAgAUEAOwE0IAAoAggiACABIAIgAkEBIAQgACgCACgCFBEKACABLQA1QQFGBEAgAUEDNgIsIAEtADRFDQEMAwsgAUEENgIsCyABIAI2AhQgASABKAIoQQFqNgIoIAEoAiRBAUcNASABKAIYQQJHDQEgAUEBOgA2DwsgACgCCCIAIAEgAiADIAQgACgCACgCGBELAAsLrwQBA38gACABKAIIIAQQOwRAIAEgAiADEOYBDwsCQAJAIAAgASgCACAEEDsEQAJAIAEoAhAgAkcEQCACIAEoAhRHDQELIANBAUcNAyABQQE2AiAPCyABIAM2AiAgASgCLEEERg0BIABBEGoiBSAAKAIMQQN0aiEHQQAhAwNAAkACQCABAn8CQCAFIAdPDQAgAUEAOwE0IAUgASACIAJBASAEEOUBIAEtADYNACABLQA1QQFHDQMgAS0ANEEBRgRAIAEoAhhBAUYNA0EBIQNBASEGIAAtAAhBAnFFDQMMBAtBASEDIAAtAAhBAXENA0EDDAELQQNBBCADGws2AiwgBg0FDAQLIAFBAzYCLAwECyAFQQhqIQUMAAsACyAAKAIMIQUgAEEQaiIGIAEgAiADIAQQtwEgBUECSQ0BIAYgBUEDdGohBiAAQRhqIQUCQCAAKAIIIgBBAnFFBEAgASgCJEEBRw0BCwNAIAEtADYNAyAFIAEgAiADIAQQtwEgBUEIaiIFIAZJDQALDAILIABBAXFFBEADQCABLQA2DQMgASgCJEEBRg0DIAUgASACIAMgBBC3ASAFQQhqIgUgBkkNAAwDCwALA0AgAS0ANg0CIAEoAiRBAUYEQCABKAIYQQFGDQMLIAUgASACIAMgBBC3ASAFQQhqIgUgBkkNAAsMAQsgASACNgIUIAEgASgCKEEBajYCKCABKAIkQQFHDQAgASgCGEECRw0AIAFBAToANgsLjgUBBH8jAEFAaiIEJAACQCABQaDZAUEAEDsEQCACQQA2AgBBASEFDAELAkAgACABIAAtAAhBGHEEf0EBBSABRQ0BIAFB9NYBEFIiA0UNASADLQAIQRhxQQBHCxA7IQYLIAYEQEEBIQUgAigCACIARQ0BIAIgACgCADYCAAwBCwJAIAFFDQAgAUGk1wEQUiIGRQ0BIAIoAgAiAQRAIAIgASgCADYCAAsgBigCCCIDIAAoAggiAUF/c3FBB3EgA0F/cyABcUHgAHFyDQFBASEFIAAoAgwgBigCDEEAEDsNASAAKAIMQZTZAUEAEDsEQCAGKAIMIgBFDQIgAEHU1wEQUkUhBQwCCyAAKAIMIgNFDQBBACEFIANBpNcBEFIiAQRAIAAtAAhBAXFFDQICfyAGKAIMIQBBACECAkADQEEAIABFDQIaIABBpNcBEFIiA0UNASADKAIIIAEoAghBf3NxDQFBASABKAIMIAMoAgxBABA7DQIaIAEtAAhBAXFFDQEgASgCDCIARQ0BIABBpNcBEFIiAQRAIAMoAgwhAAwBCwsgAEGI2AEQUiIARQ0AIAAgAygCDBCpAiECCyACCyEFDAILIANBiNgBEFIiAQRAIAAtAAhBAXFFDQIgASAGKAIMEKkCIQUMAgsgA0HE1gEQUiIBRQ0BIAYoAgwiAEUNASAAQcTWARBSIgBFDQEgAigCACEDIARBCGpBAEE4/AsAIAQgA0EARzoAOyAEQX82AhAgBCABNgIMIAQgADYCBCAEQQE2AjQgACAEQQRqIANBASAAKAIAKAIcEQgAIAQoAhwiAEEBRgRAIAIgBCgCFEEAIAMbNgIACyAAQQFGIQUMAQtBACEFCyAEQUBrJAAgBQtvAQJ/IAAgASgCCEEAEDsEQCABIAIgAxDpAQ8LIAAoAgwhBCAAQRBqIgUgASACIAMQqwICQCAEQQJJDQAgBSAEQQN0aiEEIABBGGohAANAIAAgASACIAMQqwIgAS0ANg0BIABBCGoiACAESQ0ACwsLMgAgACABKAIIQQAQOwRAIAEgAiADEOkBDwsgACgCCCIAIAEgAiADIAAoAgAoAhwRCAALGQAgACABKAIIQQAQOwRAIAEgAiADEOkBCwvIAQECfyMAQdAAayIDJAACQAJ/QQEgACABQQAQOw0AGkEAIAFFDQAaQQAgAUHE1gEQUiIBRQ0AGiACKAIAIgRFDQEgA0EYakEAQTj8CwAgA0EBOgBLIANBfzYCICADIAA2AhwgAyABNgIUIANBATYCRCABIANBFGogBEEBIAEoAgAoAhwRCAAgAygCLCIAQQFGBEAgAiADKAIkNgIACyAAQQFGCyADQdAAaiQADwsgA0GeFjYCCCADQecDNgIEIANBig02AgAQPQALAwAACxEBAX9BBBBTIgBBADYCACAACwkAQaD0ARA5GgslAEGs9AEtAABFBEBBoPQBQdisARCRAUGs9AFBAToAAAtBoPQBCwkAQZD0ARAgGgskAEGc9AEtAABFBEBBkPQBQc4NELABQZz0AUEBOgAAC0GQ9AELCQBBgPQBEDkaCyUAQYz0AS0AAEUEQEGA9AFBhKwBEJEBQYz0AUEBOgAAC0GA9AELCQBB8PMBECAaCyQAQfzzAS0AAEUEQEHw8wFBmRUQsAFB/PMBQQE6AAALQfDzAQsJAEHg8wEQORoLqQIBBH8gAiABIAAoAgBqIgBHBEACQCACKAIEIgQgAigCACIBa0ECdSIGIAAoAgggACgCACICa0ECdU0EQCAGIAAoAgQiAyACayIFQQJ1SwRAIAIgA0cEQCAFBEAgAiABIAX8CgAACyAAKAIEIQMLIAQgASAFaiIBayICRSABIARGckUEQCADIAEgAvwKAAALIAAgAiADajYCBAwCCyAEIAFrIgNFIAEgBEZyRQRAIAIgASAD/AoAAAsgACACIANqNgIEDAELIAAoAgAiAgRAIAAgAjYCBCAAKAIIGiACEC0gAEEANgIIIABCADcCAAsgACAAIAYQtgEQrgMgACgCBCECIAQgAWsiA0UgASAERnJFBEAgAiABIAP8CgAACyAAIAIgA2o2AgQLCwslAEHs8wEtAABFBEBB4PMBQeCrARCRAUHs8wFBAToAAAtB4PMBCwkAQeTeARAgGgsaAEHd8wEtAABFBEBB3fMBQQE6AAALQeTeAQsJAEHQ8wEQORoLJQBB3PMBLQAARQRAQdDzAUG8qwEQkQFB3PMBQQE6AAALQdDzAQsJAEHY3gEQIBoLGgBBzfMBLQAARQRAQc3zAUEBOgAAC0HY3gELGwBBqPwBIQADQCAAQQxrEDkiAEGQ/AFHDQALC1QAQczzAS0AAARAQcjzASgCAA8LQaj8AS0AAEUEQEGo/AFBAToAAAtBkPwBQfjUARApQZz8AUGE1QEQKUHM8wFBAToAAEHI8wFBkPwBNgIAQZD8AQsbAEGI/AEhAANAIABBDGsQICIAQfD7AUcNAAsLFQAgASAAKAIAaiEAQQwQUyAAEIEBC1IAQcTzAS0AAARAQcDzASgCAA8LQYj8AS0AAEUEQEGI/AFBAToAAAtB8PsBQdEVECpB/PsBQc4VECpBxPMBQQE6AABBwPMBQfD7ATYCAEHw+wELGwBB4PsBIQADQCAAQQxrEDkiAEHA+QFHDQALC7ACAEG88wEtAAAEQEG48wEoAgAPC0Hg+wEtAABFBEBB4PsBQQE6AAALQcD5AUHw0AEQKUHM+QFBkNEBEClB2PkBQbTRARApQeT5AUHM0QEQKUHw+QFB5NEBEClB/PkBQfTRARApQYj6AUGI0gEQKUGU+gFBnNIBEClBoPoBQbjSARApQaz6AUHg0gEQKUG4+gFBgNMBEClBxPoBQaTTARApQdD6AUHI0wEQKUHc+gFB2NMBEClB6PoBQejTARApQfT6AUH40wEQKUGA+wFB5NEBEClBjPsBQYjUARApQZj7AUGY1AEQKUGk+wFBqNQBEClBsPsBQbjUARApQbz7AUHI1AEQKUHI+wFB2NQBEClB1PsBQejUARApQbzzAUEBOgAAQbjzAUHA+QE2AgBBwPkBCxsAQbD5ASEAA0AgAEEMaxAgIgBBkPcBRw0ACwuYAgBBtPMBLQAABEBBsPMBKAIADwtBsPkBLQAARQRAQbD5AUEBOgAAC0GQ9wFBmwgQKkGc9wFBkggQKkGo9wFBzQ8QKkG09wFBnA4QKkHA9wFB4QgQKkHM9wFBhxEQKkHY9wFBowgQKkHk9wFBkwkQKkHw9wFB1QwQKkH89wFBxAwQKkGI+AFBzAwQKkGU+AFB3wwQKkGg+AFB6g0QKkGs+AFBlRUQKkG4+AFBhg0QKkHE+AFB9gsQKkHQ+AFB4QgQKkHc+AFB3g0QKkHo+AFBkA4QKkH0+AFB0w8QKkGA+QFByg0QKkGM+QFBngoQKkGY+QFBiwkQKkGk+QFB+BQQKkG08wFBAToAAEGw8wFBkPcBNgIAQZD3AQsbAEGI9wEhAANAIABBDGsQOSIAQeD1AUcNAAsLzAEAQazzAS0AAARAQajzASgCAA8LQYj3AS0AAEUEQEGI9wFBAToAAAtB4PUBQZzOARApQez1AUG4zgEQKUH49QFB1M4BEClBhPYBQfTOARApQZD2AUGczwEQKUGc9gFBwM8BEClBqPYBQdzPARApQbT2AUGA0AEQKUHA9gFBkNABEClBzPYBQaDQARApQdj2AUGw0AEQKUHk9gFBwNABEClB8PYBQdDQARApQfz2AUHg0AEQKUGs8wFBAToAAEGo8wFB4PUBNgIAQeD1AQsbAEHY9QEhAANAIABBDGsQICIAQbD0AUcNAAsLvgEAQaTzAS0AAARAQaDzASgCAA8LQdj1AS0AAEUEQEHY9QFBAToAAAtBsPQBQcwIECpBvPQBQdMIECpByPQBQbEIECpB1PQBQbkIECpB4PQBQagIECpB7PQBQdoIECpB+PQBQcMIECpBhPUBQdoNECpBkPUBQeINECpBnPUBQeoQECpBqPUBQasTECpBtPUBQY8JECpBwPUBQbIPECpBzPUBQcIKECpBpPMBQQE6AABBoPMBQbD0ATYCAEGw9AELDwAgASAAKAIAaiACOgAACwsAIABBpKsBEJEBCwoAIABB7hAQsAELCwAgAEGQqwEQkQELCgAgAEHlEBCwAQsMACAAIAFBEGoQ5AELDAAgACABQQxqEOQBCwcAIAAsAAkLBwAgACwACAsJACAAEMMCEC0LDQAgASAAKAIAai0AAAsJACAAEMQCEC0LFQAgACgCCCIARQRAQQEPCyAAEMwCC44BAQZ/A0ACQCACIANGIAQgCE1yDQBBASEGIAAoAgghByMAQRBrIgUkACAFIAc2AgwgBUEIaiAFQQxqEGNBACACIAMgAmsgAUH07wEgARsQ0gEhChBiIAVBEGokAAJAAkAgCiIFQQJqDgMCAgEACyAFIQYLIAhBAWohCCAGIAlqIQkgAiAGaiECDAELCyAJC0YBAn8gACgCCCECIwBBEGsiASQAIAEgAjYCDCABQQhqIAFBDGoQYxBiIAFBEGokACAAKAIIIgBFBEBBAQ8LIAAQzAJBAUYLiQEBAn8jAEEQayIGJAAgBCACNgIAAn9BAiAGQQxqIgVBACAAKAIIEO4BIgBBAWpBAkkNABpBASAAQQFrIgIgAyAEKAIAa0sNABoDfyACBH8gBS0AACEAIAQgBCgCACIBQQFqNgIAIAEgADoAACACQQFrIQIgBUEBaiEFDAEFQQALCwsgBkEQaiQAC7kGAQ1/IwBBEGsiESQAIAIhCANAAkAgAyAIRgRAIAMhCAwBCyAILQAARQ0AIAhBAWohCAwBCwsgByAFNgIAIAQgAjYCAANAAkACfwJAIAIgA0YgBSAGRnINACARIAEpAgA3AwggACgCCCEJIwBBEGsiECQAIBAgCTYCDCAQQQhqIBBBDGoQYyAIIAJrIQ5BACELIwBBkAhrIgwkACAMIAQoAgAiCTYCDCAFIAxBEGogBRshDwJAAkACQCAJRSAGIAVrQQJ1QYACIAUbIg1FckUEQANAIA5BgwFLIA5BAnYiCiANT3JFBEAgCSEKDAQLIA8gDEEMaiAKIA0gCiANSRsgARCbAyESIAwoAgwhCiASQX9GBEBBACENQX8hCwwDCyANIBJBACAPIAxBEGpHGyIUayENIA8gFEECdGohDyAJIA5qIAprQQAgChshDiALIBJqIQsgCkUNAiAKIQkgDQ0ADAILAAsgCSEKCyAKRQ0BCyANRSAORXINACALIQkDQAJAAkAgDyAKIA4gARDSASILQQJqQQJNBEACQAJAIAtBAWoOAgYAAQsgDEEANgIMDAILIAFBADYCAAwBCyAMIAwoAgwgC2oiCjYCDCAJQQFqIQkgDUEBayINDQELIAkhCwwCCyAPQQRqIQ8gDiALayEOIAkhCyAODQALCyAFBEAgBCAMKAIMNgIACyAMQZAIaiQAEGIgEEEQaiQAAkACQAJAAkAgCyIJQX9GBEADQCAHIAU2AgAgAiAEKAIARg0GQQEhBgJAAkACQCAFIAIgCCACayARQQhqIAAoAggQzQIiAUECag4DBwACAQsgBCACNgIADAQLIAEhBgsgAiAGaiECIAcoAgBBBGohBQwACwALIAcgBygCACAJQQJ0aiIFNgIAIAUgBkYNAyAEKAIAIQIgAyAIRg0GIAUgAkEBIAEgACgCCBDNAkUNAQtBAgwECyAHIAcoAgBBBGoiBTYCACAEIAQoAgBBAWoiAjYCACACIQgDQCADIAhGDQUgCC0AAEUNBiAIQQFqIQgMAAsACyAEIAI2AgBBAQwCCyAEKAIAIQILIAIgA0cLIBFBEGokAA8LIAMhCAwACwALpgUBDH8jAEEQayIPJAAgAiEIA0ACQCADIAhGBEAgAyEIDAELIAgoAgBFDQAgCEEEaiEIDAELCyAHIAU2AgAgBCACNgIAAkADQAJAAkAgAiADRiAFIAZGcgR/IAIFIA8gASkCADcDCEEBIRAgBSEJIAYgBWshCyAAKAIIIQpBACENIwBBEGsiDiQAIA4gCjYCDCAOQQhqIA5BDGoQYyMAQRBrIhEkAAJAIAQoAgAiCkUgCCACa0ECdSISRXINACALQQAgBRshCwNAIBFBDGogCSALQQRJGyAKKAIAEJYCIgxBf0YEQEF/IQ0MAgsgCQR/IAtBA00EQCALIAxJDQMgCSARQQxqIAwQcRoLIAsgDGshCyAJIAxqBUEACyEJIAooAgBFBEBBACEKDAILIAwgDWohDSAKQQRqIQogEkEBayISDQALCyAJBEAgBCAKNgIACyARQRBqJAAQYiAOQRBqJAACQAJAAkACQCANIglBAWoOAgAIAQsgByAFNgIAA0AgAiAEKAIARg0CIAUgAigCACAAKAIIEO4BIgFBf0YNAiAHIAcoAgAgAWoiBTYCACACQQRqIQIMAAsACyAHIAcoAgAgCWoiBTYCACAFIAZGDQEgAyAIRgRAIAQoAgAhAiADIQgMBgsgD0EEaiICQQAgACgCCBDuASIIQX9GDQQgBiAHKAIAayAISQ0GA0AgCARAIAItAAAhBSAHIAcoAgAiCUEBajYCACAJIAU6AAAgCEEBayEIIAJBAWohAgwBCwsgBCAEKAIAQQRqIgI2AgAgAiEIA0AgAyAIRgRAIAMhCAwFCyAIKAIARQ0EIAhBBGohCAwACwALIAQgAjYCAAwDCyAEKAIACyADRyEQDAMLIAcoAgAhBQwBCwtBAiEQCyAPQRBqJAAgEAsJACAAENsCEC0LMwAjAEEQayIAJAAgACAENgIMIAAgAyACazYCCCAAQQxqIABBCGoQtQMoAgAgAEEQaiQACzsAA0AgASACRkUEQCADIQAgBCABLAAAEEwEfyABLQAABSAACzoAACAEQQFqIQQgAUEBaiEBDAELCyABCwsAIAEgAiABEEwbCyoAA0AgASACRkUEQCADIAEtAAA6AAAgA0EBaiEDIAFBAWohAQwBCwsgAQsPACAAIAEgAkGgkAEQpgILHQAgARBMBH9BoJABKAIAIAFBAnRqKAIABSABC8ALDwAgACABIAJBmIQBEKYCCyEAIAEQTAR/QZiEASgCACABQf8BcUECdGooAgAFIAELwAsJACAAENACEC0LOwADQCABIAJGRQRAIAMhACAEIAEoAgAQTAR/IAEoAgAFIAALOgAAIARBAWohBCABQQRqIQEMAQsLIAELDAAgASACIAEQTBvACyoAA0AgASACRkUEQCADIAEsAAA2AgAgA0EEaiEDIAFBAWohAQwBCwsgAQsPACAAIAEgAkGgkAEQpwILHAAgARBMBH9BoJABKAIAIAFBAnRqKAIABSABCwsPACAAIAEgAkGYhAEQpwILHAAgARBMBH9BmIQBKAIAIAFBAnRqKAIABSABCwsQACAABEAgABDHAwsgABAtCzoAA0ACQCACIANGDQAgAigCABBMRQ0AIAIoAgBBAnRBkKIBaigCACABcUUNACACQQRqIQIMAQsLIAILOQADQAJAIAIgA0YNACACKAIAEEwEQCACKAIAQQJ0QZCiAWooAgAgAXENAQsgAkEEaiECDAELCyACC0YAA0AgASACRkUEQEEAIQAgAyABKAIAEEwEfyABKAIAQQJ0QZCiAWooAgAFQQALNgIAIANBBGohAyABQQRqIQEMAQsLIAELIwBBACEAIAIQTAR/IAJBAnRBkKIBaigCACABcUEARwVBAAsLDwAgACAAKAIAKAIEEQIACwkAIAAQ1gIQLQsVAQF/QdQAEFMiAEEAQdQA/AsAIAALFAAgACgCACABaiACLQAAOgAAQQELrgEAAkAgBRBHRQRAIAAgBSkCADcCACAAIAUoAgg2AgggABBeGgwBCyAFKAIAIQQgBSgCBCECIwBBEGsiAyQAAkACQAJAIAIQvQEEQCAAIgEgAhBQDAELIAJB9////wNLDQEgA0EIaiACEJABQQFqEI8BIAMoAgwaIAAgAygCCCIBNgIAIAAgAygCDBBcIAAgAjYCBAsgASAEIAJBAWoQZSADQRBqJAAMAQsQWwALCwsJACAAIAUQ5AELhAMBCH8jAEHgA2siACQAIABB3ANqIgYgAxAnIAYQSCEKIAUQHwRAIAVBABDMASgCACAKQS0QS0YhCwsgAiALIABB3ANqIABB2ANqIABB1ANqIABB0ANqIABBxANqECQiDCAAQbgDahAkIgYgAEGsA2oQJCIHIABBqANqEN8CIABB4wA2AhAgAEEIakEAIABBEGoiAhA2IQgCQAJ/IAUQHyAAKAKoA0oEQCAFEB8hCSAAKAKoAyENIAcQHyAJIA1rQQF0aiAGEB9qIAAoAqgDakEBagwBCyAHEB8gBhAfaiAAKAKoA2pBAmoLIglB5QBJDQAgCCAJQQJ0EDQQPCAIKAIAIgINABA9AAsgAiAAQQRqIAAgAygCBCAFECMgBRAjIAUQH0ECdGogCiALIABB2ANqIAAoAtQDIAAoAtADIAwgBiAHIAAoAqgDEN4CIAEgAiAAKAIEIAAoAgAgAyAEEIUBIAgQNSAHEDkaIAYQORogDBAgGiAAQdwDahAlIABB4ANqJAALvgQBC38jAEGgCGsiACQAIAAgBjcDmAggACAFNwOQCCAAIAU3AwAgACAGNwMIIAAgAEGgB2oiBzYCnAcgB0HAECAAEIYBIQcgAEHjADYCgAQgAEH4A2pBACAAQYAEaiIJEDYhDiAAQeMANgKABCAAQfADakEAIAkQNiEKAkAgB0HkAE8EQCAAQZwHahAuQcAQIABBkAhqEMgBIgdBf0YNASAOIAAoApwHEDwgCiAHQQJ0EDQQPCAKEOQCDQEgCigCACEJCyAAQewDaiIIIAMQJyAIEEgiESAAKAKcByIIIAcgCGogCRBvIAdBAEoEQCAAKAKcBy0AAEEtRiEPCyACIA8gAEHsA2ogAEHoA2ogAEHkA2ogAEHgA2ogAEHUA2oQJCIQIABByANqECQiCCAAQbwDahAkIgsgAEG4A2oQ3wIgAEHjADYCICAAQRhqQQAgAEEgaiICEDYhDAJ/IAAoArgDIg0gB0gEQCALEB8gByANa0EBdGogCBAfaiAAKAK4A2pBAWoMAQsgCxAfIAgQH2ogACgCuANqQQJqCyINQeUATwRAIAwgDUECdBA0EDwgDCgCACICRQ0BCyACIABBFGogAEEQaiADKAIEIAkgCSAHQQJ0aiARIA8gAEHoA2ogACgC5AMgACgC4AMgECAIIAsgACgCuAMQ3gIgASACIAAoAhQgACgCECADIAQQhQEgDBA1IAsQORogCBA5GiAQECAaIABB7ANqECUgChA1IA4QNSAAQaAIaiQADwsQPQALMwECfyABKAIEIAEoAgAiAWsgAksEQEEBIQQgASACai0AACEDCyAAIAQ6AAEgACADOgAAC/wCAQh/IwBBsAFrIgAkACAAQawBaiIGIAMQJyAGEEkhCiAFEB8EQCAFQQAQIi0AACAKQS0QQUH/AXFGIQsLIAIgCyAAQawBaiAAQagBaiAAQacBaiAAQaYBaiAAQZgBahAkIgwgAEGMAWoQJCIGIABBgAFqECQiByAAQfwAahDjAiAAQeMANgIQIABBCGpBACAAQRBqIgIQNiEIAkACfyAFEB8gACgCfEoEQCAFEB8hCSAAKAJ8IQ0gBxAfIAkgDWtBAXRqIAYQH2ogACgCfGpBAWoMAQsgBxAfIAYQH2ogACgCfGpBAmoLIglB5QBJDQAgCCAJEDQQPCAIKAIAIgINABA9AAsgAiAAQQRqIAAgAygCBCAFECMgBRAjIAUQH2ogCiALIABBqAFqIAAsAKcBIAAsAKYBIAwgBiAHIAAoAnwQ4gIgASACIAAoAgQgACgCACADIAQQgAEgCBA1IAcQIBogBhAgGiAMECAaIABBrAFqECUgAEGwAWokAAu1BAELfyMAQcADayIAJAAgACAGNwO4AyAAIAU3A7ADIAAgBTcDACAAIAY3AwggACAAQcACaiIHNgK8AiAHQcAQIAAQhgEhByAAQeMANgLQASAAQcgBakEAIABB0AFqIgkQNiEOIABB4wA2AtABIABBwAFqQQAgCRA2IQoCQCAHQeQATwRAIABBvAJqEC5BwBAgAEGwA2oQyAEiB0F/Rg0BIA4gACgCvAIQPCAKIAcQNBA8IAoQ5AINASAKKAIAIQkLIABBvAFqIgggAxAnIAgQSSIRIAAoArwCIgggByAIaiAJEHkgB0EASgRAIAAoArwCLQAAQS1GIQ8LIAIgDyAAQbwBaiAAQbgBaiAAQbcBaiAAQbYBaiAAQagBahAkIhAgAEGcAWoQJCIIIABBkAFqECQiCyAAQYwBahDjAiAAQeMANgIgIABBGGpBACAAQSBqIgIQNiEMAn8gACgCjAEiDSAHSARAIAsQHyAHIA1rQQF0aiAIEB9qIAAoAowBakEBagwBCyALEB8gCBAfaiAAKAKMAWpBAmoLIg1B5QBPBEAgDCANEDQQPCAMKAIAIgJFDQELIAIgAEEUaiAAQRBqIAMoAgQgCSAHIAlqIBEgDyAAQbgBaiAALAC3ASAALAC2ASAQIAggCyAAKAKMARDiAiABIAIgACgCFCAAKAIQIAMgBBCAASAMEDUgCxAgGiAIECAaIBAQIBogAEG8AWoQJSAKEDUgDhA1IABBwANqJAAPCxA9AAvtAQEDfyAAKAIEIAAoAgAiBGsiAyABSQRAIwBBIGsiBCQAAkAgASADayIDIAAoAgggACgCBCIBa00EQCADIAAoAgQiAWohAwNAIAEgA0YEQCAAIAM2AgQFIAEgAi0AADoAACABQQFqIQEMAQsLDAELIAMgBEEMaiAAIAEgA2ogACgCAGsQtAEgACgCBCAAKAIAayAAEMYBIgUoAggiAWohAwNAIAEgA0cEQCABIAItAAA6AAAgAUEBaiEBDAELCyAFIAM2AgggACAFEO8BIAUQugELIARBIGokAA8LIAEgA0kEQCAAIAEgBGo2AgQLC4EFAQR/IwBBwANrIgAkACAAIAI2ArgDIAAgATYCvAMgAEHkADYCFCAAQRhqIABBIGogAEEUaiIIEDYhCiAAQRBqIgEgBBAnIAEQSCEHIABBADoADyAAQbwDaiACIAMgASAEKAIEIAUgAEEPaiAHIAogCCAAQbADahDqAgRAIwBBEGsiASQAIAYQHxoCQCAGEEcEQCAGKAIAIAFBADYCDCABQQxqEFYgBkEANgIEDAELIAFBADYCCCAGIAFBCGoQViAGQQAQUAsgAUEQaiQAIAAtAA9BAUYEQCAGIAdBLRBLEOoBCyAHQTAQSyEBIAooAgAhAiAAKAIUIgNBBGshBANAAkAgAiAETw0AIAIoAgAgAUcNACACQQRqIQIMAQsLIwBBEGsiBCQAIAYQHyEBIAYQ8QEhBwJAIAIgAxD1ASIIRQ0AIAYQIyAGECMgBhAfQQJ0akEEaiACEL4CRQRAIAggByABa0sEQCAGIAcgASAHayAIaiABIAEQ6AILIAIgAyAGECMgAUECdGoQ5wIgBEEANgIEIARBBGoQViAGIAEgCGoQgwEMAQsgBEEEaiIBIAIgAxCZAyABECMhCCABEB8hAiMAQRBrIgckAAJAIAIgBhDxASIJIAYQHyIDa00EQCACRQ0BIAYQIyIJIANBAnRqIAggAhBlIAYgAiADaiICEIMBIAdBADYCDCAJIAJBAnRqIAdBDGoQVgwBCyAGIAkgAiAJayADaiADIANBACACIAgQrwILIAdBEGokACABEDkaCyAEQRBqJAALIABBvANqIABBuANqECsEQCAFIAUoAgBBAnI2AgALIAAoArwDIABBEGoQJSAKEDUgAEHAA2okAAvRAwEDfyMAQfAEayIAJAAgACACNgLoBCAAIAE2AuwEIABB5AA2AhAgAEHIAWogAEHQAWogAEEQaiIBEDYhByAAQcABaiIIIAQQJyAIEEghCSAAQQA6AL8BAkAgAEHsBGogAiADIAggBCgCBCAFIABBvwFqIAkgByAAQcQBaiAAQeAEahDqAkUNACAAQcsbKAAANgC3ASAAQcQbKQAANwOwASAJIABBsAFqIABBugFqIABBgAFqEG8gAEHjADYCECAAQQhqQQAgARA2IQMgASEEAkAgACgCxAEgBygCAGsiAUGJA04EQCADIAFBAnVBAmoQNBA8IAMoAgBFDQEgAygCACEECyAALQC/AUEBRgRAIARBLToAACAEQQFqIQQLIAcoAgAhAgNAIAAoAsQBIAJNBEACQCAEQQA6AAAgACAGNgIAIABBEGogABCjA0EBRw0AIAMQNQwECwUgBCAAQbABaiAAQYABaiIBIAFBKGogAhD5ASABa0ECdWotAAA6AAAgBEEBaiEEIAJBBGohAgwBCwsQPQALED0ACyAAQewEaiAAQegEahArBEAgBSAFKAIAQQJyNgIACyAAKALsBCAAQcABahAlIAcQNSAAQfAEaiQAC5ABAQJ/IAACfyAAKAIEIgIgACgCCEkEQCACIAEtAAA6AAAgAkEBagwBCyMAQSBrIgMkACADQQxqIAAgACgCBCAAKAIAa0EBahC0ASAAKAIEIAAoAgBrIAAQxgEiAigCCCABLQAAOgAAIAIgAigCCEEBajYCCCAAIAIQ7wEgACgCBCACELoBIANBIGokAAs2AgQLBQBBpCoL0AQBA38jAEGQAWsiACQAIAAgAjYCiAEgACABNgKMASAAQeQANgIUIABBGGogAEEgaiAAQRRqIgcQNiEJIABBEGoiCCAEECcgCBBJIQEgAEEAOgAPIABBjAFqIAIgAyAIIAQoAgQgBSAAQQ9qIAEgCSAHIABBhAFqEPACBEACQCAGLAALQQBIBEAgBigCAEEAOgAAIAZBADYCBAwBCyAGQQA6AAsgBkEAOgAACyAALQAPQQFGBEAgBiABQS0QQRC4AQsgAUEwEEEgCSgCACECIAAoAhQiBEEBayEDQf8BcSEBA0ACQCACIANPDQAgAi0AACABRw0AIAJBAWohAgwBCwsjAEEQayIBJAAgBhAfIQMgBhAoIQgCQCACIAQQigIiB0UNACAGECMgBhAjIAYQH2pBAWogAhC+AkUEQCAHIAggA2tLBEAgBiAIIAMgCGsgB2ogAyADEPQBCyACIAQgBhAjIANqELQDIAFBADoADyABQQ9qEF0gBiADIAdqEIMBDAELIAEgAiAEELgDIAEQIyEIIAEQHyECIwBBEGsiBCQAAkAgAiAGECgiByAGEB8iA2tNBEAgAkUNASAGECMiByADaiAIIAIQTSAGIAIgA2oiAhCDASAEQQA6AA8gAiAHaiAEQQ9qEF0MAQsgBiAHIAIgB2sgA2ogAyADQQAgAiAIELkBCyAEQRBqJAAgARAgGgsgAUEQaiQACyAAQYwBaiAAQYgBahAsBEAgBSAFKAIAQQJyNgIACyAAKAKMASAAQRBqECUgCRA1IABBkAFqJAALxwMBA38jAEGQAmsiACQAIAAgAjYCiAIgACABNgKMAiAAQeQANgIQIABBmAFqIABBoAFqIABBEGoiARA2IQcgAEGQAWoiCCAEECcgCBBJIQkgAEEAOgCPAQJAIABBjAJqIAIgAyAIIAQoAgQgBSAAQY8BaiAJIAcgAEGUAWogAEGEAmoQ8AJFDQAgAEHLGygAADYAhwEgAEHEGykAADcDgAEgCSAAQYABaiAAQYoBaiAAQfYAahB5IABB4wA2AhAgAEEIakEAIAEQNiEDIAEhBAJAIAAoApQBIAcoAgBrIgFB4wBOBEAgAyABQQJqEDQQPCADKAIARQ0BIAMoAgAhBAsgAC0AjwFBAUYEQCAEQS06AAAgBEEBaiEECyAHKAIAIQIDQCAAKAKUASACTQRAAkAgBEEAOgAAIAAgBjYCACAAQRBqIAAQowNBAUcNACADEDUMBAsFIAQgAEH2AGoiASABQQpqIAIQ/QEgAGsgAGotAAo6AAAgBEEBaiEEIAJBAWohAgwBCwsQPQALED0ACyAAQYwCaiAAQYgCahAsBEAgBSAFKAIAQQJyNgIACyAAKAKMAiAAQZABahAlIAcQNSAAQZACaiQACxcAIAAoAgAgAUECdGogAioCADgCAEEBC5EDAQJ/IwBBoANrIgckACAHIAdBoANqIgM2AgwjAEGQAWsiAiQAIAIgAkGEAWo2AhwgAEEIaiACQSBqIgggAkEcaiAEIAUgBhD0AiACQgA3AxAgAiAINgIMIAdBEGoiBSAHKAIMEPUBIQQgACgCCCEGIwBBEGsiACQAIAAgBjYCDCAAQQhqIABBDGoQYyAFIAJBDGogBCACQRBqEJsDIQQQYiAAQRBqJAAgBEF/RgRAED0ACyAHIAUgBEECdGo2AgwgAkGQAWokACAHKAIMIQIjAEEQayIGJAAjAEEgayIAJAAgAEEYaiAFIAIQvwIgAEEQaiAAKAIYIQIgACgCHCEIIwBBEGsiBCQAIAQgAjYCCCAEIAE2AgwDQCACIAhHBEAgBEEMaiACKAIAELsDIAQgAkEEaiICNgIIDAELCyAEQQhqIARBDGoQZiAEQRBqJAAgACAFIAAoAhAQjgE2AgwgACAAKAIUNgIIIAZBCGogAEEMaiAAQQhqEGYgAEEgaiQAIAYoAgwgBkEQaiQAIAMkAAuAAgECfyMAQYABayICJAAgAiACQfQAajYCDCAAQQhqIAJBEGoiAyACQQxqIAQgBSAGEPQCIAIoAgwhBCMAQRBrIgYkACMAQSBrIgAkACAAQRhqIAMgBBC/AiAAQRBqIAAoAhghBCAAKAIcIQgjAEEQayIFJAAgBSAENgIIIAUgATYCDANAIAQgCEcEQCAFQQxqIAQsAAAQvwMgBSAEQQFqIgQ2AggMAQsLIAVBCGogBUEMahBmIAVBEGokACAAIAMgACgCEBCOATYCDCAAIAAoAhQ2AgggBkEIaiAAQQxqIABBCGoQZiAAQSBqJAAgBigCDCAGQRBqJAAgAkGAAWokAAvdDAEBfyMAQTBrIgckACAHIAE2AiwgBEEANgIAIAcgAxAnIAcQSCEIIAcQJQJ/AkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQCAGQcEAaw45AAEXBBcFFwYHFxcXChcXFxcODxAXFxcTFRcXFxcXFxcAAQIDAxcXARcIFxcJCxcMFw0XCxcXERIUFgsgACAFQRhqIAdBLGogAiAEIAgQ9wIMGAsgACAFQRBqIAdBLGogAiAEIAgQ9gIMFwsgAEEIaiAAKAIIKAIMEQAAIQEgByAAIAcoAiwgAiADIAQgBSABECMgARAjIAEQH0ECdGoQbTYCLAwWCyAHQSxqIAIgBCAIQQIQZyEAAkAgBCgCACIBQQRxIABBAWtBHktyRQRAIAUgADYCDAwBCyAEIAFBBHI2AgALDBULIAdBqKABKQMANwMYIAdBoKABKQMANwMQIAdBmKABKQMANwMIIAdBkKABKQMANwMAIAcgACABIAIgAyAEIAUgByAHQSBqEG02AiwMFAsgB0HIoAEpAwA3AxggB0HAoAEpAwA3AxAgB0G4oAEpAwA3AwggB0GwoAEpAwA3AwAgByAAIAEgAiADIAQgBSAHIAdBIGoQbTYCLAwTCyAHQSxqIAIgBCAIQQIQZyEAAkAgBCgCACIBQQRxIABBF0pyRQRAIAUgADYCCAwBCyAEIAFBBHI2AgALDBILIAdBLGogAiAEIAhBAhBnIQACQCAEKAIAIgFBBHEgAEEBa0ELS3JFBEAgBSAANgIIDAELIAQgAUEEcjYCAAsMEQsgB0EsaiACIAQgCEEDEGchAAJAIAQoAgAiAUEEcSAAQe0CSnJFBEAgBSAANgIcDAELIAQgAUEEcjYCAAsMEAsgB0EsaiACIAQgCEECEGchAAJAIAQoAgAiAUEEcSAAQQFrIgBBC0tyRQRAIAUgADYCEAwBCyAEIAFBBHI2AgALDA8LIAdBLGogAiAEIAhBAhBnIQACQCAEKAIAIgFBBHEgAEE7SnJFBEAgBSAANgIEDAELIAQgAUEEcjYCAAsMDgsgB0EsaiEAIwBBEGsiASQAIAEgAjYCDANAAkAgACABQQxqECsNACAIQQEgABA3EF9FDQAgABA+GgwBCwsgACABQQxqECsEQCAEIAQoAgBBAnI2AgALIAFBEGokAAwNCyAHQSxqIQECQCAAQQhqIAAoAggoAggRAAAiABAfQQAgAEEMahAfa0YEQCAEIAQoAgBBBHI2AgAMAQsgASACIAAgAEEYaiAIIARBABDNASICIABHIAUoAggiAUEMR3JFBEAgBUEANgIIDAELIAIgAGtBDEcgAUELSnJFBEAgBSABQQxqNgIICwsMDAsgB0HQoAFBLPwKAAAgByAAIAEgAiADIAQgBSAHIAdBLGoQbTYCLAwLCyAHQZChASgCADYCECAHQYihASkDADcDCCAHQYChASkDADcDACAHIAAgASACIAMgBCAFIAcgB0EUahBtNgIsDAoLIAdBLGogAiAEIAhBAhBnIQACQCAEKAIAIgFBBHEgAEE8SnJFBEAgBSAANgIADAELIAQgAUEEcjYCAAsMCQsgB0G4oQEpAwA3AxggB0GwoQEpAwA3AxAgB0GooQEpAwA3AwggB0GgoQEpAwA3AwAgByAAIAEgAiADIAQgBSAHIAdBIGoQbTYCLAwICyAHQSxqIAIgBCAIQQEQZyEAAkAgBCgCACIBQQRxIABBBkpyRQRAIAUgADYCGAwBCyAEIAFBBHI2AgALDAcLIAAgASACIAMgBCAFIAAoAgAoAhQRBgAMBwsgAEEIaiAAKAIIKAIYEQAAIQEgByAAIAcoAiwgAiADIAQgBSABECMgARAjIAEQH0ECdGoQbTYCLAwFCyAFQRRqIAdBLGogAiAEIAgQ9QIMBAsgB0EsaiACIAQgCEEEEGchACAELQAAQQRxRQRAIAUgAEHsDms2AhQLDAMLIAZBJUYNAQsgBCAEKAIAQQRyNgIADAELIwBBEGsiACQAIAAgAjYCDAJAIAQCf0EGIAdBLGoiASAAQQxqIgIQKw0AGkEEIAggARA3EJQBQSVHDQAaIAEQPiACECtFDQFBAgsgBCgCAHI2AgALIABBEGokAAsgBygCLAsgB0EwaiQACz0AIAACfyABKAIEIAEoAgAiAWtBAnUgAksEQCAAIAEgAkECdGoqAgA4AgBBAQwBCyAAQQA6AABBAAs6AAQLSAECfyMAQRBrIgYkACAGIAE2AgwgBkEIaiIHIAMQJyAHEEghASAHECUgBUEUaiAGQQxqIAIgBCABEPUCIAYoAgwgBkEQaiQAC0oBAn8jAEEQayIGJAAgBiABNgIMIAZBCGoiByADECcgBxBIIQEgBxAlIAAgBUEQaiAGQQxqIAIgBCABEPYCIAYoAgwgBkEQaiQAC0oBAn8jAEEQayIGJAAgBiABNgIMIAZBCGoiByADECcgBxBIIQEgBxAlIAAgBUEYaiAGQQxqIAIgBCABEPcCIAYoAgwgBkEQaiQACzAAIAAgASACIAMgBCAFIABBCGogACgCCCgCFBEAACIAECMgABAjIAAQH0ECdGoQbQtYAQF/IwBBIGsiBiQAIAZBuKEBKQMANwMYIAZBsKEBKQMANwMQIAZBqKEBKQMANwMIIAZBoKEBKQMANwMAIAAgASACIAMgBCAFIAYgBkEgaiIBEG0gASQAC4ICAQN/IAAoAgQgACgCACIEa0ECdSIDIAFJBEAjAEEgayIEJAACQCABIANrIgMgACgCCCAAKAIEIgFrQQJ1TQRAIAAoAgQiASADQQJ0aiEDA0AgASADRgRAIAAgAzYCBAUgASACKgIAOAIAIAFBBGohAQwBCwsMAQsgBEEMaiAAIAEgACgCAGtBAnUgA2oQtgEgACgCBCAAKAIAa0ECdSAAEIcCIgUoAggiASADQQJ0aiEDA0AgASADRwRAIAEgAioCADgCACABQQRqIQEMAQsLIAUgAzYCCCAAIAUQhQIgBRCBAgsgBEEgaiQADwsgASADSQRAIAAgBCABQQJ0ajYCBAsL9wsBAX8jAEEQayIHJAAgByABNgIMIARBADYCACAHIAMQJyAHEEkhCCAHECUCfwJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkAgBkHBAGsOOQABFwQXBRcGBxcXFwoXFxcXDg8QFxcXExUXFxcXFxcXAAECAwMXFwEXCBcXCQsXDBcNFwsXFxESFBYLIAAgBUEYaiAHQQxqIAIgBCAIEPoCDBgLIAAgBUEQaiAHQQxqIAIgBCAIEPkCDBcLIABBCGogACgCCCgCDBEAACEBIAcgACAHKAIMIAIgAyAEIAUgARAjIAEQIyABEB9qEG42AgwMFgsgB0EMaiACIAQgCEECEGghAAJAIAQoAgAiAUEEcSAAQQFrQR5LckUEQCAFIAA2AgwMAQsgBCABQQRyNgIACwwVCyAHQqXavanC7MuS+QA3AwAgByAAIAEgAiADIAQgBSAHIAdBCGoQbjYCDAwUCyAHQqWytanSrcuS5AA3AwAgByAAIAEgAiADIAQgBSAHIAdBCGoQbjYCDAwTCyAHQQxqIAIgBCAIQQIQaCEAAkAgBCgCACIBQQRxIABBF0pyRQRAIAUgADYCCAwBCyAEIAFBBHI2AgALDBILIAdBDGogAiAEIAhBAhBoIQACQCAEKAIAIgFBBHEgAEEBa0ELS3JFBEAgBSAANgIIDAELIAQgAUEEcjYCAAsMEQsgB0EMaiACIAQgCEEDEGghAAJAIAQoAgAiAUEEcSAAQe0CSnJFBEAgBSAANgIcDAELIAQgAUEEcjYCAAsMEAsgB0EMaiACIAQgCEECEGghAAJAIAQoAgAiAUEEcSAAQQFrIgBBC0tyRQRAIAUgADYCEAwBCyAEIAFBBHI2AgALDA8LIAdBDGogAiAEIAhBAhBoIQACQCAEKAIAIgFBBHEgAEE7SnJFBEAgBSAANgIEDAELIAQgAUEEcjYCAAsMDgsgB0EMaiEAIwBBEGsiASQAIAEgAjYCDANAAkAgACABQQxqECwNACAIQQEgABA4EGBFDQAgABA/GgwBCwsgACABQQxqECwEQCAEIAQoAgBBAnI2AgALIAFBEGokAAwNCyAHQQxqIQECQCAAQQhqIAAoAggoAggRAAAiABAfQQAgAEEMahAfa0YEQCAEIAQoAgBBBHI2AgAMAQsgASACIAAgAEEYaiAIIARBABDPASICIABHIAUoAggiAUEMR3JFBEAgBUEANgIIDAELIAIgAGtBDEcgAUELSnJFBEAgBSABQQxqNgIICwsMDAsgB0H4nwEoAAA2AAcgB0HxnwEpAAA3AwAgByAAIAEgAiADIAQgBSAHIAdBC2oQbjYCDAwLCyAHQYCgAS0AADoABCAHQfyfASgAADYCACAHIAAgASACIAMgBCAFIAcgB0EFahBuNgIMDAoLIAdBDGogAiAEIAhBAhBoIQACQCAEKAIAIgFBBHEgAEE8SnJFBEAgBSAANgIADAELIAQgAUEEcjYCAAsMCQsgB0KlkOmp0snOktMANwMAIAcgACABIAIgAyAEIAUgByAHQQhqEG42AgwMCAsgB0EMaiACIAQgCEEBEGghAAJAIAQoAgAiAUEEcSAAQQZKckUEQCAFIAA2AhgMAQsgBCABQQRyNgIACwwHCyAAIAEgAiADIAQgBSAAKAIAKAIUEQYADAcLIABBCGogACgCCCgCGBEAACEBIAcgACAHKAIMIAIgAyAEIAUgARAjIAEQIyABEB9qEG42AgwMBQsgBUEUaiAHQQxqIAIgBCAIEPgCDAQLIAdBDGogAiAEIAhBBBBoIQAgBC0AAEEEcUUEQCAFIABB7A5rNgIUCwwDCyAGQSVGDQELIAQgBCgCAEEEcjYCAAwBCyMAQRBrIgAkACAAIAI2AgwCQCAEAn9BBiAHQQxqIgEgAEEMaiICECwNABpBBCAIIAEQOBCVAUElRw0AGiABED8gAhAsRQ0BQQILIAQoAgByNgIACyAAQRBqJAALIAcoAgwLIAdBEGokAAtIAQJ/IwBBEGsiBiQAIAYgATYCDCAGQQhqIgcgAxAnIAcQSSEBIAcQJSAFQRRqIAZBDGogAiAEIAEQ+AIgBigCDCAGQRBqJAALSgECfyMAQRBrIgYkACAGIAE2AgwgBkEIaiIHIAMQJyAHEEkhASAHECUgACAFQRBqIAZBDGogAiAEIAEQ+QIgBigCDCAGQRBqJAALSgECfyMAQRBrIgYkACAGIAE2AgwgBkEIaiIHIAMQJyAHEEkhASAHECUgACAFQRhqIAZBDGogAiAEIAEQ+gIgBigCDCAGQRBqJAALLQAgACABIAIgAyAEIAUgAEEIaiAAKAIIKAIUEQAAIgAQIyAAECMgABAfahBuCzsBAX8jAEEQayIGJAAgBkKlkOmp0snOktMANwMIIAAgASACIAMgBCAFIAZBCGogBkEQaiIBEG4gASQAC4MBAQR/IwBBwAFrIgAkACAAIAQ2ArwBIABBoAFqIgUgBSAFQRQQLkHXDSAAQbwBahDKASIHaiIEIAIQaSEGIAAgAhAnIAAQSCAAECUgBSAEIAAQbyABIAAgACAHQQJ0aiIBIAAgBiAFa0ECdGogBCAGRhsgASACIAMQhQEgAEHAAWokAAvRAwEHfwJ/IwBB0AJrIgYkACAGIAU3A8gCIAYgBDcDwAIgBkIlNwO4AiAGQbgCaiIHQQFyQd8VIAIoAgQQyQEhCCAGIAZBkAJqIgk2AowCEC4hAAJ/IAgEQCAGIAIoAgg2AiAgCSAAIAcgBkEgaiAGQcACahCDAwwBCyAGQZACaiAAIAZBuAJqIAZBwAJqEIIDCyEAIAZB4wA2AiAgBkGEAmpBACAGQSBqIgoQNiEJIAZBkAJqIQcCQCAAQR5OBEAQLiEAAn8gCARAIAYgAigCCDYCICAGQYwCaiAAIAZBuAJqIAogBkHAAmoQgQMMAQsgBkGMAmogACAGQbgCaiAGQcACahDIAQsiAEF/Rg0BIAkgBigCjAIQPCAGKAKMAiEHCyAHIAAgB2oiCyACEGkhDCAGQeMANgIgIAZBGGpBACAGQSBqIgcQNiEIAkAgBigCjAIiCiAGQZACakYEQCAHIQAMAQsgAEEDdBA0IgBFDQEgCCAAEDwgBigCjAIhCgsgBkEMaiIHIAIQJyAKIAwgCyAAIAZBFGogBkEQaiAHEP4CIAcQJSABIAAgBigCFCAGKAIQIAIgAxCFASAIEDUgCRA1IAZB0AJqJAAMAQsQPQALC8kDAQd/An8jAEHAAmsiBSQAIAUgBDkDuAIgBUIlNwOwAiAFQbACaiIGQQFyQcYfIAIoAgQQyQEhByAFIAVBkAJqIgg2AowCEC4hAAJ/IAcEQCAFIAIoAgg2AiAgCCAAIAYgBUEgaiAFQbgCahCIAwwBCyAFQZACaiAAIAVBsAJqIAVBuAJqEIcDCyEAIAVB4wA2AiAgBUGEAmpBACAFQSBqIgkQNiEIIAVBkAJqIQYCQCAAQR5OBEAQLiEAAn8gBwRAIAUgAigCCDYCICAFQYwCaiAAIAVBsAJqIAkgBUG4AmoQhgMMAQsgBUGMAmogACAFQbACaiAFQbgCahCFAwsiAEF/Rg0BIAggBSgCjAIQPCAFKAKMAiEGCyAGIAAgBmoiCiACEGkhCyAFQeMANgIgIAVBGGpBACAFQSBqIgYQNiEHAkAgBSgCjAIiCSAFQZACakYEQCAGIQAMAQsgAEEDdBA0IgBFDQEgByAAEDwgBSgCjAIhCQsgBUEMaiIGIAIQJyAJIAsgCiAAIAVBFGogBUEQaiAGEP4CIAYQJSABIAAgBSgCFCAFKAIQIAIgAxCFASAHEDUgCBA1IAVBwAJqJAAMAQsQPQALCxEAIAAgASACIAMgBEEAEKECCxEAIAAgASACIAMgBEEAEKICCxEAIAAgASACIAMgBEEBEKECCxEAIAAgASACIAMgBEEBEKICC8kBAQF/IwBBIGsiBSQAIAUgATYCHAJAIAIoAgRBAXFFBEAgACABIAIgAyAEIAAoAgAoAhgRBwAhAgwBCyAFQRBqIgAgAhAnIAAQmQEhASAAECUCQCAEBEAgACABEHwMAQsgBUEQaiABEHsLIAUgBUEQahBONgIMA0AgBSAFQRBqIgAQdTYCCCAFQQxqIAVBCGoQdgRAIAUoAhwhAiAAEDkaBSAFQRxqIAVBDGoiACgCACgCABC7AyAAEPYBDAELCwsgBUEgaiQAIAILBQBB7CALewEEfyMAQdAAayIAJAAgACAENgJMIABBMGoiBSAFIAVBFBAuQdcNIABBzABqEMoBIgdqIgQgAhBpIQYgACACECcgABBJIAAQJSAFIAQgABB5IAEgACAAIAdqIgEgACAGIAVraiAEIAZGGyABIAIgAxCAASAAQdAAaiQAC8wDAQd/An8jAEGwAWsiBiQAIAYgBTcDqAEgBiAENwOgASAGQiU3A5gBIAZBmAFqIgdBAXJB3xUgAigCBBDJASEIIAYgBkHwAGoiCTYCbBAuIQACfyAIBEAgBiACKAIINgIgIAkgACAHIAZBIGogBkGgAWoQgwMMAQsgBkHwAGogACAGQZgBaiAGQaABahCCAwshACAGQeMANgIgIAZB5ABqQQAgBkEgaiIKEDYhCSAGQfAAaiEHAkAgAEEeTgRAEC4hAAJ/IAgEQCAGIAIoAgg2AiAgBkHsAGogACAGQZgBaiAKIAZBoAFqEIEDDAELIAZB7ABqIAAgBkGYAWogBkGgAWoQyAELIgBBf0YNASAJIAYoAmwQPCAGKAJsIQcLIAcgACAHaiILIAIQaSEMIAZB4wA2AiAgBkEYakEAIAZBIGoiBxA2IQgCQCAGKAJsIgogBkHwAGpGBEAgByEADAELIABBAXQQNCIARQ0BIAggABA8IAYoAmwhCgsgBkEMaiIHIAIQJyAKIAwgCyAAIAZBFGogBkEQaiAHEIQDIAcQJSABIAAgBigCFCAGKAIQIAIgAxCAASAIEDUgCRA1IAZBsAFqJAAMAQsQPQALCwkAIAEgABEAAAvEAwEHfwJ/IwBBoAFrIgUkACAFIAQ5A5gBIAVCJTcDkAEgBUGQAWoiBkEBckHGHyACKAIEEMkBIQcgBSAFQfAAaiIINgJsEC4hAAJ/IAcEQCAFIAIoAgg2AiAgCCAAIAYgBUEgaiAFQZgBahCIAwwBCyAFQfAAaiAAIAVBkAFqIAVBmAFqEIcDCyEAIAVB4wA2AiAgBUHkAGpBACAFQSBqIgkQNiEIIAVB8ABqIQYCQCAAQR5OBEAQLiEAAn8gBwRAIAUgAigCCDYCICAFQewAaiAAIAVBkAFqIAkgBUGYAWoQhgMMAQsgBUHsAGogACAFQZABaiAFQZgBahCFAwsiAEF/Rg0BIAggBSgCbBA8IAUoAmwhBgsgBiAAIAZqIgogAhBpIQsgBUHjADYCICAFQRhqQQAgBUEgaiIGEDYhBwJAIAUoAmwiCSAFQfAAakYEQCAGIQAMAQsgAEEBdBA0IgBFDQEgByAAEDwgBSgCbCEJCyAFQQxqIgYgAhAnIAkgCyAKIAAgBUEUaiAFQRBqIAYQhAMgBhAlIAEgACAFKAIUIAUoAhAgAiADEIABIAcQNSAIEDUgBUGgAWokAAwBCxA9AAsLEQAgACABIAIgAyAEQQAQowILEQAgACABIAIgAyAEQQAQpAILEQAgACABIAIgAyAEQQEQowILoQEBAn8jAEHgAGsiBSQAIAVBDGoiBCABIAIgAygCACAAEQgAQdQAEFMiACAEKQIANwIAIAAgBC0ACDoACCAAQQxqIARBDGoQgQEaIABBGGogBEEYahCBARogAEEkaiAEQSRqEIEBGiAAQTBqIARBMGoQgQEaIABBPGogBEE8ahCBARogAEHIAGogBEHIAGoQgQEaIAQQxwMgBUHgAGokACAACxEAIAAgASACIAMgBEEBEKQCC8kBAQF/IwBBIGsiBSQAIAUgATYCHAJAIAIoAgRBAXFFBEAgACABIAIgAyAEIAAoAgAoAhgRBwAhAgwBCyAFQRBqIgAgAhAnIAAQmwEhASAAECUCQCAEBEAgACABEHwMAQsgBUEQaiABEHsLIAUgBUEQahBONgIMA0AgBSAFQRBqIgAQdzYCCCAFQQxqIAVBCGoQdgRAIAUoAhwhAiAAECAaBSAFQRxqIAVBDGoiACgCACwAABC/AyAAEPgBDAELCwsgBUEgaiQAIAIL5gIBAX8jAEHAAmsiACQAIAAgAjYCuAIgACABNgK8AiAAQcQBahAkIQYgAEEQaiICIAMQJyACEEhB0J8BQeqfASAAQdABahBvIAIQJSAAQbgBahAkIgMgAxAoECEgACADQQAQIiIBNgK0ASAAIAI2AgwgAEEANgIIA0ACQCAAQbwCaiAAQbgCahArDQAgACgCtAEgAxAfIAFqRgRAIAMQHyECIAMgAxAfQQF0ECEgAyADECgQISAAIAIgA0EAECIiAWo2ArQBCyAAQbwCaiICEDdBECABIABBtAFqIABBCGpBACAGIABBEGogAEEMaiAAQdABahCYAQ0AIAIQPhoMAQsLIAMgACgCtAEgAWsQISADECMQLiAAIAU2AgQgAEEEahCNA0EBRwRAIARBBDYCAAsgAEG8AmogAEG4AmoQKwRAIAQgBCgCAEECcjYCAAsgACgCvAIgAxAgGiAGECAaIABBwAJqJAAL4QQCA38BfgJ/IwBB8AJrIgAkACAAIAI2AugCIAAgATYC7AIgAEHcAWogAyAAQfABaiAAQewBaiAAQegBahD7ASAAQdABahAkIgEgARAoECEgACABQQAQIiICNgLMASAAIABBIGo2AhwgAEEANgIYIABBAToAFyAAQcUAOgAWQQAhAwNAAkACQAJAIABB7AJqIABB6AJqECsNACAAKALMASABEB8gAmpGBEAgARAfIQYgASABEB9BAXQQISABIAEQKBAhIAAgBiABQQAQIiICajYCzAELIABB7AJqEDcgAEEXaiAAQRZqIAIgAEHMAWogACgC7AEgACgC6AEgAEHcAWogAEEgaiAAQRxqIABBGGogAEHwAWoQ+gENACADDQFBACEDIAAoAswBIAJrIgdBAEwNAgJAAkAgAi0AACIGQStrIggOAwEAAQALIAZBLkYNAkEBIQMgBkEwa0H/AXFBCkkNAwwBCyAHQQFGDQICQCAIDgMAAwADCyACLQABIgZBLkYNAUEBIQMgBkEwa0H/AXFBCU0NAgsCQCAAQdwBahAfRQ0AIAAtABdBAXFFDQAgACgCHCIDIABBIGprQZ8BSg0AIAAgA0EEajYCHCADIAAoAhg2AgALIAAgAiAAKALMASAEEI4DIAApAwAhCSAFIAApAwg3AwggBSAJNwMAIABB3AFqIABBIGogACgCHCAEEEMgAEHsAmogAEHoAmoQKwRAIAQgBCgCAEECcjYCAAsgACgC7AIgARAgGiAAQdwBahAgGiAAQfACaiQADAMLQQEhAwsgAEHsAmoQPhoMAAsACwvKBAEDfwJ/IwBB4AJrIgAkACAAIAI2AtgCIAAgATYC3AIgAEHMAWogAyAAQeABaiAAQdwBaiAAQdgBahD7ASAAQcABahAkIgEgARAoECEgACABQQAQIiICNgK8ASAAIABBEGo2AgwgAEEANgIIIABBAToAByAAQcUAOgAGQQAhAwNAAkACQAJAIABB3AJqIABB2AJqECsNACAAKAK8ASABEB8gAmpGBEAgARAfIQYgASABEB9BAXQQISABIAEQKBAhIAAgBiABQQAQIiICajYCvAELIABB3AJqEDcgAEEHaiAAQQZqIAIgAEG8AWogACgC3AEgACgC2AEgAEHMAWogAEEQaiAAQQxqIABBCGogAEHgAWoQ+gENACADDQFBACEDIAAoArwBIAJrIgdBAEwNAgJAAkAgAi0AACIGQStrIggOAwEAAQALIAZBLkYNAkEBIQMgBkEwa0H/AXFBCkkNAwwBCyAHQQFGDQICQCAIDgMAAwADCyACLQABIgZBLkYNAUEBIQMgBkEwa0H/AXFBCU0NAgsCQCAAQcwBahAfRQ0AIAAtAAdBAXFFDQAgACgCDCIDIABBEGprQZ8BSg0AIAAgA0EEajYCDCADIAAoAgg2AgALIAUgAiAAKAK8ASAEEI8DOQMAIABBzAFqIABBEGogACgCDCAEEEMgAEHcAmogAEHYAmoQKwRAIAQgBCgCAEECcjYCAAsgACgC3AIgARAgGiAAQcwBahAgGiAAQeACaiQADAMLQQEhAwsgAEHcAmoQPhoMAAsACwvKBAEDfwJ/IwBB4AJrIgAkACAAIAI2AtgCIAAgATYC3AIgAEHMAWogAyAAQeABaiAAQdwBaiAAQdgBahD7ASAAQcABahAkIgEgARAoECEgACABQQAQIiICNgK8ASAAIABBEGo2AgwgAEEANgIIIABBAToAByAAQcUAOgAGQQAhAwNAAkACQAJAIABB3AJqIABB2AJqECsNACAAKAK8ASABEB8gAmpGBEAgARAfIQYgASABEB9BAXQQISABIAEQKBAhIAAgBiABQQAQIiICajYCvAELIABB3AJqEDcgAEEHaiAAQQZqIAIgAEG8AWogACgC3AEgACgC2AEgAEHMAWogAEEQaiAAQQxqIABBCGogAEHgAWoQ+gENACADDQFBACEDIAAoArwBIAJrIgdBAEwNAgJAAkAgAi0AACIGQStrIggOAwEAAQALIAZBLkYNAkEBIQMgBkEwa0H/AXFBCkkNAwwBCyAHQQFGDQICQCAIDgMAAwADCyACLQABIgZBLkYNAUEBIQMgBkEwa0H/AXFBCU0NAgsCQCAAQcwBahAfRQ0AIAAtAAdBAXFFDQAgACgCDCIDIABBEGprQZ8BSg0AIAAgA0EEajYCDCADIAAoAgg2AgALIAUgAiAAKAK8ASAEEJEDOAIAIABBzAFqIABBEGogACgCDCAEEEMgAEHcAmogAEHYAmoQKwRAIAQgBCgCAEECcjYCAAsgACgC3AIgARAgGiAAQcwBahAgGiAAQeACaiQADAMLQQEhAwsgAEHcAmoQPhoMAAsACwuWAwECfyMAQdACayIAJAAgACACNgLIAiAAIAE2AswCIAMQaiEGIAMgAEHQAWoQrgEhByAAQcQBaiADIABBxAJqEK0BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABBzAJqIABByAJqECsNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABBzAJqIgMQNyAGIAIgAEG0AWogAEEIaiAAKALEAiAAQcQBaiAAQRBqIABBDGogBxCYAQ0AIAMQPhoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCSAzcDACAAQcQBaiAAQRBqIAAoAgwgBBBDIABBzAJqIABByAJqECsEQCAEIAQoAgBBAnI2AgALIAAoAswCIAEQIBogAEHEAWoQIBogAEHQAmokAAuWAwECfyMAQdACayIAJAAgACACNgLIAiAAIAE2AswCIAMQaiEGIAMgAEHQAWoQrgEhByAAQcQBaiADIABBxAJqEK0BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABBzAJqIABByAJqECsNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABBzAJqIgMQNyAGIAIgAEG0AWogAEEIaiAAKALEAiAAQcQBaiAAQRBqIABBDGogBxCYAQ0AIAMQPhoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCVAzsBACAAQcQBaiAAQRBqIAAoAgwgBBBDIABBzAJqIABByAJqECsEQCAEIAQoAgBBAnI2AgALIAAoAswCIAEQIBogAEHEAWoQIBogAEHQAmokAAuWAwECfyMAQdACayIAJAAgACACNgLIAiAAIAE2AswCIAMQaiEGIAMgAEHQAWoQrgEhByAAQcQBaiADIABBxAJqEK0BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABBzAJqIABByAJqECsNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABBzAJqIgMQNyAGIAIgAEG0AWogAEEIaiAAKALEAiAAQcQBaiAAQRBqIABBDGogBxCYAQ0AIAMQPhoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCWAzcDACAAQcQBaiAAQRBqIAAoAgwgBBBDIABBzAJqIABByAJqECsEQCAEIAQoAgBBAnI2AgALIAAoAswCIAEQIBogAEHEAWoQIBogAEHQAmokAAuWAwECfyMAQdACayIAJAAgACACNgLIAiAAIAE2AswCIAMQaiEGIAMgAEHQAWoQrgEhByAAQcQBaiADIABBxAJqEK0BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABBzAJqIABByAJqECsNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABBzAJqIgMQNyAGIAIgAEG0AWogAEEIaiAAKALEAiAAQcQBaiAAQRBqIABBDGogBxCYAQ0AIAMQPhoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCXAzYCACAAQcQBaiAAQRBqIAAoAgwgBBBDIABBzAJqIABByAJqECsEQCAEIAQoAgBBAnI2AgALIAAoAswCIAEQIBogAEHEAWoQIBogAEHQAmokAAvqAQEBfyMAQSBrIgYkACAGIAE2AhwCQCADKAIEQQFxRQRAIAZBfzYCACAAIAEgAiADIAQgBiAAKAIAKAIQEQYAIQECQAJAAkAgBigCAA4CAAECCyAFQQA6AAAMAwsgBUEBOgAADAILIAVBAToAACAEQQQ2AgAMAQsgBiADECcgBhBIIQEgBhAlIAYgAxAnIAYQmQEhACAGECUgBiAAEHwgBkEMciAAEHsgBSAGQRxqIAIgBiAGQRhqIgMgASAEQQEQzQEgBkY6AAAgBigCHCEBA0AgA0EMaxA5IgMgBkcNAAsLIAZBIGokACABC+YCAQF/IwBBgAJrIgAkACAAIAI2AvgBIAAgATYC/AEgAEHEAWoQJCEGIABBEGoiAiADECcgAhBJQdCfAUHqnwEgAEHQAWoQeSACECUgAEG4AWoQJCIDIAMQKBAhIAAgA0EAECIiATYCtAEgACACNgIMIABBADYCCANAAkAgAEH8AWogAEH4AWoQLA0AIAAoArQBIAMQHyABakYEQCADEB8hAiADIAMQH0EBdBAhIAMgAxAoECEgACACIANBABAiIgFqNgK0AQsgAEH8AWoiAhA4QRAgASAAQbQBaiAAQQhqQQAgBiAAQRBqIABBDGogAEHQAWoQmgENACACED8aDAELCyADIAAoArQBIAFrECEgAxAjEC4gACAFNgIEIABBBGoQjQNBAUcEQCAEQQQ2AgALIABB/AFqIABB+AFqECwEQCAEIAQoAgBBAnI2AgALIAAoAvwBIAMQIBogBhAgGiAAQYACaiQAC+EEAgN/AX4CfyMAQZACayIAJAAgACACNgKIAiAAIAE2AowCIABB0AFqIAMgAEHgAWogAEHfAWogAEHeAWoQ/wEgAEHEAWoQJCIBIAEQKBAhIAAgAUEAECIiAjYCwAEgACAAQSBqNgIcIABBADYCGCAAQQE6ABcgAEHFADoAFkEAIQMDQAJAAkACQCAAQYwCaiAAQYgCahAsDQAgACgCwAEgARAfIAJqRgRAIAEQHyEGIAEgARAfQQF0ECEgASABECgQISAAIAYgAUEAECIiAmo2AsABCyAAQYwCahA4IABBF2ogAEEWaiACIABBwAFqIAAsAN8BIAAsAN4BIABB0AFqIABBIGogAEEcaiAAQRhqIABB4AFqEP4BDQAgAw0BQQAhAyAAKALAASACayIHQQBMDQICQAJAIAItAAAiBkErayIIDgMBAAEACyAGQS5GDQJBASEDIAZBMGtB/wFxQQpJDQMMAQsgB0EBRg0CAkAgCA4DAAMAAwsgAi0AASIGQS5GDQFBASEDIAZBMGtB/wFxQQlNDQILAkAgAEHQAWoQH0UNACAALQAXQQFxRQ0AIAAoAhwiAyAAQSBqa0GfAUoNACAAIANBBGo2AhwgAyAAKAIYNgIACyAAIAIgACgCwAEgBBCOAyAAKQMAIQkgBSAAKQMINwMIIAUgCTcDACAAQdABaiAAQSBqIAAoAhwgBBBDIABBjAJqIABBiAJqECwEQCAEIAQoAgBBAnI2AgALIAAoAowCIAEQIBogAEHQAWoQIBogAEGQAmokAAwDC0EBIQMLIABBjAJqED8aDAALAAsLygQBA38CfyMAQYACayIAJAAgACACNgL4ASAAIAE2AvwBIABBwAFqIAMgAEHQAWogAEHPAWogAEHOAWoQ/wEgAEG0AWoQJCIBIAEQKBAhIAAgAUEAECIiAjYCsAEgACAAQRBqNgIMIABBADYCCCAAQQE6AAcgAEHFADoABkEAIQMDQAJAAkACQCAAQfwBaiAAQfgBahAsDQAgACgCsAEgARAfIAJqRgRAIAEQHyEGIAEgARAfQQF0ECEgASABECgQISAAIAYgAUEAECIiAmo2ArABCyAAQfwBahA4IABBB2ogAEEGaiACIABBsAFqIAAsAM8BIAAsAM4BIABBwAFqIABBEGogAEEMaiAAQQhqIABB0AFqEP4BDQAgAw0BQQAhAyAAKAKwASACayIHQQBMDQICQAJAIAItAAAiBkErayIIDgMBAAEACyAGQS5GDQJBASEDIAZBMGtB/wFxQQpJDQMMAQsgB0EBRg0CAkAgCA4DAAMAAwsgAi0AASIGQS5GDQFBASEDIAZBMGtB/wFxQQlNDQILAkAgAEHAAWoQH0UNACAALQAHQQFxRQ0AIAAoAgwiAyAAQRBqa0GfAUoNACAAIANBBGo2AgwgAyAAKAIINgIACyAFIAIgACgCsAEgBBCPAzkDACAAQcABaiAAQRBqIAAoAgwgBBBDIABB/AFqIABB+AFqECwEQCAEIAQoAgBBAnI2AgALIAAoAvwBIAEQIBogAEHAAWoQIBogAEGAAmokAAwDC0EBIQMLIABB/AFqED8aDAALAAsLygQBA38CfyMAQYACayIAJAAgACACNgL4ASAAIAE2AvwBIABBwAFqIAMgAEHQAWogAEHPAWogAEHOAWoQ/wEgAEG0AWoQJCIBIAEQKBAhIAAgAUEAECIiAjYCsAEgACAAQRBqNgIMIABBADYCCCAAQQE6AAcgAEHFADoABkEAIQMDQAJAAkACQCAAQfwBaiAAQfgBahAsDQAgACgCsAEgARAfIAJqRgRAIAEQHyEGIAEgARAfQQF0ECEgASABECgQISAAIAYgAUEAECIiAmo2ArABCyAAQfwBahA4IABBB2ogAEEGaiACIABBsAFqIAAsAM8BIAAsAM4BIABBwAFqIABBEGogAEEMaiAAQQhqIABB0AFqEP4BDQAgAw0BQQAhAyAAKAKwASACayIHQQBMDQICQAJAIAItAAAiBkErayIIDgMBAAEACyAGQS5GDQJBASEDIAZBMGtB/wFxQQpJDQMMAQsgB0EBRg0CAkAgCA4DAAMAAwsgAi0AASIGQS5GDQFBASEDIAZBMGtB/wFxQQlNDQILAkAgAEHAAWoQH0UNACAALQAHQQFxRQ0AIAAoAgwiAyAAQRBqa0GfAUoNACAAIANBBGo2AgwgAyAAKAIINgIACyAFIAIgACgCsAEgBBCRAzgCACAAQcABaiAAQRBqIAAoAgwgBBBDIABB/AFqIABB+AFqECwEQCAEIAQoAgBBAnI2AgALIAAoAvwBIAEQIBogAEHAAWoQIBogAEGAAmokAAwDC0EBIQMLIABB/AFqED8aDAALAAsLiwMBAX8jAEGAAmsiACQAIAAgAjYC+AEgACABNgL8ASADEGohBiAAQcQBaiADIABB9wFqEK8BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABB/AFqIABB+AFqECwNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABB/AFqIgMQOCAGIAIgAEG0AWogAEEIaiAALAD3ASAAQcQBaiAAQRBqIABBDGpB0J8BEJoBDQAgAxA/GgwBCwsCQCAAQcQBahAfRQ0AIAAoAgwiAyAAQRBqa0GfAUoNACAAIANBBGo2AgwgAyAAKAIINgIACyAFIAIgACgCtAEgBCAGEJIDNwMAIABBxAFqIABBEGogACgCDCAEEEMgAEH8AWogAEH4AWoQLARAIAQgBCgCAEECcjYCAAsgACgC/AEgARAgGiAAQcQBahAgGiAAQYACaiQACwcAIAAoAgALiwMBAX8jAEGAAmsiACQAIAAgAjYC+AEgACABNgL8ASADEGohBiAAQcQBaiADIABB9wFqEK8BIABBuAFqECQiASABECgQISAAIAFBABAiIgI2ArQBIAAgAEEQajYCDCAAQQA2AggDQAJAIABB/AFqIABB+AFqECwNACAAKAK0ASABEB8gAmpGBEAgARAfIQMgASABEB9BAXQQISABIAEQKBAhIAAgAyABQQAQIiICajYCtAELIABB/AFqIgMQOCAGIAIgAEG0AWogAEEIaiAALAD3ASAAQcQBaiAAQRBqIABBDGpB0J8BEJoBDQAgAxA/GgwBCwsCQCAAQcQBahAfRQ0AIAAoAgwiAyAAQRBqa0GfAUoNACAAIANBBGo2AgwgAyAAKAIINgIACyAFIAIgACgCtAEgBCAGEJUDOwEAIABBxAFqIABBEGogACgCDCAEEEMgAEH8AWogAEH4AWoQLARAIAQgBCgCAEECcjYCAAsgACgC/AEgARAgGiAAQcQBahAgGiAAQYACaiQAC4sDAQF/IwBBgAJrIgAkACAAIAI2AvgBIAAgATYC/AEgAxBqIQYgAEHEAWogAyAAQfcBahCvASAAQbgBahAkIgEgARAoECEgACABQQAQIiICNgK0ASAAIABBEGo2AgwgAEEANgIIA0ACQCAAQfwBaiAAQfgBahAsDQAgACgCtAEgARAfIAJqRgRAIAEQHyEDIAEgARAfQQF0ECEgASABECgQISAAIAMgAUEAECIiAmo2ArQBCyAAQfwBaiIDEDggBiACIABBtAFqIABBCGogACwA9wEgAEHEAWogAEEQaiAAQQxqQdCfARCaAQ0AIAMQPxoMAQsLAkAgAEHEAWoQH0UNACAAKAIMIgMgAEEQamtBnwFKDQAgACADQQRqNgIMIAMgACgCCDYCAAsgBSACIAAoArQBIAQgBhCWAzcDACAAQcQBaiAAQRBqIAAoAgwgBBBDIABB/AFqIABB+AFqECwEQCAEIAQoAgBBAnI2AgALIAAoAvwBIAEQIBogAEHEAWoQIBogAEGAAmokAAuLAwEBfyMAQYACayIAJAAgACACNgL4ASAAIAE2AvwBIAMQaiEGIABBxAFqIAMgAEH3AWoQrwEgAEG4AWoQJCIBIAEQKBAhIAAgAUEAECIiAjYCtAEgACAAQRBqNgIMIABBADYCCANAAkAgAEH8AWogAEH4AWoQLA0AIAAoArQBIAEQHyACakYEQCABEB8hAyABIAEQH0EBdBAhIAEgARAoECEgACADIAFBABAiIgJqNgK0AQsgAEH8AWoiAxA4IAYgAiAAQbQBaiAAQQhqIAAsAPcBIABBxAFqIABBEGogAEEMakHQnwEQmgENACADED8aDAELCwJAIABBxAFqEB9FDQAgACgCDCIDIABBEGprQZ8BSg0AIAAgA0EEajYCDCADIAAoAgg2AgALIAUgAiAAKAK0ASAEIAYQlwM2AgAgAEHEAWogAEEQaiAAKAIMIAQQQyAAQfwBaiAAQfgBahAsBEAgBCAEKAIAQQJyNgIACyAAKAL8ASABECAaIABBxAFqECAaIABBgAJqJAALmIwBAy5/BX0CfCMAQRBrIhkkACAZIAM2AgwgGUEANgIIIBlCADcCACAZIAEgASACaiICIAIgAWsQwAMjAEHgAGsiIiQAICJBCGohDSAZKAIEIBkoAgAiAWshAiMAQcABayITJAAgE0EANgKgASATQgA3A5gBIBNBADYCsAEgE0IANwKoASATQbQBaiIaQQA2AgggGkIANwIAIBpBgMAAELcDIBpBgMAAEJgDIBNBDGpBAEEw/AsAIBMgAjYCCCATIAE2AgQCQAJ/IBNBBGohAgJ/QXpB5RstAABBMUcNABpBfiACRQ0BGiACQQA2AhggAigCICIBRQRAIAJBADYCKCACQS82AiBBLyEBCyACKAIkRQRAIAJBMDYCJAtBfCACKAIoQQFB0DcgAREDACIDRQ0BGiACIAM2AhwgA0EANgI4IAMgAjYCACADQbT+ADYCBEF+IQQCQCACRQ0AIAIoAiBFDQAgAigCJCIFRQ0AIAIoAhwiAUUNACABKAIAIAJHDQAgASgCBEG0/gBrQR9LDQACQAJAIAEoAjgiDARAIAEoAihBD0cNAQsgAUEPNgIoIAFBBjYCDAwBCyACKAIoIAwgBREBACABQQA2AjggAigCICABQQ82AiggAUEGNgIMRQ0BCyACKAIkRQ0AIAIoAhwiAUUNACABKAIAIAJHDQAgASgCBEG0/gBrQR9LDQBBACEEIAFBADYCNCABQgA3AiwgAUEANgIgIAJBADYCCCACQgA3AhQgASgCDCIFBEAgAiAFQQFxNgIwCyABQgA3AjwgAUEANgIkIAFBgIACNgIYIAFCgICAgHA3AhAgAUK0/gA3AgQgAUKBgICAcDcCxDcgASABQbQKaiIFNgJwIAEgBTYCVCABIAU2AlALQQAgBEUNABogAigCKCADIAIoAiQRAQAgAkEANgIcIAQLC0UEQCATQQA2AqwBAkADQCATIBooAgAiATYCECATIBooAgQgAWs2AhRBACEMIwBBEGsiFyQAQX4hHAJAIBNBBGoiCkUNACAKKAIgRQ0AIAooAiRFDQAgCigCHCIGRQ0AIAYoAgAgCkcNACAGKAIEIgVBtP4Aa0EfSw0AIAooAgwiEEUNACAKKAIAIgFFBEAgCigCBA0BCyAFQb/+AEYEQCAGQcD+ADYCBEHA/gAhBQsgBkHcAGohKiAGQfQFaiEgIAZB2ABqISMgBkHwAGohISAGQbQKaiEfIAZB9ABqIRYgBigCQCEDIAYoAjwhByAKKAIEIiQhBCAKKAIQIg8hFQJAAkACQAJAAkADQEF9IQICQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAAkACQAJAIAVBtP4Aaw4fBwYKDRA5Ojs8BRUWFhcYGQQcAiUmASgAKh0eA0BCQ0QLIAYoAkwhCAwoCyAGKAJMIQgMJQsgBigCbCEIDCELIAYoAgwhBQw5CyADQQ5PDRYgBEUNPCADQQhqIQIgAUEBaiEFIARBAWshCCABLQAAIAN0IAdqIQcgA0EFTQ0VIAUhASAIIQQgAiEDDBYLIANBIE8NDiAERQ07IAFBAWohAiAEQQFrIQUgAS0AACADdCAHaiEHIANBF00NDSACIQEgBSEEDA4LIANBEE8NAiAERQ06IANBCGohAiABQQFqIQUgBEEBayEIIAEtAAAgA3QgB2ohByADQQdNDQEgBSEBIAghBCACIQMMAgsgBigCDCIJRQ0XAkAgA0EQTw0AIARFDTogA0EIaiECIAFBAWohBSAEQQFrIQggAS0AACADdCAHaiEHIANBB0sEQCAFIQEgCCEEIAIhAwwBCyAIRQRAIAUhAUEAIQQgAiEDIAwhAgw8CyADQRByIQMgBEECayEEIAEtAAEgAnQgB2ohByABQQJqIQELIAlBAnFFIAdBn5YCR3JFBEAgBigCKEUEQCAGQQ82AigLQQAhByAGQQBBAEEAEFEiAjYCHCAXQZ+WAjsADCACIBdBDGpBAhBRIQIgBkG1/gA2AgQgBiACNgIcQQAhAyAGKAIEIQUMNwsgBigCJCICBEAgAkF/NgIwCyAHQQh0QYD+A3EgB0EIdmpBH3BFIAlBAXFxRQRAIApBxw42AhggBkHR/gA2AgQgBigCBCEFDDcLIAdBD3FBCEcEQCAKQZcSNgIYIAZB0f4ANgIEIAYoAgQhBQw3CyAHQQR2IgJBD3EiCEEIaiEFIAhBB00gBigCKCIJBH8gCQUgBiAFNgIoIAULIAVPcUUEQCADQQRrIQMgCkHREDYCGCAGQdH+ADYCBCACIQcgBigCBCEFDDcLQQAhAyAGQQA2AhQgBkGAAiAIdDYCGCAGQQBBAEEAELMBIgI2AhwgCiACNgIwIAZBvf4AQb/+ACAHQYDAAHEbNgIEQQAhByAGKAIEIQUMNgsgCEUEQCAFIQFBACEEIAIhAyAMIQIMOgsgA0EQciEDIARBAmshBCABLQABIAJ0IAdqIQcgAUECaiEBCyAGIAc2AhQgB0H/AXFBCEcEQCAKQZcSNgIYIAZB0f4ANgIEIAYoAgQhBQw1CyAHQYDAA3EEQCAKQesJNgIYIAZB0f4ANgIEIAYoAgQhBQw1CyAGKAIkIgIEQCACIAdBCHZBAXE2AgALAkAgB0GABHFFDQAgBi0ADEEEcUUNACAXQQg6AAwgFyAHQQh2OgANIAYgBigCHCAXQQxqQQIQUTYCHAsgBkG2/gA2AgRBACEDQQAhBwwBCyADQR9LDQELIARFDTUgAUEBaiECIARBAWshBSABLQAAIAN0IAdqIQcgA0EXSwRAIAIhASAFIQQMAQsgA0EIaiEIIAVFBEAgAiEBQQAhBCAIIQMgDCECDDcLIAFBAmohAiAEQQJrIQUgAS0AASAIdCAHaiEHIANBD0sEQCACIQEgBSEEDAELIANBEGohCCAFRQRAIAIhAUEAIQQgCCEDIAwhAgw3CyABQQNqIQIgBEEDayEFIAEtAAIgCHQgB2ohByADQQdLBEAgAiEBIAUhBAwBCyADQRhqIQMgBUUEQCACIQEMNgsgBEEEayEEIAEtAAMgA3QgB2ohByABQQRqIQELIAYoAiQiAgRAIAIgBzYCBAsCQCAGLQAVQQJxRQ0AIAYtAAxBBHFFDQAgFyAHNgAMIAYgBigCHCAXQQxqQQQQUTYCHAsgBkG3/gA2AgRBACEDQQAhBwwBCyADQQ9LDQELIARFDTIgAUEBaiECIARBAWshBSABLQAAIAN0IAdqIQcgA0EHSwRAIAIhASAFIQQMAQsgA0EIaiEDIAVFBEAgAiEBDDMLIARBAmshBCABLQABIAN0IAdqIQcgAUECaiEBCyAGKAIkIgIEQCACIAdBCHY2AgwgAiAHQf8BcTYCCAsCQCAGLQAVQQJxRQ0AIAYtAAxBBHFFDQAgFyAHOwAMIAYgBigCHCAXQQxqQQIQUTYCHAsgBkG4/gA2AgRBACEFQQAhA0EAIQcgBigCFCICQYAIcQ0BDCcLIAYoAhQiAkGACHFFBEAgAyEFDCcLIAchBSADQQ9LDQELIARFBEBBACEEIAUhByAMIQIMMQsgAUEBaiEIIARBAWshCSABLQAAIAN0IAVqIQcgA0EHSwRAIAghASAJIQQMAQsgA0EIaiEDIAlFBEAgCCEBDDALIARBAmshBCABLQABIAN0IAdqIQcgAUECaiEBCyAGIAc2AkQgBigCJCIDBEAgAyAHNgIUC0EAIQMCQCACQYAEcUUNACAGLQAMQQRxRQ0AIBcgBzsADCAGIAYoAhwgF0EMakECEFE2AhwLQQAhBwwlCyADQQhqIQggBUUEQCACIQFBACEEIAghAyAMIQIMLwsgAUECaiECIARBAmshBSABLQABIAh0IAdqIQcgA0EPSwRAIAIhASAFIQQMAQsgA0EQaiEIIAVFBEAgAiEBQQAhBCAIIQMgDCECDC8LIAFBA2ohAiAEQQNrIQUgAS0AAiAIdCAHaiEHIANBB0sEQCACIQEgBSEEDAELIANBGGohAyAFRQRAIAIhAQwuCyAEQQRrIQQgAS0AAyADdCAHaiEHIAFBBGohAQsgBiAHQRh0IAdBgP4DcUEIdHIgB0EIdkGA/gNxIAdBGHZyciICNgIcIAogAjYCMCAGQb7+ADYCBEEAIQdBACEDCyAGKAIQRQRAIAogDzYCECAKIBA2AgwgCiAENgIEIAogATYCACAGIAM2AkAgBiAHNgI8QQIhHAwvCyAGQQBBAEEAELMBIgI2AhwgCiACNgIwIAZBv/4ANgIECwJ/AkAgBigCCEUEQCADIANBAksNAhogBA0BDC0LIAZBzv4ANgIEIAcgA0EHcXYhByADQXhxIQMgBigCBCEFDCkLIARBAWshBCABLQAAIAN0IAdqIQcgAUEBaiEBIANBCHILIAYgB0EBcTYCCEHB/gAhBQJAAkACQAJAAkAgB0EBdkEDcUEBaw4DAAECAwsgBkGA3AA2AlAgBkKJgICA0AA3AlggBkGA7AA2AlQgBkHH/gA2AgQMAwtBxP4AIQUMAQsgCkH0EDYCGEHR/gAhBQsgBiAFNgIEC0EDayEDIAdBA3YhByAGKAIEIQUMJwsgByADQQdxdiEHAn8gA0F4cSIFIANBH0sNABogBEUEQEEAIQQgBSEDIAwhAgwsCyAFQQhqIQggAUEBaiECIARBAWshCSABLQAAIAV0IAdqIQcgA0EXSwRAIAIhASAJIQQgCAwBCyAJRQRAIAIhAUEAIQQgCCEDIAwhAgwsCyAFQRBqIQkgAUECaiECIARBAmshCyABLQABIAh0IAdqIQcgA0EPSwRAIAIhASALIQQgCQwBCyALRQRAIAIhAUEAIQQgCSEDIAwhAgwsCyAFQRhqIQUgAUEDaiECIARBA2shCCABLQACIAl0IAdqIQcgA0EHSwRAIAIhASAIIQQgBQwBCyAIRQRAIAIhAUEAIQQgBSEDIAwhAgwsCyAEQQRrIQQgAS0AAyAFdCAHaiEHIAFBBGohAUEgCyEDIAdB//8DcSICIAdBf3NBEHZHBEAgCkGdCzYCGCAGQdH+ADYCBCAGKAIEIQUMJwsgBkHC/gA2AgQgBiACNgJEQQAhB0EAIQMLIAZBw/4ANgIECyAGKAJEIgIEQCACIAQgAiAESRsiAiAPIAIgD0kbIgJFBEAgDCECDCoLIAIEQCAQIAEgAvwKAAALIAYgBigCRCACazYCRCACIBBqIRAgDyACayEPIAEgAmohASAEIAJrIQQgBigCBCEFDCULIAZBv/4ANgIEIAYoAgQhBQwkCyAIRQRAIAUhAUEAIQQgAiEDIAwhAgwoCyADQRByIQMgBEECayEEIAEtAAEgAnQgB2ohByABQQJqIQELIAYgB0EfcSICQYECajYCZCAGIAdBBXZBH3EiBUEBajYCaCAGIAdBCnZBD3FBBGoiCTYCYCADQQ5rIQMgB0EOdiEHIAVBHkkgAkEdTXFFBEAgCkH5CjYCGCAGQdH+ADYCBCAGKAIEIQUMIwsgBkHF/gA2AgRBACEFIAZBADYCbAwGCyAGKAJsIgUgBigCYCIJSQ0FDAYLIA9FDQ0gECAGKAJEOgAAIAZByP4ANgIEIA9BAWshDyAQQQFqIRAgBigCBCEFDCALIAYoAgwiBUUEQEEAIQUMAwsCQCADQR9LBEAgASEIDAELIARFDSMgA0EIaiECIAFBAWohCCAEQQFrIQkgAS0AACADdCAHaiEHIANBF0sEQCAJIQQgAiEDDAELIAlFBEAgCCEBQQAhBCACIQMgDCECDCULIANBEGohCSABQQJqIQggBEECayELIAEtAAEgAnQgB2ohByADQQ9LBEAgCyEEIAkhAwwBCyALRQRAIAghAUEAIQQgCSEDIAwhAgwlCyADQRhqIQIgAUEDaiEIIARBA2shCyABLQACIAl0IAdqIQcgA0EHSwRAIAshBCACIQMMAQsgC0UEQCAIIQFBACEEIAIhAyAMIQIMJQsgA0EgciEDIAFBBGohCCAEQQRrIQQgAS0AAyACdCAHaiEHCyAKIBUgD2siASAKKAIUajYCFCAGIAYoAiAgAWo2AiAgBUEEcSICRSAPIBVGcgR/IAIFIBAgAWshAiAGKAIcIQUgBgJ/IAYoAhQEQCAFIAIgARBRDAELIAUgAiABELMBCyIBNgIcIAogATYCMCAGKAIMIgVBBHELRQ0BIAYoAhwgByAHQRh0IAdBgP4DcUEIdHIgB0EIdkGA/gNxIAdBGHZyciAGKAIUG0YNASAKQfUONgIYIAZB0f4ANgIEIAghASAPIRUgBigCBCEFDB8LIAZBwP4ANgIEDBULIAghAUEAIQdBACEDIA8hFQsgBkHP/gA2AgQMGwsDQCADQQJNBEAgBEUNICAEQQFrIQQgAS0AACADdCAHaiEHIANBCHIhAyABQQFqIQELIAYgBUEBaiICNgJsIBYgBUEBdC8B0FtBAXRqIAdBB3E7AQAgA0EDayEDIAdBA3YhByACIgUgCUcNAAsgCSEFCyAFQRJNBEBBACEIIAUiAkEDcSIMQQNHBEADQCAWIAJBAXQvAdBbQQF0akEAOwEAIAJBAWohAiAMIAhBAWoiCHNBA0cNAAsLIAVBD00EQANAIBYgAkEBdCIFLwHQW0EBdGpBADsBACAWIAVB0tsAai8BAEEBdGpBADsBACAWIAVB1NsAai8BAEEBdGpBADsBACAWIAVB1tsAai8BAEEBdGpBADsBACACQQRqIgJBE0cNAAsLIAZBEzYCbAsgBkEHNgJYIAYgHzYCUCAGIB82AnBBACEIQQAgFkETICEgIyAgEOMBIgwEQCAKQdIJNgIYIAZB0f4ANgIEIAYoAgQhBQwbCyAGQcb+ADYCBCAGQQA2AmxBACEMCyAGKAJkIh0gBigCaGoiGCAISwRAQX8gBigCWHRBf3MhGyAGKAJQIRQDQCADIQ4gBCEFIAEhAgJAAkACQAJAAkACQCAUIAcgG3EiEkECdGotAAEiCyADTQRAIAMhCQwBCwNAIAVFDQIgAi0AACAOdCELIAJBAWohAiAFQQFrIQUgDkEIaiIJIQ4gCSAUIAcgC2oiByAbcSISQQJ0ai0AASILSQ0ACwsgFCASQQJ0ai8BAiIDQQ9NBEAgBiAIQQFqIgE2AmwgFiAIQQF0aiADOwEAIAkgC2shAyAHIAt2IQcgASEIDAULAn8CfwJAAkACQCADQRBrDgIAAQILIAtBAmoiASAJSwRAA0AgBUUNHiAFQQFrIQUgAi0AACAJdCAHaiEHIAJBAWohAiAJQQhqIgkgAUkNAAsLIAkgC2shAyAHIAt2IQkgCEUEQCAKQagKNgIYIAZB0f4ANgIEIAIhASAFIQQgCSEHIAYoAgQhBQwlCyADQQJrIQMgCUECdiEHIAlBA3FBA2ohCyAIQQF0IBZqQQJrLwEADAMLIAtBA2oiASAJSwRAA0AgBUUNHSAFQQFrIQUgAi0AACAJdCAHaiEHIAJBAWohAiAJQQhqIgkgAUkNAAsLIAkgC2tBA2shAyAHIAt2IgFBA3YhByABQQdxQQNqDAELIAtBB2oiASAJSwRAA0AgBUUNHCAFQQFrIQUgAi0AACAJdCAHaiEHIAJBAWohAiAJQQhqIgkgAUkNAAsLIAkgC2tBB2shAyAHIAt2IgFBB3YhByABQf8AcUELagshC0EACyEEIAggC2ogGEsNAkEAIQkgC0EDcSIORQ0BIAshAQNAIBYgCEEBdGogBDsBACAIQQFqIQggAUEBayEBIAlBAWoiCSAORw0ACwwDCyABIARqIQEgAyAEQQN0aiEDDCILIAshAQwBCyAKQagKNgIYIAZB0f4ANgIEIAIhASAFIQQgBigCBCEFDB0LIAtBBE8EQANAIBYgCEEBdGoiCSAEOwEAIAkgBDsBAiAJIAQ7AQQgCSAEOwEGIAhBBGohCCABQQRrIgENAAsLIAYgCDYCbAsgAiEBIAUhBCAIIBhJDQALCyAGLwH0BEUEQCAKQaIONgIYIAZB0f4ANgIEIAYoAgQhBQwaCyAGQQk2AlggBiAfNgJQIAYgHzYCcEEBIBYgHSAhICMgIBDjASIMBEAgCkG2CTYCGCAGQdH+ADYCBCAGKAIEIQUMGgsgBkEGNgJcIAYgBigCcDYCVEECIBYgBigCZEEBdGogBigCaCAhICogIBDjASIMBEAgCkGECjYCGCAGQdH+ADYCBCAGKAIEIQUMGgsgBkHH/gA2AgRBACEMCyAGQcj+ADYCBAsgBEEGSSAPQYICSXJFBEAgCiAPNgIQIAogEDYCDCAKIAQ2AgQgCiABNgIAIAYgAzYCQCAGIAc2AjwgCigCHCIQKAI0IgtBB3EhJSALIBVqISsgCyAQKAIsIixqIS0gCigCDCIBIAooAhAiAmoiHUGBAmshJiABIAIgFWtqIS4gCigCACIIIAooAgRqQQVrISdBfyAQKAJcdEF/cyEvQX8gECgCWHRBf3MhMCAQKAJUISggECgCUCEpIBAoAkAhBSAQKAI8IQ4gECgCOCEHIBAoAjAhMQNAIAVBDk0EfyAILQAAIAV0IA5qIAgtAAEgBUEIanRqIQ4gCEECaiEIIAVBEHIFIAULICkgDiAwcUECdGoiAi0AASIDayEFIA4gA3YhDgJAAkACQAJAAkAgEAJ/IAoCfwJAA0AgAi0AACIDRQRAIAEgAi0AAjoAACABQQFqIQEMCAsgA0EQcQRAIAIvAQIhDwJ/IANBD3EiAkUEQCAIIQMgDgwBCwJ/IAIgBU0EQCAFIQQgCAwBCyAFQQhqIQQgCC0AACAFdCAOaiEOIAhBAWoLIQMgBCACayEFIA5BfyACdEF/c3EgD2ohDyAOIAJ2CyEEIAVBDk0EQCADLQAAIAV0IARqIAMtAAEgBUEIanRqIQQgBUEQciEFIANBAmohAwsgBSAoIAQgL3FBAnRqIgItAAEiCGshBSAEIAh2IQ4gAi0AACIEQRBxDQIDQCAEQcAAcUUEQCAFICggAi8BAkECdGogDkF/IAR0QX9zcUECdGoiAi0AASIEayEFIA4gBHYhDiACLQAAIgRBEHFFDQEMBAsLIAMhCEHwEQwDCyADQcAAcUUEQCAFICkgAi8BAkECdGogDkF/IAN0QX9zcUECdGoiAi0AASIDayEFIA4gA3YhDgwBCwtBv/4AIANBIHENAhpB1BEMAQsgAi8BAiEUAn8gBEEPcSICIAVNBEAgBSEEIAMMAQsgAy0AACAFdCAOaiEOIANBAWogAiAFQQhqIgRNDQAaIAMtAAEgBHQgDmohDiAFQRBqIQQgA0ECagshCCAOQX8gAnRBf3NxIRggBCACayEFIA4gAnYhDiAUIBhqIhsgASAuayICTQ0DIBsgAmsiCSAxTQ0CIBAoAsQ3RQ0CQZQPCzYCGEHR/gALNgIEDAQLAkACQCALRQRAIAcgLCAJa2ohBCAJIA9PBEAgASECDAMLQQAhEiABIQIgCSIDQQdxIh4EQANAIAIgBC0AADoAACADQQFrIQMgAkEBaiECIARBAWohBCASQQFqIhIgHkcNAAsLIBUgGCAdaiAUamsgAWpBeEsNAQNAIAIgBC0AADoAACACIAQtAAE6AAEgAiAELQACOgACIAIgBC0AAzoAAyACIAQtAAQ6AAQgAiAELQAFOgAFIAIgBC0ABjoABiACIAQtAAc6AAcgAkEIaiECIARBCGohBCADQQhrIgMNAAsMAQsgCSALSwRAIAcgLSAJa2ohBCAJIAtrIgkgD08EQCABIQIMAwtBACESIAEhAiAJIgNBB3EiHgRAA0AgAiAELQAAOgAAIANBAWshAyACQQFqIQIgBEEBaiEEIBJBAWoiEiAeRw0ACwsgKyAYIB1qIBRqayABakF4TQRAA0AgAiAELQAAOgAAIAIgBC0AAToAASACIAQtAAI6AAIgAiAELQADOgADIAIgBC0ABDoABCACIAQtAAU6AAUgAiAELQAGOgAGIAIgBC0ABzoAByACQQhqIQIgBEEIaiEEIANBCGsiAw0ACwsgCyAPIAlrIg9PBEAgByEEDAMLQQAhASALIQMgByEEICUEQANAIAIgBC0AADoAACADQQFrIQMgAkEBaiECIARBAWohBCABQQFqIgEgJUcNAAsLIAtBCE8EQANAIAIgBC0AADoAACACIAQtAAE6AAEgAiAELQACOgACIAIgBC0AAzoAAyACIAQtAAQ6AAQgAiAELQAFOgAFIAIgBC0ABjoABiACIAQtAAc6AAcgAkEIaiECIARBCGohBCADQQhrIgMNAAsLIAIgG2shBCAPIAtrIQ8MAgsgByALIAlraiEEIAkgD08EQCABIQIMAgtBACESIAEhAiAJIgNBB3EiHgRAA0AgAiAELQAAOgAAIANBAWshAyACQQFqIQIgBEEBaiEEIBJBAWoiEiAeRw0ACwsgFSAYIB1qIBRqayABakF4Sw0AA0AgAiAELQAAOgAAIAIgBC0AAToAASACIAQtAAI6AAIgAiAELQADOgADIAIgBC0ABDoABCACIAQtAAU6AAUgAiAELQAGOgAGIAIgBC0ABzoAByACQQhqIQIgBEEIaiEEIANBCGsiAw0ACwsgAiAbayEEIA8gCWshDwsCQCAPQQNJDQAgD0EDayIBQQNuIgNBA3FBA0cEQCADQQFqQQNxIQlBACEDA0AgAiAELQAAOgAAIAIgBC0AAToAASACIAQtAAI6AAIgD0EDayEPIAJBA2ohAiAEQQNqIQQgA0EBaiIDIAlHDQALCyABQQlJDQADQCACIAQtAAA6AAAgAiAELQABOgABIAIgBC0AAjoAAiACIAQtAAM6AAMgAiAELQAEOgAEIAIgBC0ABToABSACIAQtAAY6AAYgAiAELQAHOgAHIAIgBC0ACDoACCACIAQtAAk6AAkgAiAELQAKOgAKIAIgBC0ACzoACyACQQxqIQIgBEEMaiEEIA9BDGsiD0ECSw0ACwsgD0UEQCACIQEMAwsgAiAELQAAOgAAIA9BAkYNASACQQFqIQEMAgsgASAbayEDA0AgASICIAMiBC0AADoAACACIAMtAAE6AAEgAiADLQACOgACIAJBA2ohASADQQNqIQMgD0EDayIPQQJLDQALIA9FDQEgAiADLQAAOgADIA9BAkcEQCACQQRqIQEMAgsgAiAELQAEOgAEIAJBBWohAQwBCyACIAQtAAE6AAEgAkECaiEBCyAIICdPDQAgASAmSQ0BCwsgCiABNgIMIAogCCAFQQN2ayICNgIAIAogJiABa0GBAmo2AhAgCiAnIAJrQQVqNgIEIBAgBUEHcSIBNgJAIBAgDkF/IAF0QX9zcTYCPCAGKAJAIQMgBigCPCEHIAooAgQhBCAKKAIAIQEgCigCECEPIAooAgwhECAGKAIEQb/+AEcNDyAGQX82Asg3IAYoAgQhBQwYCyAGQQA2Asg3IAMhCCAEIQUgASECAkAgBigCUCIUIAdBfyAGKAJYdEF/cyIScUECdGoiCy0AASIOIANNBEAgAyEJDAELA0AgBUUNDSACLQAAIAh0IQsgAkEBaiECIAVBAWshBSAIQQhqIgkhCCAJIBQgByALaiIHIBJxQQJ0aiILLQABIg5JDQALCyAOIQMgCy8BAiESAkAgCy0AACILQQFrQf8BcUEOSwRAQQAhAyACIQEgBSEEDAELIAUhBCACIQECQCAJIgggAyAUIBJBAnRqIhQgB0F/IAMgC2p0QX9zIhhxIAN2QQJ0aiISLQABIg5qTwRAIAghCwwBCwNAIARFDQ0gAS0AACAIdCEOIAFBAWohASAEQQFrIQQgCEEIaiILIQggAyAUIAcgDmoiByAYcSADdkECdGoiEi0AASIOaiALSw0ACwsgCyADayEJIAcgA3YhByASLQAAIQsgEi8BAiESCyAGIBJB//8DcTYCRCAGIAMgDmo2Asg3IAkgDmshAyAHIA52IQcgC0H/AXEiAkUEQCAGQc3+ADYCBCAGKAIEIQUMGAsgAkEgcQRAIAZBv/4ANgIEIAZBfzYCyDcgBigCBCEFDBgLIAJBwABxBEAgCkHUETYCGCAGQdH+ADYCBCAGKAIEIQUMGAsgBkHJ/gA2AgQgBiACQQ9xIgg2AkwLIAEhCyAEIQkCQCAIRQRAIAYoAkQhAgwBCyADIQUgASECIAMgCEkEQANAIARFDQsgBEEBayEEIAItAAAgBXQgB2ohByACQQFqIgEhAiAFQQhqIgUgCEkNAAsLIAYgBigCyDcgCGo2Asg3IAYgBigCRCAHQX8gCHRBf3NxaiICNgJEIAUgCGshAyAHIAh2IQcLIAZByv4ANgIEIAYgAjYCzDcLIAMhCCAEIQUgASECAkAgBigCVCIUIAdBfyAGKAJcdEF/cyIScUECdGoiCy0AASIOIANNBEAgAyEJDAELA0AgBUUNCCACLQAAIAh0IQsgAkEBaiECIAVBAWshBSAIQQhqIgkhCCAJIBQgByALaiIHIBJxQQJ0aiILLQABIg5JDQALCyALLwECIRIgBgJ/IAstAAAiCEEQTwRAIAIhASAFIQQgDiELIAYoAsg3DAELIAUhBCACIQECQCAJIgMgDiAUIBJBAnRqIhQgB0F/IAggDmp0QX9zIhhxIA52QQJ0aiISLQABIgtqTwRAIAMhCAwBCwNAIARFDQggAS0AACADdCELIAFBAWohASAEQQFrIQQgA0EIaiIIIQMgDiAUIAcgC2oiByAYcSAOdkECdGoiEi0AASILaiAISw0ACwsgCCAOayEJIAcgDnYhByASLQAAIQggEi8BAiESIAYoAsg3IA5qCyALajYCyDcgCSALayEDIAcgC3YhByAIQcAAcQRAIApB8BE2AhggBkHR/gA2AgQgBigCBCEFDBYLIAZBy/4ANgIEIAYgCEEPcSIINgJMIAYgEkH//wNxNgJICyABIQsgBCEJIAgEQCADIQUgASECIAMgCEkEQANAIARFDQYgBEEBayEEIAItAAAgBXQgB2ohByACQQFqIgEhAiAFQQhqIgUgCEkNAAsLIAYgBigCyDcgCGo2Asg3IAYgBigCSCAHQX8gCHRBf3NxajYCSCAHIAh2IQcgBSAIayEDCyAGQcz+ADYCBAsgDw0BC0EAIQ8gDCECDBYLAn8gBigCSCICIBUgD2siBUsEQAJAIAIgBWsiAiAGKAIwTQ0AIAYoAsQ3RQ0AIApBlA82AhggBkHR/gA2AgQgBigCBCEFDBQLAn8gBigCNCIFIAJJBEAgBigCOCAGKAIsIAIgBWsiAmtqDAELIAYoAjggBSACa2oLIQUgAiAGKAJEIgggAiAISRsMAQsgECACayEFIAYoAkQiCAshAiAGIAggAiAPIAIgD0kbIglrNgJEIAlBAWshC0EAIQggCUEHcSIORQ0GIAkhAgNAIBAgBS0AADoAACACQQFrIQIgEEEBaiEQIAVBAWohBSAIQQFqIgggDkcNAAsMBwsgCSALaiEBIAMgCUEDdGohAwwTCyACIAVqIQEgCSAFQQN0aiEDDBILIAEgBGohASADIARBA3RqIQMMEQsgCSALaiEBIAMgCUEDdGohAwwQCyACIAVqIQEgCSAFQQN0aiEDDA8LIAEgBGohASADIARBA3RqIQMMDgsgCSECCyALQQdPBEADQCAQIAUtAAA6AAAgECAFLQABOgABIBAgBS0AAjoAAiAQIAUtAAM6AAMgECAFLQAEOgAEIBAgBS0ABToABSAQIAUtAAY6AAYgECAFLQAHOgAHIBBBCGohECAFQQhqIQUgAkEIayICDQALCyAPIAlrIQ8gBigCRA0AIAZByP4ANgIEIAYoAgQhBQwJCyAGKAIEIQUMCAtBACEEIAIhASAJIQMgDCECDAsLIAYoAiQiAgRAIAJBADYCEAsgBSEDCyAGQbn+ADYCBAsCQCAGKAIUIghBgAhxRQ0AIAYoAkQiBSAEIAQgBUsbIgIEQAJAIAYoAiQiCUUNACAJKAIQIg5FDQAgCSgCGCILIAkoAhQgBWsiBU0NACALIAVrIAIgAiAFaiALSxsiCARAIAUgDmogASAI/AoAAAsgBigCFCEICwJAIAhBgARxRQ0AIAYtAAxBBHFFDQAgBiAGKAIcIAEgAhBRNgIcCyAGIAYoAkQgAmsiBTYCRCAEIAJrIQQgASACaiEBCyAFRQ0AIAwhAgwJCyAGQbr+ADYCBCAGQQA2AkQLAkAgBi0AFUEIcQRAQQAhBSAERQ0IA0AgASAFai0AACECAkAgBigCJCIIRQ0AIAgoAhwiC0UNACAGKAJEIgkgCCgCIE8NACAGIAlBAWo2AkQgCSALaiACOgAACyACQQAgBCAFQQFqIgVLGw0ACwJAIAYtABVBAnFFDQAgBi0ADEEEcUUNACAGIAYoAhwgASAFEFE2AhwLIAEgBWohASAEIAVrIQQgAkUNASAMIQIMCQsgBigCJCICRQ0AIAJBADYCHAsgBkG7/gA2AgQgBkEANgJECwJAIAYtABVBEHEEQEEAIQUgBEUNBwNAIAEgBWotAAAhAgJAIAYoAiQiCEUNACAIKAIkIgtFDQAgBigCRCIJIAgoAihPDQAgBiAJQQFqNgJEIAkgC2ogAjoAAAsgAkEAIAQgBUEBaiIFSxsNAAsCQCAGLQAVQQJxRQ0AIAYtAAxBBHFFDQAgBiAGKAIcIAEgBRBRNgIcCyABIAVqIQEgBCAFayEEIAJFDQEgDCECDAgLIAYoAiQiAkUNACACQQA2AiQLIAZBvP4ANgIECyAGKAIUIglBgARxBEACQCADQQ9LBEAgASEFDAELIARFDQYgA0EIaiECIAFBAWohBSAEQQFrIQggAS0AACADdCAHaiEHIANBB0sEQCAIIQQgAiEDDAELIAhFBEAgBSEBQQAhBCACIQMgDCECDAgLIANBEHIhAyABQQJqIQUgBEECayEEIAEtAAEgAnQgB2ohBwsCQCAGLQAMQQRxRQ0AIAcgBi8BHEYNACAKQbkPNgIYIAZB0f4ANgIEIAUhASAGKAIEIQUMAwtBACEHQQAhAyAFIQELIAYoAiQiAgRAIAJBATYCMCACIAlBCXZBAXE2AiwLIAZBAEEAQQAQUSICNgIcIAogAjYCMCAGQb/+ADYCBCAGKAIEIQUMAQsgBUUNASAGKAIURQ0BAkAgA0EfSwRAIAEhAgwBCyAERQ0EIANBCGohCCABQQFqIQIgBEEBayEJIAEtAAAgA3QgB2ohByADQRdLBEAgCSEEIAghAwwBCyAJRQRAIAIhAUEAIQQgCCEDIAwhAgwGCyADQRBqIQkgAUECaiECIARBAmshCyABLQABIAh0IAdqIQcgA0EPSwRAIAshBCAJIQMMAQsgC0UEQCACIQFBACEEIAkhAyAMIQIMBgsgA0EYaiEIIAFBA2ohAiAEQQNrIQsgAS0AAiAJdCAHaiEHIANBB0sEQCALIQQgCCEDDAELIAtFBEAgAiEBQQAhBCAIIQMgDCECDAYLIANBIHIhAyABQQRqIQIgBEEEayEEIAEtAAMgCHQgB2ohBwsCQCAFQQRxRQ0AIAcgBigCIEYNACAKQd4ONgIYIAZB0f4ANgIEIAIhASAGKAIEIQUMAQsLIAIhAUEAIQdBACEDCyAGQdD+ADYCBAtBASECDAELQQAhBCAMIQILIAogDzYCECAKIBA2AgwgCiAENgIEIAogATYCACAGIAM2AkAgBiAHNgI8AkACQCAGKAIsRQRAIA8gFUYNASAGKAIEQdD+AEsNAQsCfyAVIA9rIQMCQAJAIAooAhwiASgCOCIMRQRAQQEhBSABIAooAihBASABKAIodEEBIAooAiARAwAiDDYCOCAMRQ0BCyABKAIsIgRFBEAgAUIANwIwIAFBASABKAIodCIENgIsCyADIARPBEAgBARAIAwgECAEayAE/AoAAAsgAUEANgI0DAILIAQgASgCNCIIayIFIAMgAyAFSxsiBARAIAggDGogECADayAE/AoAAAsgAyAFSwRAIAMgBGsiAwRAIAEoAjggECADayAD/AoAAAsgASADNgI0DAILQQAhBSABIAEoAjQgBGoiA0EAIAMgASgCLCIMRxs2AjQgDCABKAIwIgNNDQAgASADIARqNgIwCyAFDAELIAEgASgCLDYCMEEACw0BIAooAhAhDyAKKAIEIQQLIAogCigCCCAkIARrajYCCCAKIBUgD2siASAKKAIUajYCFCAGIAYoAiAgAWo2AiAgBi0ADEEEcUUgDyAVRnJFBEAgCigCDCABayEDIAYoAhwhBSAGAn8gBigCFARAIAUgAyABEFEMAQsgBSADIAEQswELIgE2AhwgCiABNgIwCyAKIAYoAkBBwABBACAGKAIIG2pBgAFBACAGKAIEIgFBv/4ARhtqQYACQYACQQAgAUHC/gBGGyABQcf+AEYbajYCLCACQXsgAhsgAiAPIBVGGyACIAQgJEYbIRwMAgsgBkHS/gA2AgQLQXwhHAsgF0EQaiQAIBxBAUsNASATQagBaiEBIBMoAqwBIQMgGigCACEJIBooAgQgEygCFGshDCMAQSBrIggkAAJAIAwgCWsiBUEATA0AIAEoAgggASgCBCICayAFTgRAIAIgA2siBCAFSARAIAwgBCAJaiIHayILRSAHIAxGckUEQCACIAcgC/wKAAALIAEgAiALajYCBCAEQQBMDQIgASADIAIgAyAFahCeAiAERQ0CIAMgCSAE/AoAAAwCCyABIAMgAiADIAVqEJ4CIAVFDQEgAyAJIAX8CgAADAELIAUgCEEMaiABIAUgASgCAGsgAmoQtAEgAyABKAIAayABEMYBIgIoAggiBGohBQNAIAQgBUcEQCAEIAktAAA6AAAgCUEBaiEJIARBAWohBAwBCwsgAiAFNgIIIAIoAgQaIAEoAgQgA2siBARAIAIoAgggAyAE/AoAAAsgAiACKAIIIAEoAgQgA2tqNgIIIAEgAzYCBCACKAIEIAEoAgAiBCADa2ohBSADIARrIgMEQCAFIAQgA/wKAAALIAIgBTYCBCABIAEoAgAiAzYCBCABIAIoAgQ2AgAgAiADNgIEIAEoAgQhAyABIAIoAgg2AgQgAiADNgIIIAEoAgghAyABIAIoAgw2AgggAiADNgIMIAIgAigCBDYCACACELoBCyAIQSBqJAAgHEEBRw0ACyAKEJsCIBoQOiATQZgBaiIDIBMoAqgBIgIgEygCrAEgAmsQsQIgARA6IApBADYCXCAKQfD7ADYCQCAKQcj7ADYCACAKQdz7ADYCCCAKQYD8ACgCACIBNgIAIAogAUEMaygCAGpBhPwAKAIANgIAIApBADYCBCAKIAooAgBBDGsoAgBqIgJBADYCFCACIApBDGoiATYCGCACQQA2AgwgAkKCoICA4AA3AgQgAiABRTYCECACQSBqQQBBKPwLACACQRxqENMCIAJBADoAUCACQoCAgIBwNwJIIApBiPwAKAIAIgI2AgggAkEMaygCACAKQQhqakGM/AAoAgA2AgAgCkH8+wAoAgAiAjYCACAKIAJBDGsoAgBqQZD8ACgCADYCACAKQZT8ACgCADYCCCAKQcj7ADYCACAKQdz7ADYCCCAKQfD7ADYCQCABQZj1ADYCACABQQRqENMCIAFCADcCGCABQgA3AhAgAUIANwIIIAFCADcCICABQZD3ADYCACABQRg2AjAgAUIANwIoAkAgAyABQSBqIgJGDQAgAhBHRQRAIAMQR0UEQCACEF4aIAIQXiADEF5JBEAgAxBeGiACEF4aCyACIAMpAgA3AgAgAiADKAIINgIIIAIQXhoMAgsgAxAjIQUgAxAfIQMjAEEQayIEJAAgAhBeIQwCQCADQQpNBEAgAiADEFAgAiAFIAMQTSAEQQA6AA8gAiADaiAEQQ9qEF0MAQsgAkEKIANBCmsgDEEAIAwgAyAFELkBCyAEQRBqJAAMAQsgAxAjIQwgAxAfIQMjAEEQayIEJAAgAhB+IQUgAigCBCEIAkAgAyAFSQRAIAIoAgAhBSACIAM2AgQgBSAMIAMQTSAEQQA6AA8gAyAFaiAEQQ9qEF0MAQsgAiAFQQFrIAMgBWtBAWogCEEAIAggAyAMELkBCyAEQRBqJAALIAFBADYCLCABKAIgIAFBIGoiAyABLAArIgJBAEgiBBshCSABKAIkIAIgBBshCCABKAIwIgRBCHEEQCABIAk2AgwgASAJNgIIIAEgCCAJaiIFNgIQIAEgBTYCLAsCQCAEQRBxRQ0AIAEgCCAJajYCLCADQQogASgCKEH/////B3FBAWsgAkEAThsQISABIAk2AhggASAJNgIUIAEgCSABKAIkIAEsACsiAiACQQBIG2o2AhwgAS0AMEEDcUUNAANAIAhBAEgEQCABIAlB/////wdqIgk2AhggCEH/////B2shCAwBCwsgCEUNACABIAggCWo2AhgLIwBBwAFrIgEkACABQgA3ArgBIAFCzo7NgjU3ArABIAogAUGwAWpBEBCIAQJAAkAgCiAKKAIAQQxrKAIAai0AEEEFcUUEQCABKAKwAUHOjs2CBUYNAQtBshIQvgMgDUIANwAFIA1CADcCACANQQE6AA0gDUEQakEAQcgA/AsADAELIAEoArQBQQRrQXxNBEBBthQgAUG0AWoQlwIgDUIANwAFIA1CADcCACANQQE6AA0gDUEQakEAQcgA/AsADAELIAEoArgBIgJBga3iBE8EQEG4EyABQbgBahCXAiANQgA3AAUgDUIANwIAIA1BAToADSANQRBqQQBByAD8CwAMAQsgAS0AvAEiA0EETwRAIAEgAzYCAEH0EyABEHIQf0Gg8QAoAgAQYRogDUIANwAFIA1CADcCACANQQE6AA0gDUEQakEAQcgA/AsADAELIAMQ0wMhDCABKAK0ASEEIAFBAToAZSABQegAaiIFQQBByAD8CwAgASACNgJYIAEgAS0AvAE2AlwgASABLQC9ATYCYCABIAEtAL4BQQFxOgBkIAUgAkEDbCIDQQJBAyAEQQFGG2wQpwEgAUH0AGoiCCADEKcBIAEgBEECSyIEOgBlIAFBgAFqIglBBEEDIAQbIAJsEKcBIAFBjAFqIgQgAhCnASABQZgBaiIHIAMQpwEgAUGkAWoiCyADIAxsEKcBIAogASgCaCABQcwAaiAFEKIBIgIoAgQgAigCAGsQiAEgAhA6IAogASgCjAEgAUFAayAEEKIBIgIoAgQgAigCAGsQiAEgAhA6IAogASgCmAEgAUE0aiAHEKIBIgIoAgQgAigCAGsQiAEgAhA6IAogASgCdCABQShqIAgQogEiAigCBCACKAIAaxCIASACEDogCiABKAKAASABQRxqIAkQogEiAigCBCACKAIAaxCIASACEDogCiABKAKkASABQRBqIAsQogEiAigCBCACKAIAaxCIASACEDoCQCAKIAooAgBBDGsoAgBqLQAQQQVxBEBBkQwQvgMgDUIANwAFIA1CADcCACANQQE6AA0gDUEQakEAQcgA/AsADAELIA0gAUHYAGoiAikCADcCACANIAIpAQY3AQYgDUEQaiACQRBqEKEBIA1BHGogAkEcahChASANQShqIAJBKGoQoQEgDUE0aiACQTRqEKEBIA1BQGsgAkFAaxChASANQcwAaiACQcwAahChAQsgAUHYAGoQywMLIAFBwAFqJAAgChCxARoMAgsgE0EEahCbAgsgGhA6IBNBqAFqEDogDUIANwAFIA1CADcCACANQQE6AA0gDUEQakEAQcgA/AsACyATQZgBahAgGiATQcABaiQAIwBBkAFrIgIkACANKAIAIQQgDSgCBBDTAyEBAkACQAJAIA0oAhQgDSgCEGsiBSAEQQNsIgNBAkEDIAUgDSgCACIMQQZsIghGG2xHBEAgAkH2HTYCOCACQfgANgI0IAJB/BQ2AjBByAsgAkEwahByEH9BoPEAKAIAEGEaDAELIAMgDSgCICANKAIca0cEQCACQfkANgI8IAJBPGpBxhwQmgIMAQsgDSgCLCANKAIoa0EEQQMgDS0ADSIJQQFxGyAEbEcEQCACQZ4dNgIoIAJB+gA2AiQgAkH8FDYCIEHICyACQSBqEHIQf0Gg8QAoAgAQYRoMAQsgBCANKAI4IA0oAjRrRwRAIAJB7xs2AhggAkH7ADYCFCACQfwUNgIQQcgLIAJBEGoQchB/QaDxACgCABBhGgwBCyADIA0oAkQgDSgCQGtHBEAgAkH8ADYCPCACQTxqQZwcEJoCDAELIA0oAlAgDSgCTGsiByABIANsRg0BIAJB8Bw2AgggAkH9ADYCBCACQfwUNgIAQcgLIAIQchB/QaDxACgCABBhGgsgAEIANwIAIABBADoACCAAQQxqQQBByAD8CwAMAQsgAEEMaiIBQQBByAD8CwAgACAMNgIAIAAgDSgCBDYCBCAAIA0tAAw6AAggASADEKQBIABBGGogAxCkASAAQSRqIARBAnQQpAEgAEEwaiAEEKQBIABBPGogAxCkASAAQcgAaiAHEKQBAkAgBSAIRgRAIAEoAgAhDCANKAIQIQgDQCADIBFGDQIgDCARQQJ0agJ9QwAAgD9DAACAvyAIIBFBAXRqLwEAIgHBQQBOGyEzIAFB/wdxIQUCQCABQQp2QR9xIgFBH0cEQCABDQEgM0MAAIA4lCAFs5RDAACAOpQMAgtDAADAfyAzQwAAgH+UIAUbDAELQwAAgD8hMgJAIAFBD2siAUGAAU4EQEMAAAB/ITIgAUH/AUkEQCABQf8AayEBDAILQwAAgH8hMkH9AiABIAFB/QJPG0H+AWshAQwBCyABQYF/Sg0AQwAAgAwhMiABQZt+SwRAIAFB5gBqIQEMAQtDAAAAACEyQbZ9IAEgAUG2fU0bQcwBaiEBCyAFs0MAAIA6lEMAAIA/kiAzIDIgAUEXdEGAgID8A2q+lJSUCzgCACARQQFqIREMAAsACyANKAIQIgVBAmohDCAFQQFqIQhEAAAAAAAA8D9BASANKAIIdLejtiEyIAEoAgAhBwNAIAMgEUYNASAHIBFBAnRqIDIgCCARQQNsIgFqLQAAQQh0IAEgBWotAAByIAEgDGosAAAiAUH/AXFBEHRyQYCAgHhBACABQQBIG3KylDgCACARQQFqIREMAAsACyAAKAIYIQEgDSgCHCEFQQAhEQNAIAMgEUYEQCACQdQAaiEIQQAhESAJQQFxIQcDfyAEIBFGBH8gACgCMCEFIA0oAjQhDEEABQJAIAcEQCAAKAIkIA0oAighBSACQoCAgPyDgIDAPzcCTCACQoCAgPyDgIDAPzcCRCACQoCAgPyDgIDAPzcCPCAIQcgfQTz8CgAAIBFBBHRqIQwgAkE8aiELQwAAAAAhMiAFIBFBAnRqIgEvAAAgAS0AAkEQdHIgAS0AAyIBQRh0ciEFIAFBBnYhCUEDIQEDfyABQQBIBH8gDCAJQQJ0akMAAIA/IDKTkTgCACALQQxqIQVBAAUgASAJRwRAIAwgAUECdGogBUH/A3GzQ/MENT+UQwCA/0OVIjOMIDMgBUGABHEbIjM4AgAgMyAzlCAykiEyIAVBCnYhBQsgAUEBayEBDAELCyEBA0AgAUEDRwRAIAwgAUECdCIJaiILIAUgCWoqAgAgCyoCAJQ4AgAgAUEBaiEBDAELCwwBCyAAKAIkIA0oAiggAkKAgID8g4CAwD83AkwgAkKAgID8g4CAwD83AkQgAkKAgID8g4CAwD83AjwgCEHIH0E8/AoAACMAQRBrIgEkACARQQNsaiIFLQACIQkgBS0AASELIAEgBS0AALNDgYAAPJRDAACAv5IgAioCSJQ4AgQgASALs0OBgAA8lEMAAIC/kiACKgJMlDgCCCABIAmzQ4GAADyUQwAAgL+SIAIqAlCUOAIMIBFBBHRqIgUgASkCBDcCACAFIAEoAgw2AgggBUMAAIA/IAEqAgwgASoCDJQgASoCBCABKgIElCABKgIIIAEqAgiUkpKTIjJDAAAAACAyQwAAAABeG5E4AgwgAUEQaiQACyARQQFqIREMAQsLIREDQCAEIBFHBEAgBSARQQJ0agJ9QwAAAAAgDCARai0AALNDAAB/Q5UiMkMAAIA/IDKTlSIyvCIBQYCAgPwDRg0AGgJAIAFBgICA/AdrQf///4d4TQRAIAFBAXQiCEUEQCMAQRBrIgFDAACAvzgCDCABKgIMQwAAAACVDAMLIAFBgICA/AdGDQEgCEGAgIB4SSABQQBOcUUEQCAyIDKTIjIgMpUMAwsgMkMAAABLlLxBgICA3ABrIQELQYjxACsDACABIAFBgIDM+QNrIgFBgICAfHFrvrsgAUEPdkHwAXEiCCsDgG+iRAAAAAAAAPC/oCI3IDeiIjiiQZDxACsDACA3okGY8QArAwCgoCA4oiABQRd1t0GA8QArAwCiIAgrA4hvoCA3oKC2ITILIDILOAIAIBFBAWohEQwBCwsgACgCPCEBIA0oAkAhBEEAIREDQCADIBFGBEAgDSgCUCANKAJMIgFrIQQgACgCSCEFQQAhAwNAIAMgBEYEQCAZKAIMIQwjAEHgAGsiBCQAIwBBEGsiBSQAQQEhAQJ/QQEhA0EBIAxBAEwNABogDEEBa0EDcyIMQX9zQQFxIQEgDEEEcUUhAyAMQQJxRQshDCAFIAM6AA8gBSAMOgAOIAUgAToADSAFLQAOIQEgBS0ADyEDIAUtAA0hDCAEQYCAgPwDNgJAIARBgICA/AM2AjggBEMAAIA/QwAAgL8gDBsiMzgCXCAEQwAAgD9DAACAvyADGyIyOAJYIAQgMzgCVCAEIDI4AlAgBEMAAIA/QwAAgL8gARsiNDgCTCAEIDQ4AkQgBCAzOAIsIAQgMjgCKCAEIDQ4AiQgBCAyOAIUIAQgNDgCECAEIDM4AgwgBCAzIDKUIjU4AjwgBCA0IDKUIjY4AjQgBCAzIDSUIjM4AjAgBCAzOAIgIAQgNTgCHCAEIDY4AhggBCAzIDKUOAJIIAVBEGokACAAKAIMIgFBCGohDCABQQRqIQggACgCECABa0ECdSEJQQAhAwNAIAMgCU8EQCAAKAIkIgFBCGohDCABQQRqIQggACgCKCABa0ECdSEJQQAhAwNAIAMgCU8EQAJAIAAoAkgiBUEIaiEJIAVBBGohByAAKAJMIAVrQQJ1QQNuIgsgACgCAG4hDCAEQSRqIQ5BACEAQQAhAQNAQQAhAyABIAtPDQEDQCADIAxPBEAgASAMaiEBDAIFIAUgAEECdCIIaiIPIA4gA0ECdGoqAgAiMiAPKgIAlDgCACAHIAhqIg8gMiAPKgIAlDgCACAIIAlqIgggMiAIKgIAlDgCACAAQQNqIQAgA0EBaiEDDAELAAsACwALBSABIANBAnQiBWoiByAEKgIYIAcqAgCUOAIAIAUgCGoiByAEKgIcIAcqAgCUOAIAIAUgDGoiBSAEKgIgIAUqAgCUOAIAIANBBGohAwwBCwsgBEHgAGokAAUgASADQQJ0IgVqIgcgBCoCDCAHKgIAlDgCACAFIAhqIgcgBCoCECAHKgIAlDgCACAFIAxqIgUgBCoCFCAFKgIAlDgCACADQQNqIQMMAQsLBSAFIANBAnRqIAEgA2otAACzQwAAAMOSQwAAADyUOAIAIANBAWohAwwBCwsFIAEgEUECdGogBCARai0AALNDAAB/Q5VDAAAAv5JDmpkZPpU4AgAgEUEBaiERDAELCwUgASARQQJ0aiAFIBFqLQAAs0MAAIA9lEMAACDBkjgCACARQQFqIREMAQsLCyACQZABaiQAIA0QywMgIkHgAGokACAZEDogGUEQaiQAC5UBAQN/IAACfyAAKAIEIgIgACgCCEkEQCACIAEqAgA4AgAgAkEEagwBCyMAQSBrIgMkACADQQxqIAAgACgCBCAAKAIAa0ECdUEBahC2ASAAKAIEIAAoAgBrQQJ1IAAQhwIiAigCCCIEIAEqAgA4AgAgAiAEQQRqNgIIIAAgAhCFAiAAKAIEIAIQgQIgA0EgaiQACzYCBAvqAQEBfyMAQSBrIgYkACAGIAE2AhwCQCADKAIEQQFxRQRAIAZBfzYCACAAIAEgAiADIAQgBiAAKAIAKAIQEQYAIQECQAJAAkAgBigCAA4CAAECCyAFQQA6AAAMAwsgBUEBOgAADAILIAVBAToAACAEQQQ2AgAMAQsgBiADECcgBhBJIQEgBhAlIAYgAxAnIAYQmwEhACAGECUgBiAAEHwgBkEMciAAEHsgBSAGQRxqIAIgBiAGQRhqIgMgASAEQQEQzwEgBkY6AAAgBigCHCEBA0AgA0EMaxAgIgMgBkcNAAsLIAZBIGokACABC0ABAX9BACEAA38gASACRgR/IAAFIAEoAgAgAEEEdGoiAEGAgICAf3EiA0EYdiADciAAcyEAIAFBBGohAQwBCwsLCwAgACACIAMQmQMLVAECfwJAA0AgAyAERwRAQX8hACABIAJGDQIgASgCACIFIAMoAgAiBkgNAiAFIAZKBEBBAQ8FIANBBGohAyABQQRqIQEMAgsACwsgASACRyEACyAAC0ABAX9BACEAA38gASACRgR/IAAFIAEsAAAgAEEEdGoiAEGAgICAf3EiA0EYdiADciAAcyEAIAFBAWohAQwBCwsLCwAgACACIAMQuAMLXgEDfyABIAQgA2tqIQUCQANAIAMgBEcEQEF/IQAgASACRg0CIAEsAAAiBiADLAAAIgdIDQIgBiAHSgRAQQEPBSADQQFqIQMgAUEBaiEBDAILAAsLIAIgBUchAAsgAAuoAQEFfyAAKAJUIgMoAgAhBSADKAIEIgQgACgCFCAAKAIcIgdrIgYgBCAGSRsiBgRAIAUgByAGEHEaIAMgAygCACAGaiIFNgIAIAMgAygCBCAGayIENgIECyAEIAIgAiAESxsiBARAIAUgASAEEHEaIAMgAygCACAEaiIFNgIAIAMgAygCBCAEazYCBAsgBUEAOgAAIAAgACgCLCIBNgIcIAAgATYCFCACC1QBAn8gASAAKAJUIgEgAUEAIAJBgAJqIgMQ4AEiBCABayADIAQbIgMgAiACIANLGyICEHEaIAAgASADaiIDNgJUIAAgAzYCCCAAIAEgAmo2AgQgAgsJACAAEIkCEC0LEwAgACAAKAIAQQxrKAIAahCMAgsTACAAIAAoAgBBDGsoAgBqELEBCwoAIABBCGsQjAILCgAgAEEIaxCxAQsaACAAIAEgAikDCEEAIAMgASgCACgCEBEXAAsJACAAEPwBEC0LlAICAX8DfiABKAIYIAEoAixLBEAgASABKAIYNgIsC0J/IQgCQCAEQRhxIgVFIANBAUYgBUEYRnFyDQAgASgCLCIFBEAgBSABQSBqECNrrCEGCwJAAkACQCADDgMCAAEDCyAEQQhxBEAgASgCDCABKAIIa6whBwwCCyABKAIYIAEoAhRrrCEHDAELIAYhBwsgAiAHfCICQgBTIAIgBlVyDQAgBEEIcSEDAkAgAlANACADBEAgASgCDEUNAgsgBEEQcUUNACABKAIYRQ0BCyADBEAgASABKAIIIAEoAgggAqdqIAEoAiwQsgELIARBEHEEQCABIAEoAhQgASgCHBC6AyABIAKnELkDCyACIQgLIAAgCBCSAgv8AQEJfyMAQRBrIgMkAAJ/IAFBf0cEQCAAKAIMIQQgACgCCCEFIAAoAhggACgCHEYEQEF/IAAtADBBEHFFDQIaIAAoAhghBiAAKAIUIQcgACgCLCEIIAAoAhQhCSAAQSBqIgJBABC4ASACIAIQKBAhIAAgAhAjIgogAhAfIApqELoDIAAgBiAHaxC5AyAAIAAoAhQgCCAJa2o2AiwLIAMgACgCGEEBajYCDCAAIANBDGogAEEsahCgASgCADYCLCAALQAwQQhxBEAgACAAQSBqECMiAiACIAQgBWtqIAAoAiwQsgELIAAgAcAQwgMMAQsgARC2AwsgA0EQaiQAC5YBACAAKAIYIAAoAixLBEAgACAAKAIYNgIsCwJAIAAoAgggACgCDE8NACABQX9GBEAgACAAKAIIIAAoAgxBAWsgACgCLBCyASABELYDDwsgAC0AMEEQcUUEQCAAKAIMQQFrLQAAIAFB/wFxRw0BCyAAIAAoAgggACgCDEEBayAAKAIsELIBIAAoAgwgAcA6AAAgAQ8LQX8LZQAgACgCGCAAKAIsSwRAIAAgACgCGDYCLAsCQCAALQAwQQhxRQ0AIAAoAhAgACgCLEkEQCAAIAAoAgggACgCDCAAKAIsELIBCyAAKAIMIAAoAhBPDQAgACgCDCwAABCjAQ8LQX8LBwAgACgCDAsHACAAKAIICxMAIAAgACgCAEEMaygCAGoQjgILCgAgAEEIaxCOAgsTACAAIAAoAgBBDGsoAgBqENgBCwoAIABBCGsQ2AELEwAgACAAKAIAQQxrKAIAahDBAwsTACAAIAAoAgBBDGsoAgBqEI8CCxMAIAAgACgCAEEMaygCAGoQxgMLEwAgACAAKAIAQQxrKAIAahCQAguuAQEEfyMAQRBrIgUkAANAAkAgAiAETA0AIAAoAhgiAyAAKAIcIgZPBEAgACABLAAAEKMBIAAoAgAoAjQRBABBf0YNASAEQQFqIQQgAUEBaiEBBSAFIAYgA2s2AgwgBSACIARrNgIIIAVBDGogBUEIahCRAiEDIAAoAhggASADKAIAIgMQTSAAIAMgACgCGGo2AhggAyAEaiEEIAEgA2ohAQsMAQsLIAVBEGokACAECy8AIAAgACgCACgCJBEAAEF/RgRAQX8PCyAAIAAoAgwiAEEBajYCDCAALAAAEKMBCwQAQX8LvQEBBH8jAEEQayIEJAADQAJAIAIgBUwNAAJAIAAoAgwiAyAAKAIQIgZJBEAgBEH/////BzYCDCAEIAYgA2s2AgggBCACIAVrNgIEIARBDGogBEEIaiAEQQRqEJECEJECIQMgASAAKAIMIAMoAgAiAxBNIAAgACgCDCADajYCDAwBCyAAIAAoAgAoAigRAAAiA0F/Rg0BIAEgA8A6AABBASEDCyABIANqIQEgAyAFaiEFDAELCyAEQRBqJAAgBQsJACAAQn8QkgILCQAgAEJ/EJICCwQAIAALDAAgABCUAhogABAtCwwAIAAoAjwQFRDdAQs7AQF/IAAoAjwjAEEQayIAJAAgASACQf8BcSAAQQhqEBYQ3QEhAiAAKQMIIQEgAEEQaiQAQn8gASACGwspACABIAEoAgBBB2pBeHEiAUEQajYCACAAIAEpAwAgASkDCBCVAjkDAAu5FwMSfwF8A34jAEGwBGsiCyQAIAtBADYCLAJAIAG9IhlCAFMEQEEBIRBB+AghFCABmiIBvSEZDAELIARBgBBxBEBBASEQQfsIIRQMAQtB/ghB+QggBEEBcSIQGyEUIBBFIRcLAkAgGUKAgICAgICA+P8Ag0KAgICAgICA+P8AUQRAIABBICACIBBBA2oiBiAEQf//e3EQRSAAIBQgEBBCIABB5g1ByhUgBUEgcSIDG0G8EEH0FSADGyABIAFiG0EDEEIgAEEgIAIgBiAEQYDAAHMQRSACIAYgAiAGShshDQwBCyALQRBqIRECQAJAAkAgASALQSxqENIDIgEgAaAiAUQAAAAAAAAAAGIEQCALIAsoAiwiBkEBazYCLCAFQSByIhVB4QBHDQEMAwsgBUEgciIVQeEARg0CIAsoAiwhDAwBCyALIAZBHWsiDDYCLCABRAAAAAAAALBBoiEBC0EGIAMgA0EASBshCiALQTBqQaACQQAgDEEAThtqIg4hBwNAIAcgAfwDIgM2AgAgB0EEaiEHIAEgA7ihRAAAAABlzc1BoiIBRAAAAAAAAAAAYg0ACwJAIAxBAEwEQCAMIQkgByEGIA4hCAwBCyAOIQggDCEJA0BBHSAJIAlBHU8bIQMCQCAHQQRrIgYgCEkNACADrSEbQgAhGQNAIAYgBjUCACAbhiAZfCIaIBpCgJTr3AOAIhlCgJTr3AN+fT4CACAGQQRrIgYgCE8NAAsgGkKAlOvcA1QNACAIQQRrIgggGT4CAAsDQCAIIAciBkkEQCAGQQRrIgcoAgBFDQELCyALIAsoAiwgA2siCTYCLCAGIQcgCUEASg0ACwsgCUEASARAIApBGWpBCW5BAWohEiAVQeYARiETA0BBCUEAIAlrIgMgA0EJTxshDQJAIAYgCE0EQEEAQQQgCCgCABshBwwBC0GAlOvcAyANdiEWQX8gDXRBf3MhD0EAIQkgCCEHA0AgByAHKAIAIgMgDXYgCWo2AgAgAyAPcSAWbCEJIAdBBGoiByAGSQ0AC0EAQQQgCCgCABshByAJRQ0AIAYgCTYCACAGQQRqIQYLIAsgCygCLCANaiIJNgIsIA4gByAIaiIIIBMbIgMgEkECdGogBiAGIANrQQJ1IBJKGyEGIAlBAEgNAAsLQQAhCQJAIAYgCE0NACAOIAhrQQJ1QQlsIQlBCiEHIAgoAgAiA0EKSQ0AA0AgCUEBaiEJIAMgB0EKbCIHTw0ACwsgCiAJQQAgFUHmAEcbayAVQecARiAKQQBHcWsiAyAGIA5rQQJ1QQlsQQlrSARAIAtBMGpBhGBBpGIgDEEASBtqIANBgMgAaiIMQQltIgNBAnRqIQ1BCiEHIAwgA0EJbGsiA0EHTARAA0AgB0EKbCEHIANBAWoiA0EIRw0ACwsCQCANKAIAIgwgDCAHbiISIAdsayIPRSANQQRqIgMgBkZxDQACQCASQQFxRQRARAAAAAAAAEBDIQEgB0GAlOvcA0cgCCANT3INASANQQRrLQAAQQFxRQ0BC0QBAAAAAABAQyEBC0QAAAAAAADgP0QAAAAAAADwP0QAAAAAAAD4PyADIAZGG0QAAAAAAAD4PyAPIAdBAXYiA0YbIAMgD0sbIRgCQCAXDQAgFC0AAEEtRw0AIBiaIRggAZohAQsgDSAMIA9rIgM2AgAgASAYoCABYQ0AIA0gAyAHaiIDNgIAIANBgJTr3ANPBEADQCANQQA2AgAgCCANQQRrIg1LBEAgCEEEayIIQQA2AgALIA0gDSgCAEEBaiIDNgIAIANB/5Pr3ANLDQALCyAOIAhrQQJ1QQlsIQlBCiEHIAgoAgAiA0EKSQ0AA0AgCUEBaiEJIAMgB0EKbCIHTw0ACwsgDUEEaiIDIAYgAyAGSRshBgsDQCAGIgwgCE0iB0UEQCAGQQRrIgYoAgBFDQELCwJAIBVB5wBHBEAgBEEIcSETDAELIAlBf3NBfyAKQQEgChsiBiAJSiAJQXtKcSIDGyAGaiEKQX9BfiADGyAFaiEFIARBCHEiEw0AQXchBgJAIAcNACAMQQRrKAIAIg9FDQBBCiEDQQAhBiAPQQpwDQADQCAGIgdBAWohBiAPIANBCmwiA3BFDQALIAdBf3MhBgsgDCAOa0ECdUEJbCEDIAVBX3FBxgBGBEBBACETIAogAyAGakEJayIDQQAgA0EAShsiAyADIApKGyEKDAELQQAhEyAKIAMgCWogBmpBCWsiA0EAIANBAEobIgMgAyAKShshCgtBfyENIApB/f///wdB/v///wcgCiATciIPG0oNASAKIA9BAEdqQQFqIRYCQCAFQV9xIgdBxgBGBEAgCSAWQf////8Hc0oNAyAJQQAgCUEAShshBgwBCyARIAkgCUEfdSIDcyADa60gERCmASIGa0EBTARAA0AgBkEBayIGQTA6AAAgESAGa0ECSA0ACwsgBkECayISIAU6AAAgBkEBa0EtQSsgCUEASBs6AAAgESASayIGIBZB/////wdzSg0CCyAGIBZqIgMgEEH/////B3NKDQEgAEEgIAIgAyAQaiIJIAQQRSAAIBQgEBBCIABBMCACIAkgBEGAgARzEEUCQAJAAkAgB0HGAEYEQCALQRBqQQlyIQUgDiAIIAggDksbIgMhCANAIAg1AgAgBRCmASEGAkAgAyAIRwRAIAYgC0EQak0NAQNAIAZBAWsiBkEwOgAAIAYgC0EQaksNAAsMAQsgBSAGRw0AIAZBAWsiBkEwOgAACyAAIAYgBSAGaxBCIAhBBGoiCCAOTQ0ACyAPBEAgAEHrG0EBEEILIApBAEwgCCAMT3INAQNAIAg1AgAgBRCmASIGIAtBEGpLBEADQCAGQQFrIgZBMDoAACAGIAtBEGpLDQALCyAAIAZBCSAKIApBCU4bEEIgCkEJayEGIAhBBGoiCCAMTw0DIApBCUogBiEKDQALDAILAkAgCkEASA0AIAwgCEEEaiAIIAxJGyEDIAtBEGpBCXIhDCAIIQcDQCAMIAc1AgAgDBCmASIGRgRAIAZBAWsiBkEwOgAACwJAIAcgCEcEQCAGIAtBEGpNDQEDQCAGQQFrIgZBMDoAACAGIAtBEGpLDQALDAELIAAgBkEBEEIgBkEBaiEGIAogE3JFDQAgAEHrG0EBEEILIAAgBiAMIAZrIgUgCiAFIApIGxBCIAogBWshCiAHQQRqIgcgA08NASAKQQBODQALCyAAQTAgCkESakESQQAQRSAAIBIgESASaxBCDAILIAohBgsgAEEwIAZBCWpBCUEAEEULIABBICACIAkgBEGAwABzEEUgAiAJIAIgCUobIQ0MAQsgFCAFQRp0QR91QQlxaiEJAkAgA0ELSw0AQQwgA2shBkQAAAAAAAAwQCEYA0AgGEQAAAAAAAAwQKIhGCAGQQFrIgYNAAsgCS0AAEEtRgRAIBggAZogGKGgmiEBDAELIAEgGKAgGKEhAQsgESALKAIsIgcgB0EfdSIGcyAGa60gERCmASIGRgRAIAZBAWsiBkEwOgAAIAsoAiwhBwsgEEECciEKIAVBIHEhDCAGQQJrIg4gBUEPajoAACAGQQFrQS1BKyAHQQBIGzoAACAEQQhxRSADQQBMcSEIIAtBEGohBwNAIAciBSAB/AIiBkGA9QBqLQAAIAxyOgAAIAEgBrehRAAAAAAAADBAoiIBRAAAAAAAAAAAYSAIcSAHQQFqIgcgC0EQamtBAUdyRQRAIAVBLjoAASAFQQJqIQcLIAFEAAAAAAAAAABiDQALQX8hDSADQf3///8HIAogESAOayIIaiIGa0oNACAAQSAgAiAGIANBAmogByALQRBqIgVrIgcgB0ECayADSBsgByADGyIDaiIGIAQQRSAAIAkgChBCIABBMCACIAYgBEGAgARzEEUgACAFIAcQQiAAQTAgAyAHa0EAQQAQRSAAIA4gCBBCIABBICACIAYgBEGAwABzEEUgAiAGIAIgBkobIQ0LIAtBsARqJAAgDQsEAEIAC9YCAQd/IwBBIGsiAyQAIAMgACgCHCIENgIQIAAoAhQhBSADIAI2AhwgAyABNgIYIAMgBSAEayIBNgIUIAEgAmohBSADQRBqIQFBAiEHAn8CQAJAAkAgACgCPCABQQIgA0EMahAKEN0BBEAgASEEDAELA0AgBSADKAIMIgZGDQIgBkEASARAIAEhBAwECyABQQhBACAGIAEoAgQiCEsiCRtqIgQgBiAIQQAgCRtrIgggBCgCAGo2AgAgAUEMQQQgCRtqIgEgASgCACAIazYCACAFIAZrIQUgACgCPCAEIgEgByAJayIHIANBDGoQChDdAUUNAAsLIAVBf0cNAQsgACAAKAIsIgE2AhwgACABNgIUIAAgASAAKAIwajYCECACDAELIABBADYCHCAAQgA3AxAgACAAKAIAQSByNgIAQQAgB0ECRg0AGiACIAQoAgRrCyADQSBqJAALiQIBA38jAEEQayIAJAACQCAAQQxqIABBCGoQFA0AQYDuASAAKAIMQQJ0QQRqEDQiATYCACABRQ0AIAAoAggQNCIBBEBBgO4BKAIAIgIgACgCDEECdGpBADYCACACIAEQE0UNAQtBgO4BQQA2AgALIABBEGokAEGU4AFBADYCAEGQ4AFBATYCABCQA0GU4AFBsOABKAIANgIAQbDgAUGQ4AE2AgBBtOABQS42AgBBuOABQQA2AgAQnAJBuOABQbDgASgCADYCAEGw4AFBtOABNgIAQdzhAUHk4AE2AgBBtOEBQYCABDYCAEGw4QFB8P4FNgIAQZThAUEqNgIAQbjhAUG43QEoAgA2AgALC8jAASoAQYAIC4QYbG9hZF9zcHoAaW5maW5pdHkARmVicnVhcnkASmFudWFyeQBKdWx5AFRodXJzZGF5AFR1ZXNkYXkAV2VkbmVzZGF5AFNhdHVyZGF5AFN1bmRheQBNb25kYXkARnJpZGF5AE1heQAlbS8lZC8leQAtKyAgIDBYMHgALTBYKzBYIDBYLTB4KzB4IDB4AE5vdgBUaHUAQXVndXN0AHVuc2lnbmVkIHNob3J0AHVuc2lnbmVkIGludABpbnZhbGlkIGxpdGVyYWwvbGVuZ3RocyBzZXQAaW52YWxpZCBjb2RlIGxlbmd0aHMgc2V0AHVua25vd24gaGVhZGVyIGZsYWdzIHNldABpbnZhbGlkIGRpc3RhbmNlcyBzZXQAZ2V0AE9jdABmbG9hdABpbnZhbGlkIGJpdCBsZW5ndGggcmVwZWF0AFNhdABudW1Qb2ludHMAY29sb3JzAFVucGFja09wdGlvbnMAcG9zaXRpb25zAHJvdGF0aW9ucwB0b28gbWFueSBsZW5ndGggb3IgZGlzdGFuY2Ugc3ltYm9scwBpbnZhbGlkIHN0b3JlZCBibG9jayBsZW5ndGhzAHNjYWxlcwBhbHBoYXMAW1NQWjogRVJST1JdIENoZWNrIGZhaWxlZDogJXM6JWQ6ICVzAHZmMzJfcHRyAEFwcgB2ZWN0b3IAbW9uZXlfZ2V0IGVycm9yAFtTUFogRVJST1JdIGRlc2VyaWFsaXplUGFja2VkR2F1c3NpYW5zOiByZWFkIGVycm9yAE9jdG9iZXIATm92ZW1iZXIAU2VwdGVtYmVyAERlY2VtYmVyAHVuc2lnbmVkIGNoYXIAaW9zX2Jhc2U6OmNsZWFyAE1hcgAvZW1zZGsvZW1zY3JpcHRlbi9zeXN0ZW0vbGliL2xpYmN4eGFiaS9zcmMvcHJpdmF0ZV90eXBlaW5mby5jcHAAU2VwACVJOiVNOiVTICVwAFN1bgBKdW4ATW9uAG5hbgBKYW4AY29vcmRpbmF0ZVN5c3RlbQBDb29yZGluYXRlU3lzdGVtAEp1bABib29sAGxsAEFwcmlsAGludmFsaWQgY29kZSAtLSBtaXNzaW5nIGVuZC1vZi1ibG9jawBpbmNvcnJlY3QgaGVhZGVyIGNoZWNrAGluY29ycmVjdCBsZW5ndGggY2hlY2sAaW5jb3JyZWN0IGRhdGEgY2hlY2sAcHVzaF9iYWNrAGludmFsaWQgZGlzdGFuY2UgdG9vIGZhciBiYWNrAEZyaQBzaABoZWFkZXIgY3JjIG1pc21hdGNoAE1hcmNoAEF1ZwB1bnNpZ25lZCBsb25nIGxvbmcAdW5zaWduZWQgbG9uZwBzdGQ6OndzdHJpbmcAYmFzaWNfc3RyaW5nAHN0ZDo6c3RyaW5nAHN0ZDo6dTE2c3RyaW5nAHN0ZDo6dTMyc3RyaW5nAGluZgAlLjBMZgAlTGYAcmVzaXplAGludmFsaWQgd2luZG93IHNpemUAdHJ1ZQBUdWUAZmFsc2UAaW52YWxpZCBibG9jayB0eXBlAEp1bmUAZG91YmxlAHNoRGVncmVlAGJhZF9hcnJheV9uZXdfbGVuZ3RoIHdhcyB0aHJvd24gaW4gLWZuby1leGNlcHRpb25zIG1vZGUAaW52YWxpZCBsaXRlcmFsL2xlbmd0aCBjb2RlAGludmFsaWQgZGlzdGFuY2UgY29kZQBSYXdHYXVzc2lhbkNsb3VkAHVua25vd24gY29tcHJlc3Npb24gbWV0aG9kAFtTUFogRVJST1JdIGRlc2VyaWFsaXplUGFja2VkR2F1c3NpYW5zOiBoZWFkZXIgbm90IGZvdW5kACUwKmxsZAAlKmxsZAArJWxsZAAlKy40bGQAdm9pZABsb2NhbGUgbm90IHN1cHBvcnRlZABhbnRpYWxpYXNlZABXZWQAJVktJW0tJWQAW1NQWiBFUlJPUl0gZGVzZXJpYWxpemVQYWNrZWRHYXVzc2lhbnM6IFRvbyBtYW55IHBvaW50czogJWQAW1NQWiBFUlJPUl0gZGVzZXJpYWxpemVQYWNrZWRHYXVzc2lhbnM6IFVuc3VwcG9ydGVkIFNIIGRlZ3JlZTogJWQAW1NQWiBFUlJPUl0gZGVzZXJpYWxpemVQYWNrZWRHYXVzc2lhbnM6IHZlcnNpb24gbm90IHN1cHBvcnRlZDogJWQARGVjAC4vc3B6L3NyYy9jYy9sb2FkLXNwei5jYwBGZWIAJWEgJWIgJWQgJUg6JU06JVMgJVkAUE9TSVgAVmVjdG9yVUludDhUACVIOiVNOiVTAE5BTgBQTQBBTQAlSDolTQBMQ19BTEwAQVNDSUkATEFORwBSVUYATFVGAElORgBSREYATERGAFVOU1BFQ0lGSUVEAEMAUlVCAExVQgBSREIATERCAGNhdGNoaW5nIGEgY2xhc3Mgd2l0aG91dCBhbiBvYmplY3Q/AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHNob3J0PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1bnNpZ25lZCBzaG9ydD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8aW50PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1bnNpZ25lZCBpbnQ+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PGZsb2F0PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1aW50OF90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxpbnQ4X3Q+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHVpbnQxNl90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxpbnQxNl90PgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1aW50NjRfdD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8aW50NjRfdD4AZW1zY3JpcHRlbjo6bWVtb3J5X3ZpZXc8dWludDMyX3Q+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PGludDMyX3Q+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PGNoYXI+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHVuc2lnbmVkIGNoYXI+AGVtc2NyaXB0ZW46Om1lbW9yeV92aWV3PHNpZ25lZCBjaGFyPgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxsb25nPgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzx1bnNpZ25lZCBsb25nPgBlbXNjcmlwdGVuOjptZW1vcnlfdmlldzxkb3VibGU+ADAxMjM0NTY3ODkAQy5VVEYtOABWZWN0b3JGbG9hdDMyADEuMy4xAC4ALQAocGFja2VkLmFscGhhcy5zaXplKCkpID09IChudW1Qb2ludHMpAChudWxsKQAocGFja2VkLmNvbG9ycy5zaXplKCkpID09IChudW1Qb2ludHMgKiAzKQAocGFja2VkLnNjYWxlcy5zaXplKCkpID09IChudW1Qb2ludHMgKiAzKQAocGFja2VkLnNoLnNpemUoKSkgPT0gKG51bVBvaW50cyAqIHNoRGltICogMykAKHBhY2tlZC5yb3RhdGlvbnMuc2l6ZSgpKSA9PSAobnVtUG9pbnRzICogKHBhY2tlZC51c2VzUXVhdGVybmlvblNtYWxsZXN0VGhyZWUgPyA0IDogMykpAChwYWNrZWQucG9zaXRpb25zLnNpemUoKSkgPT0gKG51bVBvaW50cyAqIDMgKiAodXNlc0Zsb2F0MTYgPyAyIDogMykpACUAbGVuZ3RoX2Vycm9yIHdhcyB0aHJvd24gaW4gLWZuby1leGNlcHRpb25zIG1vZGUgd2l0aCBtZXNzYWdlICIlcyIAUHVyZSB2aXJ0dWFsIGZ1bmN0aW9uIGNhbGxlZCEAW1NQWjogRVJST1JdIFVuc3VwcG9ydGVkIFNIIGRlZ3JlZTogJWQKAAkAAAAAgD8AAIA/AACAPwAAgD8AAIA/AACAPwAAgD8AAIA/AACAPwAAgD8AAIA/AACAPwAAgD8AAIA/AACAPwBBkCALthMgEAAA9GwAAPRsAABAEAAAqG0AACgQAABOM3NwejEzR2F1c3NpYW5DbG91ZEUAAACobQAASBAAAE4zc3B6MTNVbnBhY2tPcHRpb25zRQBwcGlpcAD0bAAAbBAAAKhtAAB0EAAATlN0M19fMjZ2ZWN0b3JJZk5TXzlhbGxvY2F0b3JJZkVFRUUAaXBwACxuAADEEAAAAAAAAAMAAADcEAAAAAAAACgSAAAAAAAAWBIAAAAAAABOU3QzX18yOG9wdGlvbmFsSWZFRQAAAADQbQAA6BAAABgRAABOU3QzX18yMjdfX29wdGlvbmFsX21vdmVfYXNzaWduX2Jhc2VJZkxiMUVFRQAAAADQbQAAJBEAAFQRAABOU3QzX18yMjdfX29wdGlvbmFsX2NvcHlfYXNzaWduX2Jhc2VJZkxiMUVFRQAAAADQbQAAYBEAAIgRAABOU3QzX18yMjBfX29wdGlvbmFsX21vdmVfYmFzZUlmTGIxRUVFAAAA0G0AAJQRAAC8EQAATlN0M19fMjIwX19vcHRpb25hbF9jb3B5X2Jhc2VJZkxiMUVFRQAAANBtAADIEQAA9BEAAE5TdDNfXzIyM19fb3B0aW9uYWxfc3RvcmFnZV9iYXNlSWZMYjBFRUUAAAAAqG0AAPwRAABOU3QzX18yMjRfX29wdGlvbmFsX2Rlc3RydWN0X2Jhc2VJZkxiMUVFRQAAAKhtAAAwEgAATlN0M19fMjE4X19zZmluYWVfY3Rvcl9iYXNlSUxiMUVMYjFFRUUAAKhtAABgEgAATlN0M19fMjIwX19zZmluYWVfYXNzaWduX2Jhc2VJTGIxRUxiMUVFRQAAAACIbgAAnBIAAAAAAABsEAAAUE5TdDNfXzI2dmVjdG9ySWZOU185YWxsb2NhdG9ySWZFRUVFAAAAAIhuAADUEgAAAQAAAGwQAABQS05TdDNfXzI2dmVjdG9ySWZOU185YWxsb2NhdG9ySWZFRUVFAHBwAHYAdnAAAACMEgAAcHAAAJRsAACMEgAAPG0AAHZwcGQAAAAAlGwAAIwSAAAYbQAAPG0AAHZwcHBkAAAAGG0AAMQSAABwcHAATBMAADxtAACobQAAVBMAAE4xMGVtc2NyaXB0ZW4zdmFsRQAAnBAAAGwQAAAYbQAAcHBwcAAAAAAAAAAArGwAAGwQAAAYbQAAPG0AAGlwcHBkAAAALG4AAMATAAAAAAAAAwAAANgTAAAAAAAAKBIAAAAAAABYEgAAAAAAAE5TdDNfXzI4b3B0aW9uYWxJaEVFAAAAANBtAADkEwAAFBQAAE5TdDNfXzIyN19fb3B0aW9uYWxfbW92ZV9hc3NpZ25fYmFzZUloTGIxRUVFAAAAANBtAAAgFAAAUBQAAE5TdDNfXzIyN19fb3B0aW9uYWxfY29weV9hc3NpZ25fYmFzZUloTGIxRUVFAAAAANBtAABcFAAAhBQAAE5TdDNfXzIyMF9fb3B0aW9uYWxfbW92ZV9iYXNlSWhMYjFFRUUAAADQbQAAkBQAALgUAABOU3QzX18yMjBfX29wdGlvbmFsX2NvcHlfYmFzZUloTGIxRUVFAAAA0G0AAMQUAADwFAAATlN0M19fMjIzX19vcHRpb25hbF9zdG9yYWdlX2Jhc2VJaExiMEVFRQAAAACobQAA+BQAAE5TdDNfXzIyNF9fb3B0aW9uYWxfZGVzdHJ1Y3RfYmFzZUloTGIxRUVFAAAAqG0AACwVAABOU3QzX18yNnZlY3RvckloTlNfOWFsbG9jYXRvckloRUVFRQCIbgAAYBUAAAAAAAAkFQAAUE5TdDNfXzI2dmVjdG9ySWhOU185YWxsb2NhdG9ySWhFRUVFAAAAAIhuAACYFQAAAQAAACQVAABQS05TdDNfXzI2dmVjdG9ySWhOU185YWxsb2NhdG9ySWhFRUVFAHBwAHZwAFAVAABwcAAAlGwAAFAVAADEbAAAdnBwaQAAAACUbAAAUBUAABhtAADEbAAAdnBwcGkAAAAYbQAAiBUAAHBwcABMEwAAxGwAAJgTAAAkFQAAGG0AAHBwcHAAAAAArGwAACQVAAAYbQAAxGwAAGlwcHBpAHAAdnAAaXBwAHZwcGkAaXBwAHZwcGkAcHBwAHZwcHAAAABcbQAAYBYAAE4zc3B6MTZDb29yZGluYXRlU3lzdGVtRQBwAHZwAGlwcAB2cHBpAAAAAAAAAwAAAAgAAAAPAAAAqG0AAKAWAABOU3QzX18yMTJiYXNpY19zdHJpbmdJY05TXzExY2hhcl90cmFpdHNJY0VFTlNfOWFsbG9jYXRvckljRUVFRQAAqG0AAOgWAABOU3QzX18yMTJiYXNpY19zdHJpbmdJd05TXzExY2hhcl90cmFpdHNJd0VFTlNfOWFsbG9jYXRvckl3RUVFRQAAqG0AADAXAABOU3QzX18yMTJiYXNpY19zdHJpbmdJRHNOU18xMWNoYXJfdHJhaXRzSURzRUVOU185YWxsb2NhdG9ySURzRUVFRQAAAKhtAAB8FwAATlN0M19fMjEyYmFzaWNfc3RyaW5nSURpTlNfMTFjaGFyX3RyYWl0c0lEaUVFTlNfOWFsbG9jYXRvcklEaUVFRUUAAACobQAAyBcAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWNFRQAAqG0AAPAXAABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0lhRUUAAKhtAAAYGAAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJaEVFAACobQAAQBgAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SXNFRQAAqG0AAGgYAABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0l0RUUAAKhtAACQGAAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJaUVFAACobQAAuBgAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWpFRQAAqG0AAOAYAABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0lsRUUAAKhtAAAIGQAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJbUVFAACobQAAMBkAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SXhFRQAAqG0AAFgZAABOMTBlbXNjcmlwdGVuMTFtZW1vcnlfdmlld0l5RUUAAKhtAACAGQAATjEwZW1zY3JpcHRlbjExbWVtb3J5X3ZpZXdJZkVFAACobQAAqBkAAE4xMGVtc2NyaXB0ZW4xMW1lbW9yeV92aWV3SWRFRQBB1DMLoSiWMAd3LGEO7rpRCZkZxG0Hj/RqcDWlY+mjlWSeMojbDqS43Hke6dXgiNnSlytMtgm9fLF+By2455Edv5BkELcd8iCwakhxufPeQb6EfdTaGuvk3W1RtdT0x4XTg1aYbBPAqGtkevli/ezJZYpPXAEU2WwGY2M9D/r1DQiNyCBuO14QaUzkQWDVcnFnotHkAzxH1ARL/YUN0mu1CqX6qLU1bJiyQtbJu9tA+bys42zYMnVc30XPDdbcWT3Rq6ww2SY6AN5RgFHXyBZh0L+19LQhI8SzVpmVus8Ppb24nrgCKAiIBV+y2QzGJOkLsYd8by8RTGhYqx1hwT0tZraQQdx2BnHbAbwg0pgqENXviYWxcR+1tgal5L+fM9S46KLJB3g0+QAPjqgJlhiYDuG7DWp/LT1tCJdsZJEBXGPm9FFra2JhbBzYMGWFTgBi8u2VBmx7pQEbwfQIglfED/XG2bBlUOm3Euq4vot8iLn83x3dYkkt2hXzfNOMZUzU+1hhsk3OUbU6dAC8o+Iwu9RBpd9K15XYPW3E0aT79NbTaulpQ/zZbjRGiGet0Lhg2nMtBETlHQMzX0wKqsl8Dd08cQVQqkECJxAQC76GIAzJJbVoV7OFbyAJ1Ga5n+Rhzg753l6YydkpIpjQsLSo18cXPbNZgQ20LjtcvbetbLrAIIO47bazv5oM4rYDmtKxdDlH1eqvd9KdFSbbBIMW3HMSC2PjhDtklD5qbQ2oWmp6C88O5J3/CZMnrgAKsZ4HfUSTD/DSowiHaPIBHv7CBmldV2L3y2dlgHE2bBnnBmtudhvU/uAr04laetoQzErdZ2/fufn5776OQ763F9WOsGDoo9bWfpPRocTC2DhS8t9P8We70WdXvKbdBrU/SzaySNorDdhMGwqv9koDNmB6BEHD72DfVd9nqO+ObjF5vmlGjLNhyxqDZryg0m8lNuJoUpV3DMwDRwu7uRYCIi8mBVW+O7rFKAu9spJatCsEarNcp//XwjHP0LWLntksHa7eW7DCZJsm8mPsnKNqdQqTbQKpBgmcPzYO64VnB3ITVwAFgkq/lRR6uOKuK7F7OBu2DJuO0pINvtXlt+/cfCHf2wvU0tOGQuLU8fiz3Whug9ofzRa+gVsmufbhd7Bvd0e3GOZaCIhwag//yjsGZlwLARH/nmWPaa5i+NP/a2FFz2wWeOIKoO7SDddUgwROwrMDOWEmZ6f3FmDQTUdpSdt3bj5KatGu3FrW2WYL30DwO9g3U668qcWeu95/z7JH6f+1MBzyvb2KwrrKMJOzU6ajtCQFNtC6kwbXzSlX3lS/Z9kjLnpms7hKYcQCG2hdlCtvKje+C7ShjgzDG98FWo3vAi0AAAAARjtnZYx2zsrKTamvWevtTh/QiivVnSOEk6ZE4bLW25307bz4PqAVV3ibcjLrPTbTrQZRtmdL+BkhcJ98JavG4GOQoYWp3Qgq7+ZvT3xAK646e0zL8DblZLYNggGXfR190UZ6GBsL07ddMLTSzpbwM4itl1ZC4D75BNtZnAtQ/BpNa5t/hyYy0MEdVbVSuxFUFIB2Md7N356Y9rj7uYYnh/+9QOI18OlNc8uOKOBtysmmVq2sbBsEAyogY2Yu+zr6aMBdn6KN9DDktpNVdxDXtDErsNH7Zhl+vV1+G5wt4WfaFoYCEFsvrVZgSMjFxgwpg/1rTEmwwuMPi6WGFqD4NVCbn1Ca1jb/3O1Rmk9LFXsJcHIewz3bsYUGvNSkdiOo4k1EzSgA7WJuO4oH/Z3O5rumqYNx6wAsN9BnSTMLPtV1MFmwv33wH/lGl3pq4NObLNu0/uaWHVGgrXo0gd3lSMfmgi0NqyuCS5BM59g2CAaeDW9jVEDGzBJ7oakd8AQvW8tjSpGGyuXXva2ARBvpYQIgjgTIbSerjlZAzq8m37LpHbjXI1AReGVrdh32zTL8sPZVmXq7/DY8gJtTOFvCz35gpaq0LQwF8hZrYGGwL4Eni0jk7cbhS6v9hi6KjRlSzLZ+Nwb715hAwLD902b0HJVdk3lfEDrWGStdsyxA8Wtqe5YOoDY/oeYNWMR1qxwlM5B7QPnd0u+/5rWKnpYq9titTZMS4OQ8VNuDWcd9x7iBRqDdSwsJcg0wbhcJ6zeLT9BQ7oWd+UHDpp4kUADaxRY7vaDcdhQPmk1zars97Bb9BotzN0si3HFwRbni1gFYpO1mPW6gz5Iom6j3JxANcWErahSrZsO77V2k3n774D84wIda8o0u9bS2SZCVxtbs0/2xiRmwGCZfi39DzC07oooWXMdAW/VoBmCSDQK7y5FEgKz0js0FW8j2Yj5bUCbfHWtButcm6BWRHY9wsG0QDPZWd2k8G97GeiC5o+mG/UKvvZonZfAziCPLVO064AlefNtuO7aWx5TwraDxYwvkECUwg3XvfSraqUZNv4g20sPODbWmBEAcCUJ7e2zR3T+Nl+ZY6F2r8UcbkJYiH0vPvllwqNuTPQF01QZmEUagIvAAm0WVytbsOozti1+tnRQj66ZzRiHr2uln0L2M9Hb5bbJNngh4ADenPjtQwjGw9UR3i5IhvcY7jvv9XOtoWxgKLmB/b+Qt1sCiFrGlg2Yu2cVdSbwPEOATSSuHdtqNw5ectqTyVvsNXRDAajgUGzOkUiBUwZht/W7eVpoLTfDe6gvLuY/BhhAgh713RabN6Dng9o9cKrsm82yAQZb/JgV3uR1iEnNQy701a6zYAAAAAFiA4tfxBrR0qYZWo+INaOm6jYo+EwvcnUuLPkqFHaEJ3Z1D3nQbFX0sm/eqZxDJ4D+QKzeWFn2UzpafQwo7QhNSu6DE+z32Z6O9FLDoNir6sLbILRkwno5BsHxZjybjGtemAc1+IFduJqC1uW0ri/M1q2kknC0/h8St3VAUdoQmTPZm8eVwMFK98NKF9nvsz677DhgHfVi7X/26bJFrJS/J68f4YG2RWzjtc4xzZk3GK+avEYJg+bLa4BtlHk3GNUbNJOLvS3JBt8uQlvxArtykwEwLDUYaqFXG+H+bUGc8w9CF62pW00gy1jGfeV0P1SHd7QKIW7uh0NtZdijsCE1wbOqa2eq8OYFqXu7K4WCkkmGCczvn1NBjZzYHrfGpRPVxS5Nc9x0wBHf/50/8wa0XfCN6vvp12eZ6lw4i10peeleoidPR/iqLURz9wNoit5hawGAx3JbDaVx0FKfK61f/SgmAVsxfIw5MvfRFx4O+HUdhabTBN8rsQdUdPJqMa2QabrzNnDgflRzayN6X5IKGFwZVL5FQ9ncRsiG5hy1i4QfPtUiBmRYQAXvBW4pFiwMKp1yqjPH/8gwTKDahznhuISyvx6d6DJ8nmNvUrKaRjCxERiWqEuV9KvAys7xvces8jaZCutsFGjo50lGxB5gJMeVPoLez7Pg3UTtQ2BGaCFjzTaHepe75Xkc5stV5c+pVm6RD080HG1Mv0NXFsJONRVJEJMME53xD5jA3yNh6b0g6rcbObA6eTo7ZWuNTiQJjsV6r5ef982UFKrjuO2Dgbtm3SeiPFBFobcPf/vKAh34QVy74RvR2eKQjPfOaaWVzeL7M9S4dlHXMykSulbwcLndrtaghyO0owx+mo/1V/iMfglelSSEPJav2wbM0tZkz1mIwtYDBaDViFiO+XFx7Pr6L0rjoKIo4Cv9OldevFhU1eL+TY9vnE4EMrJi/RvQYXZFdngsyBR7p5cuIdqaTCJRxOo7C0mIOIAUphR5PcQX8mNiDqjuAA0jseDQZ1yC0+wCJMq2j0bJPdJo5cT7CuZPpaz/FSjO/J539KbjepalaCQwvDKpUr+59HyTQN0ekMuDuImRDtqKGlHIPW8Qqj7kTgwnvsNuJDWeQAjMtyILR+mEEh1k5hGWO9xL6za+SGBoGFE65XpSsbhUfkiRNn3Dz5BkmULyZxIdsQp3xNMJ/Jp1EKYXFxMtSjk/1GNbPF89/SUFsJ8mju+lfPPix394vGFmIjEDZalsLUlQRU9K2xvpU4GWi1AKyZnnf4j75PTWXf2uWz/+JQYR0twvc9FXcdXIDfy3y4ajjZH7ru+ScPBJiyp9K4ihIAWkWAlnp9NXwb6J2qO9AoQAAAADhtlLvg2vUBWLdhuoG16gL52H65IW8fA5kCi7hDK5RF+0YA/iPxYUSbnPX/Qp5+Rzrz6vziRItGWikf/YYXKMu+erxwZs3dyt6gSXEHosLJf89Wcqd4N8gfFaNzxTy8jn1RKDWl5kmPHYvdNMSJVoy85MI3ZFOjjdw+NzYMLhGXdEOFLKz05JYUmXAtzZv7lbX2by5tQQ6U1SyaLw8FhdK3aBFpb99w09ey5GgOsG/Qdt37a65qmtEWBw5qyjk5XPJUrecq48xdko5Y5kuM014z4Ufl61YmX1M7suSJEq0ZMX85ounIWBhRpcyjiKdHG/DK06AofbIakBAmoVgcI26gcbfVeMbWb8CrQtQZqclsYcRd17lzPG0BHqjW2ze3K2NaI5C77UIqA4DWkdqCXSmi78mSelioKMI1PJMeCwulJmafHv7R/qRGvGofn77hp+fTdRw/ZBSmhwmAHV0gn+DlTQtbPfpq4YWX/lpclXXiJPjhWfxPgONEIhRYlDIy+exfpkI06Mf4jIVTQ1WH2Pst6kxA9V0t+k0wuUGXGaa8L3QyB/fDU71PrscGlqxMvu7B2AU2drm/jhstBFIlGjJqSI6Jsv/vMwqSe4jTkPAwq/1ki3NKBTHLJ5GKEQ6Od6ljGsxx1Ht2ybnvzRC7ZHVo1vDOsGGRdAgMBc/geZrrmBQOUECjb+r4zvtRIcxw6Vmh5FKBFoXoOXsRU+NSDq5bP5oVg4j7rzvlbxTi5+SsmopwF0I9Ea36UIUWJm6yIB4DJpvGtEchftnTmqfbWCLftsyZBwGtI79sOZhlRSZl3Siy3gWf02S98kffZPDMZxydWNzEKjlmfEet3axXi3zUOh/HDI1+fbTg6sZt4mF+FY/1xc04lH91VQDEr3wfORcRi4LPpuo4d8t+g67J9TvWpGGADhMAOrZ+lIFqQKO3Ui03DIqaVrYy98IN6/VJtZOY3Q5LL7y080IoDylrN/KRBqNJSbHC8/HcVkgo3t3wULNJS4gEKPEwabxK+GW5hQAILT7Yv0yEYNLYP7nQU4fBvcc8GQqmhqFnMj17Ti3AwyO5exuU2MGj+Ux6evvHwgKWU3naITLDYkymeL5ykU6GHwX1XqhkT+bF8PQ/x3tMR6rv958djk0ncBr2/VkFC0U0kbCdg/AKJe5ksfzs7wmEgXuyXDYaCORbjrM0S6gSTCY8qZSRXRMs/Mmo9f5CEI2T1qtVJLcR7UkjqjdgPFePDajsV7rJVu/XXe021dZVTrhC7pYPI1QuYrfv8lyA2coxFGIShnXYquvhY3PpatsLhP5g0zOf2mteC2GxdxScCRqAJ9Gt4Z1pwHUmsML+nsivaiUQGAufqHWfJEAAAAAQ8umh8eQPNSEW5pTzycIc4zsrvQItzSnS3ySIJ5PEObdhLZhWd8sMhoUirVRaBiVEqO+Epb4JEHVM4LGfZlRFz5S95C6CW3D+cLLRLK+WWTxdf/jdS5lsDblwzfj1kHxoB3ndiRGfSVnjduiLPFJgm867wXrYXVWqKrT0foyoy65+QWpPaKf+n5pOX01Fatddt4N2vKFl4mxTjEOZH2zyCe2FU+j7Y8c4CYpm6tau7vokR08bMqHby8BIeiHq/I5xGBUvkA7zu0D8GhqSIz6SgtHXM2PHMaezNdgGRnk4t9aL0RY3nTeC52/eIzWw+qslQhMKxFT1nhSmHD/9GVGXbeu4Noz9XqJcD7cDjtCTi54ieip/NJy+r8Z1H1qKla7KeHwPK26am/ucczopQ1eyObG+E9inWIcIVbEm4n8F0rKN7HNTmwrng2njRlG2x85BRC5voFLI+3CgIVqF7MHrFR4oSvQIzt4k+id/9iUD9+bX6lYHwQzC1zPlYwOV+VzTZxD9MnH2aeKDH8gwXDtAIK7S4cG4NHURSt3U5AY9ZXT01MSV4jJQRRDb8ZfP/3mHPRbYZivwTLbZGe1c860ZDAFEuO0Xoiw95UuN7zpvBf/IhqQe3mAwziyJkTtgaSCrkoCBSoRmFZp2j7RIqas8WFtCnblNpAlpv02oujLjLqrACo9L1uwbmyQFukn7ITJZCciTuB8uB2jtx6adoScXDVPOtuxFKCI8t8GD7mjlC/6aDKofjOo+z34DnyVUt2t1pl7KlLC4XkRCUf+WnXV3hm+c1md5ekK3i5PjQsdzUtI1mvMzI3xn49GVxjEOsU4h/FjvwOq+exAYV9rEvkvlFEyiRPVaRNAlqK1x93eJ+eeFYFgGk4bM1mFvbSMtj9yz32Z9UsmA6YI7aUhQ5E3AQBakYaEAQvVx8qtUm9gfoMsq9gEqPBCV+s75NCgR3bw44zQd2fXSiQkHOyj8S9uZbLkyOI2v1KxdXT0Nj4IZhZ9w8CR+ZhawrpT/EUcrsrnX2VsYNs+9jOY9VC004nClJBCZBMUGf5AV9JYx4Lh2gHBKnyGRXHm1Qa6QFJNxtJyDg109YpW7qbJnUghYTeb8CL8PXemp6ck5WwBo64Qk4Pt2zUEaYCvVypLCdD/eIsWvLMtkTjot8J7IxFFMF+DZXOUJeL3z7+xtAQZNuacacmlV89OIQxVHWLH85opu2G6anDHPe4rXW6t4PvpeNN5LzsY36i/Q0X7/IjjfLf0cVz0P9fbcGRNiDOv6w+bBTje2M6eWVyVBAofXqKNVCIwrRfpliqTsgx50Hmq/gVKKDhGgY6/wtoU7IERsmvKbSBLiaaGzA39HJ9ONroYEAARABIAAAAIAAcACQAGAAoABQALAAQADAADAA0AAgAOAAEADwBBgNwAC6IVYAcAAAAIUAAACBAAFAhzABIHHwAACHAAAAgwAAAJwAAQBwoAAAhgAAAIIAAACaAAAAgAAAAIgAAACEAAAAngABAHBgAACFgAAAgYAAAJkAATBzsAAAh4AAAIOAAACdAAEQcRAAAIaAAACCgAAAmwAAAICAAACIgAAAhIAAAJ8AAQBwQAAAhUAAAIFAAVCOMAEwcrAAAIdAAACDQAAAnIABEHDQAACGQAAAgkAAAJqAAACAQAAAiEAAAIRAAACegAEAcIAAAIXAAACBwAAAmYABQHUwAACHwAAAg8AAAJ2AASBxcAAAhsAAAILAAACbgAAAgMAAAIjAAACEwAAAn4ABAHAwAACFIAAAgSABUIowATByMAAAhyAAAIMgAACcQAEQcLAAAIYgAACCIAAAmkAAAIAgAACIIAAAhCAAAJ5AAQBwcAAAhaAAAIGgAACZQAFAdDAAAIegAACDoAAAnUABIHEwAACGoAAAgqAAAJtAAACAoAAAiKAAAISgAACfQAEAcFAAAIVgAACBYAQAgAABMHMwAACHYAAAg2AAAJzAARBw8AAAhmAAAIJgAACawAAAgGAAAIhgAACEYAAAnsABAHCQAACF4AAAgeAAAJnAAUB2MAAAh+AAAIPgAACdwAEgcbAAAIbgAACC4AAAm8AAAIDgAACI4AAAhOAAAJ/ABgBwAAAAhRAAAIEQAVCIMAEgcfAAAIcQAACDEAAAnCABAHCgAACGEAAAghAAAJogAACAEAAAiBAAAIQQAACeIAEAcGAAAIWQAACBkAAAmSABMHOwAACHkAAAg5AAAJ0gARBxEAAAhpAAAIKQAACbIAAAgJAAAIiQAACEkAAAnyABAHBAAACFUAAAgVABAIAgETBysAAAh1AAAINQAACcoAEQcNAAAIZQAACCUAAAmqAAAIBQAACIUAAAhFAAAJ6gAQBwgAAAhdAAAIHQAACZoAFAdTAAAIfQAACD0AAAnaABIHFwAACG0AAAgtAAAJugAACA0AAAiNAAAITQAACfoAEAcDAAAIUwAACBMAFQjDABMHIwAACHMAAAgzAAAJxgARBwsAAAhjAAAIIwAACaYAAAgDAAAIgwAACEMAAAnmABAHBwAACFsAAAgbAAAJlgAUB0MAAAh7AAAIOwAACdYAEgcTAAAIawAACCsAAAm2AAAICwAACIsAAAhLAAAJ9gAQBwUAAAhXAAAIFwBACAAAEwczAAAIdwAACDcAAAnOABEHDwAACGcAAAgnAAAJrgAACAcAAAiHAAAIRwAACe4AEAcJAAAIXwAACB8AAAmeABQHYwAACH8AAAg/AAAJ3gASBxsAAAhvAAAILwAACb4AAAgPAAAIjwAACE8AAAn+AGAHAAAACFAAAAgQABQIcwASBx8AAAhwAAAIMAAACcEAEAcKAAAIYAAACCAAAAmhAAAIAAAACIAAAAhAAAAJ4QAQBwYAAAhYAAAIGAAACZEAEwc7AAAIeAAACDgAAAnRABEHEQAACGgAAAgoAAAJsQAACAgAAAiIAAAISAAACfEAEAcEAAAIVAAACBQAFQjjABMHKwAACHQAAAg0AAAJyQARBw0AAAhkAAAIJAAACakAAAgEAAAIhAAACEQAAAnpABAHCAAACFwAAAgcAAAJmQAUB1MAAAh8AAAIPAAACdkAEgcXAAAIbAAACCwAAAm5AAAIDAAACIwAAAhMAAAJ+QAQBwMAAAhSAAAIEgAVCKMAEwcjAAAIcgAACDIAAAnFABEHCwAACGIAAAgiAAAJpQAACAIAAAiCAAAIQgAACeUAEAcHAAAIWgAACBoAAAmVABQHQwAACHoAAAg6AAAJ1QASBxMAAAhqAAAIKgAACbUAAAgKAAAIigAACEoAAAn1ABAHBQAACFYAAAgWAEAIAAATBzMAAAh2AAAINgAACc0AEQcPAAAIZgAACCYAAAmtAAAIBgAACIYAAAhGAAAJ7QAQBwkAAAheAAAIHgAACZ0AFAdjAAAIfgAACD4AAAndABIHGwAACG4AAAguAAAJvQAACA4AAAiOAAAITgAACf0AYAcAAAAIUQAACBEAFQiDABIHHwAACHEAAAgxAAAJwwAQBwoAAAhhAAAIIQAACaMAAAgBAAAIgQAACEEAAAnjABAHBgAACFkAAAgZAAAJkwATBzsAAAh5AAAIOQAACdMAEQcRAAAIaQAACCkAAAmzAAAICQAACIkAAAhJAAAJ8wAQBwQAAAhVAAAIFQAQCAIBEwcrAAAIdQAACDUAAAnLABEHDQAACGUAAAglAAAJqwAACAUAAAiFAAAIRQAACesAEAcIAAAIXQAACB0AAAmbABQHUwAACH0AAAg9AAAJ2wASBxcAAAhtAAAILQAACbsAAAgNAAAIjQAACE0AAAn7ABAHAwAACFMAAAgTABUIwwATByMAAAhzAAAIMwAACccAEQcLAAAIYwAACCMAAAmnAAAIAwAACIMAAAhDAAAJ5wAQBwcAAAhbAAAIGwAACZcAFAdDAAAIewAACDsAAAnXABIHEwAACGsAAAgrAAAJtwAACAsAAAiLAAAISwAACfcAEAcFAAAIVwAACBcAQAgAABMHMwAACHcAAAg3AAAJzwARBw8AAAhnAAAIJwAACa8AAAgHAAAIhwAACEcAAAnvABAHCQAACF8AAAgfAAAJnwAUB2MAAAh/AAAIPwAACd8AEgcbAAAIbwAACC8AAAm/AAAIDwAACI8AAAhPAAAJ/wAQBQEAFwUBARMFEQAbBQEQEQUFABkFAQQVBUEAHQUBQBAFAwAYBQECFAUhABwFASASBQkAGgUBCBYFgQBABQAAEAUCABcFgQETBRkAGwUBGBEFBwAZBQEGFQVhAB0FAWAQBQQAGAUBAxQFMQAcBQEwEgUNABoFAQwWBcEAQAUAAAMABAAFAAYABwAIAAkACgALAA0ADwARABMAFwAbAB8AIwArADMAOwBDAFMAYwBzAIMAowDDAOMAAgEAAAAAAAAQABAAEAAQABAAEAAQABAAEQARABEAEQASABIAEgASABMAEwATABMAFAAUABQAFAAVABUAFQAVABAAywBNAAAAAQACAAMABAAFAAcACQANABEAGQAhADEAQQBhAIEAwQABAYEBAQIBAwEEAQYBCAEMARABGAEgATABQAFgAAAAABAAEAAQABAAEQARABIAEgATABMAFAAUABUAFQAWABYAFwAXABgAGAAZABkAGgAaABsAGwAcABwAHQAdAEAAQAC+8/h57GH2P96qjID3e9W/PYivSu1x9T/bbcCn8L7Sv7AQ8PA5lfQ/ZzpRf64e0L+FA7iwlcnzP+kkgqbYMcu/pWSIDBkN8z9Yd8AKT1fGv6COC3siXvI/AIGcxyuqwb8/NBpKSrvxP14OjM52Trq/uuWK8Fgj8T/MHGFaPJexv6cAmUE/lfA/HgzhOPRSor8AAAAAAADwPwAAAAAAAAAArEea/Yxg7j+EWfJdqqWqP6BqAh+zpOw/tC42qlNevD/m/GpXNiDrPwjbIHflJsU/LaqhY9HC6T9wRyINhsLLP+1BeAPmhug/4X6gyIsF0T9iSFP13GfnPwnutlcwBNQ/7zn6/kIu5j80g7hIow7Qv2oL4AtbV9U/I0EK8v7/37/AbgBBsPEAC0EZAAsAGRkZAAAAAAUAAAAAAAAJAAAAAAsAAAAAAAAAABkACgoZGRkDCgcAAQAJCxgAAAkGCwAACwAGGQAAABkZGQBBgfIACyEOAAAAAAAAAAAZAAsNGRkZAA0AAAIACQ4AAAAJAA4AAA4AQbvyAAsBDABBx/IACxUTAAAAABMAAAAACQwAAAAAAAwAAAwAQfXyAAsBEABBgfMACxUPAAAABA8AAAAACRAAAAAAABAAABAAQa/zAAsBEgBBu/MACx4RAAAAABEAAAAACRIAAAAAABIAABIAABoAAAAaGhoAQfLzAAsOGgAAABoaGgAAAAAAAAkAQaP0AAsBFABBr/QACxUXAAAAABcAAAAACRQAAAAAABQAABQAQd30AAsBFgBB6fQAC5oOFQAAAAAVAAAAAAkWAAAAAAAWAAAWAAAwMTIzNDU2Nzg5QUJDREVGAAAAAAA8AAA2AAAANwAAADgAAAA5AAAAOgAAADsAAAA8AAAAPQAAAD4AAAA/AAAAQAAAAEEAAABCAAAAQwAAAAgAAAAAAAAAPDwAAEQAAABFAAAA+P////j///88PAAARgAAAEcAAADcOgAA8DoAAAQAAAAAAAAAhDwAAEgAAABJAAAA/P////z///+EPAAASgAAAEsAAAAMOwAAIDsAAAwAAAAAAAAAHD0AAEwAAABNAAAABAAAAPj///8cPQAATgAAAE8AAAD0////9P///xw9AABQAAAAUQAAADw7AADYPAAA7DwAAAA9AAAUPQAAZDsAAFA7AAAAAAAAbD0AAFIAAABTAAAAOAAAADkAAABUAAAAVQAAADwAAAA9AAAAPgAAAFYAAABAAAAAVwAAAEIAAABYAAAA0G0AANQ7AAAQPwAATlN0M19fMjliYXNpY19pb3NJY05TXzExY2hhcl90cmFpdHNJY0VFRUUAAACobQAACDwAAE5TdDNfXzIxNWJhc2ljX3N0cmVhbWJ1ZkljTlNfMTFjaGFyX3RyYWl0c0ljRUVFRQAAAAAsbgAAVDwAAAAAAAABAAAAyDsAAAP0//9OU3QzX18yMTNiYXNpY19pc3RyZWFtSWNOU18xMWNoYXJfdHJhaXRzSWNFRUVFAAAsbgAAnDwAAAAAAAABAAAAyDsAAAP0//9OU3QzX18yMTNiYXNpY19vc3RyZWFtSWNOU18xMWNoYXJfdHJhaXRzSWNFRUVFAAAMAAAAAAAAADw8AABEAAAARQAAAPT////0////PDwAAEYAAABHAAAABAAAAAAAAACEPAAASAAAAEkAAAD8/////P///4Q8AABKAAAASwAAACxuAAA8PQAAAwAAAAIAAAA8PAAAAgAAAIQ8AAACCAAATlN0M19fMjE0YmFzaWNfaW9zdHJlYW1JY05TXzExY2hhcl90cmFpdHNJY0VFRUUA0G0AAHg9AAAAPAAATlN0M19fMjE1YmFzaWNfc3RyaW5nYnVmSWNOU18xMWNoYXJfdHJhaXRzSWNFRU5TXzlhbGxvY2F0b3JJY0VFRUUAAABAAAAAAAAAAKw+AABZAAAAWgAAADgAAAD4////rD4AAFsAAABcAAAAwP///8D///+sPgAAXQAAAF4AAADIPQAALD4AAGg+AAB8PgAAkD4AAKQ+AABUPgAAQD4AAPA9AADcPQAAQAAAAAAAAAAcPQAATAAAAE0AAAA4AAAA+P///xw9AABOAAAATwAAAMD////A////HD0AAFAAAABRAAAAQAAAAAAAAAA8PAAARAAAAEUAAADA////wP///zw8AABGAAAARwAAADgAAAAAAAAAhDwAAEgAAABJAAAAyP///8j///+EPAAASgAAAEsAAADQbQAAuD4AABw9AABOU3QzX18yMThiYXNpY19zdHJpbmdzdHJlYW1JY05TXzExY2hhcl90cmFpdHNJY0VFTlNfOWFsbG9jYXRvckljRUVFRQAAAAAAAAAAED8AAF8AAABgAAAAqG0AABg/AABOU3QzX18yOGlvc19iYXNlRQAAAAAAAADRdJ4AV529KoBwUg///z4nCgAAAGQAAADoAwAAECcAAKCGAQBAQg8AgJaYAADh9QUYAAAANQAAAHEAAABr////zvv//5K///8AAAAAAAAAAP////////////////////////////////////////////////////////////////8AAQIDBAUGBwgJ/////////woLDA0ODxAREhMUFRYXGBkaGxwdHh8gISIj////////CgsMDQ4PEBESExQVFhcYGRobHB0eHyAhIiP/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////AAECBAcDBgUAAAAAAAAAAgAAwAMAAMAEAADABQAAwAYAAMAHAADACAAAwAkAAMAKAADACwAAwAwAAMANAADADgAAwA8AAMAQAADAEQAAwBIAAMATAADAFAAAwBUAAMAWAADAFwAAwBgAAMAZAADAGgAAwBsAAMAcAADAHQAAwB4AAMAfAADAAAAAswEAAMMCAADDAwAAwwQAAMMFAADDBgAAwwcAAMMIAADDCQAAwwoAAMMLAADDDAAAww0AANMOAADDDwAAwwAADLsBAAzDAgAMwwMADMMEAAzbAAAAAN4SBJUAAAAA////////////////YEEAABQAAABDLlVURi04AEGwgwELAnRBAEHQgwELSkxDX0NUWVBFAAAAAExDX05VTUVSSUMAAExDX1RJTUUAAAAAAExDX0NPTExBVEUAAExDX01PTkVUQVJZAExDX01FU1NBR0VTACBEAEGkiAEL+QMBAAAAAgAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAKAAAACwAAAAwAAAANAAAADgAAAA8AAAAQAAAAEQAAABIAAAATAAAAFAAAABUAAAAWAAAAFwAAABgAAAAZAAAAGgAAABsAAAAcAAAAHQAAAB4AAAAfAAAAIAAAACEAAAAiAAAAIwAAACQAAAAlAAAAJgAAACcAAAAoAAAAKQAAACoAAAArAAAALAAAAC0AAAAuAAAALwAAADAAAAAxAAAAMgAAADMAAAA0AAAANQAAADYAAAA3AAAAOAAAADkAAAA6AAAAOwAAADwAAAA9AAAAPgAAAD8AAABAAAAAQQAAAEIAAABDAAAARAAAAEUAAABGAAAARwAAAEgAAABJAAAASgAAAEsAAABMAAAATQAAAE4AAABPAAAAUAAAAFEAAABSAAAAUwAAAFQAAABVAAAAVgAAAFcAAABYAAAAWQAAAFoAAABbAAAAXAAAAF0AAABeAAAAXwAAAGAAAABBAAAAQgAAAEMAAABEAAAARQAAAEYAAABHAAAASAAAAEkAAABKAAAASwAAAEwAAABNAAAATgAAAE8AAABQAAAAUQAAAFIAAABTAAAAVAAAAFUAAABWAAAAVwAAAFgAAABZAAAAWgAAAHsAAAB8AAAAfQAAAH4AAAB/AEGgkAELAjBKAEG0lAEL+QMBAAAAAgAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAKAAAACwAAAAwAAAANAAAADgAAAA8AAAAQAAAAEQAAABIAAAATAAAAFAAAABUAAAAWAAAAFwAAABgAAAAZAAAAGgAAABsAAAAcAAAAHQAAAB4AAAAfAAAAIAAAACEAAAAiAAAAIwAAACQAAAAlAAAAJgAAACcAAAAoAAAAKQAAACoAAAArAAAALAAAAC0AAAAuAAAALwAAADAAAAAxAAAAMgAAADMAAAA0AAAANQAAADYAAAA3AAAAOAAAADkAAAA6AAAAOwAAADwAAAA9AAAAPgAAAD8AAABAAAAAYQAAAGIAAABjAAAAZAAAAGUAAABmAAAAZwAAAGgAAABpAAAAagAAAGsAAABsAAAAbQAAAG4AAABvAAAAcAAAAHEAAAByAAAAcwAAAHQAAAB1AAAAdgAAAHcAAAB4AAAAeQAAAHoAAABbAAAAXAAAAF0AAABeAAAAXwAAAGAAAABhAAAAYgAAAGMAAABkAAAAZQAAAGYAAABnAAAAaAAAAGkAAABqAAAAawAAAGwAAABtAAAAbgAAAG8AAABwAAAAcQAAAHIAAABzAAAAdAAAAHUAAAB2AAAAdwAAAHgAAAB5AAAAegAAAHsAAAB8AAAAfQAAAH4AAAB/AEG0nAELLYDeKACAyE0AAKd2AAA0ngCAEscAgJ/uAAB+FwGAXEABgOlnAQDIkAEAVbgBLgBB8JwBC9ICU3VuAE1vbgBUdWUAV2VkAFRodQBGcmkAU2F0AFN1bmRheQBNb25kYXkAVHVlc2RheQBXZWRuZXNkYXkAVGh1cnNkYXkARnJpZGF5AFNhdHVyZGF5AEphbgBGZWIATWFyAEFwcgBNYXkASnVuAEp1bABBdWcAU2VwAE9jdABOb3YARGVjAEphbnVhcnkARmVicnVhcnkATWFyY2gAQXByaWwATWF5AEp1bmUASnVseQBBdWd1c3QAU2VwdGVtYmVyAE9jdG9iZXIATm92ZW1iZXIARGVjZW1iZXIAQU0AUE0AJWEgJWIgJWUgJVQgJVkAJW0vJWQvJXkAJUg6JU06JVMAJUk6JU06JVMgJXAAAAAlbS8lZC8leQAwMTIzNDU2Nzg5ACVhICViICVlICVUICVZACVIOiVNOiVTAAAAAABeW3lZXQBeW25OXQB5ZXMAbm8AQdCfAQsxMDEyMzQ1Njc4OWFiY2RlZkFCQ0RFRnhYKy1wUGlJbk4AJUk6JU06JVMgJXAlSDolTQBBkKABC4EBJQAAAG0AAAAvAAAAJQAAAGQAAAAvAAAAJQAAAHkAAAAlAAAAWQAAAC0AAAAlAAAAbQAAAC0AAAAlAAAAZAAAACUAAABJAAAAOgAAACUAAABNAAAAOgAAACUAAABTAAAAIAAAACUAAABwAAAAAAAAACUAAABIAAAAOgAAACUAAABNAEGgoQELZSUAAABIAAAAOgAAACUAAABNAAAAOgAAACUAAABTAAAAAAAAAABaAAB0AAAAdQAAAHYAAAAAAAAAZFoAAHcAAAB4AAAAdgAAAHkAAAB6AAAAewAAAHwAAAB9AAAAfgAAAH8AAACAAEGQogEL/QMEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAFAgAABQAAAAUAAAAFAAAABQAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAQAAAAEAAAABAAAAAMCAACCAAAAggAAAIIAAACCAAAAggAAAIIAAACCAAAAggAAAIIAAACCAAAAggAAAIIAAACCAAAAggAAAIIAAABCAQAAQgEAAEIBAABCAQAAQgEAAEIBAABCAQAAQgEAAEIBAABCAQAAggAAAIIAAACCAAAAggAAAIIAAACCAAAAggAAACoBAAAqAQAAKgEAACoBAAAqAQAAKgEAACoAAAAqAAAAKgAAACoAAAAqAAAAKgAAACoAAAAqAAAAKgAAACoAAAAqAAAAKgAAACoAAAAqAAAAKgAAACoAAAAqAAAAKgAAACoAAAAqAAAAggAAAIIAAACCAAAAggAAAIIAAACCAAAAMgEAADIBAAAyAQAAMgEAADIBAAAyAQAAMgAAADIAAAAyAAAAMgAAADIAAAAyAAAAMgAAADIAAAAyAAAAMgAAADIAAAAyAAAAMgAAADIAAAAyAAAAMgAAADIAAAAyAAAAMgAAADIAAACCAAAAggAAAIIAAACCAAAABABBlKoBC+0CvFkAAIEAAACCAAAAdgAAAIMAAACEAAAAhQAAAIYAAACHAAAAiAAAAIkAAAAAAAAAmFoAAIoAAACLAAAAdgAAAIwAAACNAAAAjgAAAI8AAACQAAAAAAAAALxaAACRAAAAkgAAAHYAAACTAAAAlAAAAJUAAACWAAAAlwAAAHQAAAByAAAAdQAAAGUAAAAAAAAAZgAAAGEAAABsAAAAcwAAAGUAAAAAAAAAJQAAAG0AAAAvAAAAJQAAAGQAAAAvAAAAJQAAAHkAAAAAAAAAJQAAAEgAAAA6AAAAJQAAAE0AAAA6AAAAJQAAAFMAAAAAAAAAJQAAAGEAAAAgAAAAJQAAAGIAAAAgAAAAJQAAAGQAAAAgAAAAJQAAAEgAAAA6AAAAJQAAAE0AAAA6AAAAJQAAAFMAAAAgAAAAJQAAAFkAAAAAAAAAJQAAAEkAAAA6AAAAJQAAAE0AAAA6AAAAJQAAAFMAAAAgAAAAJQAAAHAAQYytAQv9J5xWAACYAAAAmQAAAHYAAADQbQAAqFYAAOxqAABOU3QzX18yNmxvY2FsZTVmYWNldEUAAAAAAAAABFcAAJgAAACaAAAAdgAAAJsAAACcAAAAnQAAAJ4AAACfAAAAoAAAAKEAAACiAAAAowAAAKQAAAClAAAApgAAACxuAAAkVwAAAAAAAAIAAACcVgAAAgAAADhXAAACAAAATlN0M19fMjVjdHlwZUl3RUUAAACobQAAQFcAAE5TdDNfXzIxMGN0eXBlX2Jhc2VFAAAAAAAAAACIVwAAmAAAAKcAAAB2AAAAqAAAAKkAAACqAAAAqwAAAKwAAACtAAAArgAAACxuAACoVwAAAAAAAAIAAACcVgAAAgAAAMxXAAACAAAATlN0M19fMjdjb2RlY3Z0SWNjMTFfX21ic3RhdGVfdEVFAAAAqG0AANRXAABOU3QzX18yMTJjb2RlY3Z0X2Jhc2VFAAAAAAAAHFgAAJgAAACvAAAAdgAAALAAAACxAAAAsgAAALMAAAC0AAAAtQAAALYAAAAsbgAAPFgAAAAAAAACAAAAnFYAAAIAAADMVwAAAgAAAE5TdDNfXzI3Y29kZWN2dElEc2MxMV9fbWJzdGF0ZV90RUUAAAAAAACQWAAAmAAAALcAAAB2AAAAuAAAALkAAAC6AAAAuwAAALwAAAC9AAAAvgAAACxuAACwWAAAAAAAAAIAAACcVgAAAgAAAMxXAAACAAAATlN0M19fMjdjb2RlY3Z0SURzRHUxMV9fbWJzdGF0ZV90RUUAAAAAAARZAACYAAAAvwAAAHYAAADAAAAAwQAAAMIAAADDAAAAxAAAAMUAAADGAAAALG4AACRZAAAAAAAAAgAAAJxWAAACAAAAzFcAAAIAAABOU3QzX18yN2NvZGVjdnRJRGljMTFfX21ic3RhdGVfdEVFAAAAAAAAeFkAAJgAAADHAAAAdgAAAMgAAADJAAAAygAAAMsAAADMAAAAzQAAAM4AAAAsbgAAmFkAAAAAAAACAAAAnFYAAAIAAADMVwAAAgAAAE5TdDNfXzI3Y29kZWN2dElEaUR1MTFfX21ic3RhdGVfdEVFACxuAADcWQAAAAAAAAIAAACcVgAAAgAAAMxXAAACAAAATlN0M19fMjdjb2RlY3Z0SXdjMTFfX21ic3RhdGVfdEVFAAAA0G0AAAxaAACcVgAATlN0M19fMjZsb2NhbGU1X19pbXBFAAAA0G0AADBaAACcVgAATlN0M19fMjdjb2xsYXRlSWNFRQDQbQAAUFoAAJxWAABOU3QzX18yN2NvbGxhdGVJd0VFACxuAACEWgAAAAAAAAIAAACcVgAAAgAAADhXAAACAAAATlN0M19fMjVjdHlwZUljRUUAAADQbQAApFoAAJxWAABOU3QzX18yOG51bXB1bmN0SWNFRQAAAADQbQAAyFoAAJxWAABOU3QzX18yOG51bXB1bmN0SXdFRQAAAAAAAAAAJFoAAM8AAADQAAAAdgAAANEAAADSAAAA0wAAAAAAAABEWgAA1AAAANUAAAB2AAAA1gAAANcAAADYAAAAAAAAAGBbAACYAAAA2QAAAHYAAADaAAAA2wAAANwAAADdAAAA3gAAAN8AAADgAAAA4QAAAOIAAADjAAAA5AAAACxuAACAWwAAAAAAAAIAAACcVgAAAgAAAMRbAAAAAAAATlN0M19fMjdudW1fZ2V0SWNOU18xOWlzdHJlYW1idWZfaXRlcmF0b3JJY05TXzExY2hhcl90cmFpdHNJY0VFRUVFRQAsbgAA3FsAAAAAAAABAAAA9FsAAAAAAABOU3QzX18yOV9fbnVtX2dldEljRUUAAACobQAA/FsAAE5TdDNfXzIxNF9fbnVtX2dldF9iYXNlRQAAAAAAAAAAWFwAAJgAAADlAAAAdgAAAOYAAADnAAAA6AAAAOkAAADqAAAA6wAAAOwAAADtAAAA7gAAAO8AAADwAAAALG4AAHhcAAAAAAAAAgAAAJxWAAACAAAAvFwAAAAAAABOU3QzX18yN251bV9nZXRJd05TXzE5aXN0cmVhbWJ1Zl9pdGVyYXRvckl3TlNfMTFjaGFyX3RyYWl0c0l3RUVFRUVFACxuAADUXAAAAAAAAAEAAAD0WwAAAAAAAE5TdDNfXzI5X19udW1fZ2V0SXdFRQAAAAAAAAAgXQAAmAAAAPEAAAB2AAAA8gAAAPMAAAD0AAAA9QAAAPYAAAD3AAAA+AAAAPkAAAAsbgAAQF0AAAAAAAACAAAAnFYAAAIAAACEXQAAAAAAAE5TdDNfXzI3bnVtX3B1dEljTlNfMTlvc3RyZWFtYnVmX2l0ZXJhdG9ySWNOU18xMWNoYXJfdHJhaXRzSWNFRUVFRUUALG4AAJxdAAAAAAAAAQAAALRdAAAAAAAATlN0M19fMjlfX251bV9wdXRJY0VFAAAAqG0AALxdAABOU3QzX18yMTRfX251bV9wdXRfYmFzZUUAAAAAAAAAAAxeAACYAAAA+gAAAHYAAAD7AAAA/AAAAP0AAAD+AAAA/wAAAAABAAABAQAAAgEAACxuAAAsXgAAAAAAAAIAAACcVgAAAgAAAHBeAAAAAAAATlN0M19fMjdudW1fcHV0SXdOU18xOW9zdHJlYW1idWZfaXRlcmF0b3JJd05TXzExY2hhcl90cmFpdHNJd0VFRUVFRQAsbgAAiF4AAAAAAAABAAAAtF0AAAAAAABOU3QzX18yOV9fbnVtX3B1dEl3RUUAAAAAAAAA9F4AAAMBAAAEAQAAdgAAAAUBAAAGAQAABwEAAAgBAAAJAQAACgEAAAsBAAD4////9F4AAAwBAAANAQAADgEAAA8BAAAQAQAAEQEAABIBAAAsbgAAHF8AAAAAAAADAAAAnFYAAAIAAABkXwAAAgAAAIBfAAAACAAATlN0M19fMjh0aW1lX2dldEljTlNfMTlpc3RyZWFtYnVmX2l0ZXJhdG9ySWNOU18xMWNoYXJfdHJhaXRzSWNFRUVFRUUAAAAAqG0AAGxfAABOU3QzX18yOXRpbWVfYmFzZUUAAKhtAACIXwAATlN0M19fMjIwX190aW1lX2dldF9jX3N0b3JhZ2VJY0VFAAAAAAAAAABgAAATAQAAFAEAAHYAAAAVAQAAFgEAABcBAAAYAQAAGQEAABoBAAAbAQAA+P///wBgAAAcAQAAHQEAAB4BAAAfAQAAIAEAACEBAAAiAQAALG4AAChgAAAAAAAAAwAAAJxWAAACAAAAZF8AAAIAAABwYAAAAAgAAE5TdDNfXzI4dGltZV9nZXRJd05TXzE5aXN0cmVhbWJ1Zl9pdGVyYXRvckl3TlNfMTFjaGFyX3RyYWl0c0l3RUVFRUVFAAAAAKhtAAB4YAAATlN0M19fMjIwX190aW1lX2dldF9jX3N0b3JhZ2VJd0VFAAAAAAAAALRgAAAjAQAAJAEAAHYAAAAlAQAALG4AANRgAAAAAAAAAgAAAJxWAAACAAAAHGEAAAAIAABOU3QzX18yOHRpbWVfcHV0SWNOU18xOW9zdHJlYW1idWZfaXRlcmF0b3JJY05TXzExY2hhcl90cmFpdHNJY0VFRUVFRQAAAACobQAAJGEAAE5TdDNfXzIxMF9fdGltZV9wdXRFAAAAAAAAAABUYQAAJgEAACcBAAB2AAAAKAEAACxuAAB0YQAAAAAAAAIAAACcVgAAAgAAABxhAAAACAAATlN0M19fMjh0aW1lX3B1dEl3TlNfMTlvc3RyZWFtYnVmX2l0ZXJhdG9ySXdOU18xMWNoYXJfdHJhaXRzSXdFRUVFRUUAAAAAAAAAAPRhAACYAAAAKQEAAHYAAAAqAQAAKwEAACwBAAAtAQAALgEAAC8BAAAwAQAAMQEAADIBAAAsbgAAFGIAAAAAAAACAAAAnFYAAAIAAAAwYgAAAgAAAE5TdDNfXzIxMG1vbmV5cHVuY3RJY0xiMEVFRQCobQAAOGIAAE5TdDNfXzIxMG1vbmV5X2Jhc2VFAAAAAAAAAACIYgAAmAAAADMBAAB2AAAANAEAADUBAAA2AQAANwEAADgBAAA5AQAAOgEAADsBAAA8AQAALG4AAKhiAAAAAAAAAgAAAJxWAAACAAAAMGIAAAIAAABOU3QzX18yMTBtb25leXB1bmN0SWNMYjFFRUUAAAAAAPxiAACYAAAAPQEAAHYAAAA+AQAAPwEAAEABAABBAQAAQgEAAEMBAABEAQAARQEAAEYBAAAsbgAAHGMAAAAAAAACAAAAnFYAAAIAAAAwYgAAAgAAAE5TdDNfXzIxMG1vbmV5cHVuY3RJd0xiMEVFRQAAAAAAcGMAAJgAAABHAQAAdgAAAEgBAABJAQAASgEAAEsBAABMAQAATQEAAE4BAABPAQAAUAEAACxuAACQYwAAAAAAAAIAAACcVgAAAgAAADBiAAACAAAATlN0M19fMjEwbW9uZXlwdW5jdEl3TGIxRUVFAAAAAADIYwAAmAAAAFEBAAB2AAAAUgEAAFMBAAAsbgAA6GMAAAAAAAACAAAAnFYAAAIAAAAwZAAAAAAAAE5TdDNfXzI5bW9uZXlfZ2V0SWNOU18xOWlzdHJlYW1idWZfaXRlcmF0b3JJY05TXzExY2hhcl90cmFpdHNJY0VFRUVFRQAAAKhtAAA4ZAAATlN0M19fMjExX19tb25leV9nZXRJY0VFAAAAAAAAAABwZAAAmAAAAFQBAAB2AAAAVQEAAFYBAAAsbgAAkGQAAAAAAAACAAAAnFYAAAIAAADYZAAAAAAAAE5TdDNfXzI5bW9uZXlfZ2V0SXdOU18xOWlzdHJlYW1idWZfaXRlcmF0b3JJd05TXzExY2hhcl90cmFpdHNJd0VFRUVFRQAAAKhtAADgZAAATlN0M19fMjExX19tb25leV9nZXRJd0VFAAAAAAAAAAAYZQAAmAAAAFcBAAB2AAAAWAEAAFkBAAAsbgAAOGUAAAAAAAACAAAAnFYAAAIAAACAZQAAAAAAAE5TdDNfXzI5bW9uZXlfcHV0SWNOU18xOW9zdHJlYW1idWZfaXRlcmF0b3JJY05TXzExY2hhcl90cmFpdHNJY0VFRUVFRQAAAKhtAACIZQAATlN0M19fMjExX19tb25leV9wdXRJY0VFAAAAAAAAAADAZQAAmAAAAFoBAAB2AAAAWwEAAFwBAAAsbgAA4GUAAAAAAAACAAAAnFYAAAIAAAAoZgAAAAAAAE5TdDNfXzI5bW9uZXlfcHV0SXdOU18xOW9zdHJlYW1idWZfaXRlcmF0b3JJd05TXzExY2hhcl90cmFpdHNJd0VFRUVFRQAAAKhtAAAwZgAATlN0M19fMjExX19tb25leV9wdXRJd0VFAAAAAAAAAABsZgAAmAAAAF0BAAB2AAAAXgEAAF8BAABgAQAALG4AAIxmAAAAAAAAAgAAAJxWAAACAAAApGYAAAIAAABOU3QzX18yOG1lc3NhZ2VzSWNFRQAAAACobQAArGYAAE5TdDNfXzIxM21lc3NhZ2VzX2Jhc2VFAAAAAADkZgAAmAAAAGEBAAB2AAAAYgEAAGMBAABkAQAALG4AAARnAAAAAAAAAgAAAJxWAAACAAAApGYAAAIAAABOU3QzX18yOG1lc3NhZ2VzSXdFRQAAAABTAAAAdQAAAG4AAABkAAAAYQAAAHkAAAAAAAAATQAAAG8AAABuAAAAZAAAAGEAAAB5AAAAAAAAAFQAAAB1AAAAZQAAAHMAAABkAAAAYQAAAHkAAAAAAAAAVwAAAGUAAABkAAAAbgAAAGUAAABzAAAAZAAAAGEAAAB5AAAAAAAAAFQAAABoAAAAdQAAAHIAAABzAAAAZAAAAGEAAAB5AAAAAAAAAEYAAAByAAAAaQAAAGQAAABhAAAAeQAAAAAAAABTAAAAYQAAAHQAAAB1AAAAcgAAAGQAAABhAAAAeQAAAAAAAABTAAAAdQAAAG4AAAAAAAAATQAAAG8AAABuAAAAAAAAAFQAAAB1AAAAZQAAAAAAAABXAAAAZQAAAGQAAAAAAAAAVAAAAGgAAAB1AAAAAAAAAEYAAAByAAAAaQAAAAAAAABTAAAAYQAAAHQAAAAAAAAASgAAAGEAAABuAAAAdQAAAGEAAAByAAAAeQAAAAAAAABGAAAAZQAAAGIAAAByAAAAdQAAAGEAAAByAAAAeQAAAAAAAABNAAAAYQAAAHIAAABjAAAAaAAAAAAAAABBAAAAcAAAAHIAAABpAAAAbAAAAAAAAABNAAAAYQAAAHkAAAAAAAAASgAAAHUAAABuAAAAZQAAAAAAAABKAAAAdQAAAGwAAAB5AAAAAAAAAEEAAAB1AAAAZwAAAHUAAABzAAAAdAAAAAAAAABTAAAAZQAAAHAAAAB0AAAAZQAAAG0AAABiAAAAZQAAAHIAAAAAAAAATwAAAGMAAAB0AAAAbwAAAGIAAABlAAAAcgAAAAAAAABOAAAAbwAAAHYAAABlAAAAbQAAAGIAAABlAAAAcgAAAAAAAABEAAAAZQAAAGMAAABlAAAAbQAAAGIAAABlAAAAcgAAAAAAAABKAAAAYQAAAG4AAAAAAAAARgAAAGUAAABiAAAAAAAAAE0AAABhAAAAcgAAAAAAAABBAAAAcAAAAHIAAAAAAAAASgAAAHUAAABuAAAAAAAAAEoAAAB1AAAAbAAAAAAAAABBAAAAdQAAAGcAAAAAAAAAUwAAAGUAAABwAAAAAAAAAE8AAABjAAAAdAAAAAAAAABOAAAAbwAAAHYAAAAAAAAARAAAAGUAAABjAAAAAAAAAEEAAABNAAAAAAAAAFAAAABNAEGU1QELnAiAXwAADAEAAA0BAAAOAQAADwEAABABAAARAQAAEgEAAAAAAABwYAAAHAEAAB0BAAAeAQAAHwEAACABAAAhAQAAIgEAAAAAAADsagAAZQEAAGYBAABnAQAAqG0AAPRqAABOU3QzX18yMTRfX3NoYXJlZF9jb3VudEUAAAAAcG8AANBtAAAgawAAnG4AAE4xMF9fY3h4YWJpdjExNl9fc2hpbV90eXBlX2luZm9FAAAAANBtAABQawAAFGsAAE4xMF9fY3h4YWJpdjExN19fY2xhc3NfdHlwZV9pbmZvRQAAANBtAACAawAAFGsAAE4xMF9fY3h4YWJpdjExN19fcGJhc2VfdHlwZV9pbmZvRQAAANBtAACwawAAdGsAAE4xMF9fY3h4YWJpdjExOV9fcG9pbnRlcl90eXBlX2luZm9FANBtAADgawAAFGsAAE4xMF9fY3h4YWJpdjEyMF9fZnVuY3Rpb25fdHlwZV9pbmZvRQAAAADQbQAAFGwAAHRrAABOMTBfX2N4eGFiaXYxMjlfX3BvaW50ZXJfdG9fbWVtYmVyX3R5cGVfaW5mb0UAAAAAAAAAYGwAAGoBAABrAQAAbAEAAG0BAABuAQAA0G0AAGxsAAAUawAATjEwX19jeHhhYml2MTIzX19mdW5kYW1lbnRhbF90eXBlX2luZm9FAExsAACcbAAAdgAAAExsAACobAAARG4AAExsAAC0bAAAYgAAAExsAADAbAAAYwAAAExsAADMbAAAaAAAAExsAADYbAAAYQAAAExsAADkbAAAcwAAAExsAADwbAAAdAAAAExsAAD8bAAAaQAAAExsAAAIbQAAagAAAExsAAAUbQAAbAAAAExsAAAgbQAAbQAAAExsAAAsbQAAeAAAAExsAAA4bQAAeQAAAExsAABEbQAAZgAAAExsAABQbQAAZAAAAAAAAABwbQAAagEAAG8BAABsAQAAbQEAAHABAADQbQAAfG0AABRrAABOMTBfX2N4eGFiaXYxMTZfX2VudW1fdHlwZV9pbmZvRQAAAAAAAAAARGsAAGoBAABxAQAAbAEAAG0BAAByAQAAcwEAAHQBAAB1AQAAAAAAAPBtAABqAQAAdgEAAGwBAABtAQAAcgEAAHcBAAB4AQAAeQEAANBtAAD8bQAARGsAAE4xMF9fY3h4YWJpdjEyMF9fc2lfY2xhc3NfdHlwZV9pbmZvRQAAAAAAAAAATG4AAGoBAAB6AQAAbAEAAG0BAAByAQAAewEAAHwBAAB9AQAA0G0AAFhuAABEawAATjEwX19jeHhhYml2MTIxX192bWlfY2xhc3NfdHlwZV9pbmZvRQAAAAAAAACkawAAagEAAH4BAABsAQAAbQEAAH8BAACobQAApG4AAFN0OXR5cGVfaW5mbwBBud0BCwggAAAAAAAABQBBzN0BCwExAEHk3QELDjIAAAAzAAAACHEAAAAEAEH83QELAQEAQYzeAQsF/////woAQdDeAQshwG4AAHB/AQAlbS8lZC8leQAAAAglSDolTTolUwAAAAgFAEH83gELAmgBAEGU3wELCjIAAABpAQAAZH8AQazfAQsBAgBBvN8BCwj//////////wBBgOABCwJwbw==\")), I((await RI(A)).instance));\n  }();\n  function rA() {\n    function I() {\n      var g;\n      if (i.calledRun = !0, !fA) {\n        if (WA = !0, X.G(), AA == null || AA(i), (g = i.onRuntimeInitialized) == null || g.call(i), i.postRun) for (typeof i.postRun == \"function\" && (i.postRun = [i.postRun]); i.postRun.length; ) {\n          var A = i.postRun.shift();\n          XA.push(A);\n        }\n        VA(XA);\n      }\n    }\n    if (0 < e) u = rA;\n    else {\n      if (i.preRun) for (typeof i.preRun == \"function\" && (i.preRun = [i.preRun]); i.preRun.length; ) sI();\n      VA(TA), 0 < e ? u = rA : i.setStatus ? (i.setStatus(\"Running...\"), setTimeout(() => {\n        setTimeout(() => i.setStatus(\"\"), 1), I();\n      }, 1)) : I();\n    }\n  }\n  if (i.preInit) for (typeof i.preInit == \"function\" && (i.preInit = [i.preInit]); 0 < i.preInit.length; ) i.preInit.shift()();\n  return rA(), WA ? s = i : s = new Promise((I, A) => {\n    AA = I, IA = A;\n  }), s;\n}\nconst T = (R, s, i = (L) => L) => {\n  const L = R.vf32_ptr(s), k = s.size();\n  return new Float32Array(R.HEAPF32.buffer, L, k).map(i);\n}, pI = (R) => 1 / (1 + Math.exp(-R)), OI = (R) => (s) => s * R + 0.5, PI = (R, s, i) => {\n  const L = (i == null ? void 0 : i.colorScaleFactor) ?? 0.282;\n  return {\n    numPoints: s.numPoints,\n    shDegree: s.shDegree,\n    antialiased: s.antialiased,\n    positions: T(R, s.positions),\n    scales: T(R, s.scales, Math.exp),\n    rotations: T(R, s.rotations),\n    alphas: T(R, s.alphas, pI),\n    colors: T(\n      R,\n      s.colors,\n      OI(L)\n    ),\n    // FIXME: incorrect SH logic\n    sh: T(R, s.sh)\n  };\n}, uI = (R, s) => {\n  R._free(R.vf32_ptr(s.positions)), R._free(R.vf32_ptr(s.scales)), R._free(R.vf32_ptr(s.rotations)), R._free(R.vf32_ptr(s.alphas)), R._free(R.vf32_ptr(s.colors)), R._free(R.vf32_ptr(s.sh));\n}, mI = async (R, s) => {\n  var f;\n  const i = await TI(), L = R instanceof Uint8Array ? R : new Uint8Array(R);\n  let k = null;\n  try {\n    if (k = i._malloc(\n      Uint8Array.BYTES_PER_ELEMENT * L.length\n    ), k === null)\n      throw new Error(\"couldn't allocate memory\");\n    i.HEAPU8.set(L, k / Uint8Array.BYTES_PER_ELEMENT);\n    const r = i.CoordinateSystem[((f = s == null ? void 0 : s.unpackOptions) == null ? void 0 : f.coordinateSystem) ?? \"UNSPECIFIED\"], x = i.load_spz(k, L.length, {\n      coordinateSystem: r\n    }), p = PI(\n      i,\n      x,\n      s\n    );\n    return uI(i, x), p;\n  } catch (r) {\n    throw r;\n  } finally {\n    k !== null && i._free(k);\n  }\n}, zI = (R, s) => fetch(R).then((i) => i.arrayBuffer()).then((i) => mI(i, s)), bI = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({\n  __proto__: null\n}, Symbol.toStringTag, { value: \"Module\" }));\nexport {\n  mI as loadSpz,\n  zI as loadSpzFromUrl\n};\n","// SplatsDecoder.js\r\nimport * as THREE from 'three';\r\nimport { loadSpz } from '@spz-loader/core';\r\n// Import a module worker for SPZ decoding. When compiled/bundled by tooling such as Vite,\r\n// the '?worker' suffix ensures a proper Worker constructor is generated. If the bundler\r\n// does not support this convention the import will silently fail and fall back to main‑thread decoding.\r\nimport GLTFTileWorkerConstructor from './GLTFTileDecoder.worker.js?worker&inline';\r\n\r\nclass GLTFTileDecoder {\r\n  constructor(gltfLoader, renderer) {\r\n    this.gltfLoader = gltfLoader;\r\n    this.renderer = renderer;\r\n    if (this.gltfLoader?.register) {\r\n      this.gltfLoader.register(() => ({ name: 'KHR_spz_gaussian_splats_compression' }));\r\n    }\r\n    // Create a dedicated worker that will handle the heavy numeric work\r\n    // (SPZ decoding and KHR processing). If worker creation fails we fall\r\n    // back to main-thread decoding logic.\r\n    try {\r\n      this.worker = new GLTFTileWorkerConstructor();\r\n      this.workerJobId = 0;\r\n      this.workerCallbacks = new Map();\r\n      this.worker.onmessage = (e) => {\r\n        const { id, pos, col, c0, c1, error } = e.data || {};\r\n        const cb = this.workerCallbacks.get(id);\r\n        if (!cb) return;\r\n        this.workerCallbacks.delete(id);\r\n        if (error) cb.reject(new Error(error));\r\n        else cb.resolve({ pos, col, c0, c1 });\r\n      };\r\n      this.worker.onerror = (err) => {\r\n        // propagate worker errors to all outstanding callbacks\r\n        for (const [, cb] of this.workerCallbacks) {\r\n          cb.reject(err instanceof Error ? err : new Error(String(err)));\r\n        }\r\n        this.workerCallbacks.clear();\r\n      };\r\n    } catch (_) {\r\n      // Worker creation failed; leave worker undefined to trigger fallback.\r\n      this.worker = undefined;\r\n    }\r\n  }\r\n\r\n  parseSplats(arrayBuffer, sceneZupToYUp, meshZUpToYUp, isUltraSplats) {\r\n    return new Promise(async (resolve, reject) => {\r\n      await this.#waitLoaderDeps();\r\n      this.gltfLoader.parse(\r\n        arrayBuffer,\r\n        '',\r\n        async (gltf) => {\r\n          try {\r\n            const tile = await this.#dispatch(gltf, isUltraSplats);\r\n            \r\n            resolve(tile);\r\n          } catch (e) {\r\n            reject(e);\r\n          }\r\n        },\r\n        (err) => reject(err)\r\n      );\r\n    });\r\n  }\r\n\r\n  async #dispatch(gltf, isUltraSplats) {\r\n    if(isUltraSplats){\r\n      return this.#handleULTRA(gltf);\r\n    }\r\n    const parser = gltf.parser;\r\n    const json = parser.json;\r\n    const loc = this.#findPrim(json);\r\n    if (loc?.type === 'SPZ') return this.#handleSPZ(parser, loc, gltf);\r\n    if (loc?.type === 'KHR') return this.#handleKHR(parser, json, loc, gltf);\r\n    if (loc?.type === 'ULTRA') return this.#handleULTRA(gltf);\r\n\r\n    if(!gltf.scene) gltf.scene =  new THREE.Object3D();\r\n    gltf.scene.asset = gltf.asset;\r\n    return gltf.scene;\r\n  }\r\n\r\n  \r\n  #findPrim(json) {\r\n    if (!json?.meshes) return null;\r\n    for (let m = 0; m < json.meshes.length; m++) {\r\n      const mesh = json.meshes[m];\r\n      for (let p = 0; p < (mesh.primitives?.length || 0); p++) {\r\n        const prim = mesh.primitives[p];\r\n        const ext = prim?.extensions;\r\n        if (\r\n          ext?.KHR_spz_gaussian_splats_compression &&\r\n          Number.isInteger(ext.KHR_spz_gaussian_splats_compression.bufferView)\r\n        )\r\n          return { mesh: m, prim: p, type: 'SPZ', bv: ext.KHR_spz_gaussian_splats_compression.bufferView };\r\n        if (ext?.KHR_gaussian_splatting) return { mesh: m, prim: p, type: 'KHR' };\r\n        if (ext?.ULTRA_splats) return { mesh: m, prim: p, type: 'ULTRA' };\r\n      }\r\n    }\r\n    return null;\r\n  }\r\n\r\n  async #handleSPZ(parser, loc, gltf) {\r\n    // Read the SPZ buffer view into its own ArrayBuffer so it can be\r\n    // transferred to the worker without retaining the original glTF buffers.\r\n    let ab = await parser.getDependency('bufferView', loc.bv);\r\n    if (ab?.buffer?.byteLength) ab = ab.buffer.slice(ab.byteOffset, ab.byteLength + ab.byteOffset);\r\n    // If our worker is available offload decoding to it. Otherwise fall back\r\n    // to the original main-thread SPZ decoding logic.\r\n    if (this.worker) {\r\n      const jobId = this.workerJobId++;\r\n      const p = new Promise((resolve, reject) => {\r\n        this.workerCallbacks.set(jobId, { resolve, reject });\r\n      });\r\n      try {\r\n        // transfer the SPZ buffer to the worker; the ArrayBuffer is detached\r\n        // from the main thread immediately.\r\n        this.worker.postMessage({ id: jobId, op: 'decodeSPZ', spz: ab }, [ab]);\r\n      } catch (err) {\r\n        // Posting can throw if the worker is broken; reject immediately.\r\n        this.workerCallbacks.delete(jobId);\r\n        throw err;\r\n      }\r\n      const { pos, col, c0, c1 } = await p;\r\n      const positions = new Float32Array(pos);\r\n      const colors = new Float32Array(col);\r\n      const cov0 = new Float32Array(c0);\r\n      const cov1 = new Float32Array(c1);\r\n      const posAttr = new THREE.BufferAttribute(positions, 3);\r\n      const colAttr = new THREE.BufferAttribute(colors, 4);\r\n      const cov0Attr = new THREE.BufferAttribute(cov0, 3);\r\n      const cov1Attr = new THREE.BufferAttribute(cov1, 3);\r\n      gltf.scene.traverse((o) => o.dispose && o.dispose());\r\n      return {\r\n        isSplatsData: true,\r\n        positions: posAttr,\r\n        colors: colAttr,\r\n        cov0: cov0Attr,\r\n        cov1: cov1Attr,\r\n      };\r\n    }\r\n    // Fallback synchronous decoding when no worker is available.\r\n    const gs = await loadSpz(ab, {coordinateSystem: \"LUF\"});\r\n    const n = gs.numPoints ?? gs.positions.length / 3;\r\n    const positions = new Float32Array(gs.positions);\r\n    const rgb = gs.colors ?? gs.color;\r\n    const aArr = gs.alphas ?? gs.opacity ?? gs.opacities;\r\n    const colors = new Float32Array(n * 4);\r\n    for (let i = 0; i < n; i++) {\r\n      const r = rgb[i * 3 + 0],\r\n        g = rgb[i * 3 + 1],\r\n        b = rgb[i * 3 + 2];\r\n      const a = aArr ? this.#toUnitAlpha(aArr[i]) : 1;\r\n      const [lr, lg, lb] = this.#toLinearFromSh0Maybe(r, g, b);\r\n      colors.set([lr, lg, lb, a], i * 4);\r\n    }\r\n    const rot = gs.rotations ?? gs.quaternions;\r\n    const scl = gs.scales ?? gs.scale;\r\n    const cov = this.#covFromRotScale(rot, scl);\r\n    const posAttr = new THREE.BufferAttribute(positions, 3);\r\n    const colAttr = new THREE.BufferAttribute(colors, 4);\r\n    const cov0Attr = new THREE.BufferAttribute(cov.c0, 3);\r\n    const cov1Attr = new THREE.BufferAttribute(cov.c1, 3);\r\n    gltf.scene.traverse((o) => o.dispose && o.dispose());\r\n    return {\r\n      isSplatsData: true,\r\n      positions: posAttr,\r\n      colors: colAttr,\r\n      cov0: cov0Attr,\r\n      cov1: cov1Attr,\r\n    };\r\n  }\r\n\r\n  async #handleKHR(parser, json, loc, gltf) {\r\n    const prim = json.meshes[loc.mesh].primitives[loc.prim];\r\n    const getAcc = async (name) => {\r\n      const idx = prim.attributes?.[name];\r\n      if (Number.isInteger(idx)) return parser.getDependency('accessor', idx);\r\n      return null;\r\n    };\r\n  \r\n    // Obtain accessor objects (may contain .buffer and byte offsets)\r\n    let posAcc = await getAcc('POSITION');\r\n    if (!posAcc) return this.#handleULTRA(gltf);\r\n    let colAcc = await getAcc('COLOR_0');\r\n    let rotAcc = (await getAcc('ROTATION')) || (await getAcc('_ROTATION'));\r\n    let sclAcc = (await getAcc('SCALE')) || (await getAcc('_SCALE'));\r\n  \r\n    // Build ArrayBuffer slices for transfer to the worker (if available)\r\n    const posBuf = posAcc?.buffer ? posAcc.buffer.slice(posAcc.byteOffset, posAcc.byteOffset + posAcc.byteLength) : null;\r\n    const colBuf = colAcc?.buffer ? colAcc.buffer.slice(colAcc.byteOffset, colAcc.byteOffset + colAcc.byteLength) : null;\r\n    const rotBuf = rotAcc?.buffer ? rotAcc.buffer.slice(rotAcc.byteOffset, rotAcc.byteOffset + rotAcc.byteLength) : null;\r\n    const sclBuf = sclAcc?.buffer ? sclAcc.buffer.slice(sclAcc.byteOffset, sclAcc.byteOffset + sclAcc.byteLength) : null;\r\n  \r\n    if (this.worker) {\r\n      const jobId = this.workerJobId++;\r\n      const p = new Promise((resolve, reject) => {\r\n        this.workerCallbacks.set(jobId, { resolve, reject });\r\n      });\r\n      try {\r\n        const transfer = [];\r\n        const payload = { pos: posBuf, col: colBuf, rot: rotBuf, scl: sclBuf };\r\n        if (posBuf) transfer.push(posBuf);\r\n        if (colBuf) transfer.push(colBuf);\r\n        if (rotBuf) transfer.push(rotBuf);\r\n        if (sclBuf) transfer.push(sclBuf);\r\n        this.worker.postMessage({ id: jobId, op: 'handleKHR', payload }, transfer);\r\n      } catch (err) {\r\n        this.workerCallbacks.delete(jobId);\r\n        throw err;\r\n      }\r\n      const { pos, col, c0, c1 } = await p;\r\n      const positions = new Float32Array(pos);\r\n      const colors = new Float32Array(col);\r\n      const cov0 = new Float32Array(c0);\r\n      const cov1 = new Float32Array(c1);\r\n      const posAttr = new THREE.BufferAttribute(positions, 3);\r\n      const colAttr = new THREE.BufferAttribute(colors, 4);\r\n      const cov0Attr = new THREE.BufferAttribute(cov0, 3);\r\n      const cov1Attr = new THREE.BufferAttribute(cov1, 3);\r\n      gltf.scene.traverse((o) => o.dispose && o.dispose());\r\n      return {\r\n        isSplatsData: true, positions: posAttr, colors: colAttr, cov0: cov0Attr, cov1: cov1Attr\r\n      }\r\n    }\r\n  \r\n    // Fallback: perform the same processing on the main thread (preserve existing logic)\r\n    let pos = posAcc;\r\n    if (pos?.buffer) pos = new Float32Array(pos.buffer, pos.byteOffset, pos.count * 3);\r\n  \r\n    let col = colAcc;\r\n    if (col?.buffer) col = new Float32Array(col.buffer, col.byteOffset, (col.itemSize || 4) * col.count);\r\n  \r\n    let rot = rotAcc;\r\n    let scl = sclAcc;\r\n    if (rot?.buffer) rot = new Float32Array(rot.buffer, rot.byteOffset, rot.count * 4);\r\n    if (scl?.buffer) scl = new Float32Array(scl.buffer, scl.byteOffset, scl.count * 3);\r\n  \r\n    const n = pos.length / 3;\r\n    const colors = new Float32Array(n * 4);\r\n    if (col) {\r\n      const stride = col.length === n * 4 ? 4 : 3;\r\n      for (let i = 0; i < n; i++) {\r\n        const r = col[i * stride + 0], g = col[i * stride + 1], b = col[i * stride + 2];\r\n        const [lr, lg, lb] = this.#toLinearFromSh0Maybe(r, g, b);\r\n        colors.set([lr, lg, lb, stride === 4 ? col[i * stride + 3] : 1], i * 4);\r\n      }\r\n    } else {\r\n      for (let i = 0; i < n; i++) colors.set([1, 1, 1, 1], i * 4);\r\n    }\r\n  \r\n    const cov = this.#covFromRotScale(rot, scl);\r\n  \r\n    const posAttr = new THREE.BufferAttribute(pos, 3);\r\n    const colAttr = new THREE.BufferAttribute(colors, 4);\r\n    const cov0Attr = new THREE.BufferAttribute(cov.c0, 3);\r\n    const cov1Attr = new THREE.BufferAttribute(cov.c1, 3);\r\n  \r\n    gltf.scene.traverse((o) => o.dispose && o.dispose());\r\n    return {\r\n      isSplatsData: true, positions: posAttr, colors: colAttr, cov0: cov0Attr, cov1: cov1Attr\r\n    }\r\n  }\r\n\r\n  async #handleULTRA(gltf) {\r\n    const decoded = gltf.scene.children[0];\r\n    const g = decoded.geometry;\r\n    const positions = g.attributes.position;\r\n    const colors = g.attributes.color;\r\n    const cov0 = g.attributes.cov_0 || g.attributes.COV_0;\r\n    const cov1 = g.attributes.cov_1 || g.attributes.COV_1;\r\n\r\n    gltf.scene.traverse((o) => o.dispose && o.dispose());\r\n    return {\r\n      isSplatsData: true, positions: positions, colors: colors, cov0: cov0, cov1: cov1\r\n    }\r\n\r\n  }\r\n\r\n  #covFromRotScale(rot, logScale) {\r\n    const n = (rot?.length || 0) / 4;\r\n    const c0 = new Float32Array(n * 3);\r\n    const c1 = new Float32Array(n * 3);\r\n    const R = new Float32Array(9);\r\n    for (let i = 0; i < n; i++) {\r\n      const x = rot ? rot[i * 4 + 0] : 0, y = rot ? rot[i * 4 + 1] : 0, z = rot ? rot[i * 4 + 2] : 0, w = rot ? rot[i * 4 + 3] : 1;\r\n      const xx = x * x, yy = y * y, zz = z * z, xy = x * y, xz = x * z, yz = y * z, wx = w * x, wy = w * y, wz = w * z;\r\n      R[0] = 1 - 2 * (yy + zz); R[1] = 2 * (xy - wz); R[2] = 2 * (xz + wy);\r\n      R[3] = 2 * (xy + wz); R[4] = 1 - 2 * (xx + zz); R[5] = 2 * (yz - wx);\r\n      R[6] = 2 * (xz - wy); R[7] = 2 * (yz + wx); R[8] = 1 - 2 * (xx + yy);\r\n\r\n      const sx = Math.max(1e-12, /* Math.exp */(logScale ? logScale[i * 3 + 0] : 0));\r\n      const sy = Math.max(1e-12, /* Math.exp */(logScale ? logScale[i * 3 + 1] : 0));\r\n      const sz = Math.max(1e-12, /* Math.exp */(logScale ? logScale[i * 3 + 2] : 0));\r\n      const sxx = sx * sx, syy = sy * sy, szz = sz * sz;\r\n\r\n      const m00 = R[0] * R[0] * sxx + R[1] * R[1] * syy + R[2] * R[2] * szz;\r\n      const m10 = R[3] * R[0] * sxx + R[4] * R[1] * syy + R[5] * R[2] * szz;\r\n      const m20 = R[6] * R[0] * sxx + R[7] * R[1] * syy + R[8] * R[2] * szz;\r\n      const m11 = R[3] * R[3] * sxx + R[4] * R[4] * syy + R[5] * R[5] * szz;\r\n      const m21 = R[6] * R[3] * sxx + R[7] * R[4] * syy + R[8] * R[5] * szz;\r\n      const m22 = R[6] * R[6] * sxx + R[7] * R[7] * syy + R[8] * R[8] * szz;\r\n\r\n      const j = i * 3;\r\n      c0[j + 0] = m00; c0[j + 1] = m10; c0[j + 2] = m20;\r\n      c1[j + 0] = m11; c1[j + 1] = m21; c1[j + 2] = m22;\r\n    }\r\n    return { c0, c1 };\r\n  }\r\n\r\n  #toUnitAlpha(a) {\r\n    if (!Number.isFinite(a)) return 1;\r\n    if (a >= 0 && a <= 1) return a;\r\n    if (a >= 0 && a <= 255 && Math.abs(a - Math.round(a)) < 1e-3) return a / 255;\r\n    if (a >= 0 && a <= 65535 && Math.abs(a - Math.round(a)) < 1e-3) return a / 65535;\r\n    return Math.min(1, Math.max(0, a));\r\n  }\r\n\r\n  #toLinearFromSh0Maybe(r, g, b) {\r\n    const isU8 = (v) => v >= 0 && v <= 255 && Math.abs(v - Math.round(v)) < 1e-3;\r\n    const isU16 = (v) => v >= 0 && v <= 65535 && Math.abs(v - Math.round(v)) < 1e-3;\r\n    const lin = (s) => (s <= 0.04045 ? s / 12.92 : Math.pow((s + 0.055) / 1.055, 2.4));\r\n    const clamp01 = (x) => Math.min(1, Math.max(0, x));\r\n\r\n    let sr = r, sg = g, sb = b;\r\n\r\n    if (r >= 0 && r <= 1 && g >= 0 && g <= 1 && b >= 0 && b <= 1) {\r\n      // sRGB float 0–1\r\n    } else if (isU8(r) && isU8(g) && isU8(b)) {\r\n      sr = r / 255; sg = g / 255; sb = b / 255;\r\n    } else if (isU16(r) && isU16(g) && isU16(b)) {\r\n      sr = r / 65535; sg = g / 65535; sb = b / 65535;\r\n    } else {\r\n      const sh = (x) => 0.5 + 0.28209479177387814 * x;\r\n      sr = sh(r); sg = sh(g); sb = sh(b);\r\n    }\r\n\r\n    sr = clamp01(sr); sg = clamp01(sg); sb = clamp01(sb);\r\n    return [lin(sr), lin(sg), lin(sb)];\r\n  }\r\n\r\n  #waitLoaderDeps() {\r\n    return new Promise((resolve) => {\r\n      const i = setInterval(() => {\r\n        const l = this.gltfLoader;\r\n        if ((!l.hasDracoLoader || l.dracoLoader) && (!l.hasKTX2Loader || l.ktx2Loader)) {\r\n          clearInterval(i); resolve();\r\n        }\r\n      }, 10);\r\n    });\r\n  }\r\n}\r\n\r\nexport { GLTFTileDecoder };\r\n","import {\n\tAnimationClip,\n\tBone,\n\tBox3,\n\tBufferAttribute,\n\tBufferGeometry,\n\tClampToEdgeWrapping,\n\tColor,\n\tColorManagement,\n\tDirectionalLight,\n\tDoubleSide,\n\tFileLoader,\n\tFrontSide,\n\tGroup,\n\tImageBitmapLoader,\n\tInstancedMesh,\n\tInterleavedBuffer,\n\tInterleavedBufferAttribute,\n\tInterpolant,\n\tInterpolateDiscrete,\n\tInterpolateLinear,\n\tLine,\n\tLineBasicMaterial,\n\tLineLoop,\n\tLineSegments,\n\tLinearFilter,\n\tLinearMipmapLinearFilter,\n\tLinearMipmapNearestFilter,\n\tLinearSRGBColorSpace,\n\tLoader,\n\tLoaderUtils,\n\tMaterial,\n\tMathUtils,\n\tMatrix4,\n\tMesh,\n\tMeshBasicMaterial,\n\tMeshPhysicalMaterial,\n\tMeshStandardMaterial,\n\tMirroredRepeatWrapping,\n\tNearestFilter,\n\tNearestMipmapLinearFilter,\n\tNearestMipmapNearestFilter,\n\tNumberKeyframeTrack,\n\tObject3D,\n\tOrthographicCamera,\n\tPerspectiveCamera,\n\tPointLight,\n\tPoints,\n\tPointsMaterial,\n\tPropertyBinding,\n\tQuaternion,\n\tQuaternionKeyframeTrack,\n\tRepeatWrapping,\n\tSkeleton,\n\tSkinnedMesh,\n\tSphere,\n\tSpotLight,\n\tTexture,\n\tTextureLoader,\n\tTriangleFanDrawMode,\n\tTriangleStripDrawMode,\n\tVector2,\n\tVector3,\n\tVectorKeyframeTrack,\n\tSRGBColorSpace,\n\tInstancedBufferAttribute\n} from 'three';\nimport { toTrianglesDrawMode } from '../utils/BufferGeometryUtils.js';\n\n/**\n * A loader for the glTF 2.0 format.\n *\n * [glTF](https://www.khronos.org/gltf/} (GL Transmission Format) is an [open format specification]{@link https://github.com/KhronosGroup/glTF/tree/main/specification/2.0)\n * for efficient delivery and loading of 3D content. Assets may be provided either in JSON (.gltf) or binary (.glb)\n * format. External files store textures (.jpg, .png) and additional binary data (.bin). A glTF asset may deliver\n * one or more scenes, including meshes, materials, textures, skins, skeletons, morph targets, animations, lights,\n * and/or cameras.\n *\n * `GLTFLoader` uses {@link ImageBitmapLoader} whenever possible. Be advised that image bitmaps are not\n * automatically GC-collected when they are no longer referenced, and they require special handling during\n * the disposal process.\n *\n * `GLTFLoader` supports the following glTF 2.0 extensions:\n * - KHR_draco_mesh_compression\n * - KHR_materials_clearcoat\n * - KHR_materials_dispersion\n * - KHR_materials_ior\n * - KHR_materials_specular\n * - KHR_materials_transmission\n * - KHR_materials_iridescence\n * - KHR_materials_unlit\n * - KHR_materials_volume\n * - KHR_mesh_quantization\n * - KHR_lights_punctual\n * - KHR_texture_basisu\n * - KHR_texture_transform\n * - EXT_texture_webp\n * - EXT_meshopt_compression\n * - EXT_mesh_gpu_instancing\n *\n * The following glTF 2.0 extension is supported by an external user plugin:\n * - [KHR_materials_variants](https://github.com/takahirox/three-gltf-extensions)\n * - [MSFT_texture_dds](https://github.com/takahirox/three-gltf-extensions)\n * - [KHR_animation_pointer](https://github.com/needle-tools/three-animation-pointer)\n * - [NEEDLE_progressive](https://github.com/needle-tools/gltf-progressive)\n *\n * ```js\n * const loader = new GLTFLoader();\n *\n * // Optional: Provide a DRACOLoader instance to decode compressed mesh data\n * const dracoLoader = new DRACOLoader();\n * dracoLoader.setDecoderPath( '/examples/jsm/libs/draco/' );\n * loader.setDRACOLoader( dracoLoader );\n *\n * const gltf = await loader.loadAsync( 'models/gltf/duck/duck.gltf' );\n * scene.add( gltf.scene );\n * ```\n *\n * @augments Loader\n * @three_import import { GLTFLoader } from 'three/addons/loaders/GLTFLoader.js';\n */\nclass GLTFLoader extends Loader {\n\n\t/**\n\t * Constructs a new glTF loader.\n\t *\n\t * @param {LoadingManager} [manager] - The loading manager.\n\t */\n\tconstructor( manager ) {\n\n\t\tsuper( manager );\n\n\t\tthis.dracoLoader = null;\n\t\tthis.ktx2Loader = null;\n\t\tthis.meshoptDecoder = null;\n\n\t\tthis.pluginCallbacks = [];\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsClearcoatExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsDispersionExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFTextureBasisUExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFTextureWebPExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFTextureAVIFExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsSheenExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsTransmissionExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsVolumeExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsIorExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsEmissiveStrengthExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsSpecularExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsIridescenceExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsAnisotropyExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMaterialsBumpExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFLightsExtension( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMeshoptCompression( parser );\n\n\t\t} );\n\n\t\tthis.register( function ( parser ) {\n\n\t\t\treturn new GLTFMeshGpuInstancing( parser );\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Starts loading from the given URL and passes the loaded glTF asset\n\t * to the `onLoad()` callback.\n\t *\n\t * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.\n\t * @param {function(GLTFLoader~LoadObject)} onLoad - Executed when the loading process has been finished.\n\t * @param {onProgressCallback} onProgress - Executed while the loading is in progress.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t */\n\tload( url, onLoad, onProgress, onError ) {\n\n\t\tconst scope = this;\n\n\t\tlet resourcePath;\n\n\t\tif ( this.resourcePath !== '' ) {\n\n\t\t\tresourcePath = this.resourcePath;\n\n\t\t} else if ( this.path !== '' ) {\n\n\t\t\t// If a base path is set, resources will be relative paths from that plus the relative path of the gltf file\n\t\t\t// Example  path = 'https://my-cnd-server.com/', url = 'assets/models/model.gltf'\n\t\t\t// resourcePath = 'https://my-cnd-server.com/assets/models/'\n\t\t\t// referenced resource 'model.bin' will be loaded from 'https://my-cnd-server.com/assets/models/model.bin'\n\t\t\t// referenced resource '../textures/texture.png' will be loaded from 'https://my-cnd-server.com/assets/textures/texture.png'\n\t\t\tconst relativeUrl = LoaderUtils.extractUrlBase( url );\n\t\t\tresourcePath = LoaderUtils.resolveURL( relativeUrl, this.path );\n\n\t\t} else {\n\n\t\t\tresourcePath = LoaderUtils.extractUrlBase( url );\n\n\t\t}\n\n\t\t// Tells the LoadingManager to track an extra item, which resolves after\n\t\t// the model is fully loaded. This means the count of items loaded will\n\t\t// be incorrect, but ensures manager.onLoad() does not fire early.\n\t\tthis.manager.itemStart( url );\n\n\t\tconst _onError = function ( e ) {\n\n\t\t\tif ( onError ) {\n\n\t\t\t\tonError( e );\n\n\t\t\t} else {\n\n\t\t\t\tconsole.error( e );\n\n\t\t\t}\n\n\t\t\tscope.manager.itemError( url );\n\t\t\tscope.manager.itemEnd( url );\n\n\t\t};\n\n\t\tconst loader = new FileLoader( this.manager );\n\n\t\tloader.setPath( this.path );\n\t\tloader.setResponseType( 'arraybuffer' );\n\t\tloader.setRequestHeader( this.requestHeader );\n\t\tloader.setWithCredentials( this.withCredentials );\n\n\t\tloader.load( url, function ( data ) {\n\n\t\t\ttry {\n\n\t\t\t\tscope.parse( data, resourcePath, function ( gltf ) {\n\n\t\t\t\t\tonLoad( gltf );\n\n\t\t\t\t\tscope.manager.itemEnd( url );\n\n\t\t\t\t}, _onError );\n\n\t\t\t} catch ( e ) {\n\n\t\t\t\t_onError( e );\n\n\t\t\t}\n\n\t\t}, onProgress, _onError );\n\n\t}\n\n\t/**\n\t * Sets the given Draco loader to this loader. Required for decoding assets\n\t * compressed with the `KHR_draco_mesh_compression` extension.\n\t *\n\t * @param {DRACOLoader} dracoLoader - The Draco loader to set.\n\t * @return {GLTFLoader} A reference to this loader.\n\t */\n\tsetDRACOLoader( dracoLoader ) {\n\n\t\tthis.dracoLoader = dracoLoader;\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Sets the given KTX2 loader to this loader. Required for loading KTX2\n\t * compressed textures.\n\t *\n\t * @param {KTX2Loader} ktx2Loader - The KTX2 loader to set.\n\t * @return {GLTFLoader} A reference to this loader.\n\t */\n\tsetKTX2Loader( ktx2Loader ) {\n\n\t\tthis.ktx2Loader = ktx2Loader;\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Sets the given meshopt decoder. Required for decoding assets\n\t * compressed with the `EXT_meshopt_compression` extension.\n\t *\n\t * @param {Object} meshoptDecoder - The meshopt decoder to set.\n\t * @return {GLTFLoader} A reference to this loader.\n\t */\n\tsetMeshoptDecoder( meshoptDecoder ) {\n\n\t\tthis.meshoptDecoder = meshoptDecoder;\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Registers a plugin callback. This API is internally used to implement the various\n\t * glTF extensions but can also used by third-party code to add additional logic\n\t * to the loader.\n\t *\n\t * @param {function(parser:GLTFParser)} callback - The callback function to register.\n\t * @return {GLTFLoader} A reference to this loader.\n\t */\n\tregister( callback ) {\n\n\t\tif ( this.pluginCallbacks.indexOf( callback ) === - 1 ) {\n\n\t\t\tthis.pluginCallbacks.push( callback );\n\n\t\t}\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Unregisters a plugin callback.\n\t *\n\t * @param {Function} callback - The callback function to unregister.\n\t * @return {GLTFLoader} A reference to this loader.\n\t */\n\tunregister( callback ) {\n\n\t\tif ( this.pluginCallbacks.indexOf( callback ) !== - 1 ) {\n\n\t\t\tthis.pluginCallbacks.splice( this.pluginCallbacks.indexOf( callback ), 1 );\n\n\t\t}\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Parses the given FBX data and returns the resulting group.\n\t *\n\t * @param {string|ArrayBuffer} data - The raw glTF data.\n\t * @param {string} path - The URL base path.\n\t * @param {function(GLTFLoader~LoadObject)} onLoad - Executed when the loading process has been finished.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t */\n\tparse( data, path, onLoad, onError ) {\n\n\t\tlet json;\n\t\tconst extensions = {};\n\t\tconst plugins = {};\n\t\tconst textDecoder = new TextDecoder();\n\n\t\tif ( typeof data === 'string' ) {\n\n\t\t\tjson = JSON.parse( data );\n\n\t\t} else if ( data instanceof ArrayBuffer ) {\n\n\t\t\tconst magic = textDecoder.decode( new Uint8Array( data, 0, 4 ) );\n\n\t\t\tif ( magic === BINARY_EXTENSION_HEADER_MAGIC ) {\n\n\t\t\t\ttry {\n\n\t\t\t\t\textensions[ EXTENSIONS.KHR_BINARY_GLTF ] = new GLTFBinaryExtension( data );\n\n\t\t\t\t} catch ( error ) {\n\n\t\t\t\t\tif ( onError ) onError( error );\n\t\t\t\t\treturn;\n\n\t\t\t\t}\n\n\t\t\t\tjson = JSON.parse( extensions[ EXTENSIONS.KHR_BINARY_GLTF ].content );\n\n\t\t\t} else {\n\n\t\t\t\tjson = JSON.parse( textDecoder.decode( data ) );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tjson = data;\n\n\t\t}\n\n\t\tif ( json.asset === undefined || json.asset.version[ 0 ] < 2 ) {\n\n\t\t\tif ( onError ) onError( new Error( 'THREE.GLTFLoader: Unsupported asset. glTF versions >=2.0 are supported.' ) );\n\t\t\treturn;\n\n\t\t}\n\n\t\tconst parser = new GLTFParser( json, {\n\n\t\t\tpath: path || this.resourcePath || '',\n\t\t\tcrossOrigin: this.crossOrigin,\n\t\t\trequestHeader: this.requestHeader,\n\t\t\tmanager: this.manager,\n\t\t\tktx2Loader: this.ktx2Loader,\n\t\t\tmeshoptDecoder: this.meshoptDecoder\n\n\t\t} );\n\n\t\tparser.fileLoader.setRequestHeader( this.requestHeader );\n\n\t\tfor ( let i = 0; i < this.pluginCallbacks.length; i ++ ) {\n\n\t\t\tconst plugin = this.pluginCallbacks[ i ]( parser );\n\n\t\t\tif ( ! plugin.name ) console.error( 'THREE.GLTFLoader: Invalid plugin found: missing name' );\n\n\t\t\tplugins[ plugin.name ] = plugin;\n\n\t\t\t// Workaround to avoid determining as unknown extension\n\t\t\t// in addUnknownExtensionsToUserData().\n\t\t\t// Remove this workaround if we move all the existing\n\t\t\t// extension handlers to plugin system\n\t\t\textensions[ plugin.name ] = true;\n\n\t\t}\n\n\t\tif ( json.extensionsUsed ) {\n\n\t\t\tfor ( let i = 0; i < json.extensionsUsed.length; ++ i ) {\n\n\t\t\t\tconst extensionName = json.extensionsUsed[ i ];\n\t\t\t\tconst extensionsRequired = json.extensionsRequired || [];\n\n\t\t\t\tswitch ( extensionName ) {\n\n\t\t\t\t\tcase EXTENSIONS.KHR_MATERIALS_UNLIT:\n\t\t\t\t\t\textensions[ extensionName ] = new GLTFMaterialsUnlitExtension();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase EXTENSIONS.KHR_DRACO_MESH_COMPRESSION:\n\t\t\t\t\t\textensions[ extensionName ] = new GLTFDracoMeshCompressionExtension( json, this.dracoLoader );\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase EXTENSIONS.KHR_TEXTURE_TRANSFORM:\n\t\t\t\t\t\textensions[ extensionName ] = new GLTFTextureTransformExtension();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tcase EXTENSIONS.KHR_MESH_QUANTIZATION:\n\t\t\t\t\t\textensions[ extensionName ] = new GLTFMeshQuantizationExtension();\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t\tdefault:\n\n\t\t\t\t\t\tif ( extensionsRequired.indexOf( extensionName ) >= 0 && plugins[ extensionName ] === undefined ) {\n\n\t\t\t\t\t\t\tconsole.warn( 'THREE.GLTFLoader: Unknown extension \"' + extensionName + '\".' );\n\n\t\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\tparser.setExtensions( extensions );\n\t\tparser.setPlugins( plugins );\n\t\tparser.parse( onLoad, onError );\n\n\t}\n\n\t/**\n\t * Async version of {@link GLTFLoader#parse}.\n\t *\n\t * @async\n\t * @param {string|ArrayBuffer} data - The raw glTF data.\n\t * @param {string} path - The URL base path.\n\t * @return {Promise<GLTFLoader~LoadObject>} A Promise that resolves with the loaded glTF when the parsing has been finished.\n\t */\n\tparseAsync( data, path ) {\n\n\t\tconst scope = this;\n\n\t\treturn new Promise( function ( resolve, reject ) {\n\n\t\t\tscope.parse( data, path, resolve, reject );\n\n\t\t} );\n\n\t}\n\n}\n\n/* GLTFREGISTRY */\n\nfunction GLTFRegistry() {\n\n\tlet objects = {};\n\n\treturn\t{\n\n\t\tget: function ( key ) {\n\n\t\t\treturn objects[ key ];\n\n\t\t},\n\n\t\tadd: function ( key, object ) {\n\n\t\t\tobjects[ key ] = object;\n\n\t\t},\n\n\t\tremove: function ( key ) {\n\n\t\t\tdelete objects[ key ];\n\n\t\t},\n\n\t\tremoveAll: function () {\n\n\t\t\tobjects = {};\n\n\t\t}\n\n\t};\n\n}\n\n/*********************************/\n/********** EXTENSIONS ***********/\n/*********************************/\n\nconst EXTENSIONS = {\n\tKHR_BINARY_GLTF: 'KHR_binary_glTF',\n\tKHR_DRACO_MESH_COMPRESSION: 'KHR_draco_mesh_compression',\n\tKHR_LIGHTS_PUNCTUAL: 'KHR_lights_punctual',\n\tKHR_MATERIALS_CLEARCOAT: 'KHR_materials_clearcoat',\n\tKHR_MATERIALS_DISPERSION: 'KHR_materials_dispersion',\n\tKHR_MATERIALS_IOR: 'KHR_materials_ior',\n\tKHR_MATERIALS_SHEEN: 'KHR_materials_sheen',\n\tKHR_MATERIALS_SPECULAR: 'KHR_materials_specular',\n\tKHR_MATERIALS_TRANSMISSION: 'KHR_materials_transmission',\n\tKHR_MATERIALS_IRIDESCENCE: 'KHR_materials_iridescence',\n\tKHR_MATERIALS_ANISOTROPY: 'KHR_materials_anisotropy',\n\tKHR_MATERIALS_UNLIT: 'KHR_materials_unlit',\n\tKHR_MATERIALS_VOLUME: 'KHR_materials_volume',\n\tKHR_TEXTURE_BASISU: 'KHR_texture_basisu',\n\tKHR_TEXTURE_TRANSFORM: 'KHR_texture_transform',\n\tKHR_MESH_QUANTIZATION: 'KHR_mesh_quantization',\n\tKHR_MATERIALS_EMISSIVE_STRENGTH: 'KHR_materials_emissive_strength',\n\tEXT_MATERIALS_BUMP: 'EXT_materials_bump',\n\tEXT_TEXTURE_WEBP: 'EXT_texture_webp',\n\tEXT_TEXTURE_AVIF: 'EXT_texture_avif',\n\tEXT_MESHOPT_COMPRESSION: 'EXT_meshopt_compression',\n\tEXT_MESH_GPU_INSTANCING: 'EXT_mesh_gpu_instancing'\n};\n\n/**\n * Punctual Lights Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_lights_punctual\n *\n * @private\n */\nclass GLTFLightsExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_LIGHTS_PUNCTUAL;\n\n\t\t// Object3D instance caches\n\t\tthis.cache = { refs: {}, uses: {} };\n\n\t}\n\n\t_markDefs() {\n\n\t\tconst parser = this.parser;\n\t\tconst nodeDefs = this.parser.json.nodes || [];\n\n\t\tfor ( let nodeIndex = 0, nodeLength = nodeDefs.length; nodeIndex < nodeLength; nodeIndex ++ ) {\n\n\t\t\tconst nodeDef = nodeDefs[ nodeIndex ];\n\n\t\t\tif ( nodeDef.extensions\n\t\t\t\t\t&& nodeDef.extensions[ this.name ]\n\t\t\t\t\t&& nodeDef.extensions[ this.name ].light !== undefined ) {\n\n\t\t\t\tparser._addNodeRef( this.cache, nodeDef.extensions[ this.name ].light );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t_loadLight( lightIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst cacheKey = 'light:' + lightIndex;\n\t\tlet dependency = parser.cache.get( cacheKey );\n\n\t\tif ( dependency ) return dependency;\n\n\t\tconst json = parser.json;\n\t\tconst extensions = ( json.extensions && json.extensions[ this.name ] ) || {};\n\t\tconst lightDefs = extensions.lights || [];\n\t\tconst lightDef = lightDefs[ lightIndex ];\n\t\tlet lightNode;\n\n\t\tconst color = new Color( 0xffffff );\n\n\t\tif ( lightDef.color !== undefined ) color.setRGB( lightDef.color[ 0 ], lightDef.color[ 1 ], lightDef.color[ 2 ], LinearSRGBColorSpace );\n\n\t\tconst range = lightDef.range !== undefined ? lightDef.range : 0;\n\n\t\tswitch ( lightDef.type ) {\n\n\t\t\tcase 'directional':\n\t\t\t\tlightNode = new DirectionalLight( color );\n\t\t\t\tlightNode.target.position.set( 0, 0, - 1 );\n\t\t\t\tlightNode.add( lightNode.target );\n\t\t\t\tbreak;\n\n\t\t\tcase 'point':\n\t\t\t\tlightNode = new PointLight( color );\n\t\t\t\tlightNode.distance = range;\n\t\t\t\tbreak;\n\n\t\t\tcase 'spot':\n\t\t\t\tlightNode = new SpotLight( color );\n\t\t\t\tlightNode.distance = range;\n\t\t\t\t// Handle spotlight properties.\n\t\t\t\tlightDef.spot = lightDef.spot || {};\n\t\t\t\tlightDef.spot.innerConeAngle = lightDef.spot.innerConeAngle !== undefined ? lightDef.spot.innerConeAngle : 0;\n\t\t\t\tlightDef.spot.outerConeAngle = lightDef.spot.outerConeAngle !== undefined ? lightDef.spot.outerConeAngle : Math.PI / 4.0;\n\t\t\t\tlightNode.angle = lightDef.spot.outerConeAngle;\n\t\t\t\tlightNode.penumbra = 1.0 - lightDef.spot.innerConeAngle / lightDef.spot.outerConeAngle;\n\t\t\t\tlightNode.target.position.set( 0, 0, - 1 );\n\t\t\t\tlightNode.add( lightNode.target );\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\t\t\t\tthrow new Error( 'THREE.GLTFLoader: Unexpected light type: ' + lightDef.type );\n\n\t\t}\n\n\t\t// Some lights (e.g. spot) default to a position other than the origin. Reset the position\n\t\t// here, because node-level parsing will only override position if explicitly specified.\n\t\tlightNode.position.set( 0, 0, 0 );\n\n\t\tassignExtrasToUserData( lightNode, lightDef );\n\n\t\tif ( lightDef.intensity !== undefined ) lightNode.intensity = lightDef.intensity;\n\n\t\tlightNode.name = parser.createUniqueName( lightDef.name || ( 'light_' + lightIndex ) );\n\n\t\tdependency = Promise.resolve( lightNode );\n\n\t\tparser.cache.add( cacheKey, dependency );\n\n\t\treturn dependency;\n\n\t}\n\n\tgetDependency( type, index ) {\n\n\t\tif ( type !== 'light' ) return;\n\n\t\treturn this._loadLight( index );\n\n\t}\n\n\tcreateNodeAttachment( nodeIndex ) {\n\n\t\tconst self = this;\n\t\tconst parser = this.parser;\n\t\tconst json = parser.json;\n\t\tconst nodeDef = json.nodes[ nodeIndex ];\n\t\tconst lightDef = ( nodeDef.extensions && nodeDef.extensions[ this.name ] ) || {};\n\t\tconst lightIndex = lightDef.light;\n\n\t\tif ( lightIndex === undefined ) return null;\n\n\t\treturn this._loadLight( lightIndex ).then( function ( light ) {\n\n\t\t\treturn parser._getNodeRef( self.cache, lightIndex, light );\n\n\t\t} );\n\n\t}\n\n}\n\n/**\n * Unlit Materials Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_unlit\n *\n * @private\n */\nclass GLTFMaterialsUnlitExtension {\n\n\tconstructor() {\n\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_UNLIT;\n\n\t}\n\n\tgetMaterialType() {\n\n\t\treturn MeshBasicMaterial;\n\n\t}\n\n\textendParams( materialParams, materialDef, parser ) {\n\n\t\tconst pending = [];\n\n\t\tmaterialParams.color = new Color( 1.0, 1.0, 1.0 );\n\t\tmaterialParams.opacity = 1.0;\n\n\t\tconst metallicRoughness = materialDef.pbrMetallicRoughness;\n\n\t\tif ( metallicRoughness ) {\n\n\t\t\tif ( Array.isArray( metallicRoughness.baseColorFactor ) ) {\n\n\t\t\t\tconst array = metallicRoughness.baseColorFactor;\n\n\t\t\t\tmaterialParams.color.setRGB( array[ 0 ], array[ 1 ], array[ 2 ], LinearSRGBColorSpace );\n\t\t\t\tmaterialParams.opacity = array[ 3 ];\n\n\t\t\t}\n\n\t\t\tif ( metallicRoughness.baseColorTexture !== undefined ) {\n\n\t\t\t\tpending.push( parser.assignTexture( materialParams, 'map', metallicRoughness.baseColorTexture, SRGBColorSpace ) );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Materials Emissive Strength Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/blob/5768b3ce0ef32bc39cdf1bef10b948586635ead3/extensions/2.0/Khronos/KHR_materials_emissive_strength/README.md\n *\n * @private\n */\nclass GLTFMaterialsEmissiveStrengthExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_EMISSIVE_STRENGTH;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst emissiveStrength = materialDef.extensions[ this.name ].emissiveStrength;\n\n\t\tif ( emissiveStrength !== undefined ) {\n\n\t\t\tmaterialParams.emissiveIntensity = emissiveStrength;\n\n\t\t}\n\n\t\treturn Promise.resolve();\n\n\t}\n\n}\n\n/**\n * Clearcoat Materials Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_clearcoat\n *\n * @private\n */\nclass GLTFMaterialsClearcoatExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_CLEARCOAT;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tif ( extension.clearcoatFactor !== undefined ) {\n\n\t\t\tmaterialParams.clearcoat = extension.clearcoatFactor;\n\n\t\t}\n\n\t\tif ( extension.clearcoatTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'clearcoatMap', extension.clearcoatTexture ) );\n\n\t\t}\n\n\t\tif ( extension.clearcoatRoughnessFactor !== undefined ) {\n\n\t\t\tmaterialParams.clearcoatRoughness = extension.clearcoatRoughnessFactor;\n\n\t\t}\n\n\t\tif ( extension.clearcoatRoughnessTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'clearcoatRoughnessMap', extension.clearcoatRoughnessTexture ) );\n\n\t\t}\n\n\t\tif ( extension.clearcoatNormalTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'clearcoatNormalMap', extension.clearcoatNormalTexture ) );\n\n\t\t\tif ( extension.clearcoatNormalTexture.scale !== undefined ) {\n\n\t\t\t\tconst scale = extension.clearcoatNormalTexture.scale;\n\n\t\t\t\tmaterialParams.clearcoatNormalScale = new Vector2( scale, scale );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Materials dispersion Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/main/extensions/2.0/Khronos/KHR_materials_dispersion\n *\n * @private\n */\nclass GLTFMaterialsDispersionExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_DISPERSION;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tmaterialParams.dispersion = extension.dispersion !== undefined ? extension.dispersion : 0;\n\n\t\treturn Promise.resolve();\n\n\t}\n\n}\n\n/**\n * Iridescence Materials Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_iridescence\n *\n * @private\n */\nclass GLTFMaterialsIridescenceExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_IRIDESCENCE;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tif ( extension.iridescenceFactor !== undefined ) {\n\n\t\t\tmaterialParams.iridescence = extension.iridescenceFactor;\n\n\t\t}\n\n\t\tif ( extension.iridescenceTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'iridescenceMap', extension.iridescenceTexture ) );\n\n\t\t}\n\n\t\tif ( extension.iridescenceIor !== undefined ) {\n\n\t\t\tmaterialParams.iridescenceIOR = extension.iridescenceIor;\n\n\t\t}\n\n\t\tif ( materialParams.iridescenceThicknessRange === undefined ) {\n\n\t\t\tmaterialParams.iridescenceThicknessRange = [ 100, 400 ];\n\n\t\t}\n\n\t\tif ( extension.iridescenceThicknessMinimum !== undefined ) {\n\n\t\t\tmaterialParams.iridescenceThicknessRange[ 0 ] = extension.iridescenceThicknessMinimum;\n\n\t\t}\n\n\t\tif ( extension.iridescenceThicknessMaximum !== undefined ) {\n\n\t\t\tmaterialParams.iridescenceThicknessRange[ 1 ] = extension.iridescenceThicknessMaximum;\n\n\t\t}\n\n\t\tif ( extension.iridescenceThicknessTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'iridescenceThicknessMap', extension.iridescenceThicknessTexture ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Sheen Materials Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/main/extensions/2.0/Khronos/KHR_materials_sheen\n *\n * @private\n */\nclass GLTFMaterialsSheenExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_SHEEN;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tmaterialParams.sheenColor = new Color( 0, 0, 0 );\n\t\tmaterialParams.sheenRoughness = 0;\n\t\tmaterialParams.sheen = 1;\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tif ( extension.sheenColorFactor !== undefined ) {\n\n\t\t\tconst colorFactor = extension.sheenColorFactor;\n\t\t\tmaterialParams.sheenColor.setRGB( colorFactor[ 0 ], colorFactor[ 1 ], colorFactor[ 2 ], LinearSRGBColorSpace );\n\n\t\t}\n\n\t\tif ( extension.sheenRoughnessFactor !== undefined ) {\n\n\t\t\tmaterialParams.sheenRoughness = extension.sheenRoughnessFactor;\n\n\t\t}\n\n\t\tif ( extension.sheenColorTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'sheenColorMap', extension.sheenColorTexture, SRGBColorSpace ) );\n\n\t\t}\n\n\t\tif ( extension.sheenRoughnessTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'sheenRoughnessMap', extension.sheenRoughnessTexture ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Transmission Materials Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_transmission\n * Draft: https://github.com/KhronosGroup/glTF/pull/1698\n *\n * @private\n */\nclass GLTFMaterialsTransmissionExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_TRANSMISSION;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tif ( extension.transmissionFactor !== undefined ) {\n\n\t\t\tmaterialParams.transmission = extension.transmissionFactor;\n\n\t\t}\n\n\t\tif ( extension.transmissionTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'transmissionMap', extension.transmissionTexture ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Materials Volume Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_volume\n *\n * @private\n */\nclass GLTFMaterialsVolumeExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_VOLUME;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tmaterialParams.thickness = extension.thicknessFactor !== undefined ? extension.thicknessFactor : 0;\n\n\t\tif ( extension.thicknessTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'thicknessMap', extension.thicknessTexture ) );\n\n\t\t}\n\n\t\tmaterialParams.attenuationDistance = extension.attenuationDistance || Infinity;\n\n\t\tconst colorArray = extension.attenuationColor || [ 1, 1, 1 ];\n\t\tmaterialParams.attenuationColor = new Color().setRGB( colorArray[ 0 ], colorArray[ 1 ], colorArray[ 2 ], LinearSRGBColorSpace );\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Materials ior Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_ior\n *\n * @private\n */\nclass GLTFMaterialsIorExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_IOR;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tmaterialParams.ior = extension.ior !== undefined ? extension.ior : 1.5;\n\n\t\treturn Promise.resolve();\n\n\t}\n\n}\n\n/**\n * Materials specular Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_specular\n *\n * @private\n */\nclass GLTFMaterialsSpecularExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_SPECULAR;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tmaterialParams.specularIntensity = extension.specularFactor !== undefined ? extension.specularFactor : 1.0;\n\n\t\tif ( extension.specularTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'specularIntensityMap', extension.specularTexture ) );\n\n\t\t}\n\n\t\tconst colorArray = extension.specularColorFactor || [ 1, 1, 1 ];\n\t\tmaterialParams.specularColor = new Color().setRGB( colorArray[ 0 ], colorArray[ 1 ], colorArray[ 2 ], LinearSRGBColorSpace );\n\n\t\tif ( extension.specularColorTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'specularColorMap', extension.specularColorTexture, SRGBColorSpace ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n\n/**\n * Materials bump Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/EXT_materials_bump\n *\n * @private\n */\nclass GLTFMaterialsBumpExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.EXT_MATERIALS_BUMP;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tmaterialParams.bumpScale = extension.bumpFactor !== undefined ? extension.bumpFactor : 1.0;\n\n\t\tif ( extension.bumpTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'bumpMap', extension.bumpTexture ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * Materials anisotropy Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_materials_anisotropy\n *\n * @private\n */\nclass GLTFMaterialsAnisotropyExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_MATERIALS_ANISOTROPY;\n\n\t}\n\n\tgetMaterialType( materialIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) return null;\n\n\t\treturn MeshPhysicalMaterial;\n\n\t}\n\n\textendMaterialParams( materialIndex, materialParams ) {\n\n\t\tconst parser = this.parser;\n\t\tconst materialDef = parser.json.materials[ materialIndex ];\n\n\t\tif ( ! materialDef.extensions || ! materialDef.extensions[ this.name ] ) {\n\n\t\t\treturn Promise.resolve();\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tconst extension = materialDef.extensions[ this.name ];\n\n\t\tif ( extension.anisotropyStrength !== undefined ) {\n\n\t\t\tmaterialParams.anisotropy = extension.anisotropyStrength;\n\n\t\t}\n\n\t\tif ( extension.anisotropyRotation !== undefined ) {\n\n\t\t\tmaterialParams.anisotropyRotation = extension.anisotropyRotation;\n\n\t\t}\n\n\t\tif ( extension.anisotropyTexture !== undefined ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'anisotropyMap', extension.anisotropyTexture ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n}\n\n/**\n * BasisU Texture Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_texture_basisu\n *\n * @private\n */\nclass GLTFTextureBasisUExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.KHR_TEXTURE_BASISU;\n\n\t}\n\n\tloadTexture( textureIndex ) {\n\n\t\tconst parser = this.parser;\n\t\tconst json = parser.json;\n\n\t\tconst textureDef = json.textures[ textureIndex ];\n\n\t\tif ( ! textureDef.extensions || ! textureDef.extensions[ this.name ] ) {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t\tconst extension = textureDef.extensions[ this.name ];\n\t\tconst loader = parser.options.ktx2Loader;\n\n\t\tif ( ! loader ) {\n\n\t\t\tif ( json.extensionsRequired && json.extensionsRequired.indexOf( this.name ) >= 0 ) {\n\n\t\t\t\tthrow new Error( 'THREE.GLTFLoader: setKTX2Loader must be called before loading KTX2 textures' );\n\n\t\t\t} else {\n\n\t\t\t\t// Assumes that the extension is optional and that a fallback texture is present\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn parser.loadTextureImage( textureIndex, extension.source, loader );\n\n\t}\n\n}\n\n/**\n * WebP Texture Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Vendor/EXT_texture_webp\n *\n * @private\n */\nclass GLTFTextureWebPExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.EXT_TEXTURE_WEBP;\n\n\t}\n\n\tloadTexture( textureIndex ) {\n\n\t\tconst name = this.name;\n\t\tconst parser = this.parser;\n\t\tconst json = parser.json;\n\n\t\tconst textureDef = json.textures[ textureIndex ];\n\n\t\tif ( ! textureDef.extensions || ! textureDef.extensions[ name ] ) {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t\tconst extension = textureDef.extensions[ name ];\n\t\tconst source = json.images[ extension.source ];\n\n\t\tlet loader = parser.textureLoader;\n\t\tif ( source.uri ) {\n\n\t\t\tconst handler = parser.options.manager.getHandler( source.uri );\n\t\t\tif ( handler !== null ) loader = handler;\n\n\t\t}\n\n\t\treturn parser.loadTextureImage( textureIndex, extension.source, loader );\n\n\t}\n\n}\n\n/**\n * AVIF Texture Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Vendor/EXT_texture_avif\n *\n * @private\n */\nclass GLTFTextureAVIFExtension {\n\n\tconstructor( parser ) {\n\n\t\tthis.parser = parser;\n\t\tthis.name = EXTENSIONS.EXT_TEXTURE_AVIF;\n\n\t}\n\n\tloadTexture( textureIndex ) {\n\n\t\tconst name = this.name;\n\t\tconst parser = this.parser;\n\t\tconst json = parser.json;\n\n\t\tconst textureDef = json.textures[ textureIndex ];\n\n\t\tif ( ! textureDef.extensions || ! textureDef.extensions[ name ] ) {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t\tconst extension = textureDef.extensions[ name ];\n\t\tconst source = json.images[ extension.source ];\n\n\t\tlet loader = parser.textureLoader;\n\t\tif ( source.uri ) {\n\n\t\t\tconst handler = parser.options.manager.getHandler( source.uri );\n\t\t\tif ( handler !== null ) loader = handler;\n\n\t\t}\n\n\t\treturn parser.loadTextureImage( textureIndex, extension.source, loader );\n\n\t}\n\n}\n\n/**\n * meshopt BufferView Compression Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Vendor/EXT_meshopt_compression\n *\n * @private\n */\nclass GLTFMeshoptCompression {\n\n\tconstructor( parser ) {\n\n\t\tthis.name = EXTENSIONS.EXT_MESHOPT_COMPRESSION;\n\t\tthis.parser = parser;\n\n\t}\n\n\tloadBufferView( index ) {\n\n\t\tconst json = this.parser.json;\n\t\tconst bufferView = json.bufferViews[ index ];\n\n\t\tif ( bufferView.extensions && bufferView.extensions[ this.name ] ) {\n\n\t\t\tconst extensionDef = bufferView.extensions[ this.name ];\n\n\t\t\tconst buffer = this.parser.getDependency( 'buffer', extensionDef.buffer );\n\t\t\tconst decoder = this.parser.options.meshoptDecoder;\n\n\t\t\tif ( ! decoder || ! decoder.supported ) {\n\n\t\t\t\tif ( json.extensionsRequired && json.extensionsRequired.indexOf( this.name ) >= 0 ) {\n\n\t\t\t\t\tthrow new Error( 'THREE.GLTFLoader: setMeshoptDecoder must be called before loading compressed files' );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// Assumes that the extension is optional and that fallback buffer data is present\n\t\t\t\t\treturn null;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn buffer.then( function ( res ) {\n\n\t\t\t\tconst byteOffset = extensionDef.byteOffset || 0;\n\t\t\t\tconst byteLength = extensionDef.byteLength || 0;\n\n\t\t\t\tconst count = extensionDef.count;\n\t\t\t\tconst stride = extensionDef.byteStride;\n\n\t\t\t\tconst source = new Uint8Array( res, byteOffset, byteLength );\n\n\t\t\t\tif ( decoder.decodeGltfBufferAsync ) {\n\n\t\t\t\t\treturn decoder.decodeGltfBufferAsync( count, stride, source, extensionDef.mode, extensionDef.filter ).then( function ( res ) {\n\n\t\t\t\t\t\treturn res.buffer;\n\n\t\t\t\t\t} );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// Support for MeshoptDecoder 0.18 or earlier, without decodeGltfBufferAsync\n\t\t\t\t\treturn decoder.ready.then( function () {\n\n\t\t\t\t\t\tconst result = new ArrayBuffer( count * stride );\n\t\t\t\t\t\tdecoder.decodeGltfBuffer( new Uint8Array( result ), count, stride, source, extensionDef.mode, extensionDef.filter );\n\t\t\t\t\t\treturn result;\n\n\t\t\t\t\t} );\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t} else {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t}\n\n}\n\n/**\n * GPU Instancing Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Vendor/EXT_mesh_gpu_instancing\n *\n * @private\n */\nclass GLTFMeshGpuInstancing {\n\n\tconstructor( parser ) {\n\n\t\tthis.name = EXTENSIONS.EXT_MESH_GPU_INSTANCING;\n\t\tthis.parser = parser;\n\n\t}\n\n\tcreateNodeMesh( nodeIndex ) {\n\n\t\tconst json = this.parser.json;\n\t\tconst nodeDef = json.nodes[ nodeIndex ];\n\n\t\tif ( ! nodeDef.extensions || ! nodeDef.extensions[ this.name ] ||\n\t\t\tnodeDef.mesh === undefined ) {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t\tconst meshDef = json.meshes[ nodeDef.mesh ];\n\n\t\t// No Points or Lines + Instancing support yet\n\n\t\tfor ( const primitive of meshDef.primitives ) {\n\n\t\t\tif ( primitive.mode !== WEBGL_CONSTANTS.TRIANGLES &&\n\t\t\t\t primitive.mode !== WEBGL_CONSTANTS.TRIANGLE_STRIP &&\n\t\t\t\t primitive.mode !== WEBGL_CONSTANTS.TRIANGLE_FAN &&\n\t\t\t\t primitive.mode !== undefined ) {\n\n\t\t\t\treturn null;\n\n\t\t\t}\n\n\t\t}\n\n\t\tconst extensionDef = nodeDef.extensions[ this.name ];\n\t\tconst attributesDef = extensionDef.attributes;\n\n\t\t// @TODO: Can we support InstancedMesh + SkinnedMesh?\n\n\t\tconst pending = [];\n\t\tconst attributes = {};\n\n\t\tfor ( const key in attributesDef ) {\n\n\t\t\tpending.push( this.parser.getDependency( 'accessor', attributesDef[ key ] ).then( accessor => {\n\n\t\t\t\tattributes[ key ] = accessor;\n\t\t\t\treturn attributes[ key ];\n\n\t\t\t} ) );\n\n\t\t}\n\n\t\tif ( pending.length < 1 ) {\n\n\t\t\treturn null;\n\n\t\t}\n\n\t\tpending.push( this.parser.createNodeMesh( nodeIndex ) );\n\n\t\treturn Promise.all( pending ).then( results => {\n\n\t\t\tconst nodeObject = results.pop();\n\t\t\tconst meshes = nodeObject.isGroup ? nodeObject.children : [ nodeObject ];\n\t\t\tconst count = results[ 0 ].count; // All attribute counts should be same\n\t\t\tconst instancedMeshes = [];\n\n\t\t\tfor ( const mesh of meshes ) {\n\n\t\t\t\t// Temporal variables\n\t\t\t\tconst m = new Matrix4();\n\t\t\t\tconst p = new Vector3();\n\t\t\t\tconst q = new Quaternion();\n\t\t\t\tconst s = new Vector3( 1, 1, 1 );\n\n\t\t\t\tconst instancedMesh = new InstancedMesh( mesh.geometry, mesh.material, count );\n\n\t\t\t\tfor ( let i = 0; i < count; i ++ ) {\n\n\t\t\t\t\tif ( attributes.TRANSLATION ) {\n\n\t\t\t\t\t\tp.fromBufferAttribute( attributes.TRANSLATION, i );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( attributes.ROTATION ) {\n\n\t\t\t\t\t\tq.fromBufferAttribute( attributes.ROTATION, i );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( attributes.SCALE ) {\n\n\t\t\t\t\t\ts.fromBufferAttribute( attributes.SCALE, i );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tinstancedMesh.setMatrixAt( i, m.compose( p, q, s ) );\n\n\t\t\t\t}\n\n\t\t\t\t// Add instance attributes to the geometry, excluding TRS.\n\t\t\t\tfor ( const attributeName in attributes ) {\n\n\t\t\t\t\tif ( attributeName === '_COLOR_0' ) {\n\n\t\t\t\t\t\tconst attr = attributes[ attributeName ];\n\t\t\t\t\t\tinstancedMesh.instanceColor = new InstancedBufferAttribute( attr.array, attr.itemSize, attr.normalized );\n\n\t\t\t\t\t} else if ( attributeName !== 'TRANSLATION' &&\n\t\t\t\t\t\t attributeName !== 'ROTATION' &&\n\t\t\t\t\t\t attributeName !== 'SCALE' ) {\n\n\t\t\t\t\t\tmesh.geometry.setAttribute( attributeName, attributes[ attributeName ] );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\t// Just in case\n\t\t\t\tObject3D.prototype.copy.call( instancedMesh, mesh );\n\n\t\t\t\tthis.parser.assignFinalMaterial( instancedMesh );\n\n\t\t\t\tinstancedMeshes.push( instancedMesh );\n\n\t\t\t}\n\n\t\t\tif ( nodeObject.isGroup ) {\n\n\t\t\t\tnodeObject.clear();\n\n\t\t\t\tnodeObject.add( ... instancedMeshes );\n\n\t\t\t\treturn nodeObject;\n\n\t\t\t}\n\n\t\t\treturn instancedMeshes[ 0 ];\n\n\t\t} );\n\n\t}\n\n}\n\n/* BINARY EXTENSION */\nconst BINARY_EXTENSION_HEADER_MAGIC = 'glTF';\nconst BINARY_EXTENSION_HEADER_LENGTH = 12;\nconst BINARY_EXTENSION_CHUNK_TYPES = { JSON: 0x4E4F534A, BIN: 0x004E4942 };\n\nclass GLTFBinaryExtension {\n\n\tconstructor( data ) {\n\n\t\tthis.name = EXTENSIONS.KHR_BINARY_GLTF;\n\t\tthis.content = null;\n\t\tthis.body = null;\n\n\t\tconst headerView = new DataView( data, 0, BINARY_EXTENSION_HEADER_LENGTH );\n\t\tconst textDecoder = new TextDecoder();\n\n\t\tthis.header = {\n\t\t\tmagic: textDecoder.decode( new Uint8Array( data.slice( 0, 4 ) ) ),\n\t\t\tversion: headerView.getUint32( 4, true ),\n\t\t\tlength: headerView.getUint32( 8, true )\n\t\t};\n\n\t\tif ( this.header.magic !== BINARY_EXTENSION_HEADER_MAGIC ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: Unsupported glTF-Binary header.' );\n\n\t\t} else if ( this.header.version < 2.0 ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: Legacy binary file detected.' );\n\n\t\t}\n\n\t\tconst chunkContentsLength = this.header.length - BINARY_EXTENSION_HEADER_LENGTH;\n\t\tconst chunkView = new DataView( data, BINARY_EXTENSION_HEADER_LENGTH );\n\t\tlet chunkIndex = 0;\n\n\t\twhile ( chunkIndex < chunkContentsLength ) {\n\n\t\t\tconst chunkLength = chunkView.getUint32( chunkIndex, true );\n\t\t\tchunkIndex += 4;\n\n\t\t\tconst chunkType = chunkView.getUint32( chunkIndex, true );\n\t\t\tchunkIndex += 4;\n\n\t\t\tif ( chunkType === BINARY_EXTENSION_CHUNK_TYPES.JSON ) {\n\n\t\t\t\tconst contentArray = new Uint8Array( data, BINARY_EXTENSION_HEADER_LENGTH + chunkIndex, chunkLength );\n\t\t\t\tthis.content = textDecoder.decode( contentArray );\n\n\t\t\t} else if ( chunkType === BINARY_EXTENSION_CHUNK_TYPES.BIN ) {\n\n\t\t\t\tconst byteOffset = BINARY_EXTENSION_HEADER_LENGTH + chunkIndex;\n\t\t\t\tthis.body = data.slice( byteOffset, byteOffset + chunkLength );\n\n\t\t\t}\n\n\t\t\t// Clients must ignore chunks with unknown types.\n\n\t\t\tchunkIndex += chunkLength;\n\n\t\t}\n\n\t\tif ( this.content === null ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: JSON content not found.' );\n\n\t\t}\n\n\t}\n\n}\n\n/**\n * DRACO Mesh Compression Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_draco_mesh_compression\n *\n * @private\n */\nclass GLTFDracoMeshCompressionExtension {\n\n\tconstructor( json, dracoLoader ) {\n\n\t\tif ( ! dracoLoader ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: No DRACOLoader instance provided.' );\n\n\t\t}\n\n\t\tthis.name = EXTENSIONS.KHR_DRACO_MESH_COMPRESSION;\n\t\tthis.json = json;\n\t\tthis.dracoLoader = dracoLoader;\n\t\tthis.dracoLoader.preload();\n\n\t}\n\n\tdecodePrimitive( primitive, parser ) {\n\n\t\tconst json = this.json;\n\t\tconst dracoLoader = this.dracoLoader;\n\t\tconst bufferViewIndex = primitive.extensions[ this.name ].bufferView;\n\t\tconst gltfAttributeMap = primitive.extensions[ this.name ].attributes;\n\t\tconst threeAttributeMap = {};\n\t\tconst attributeNormalizedMap = {};\n\t\tconst attributeTypeMap = {};\n\n\t\tfor ( const attributeName in gltfAttributeMap ) {\n\n\t\t\tconst threeAttributeName = ATTRIBUTES[ attributeName ] || attributeName.toLowerCase();\n\n\t\t\tthreeAttributeMap[ threeAttributeName ] = gltfAttributeMap[ attributeName ];\n\n\t\t}\n\n\t\tfor ( const attributeName in primitive.attributes ) {\n\n\t\t\tconst threeAttributeName = ATTRIBUTES[ attributeName ] || attributeName.toLowerCase();\n\n\t\t\tif ( gltfAttributeMap[ attributeName ] !== undefined ) {\n\n\t\t\t\tconst accessorDef = json.accessors[ primitive.attributes[ attributeName ] ];\n\t\t\t\tconst componentType = WEBGL_COMPONENT_TYPES[ accessorDef.componentType ];\n\n\t\t\t\tattributeTypeMap[ threeAttributeName ] = componentType.name;\n\t\t\t\tattributeNormalizedMap[ threeAttributeName ] = accessorDef.normalized === true;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn parser.getDependency( 'bufferView', bufferViewIndex ).then( function ( bufferView ) {\n\n\t\t\treturn new Promise( function ( resolve, reject ) {\n\n\t\t\t\tdracoLoader.decodeDracoFile( bufferView, function ( geometry ) {\n\n\t\t\t\t\tfor ( const attributeName in geometry.attributes ) {\n\n\t\t\t\t\t\tconst attribute = geometry.attributes[ attributeName ];\n\t\t\t\t\t\tconst normalized = attributeNormalizedMap[ attributeName ];\n\n\t\t\t\t\t\tif ( normalized !== undefined ) attribute.normalized = normalized;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tresolve( geometry );\n\n\t\t\t\t}, threeAttributeMap, attributeTypeMap, LinearSRGBColorSpace, reject );\n\n\t\t\t} );\n\n\t\t} );\n\n\t}\n\n}\n\n/**\n * Texture Transform Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_texture_transform\n *\n * @private\n */\nclass GLTFTextureTransformExtension {\n\n\tconstructor() {\n\n\t\tthis.name = EXTENSIONS.KHR_TEXTURE_TRANSFORM;\n\n\t}\n\n\textendTexture( texture, transform ) {\n\n\t\tif ( ( transform.texCoord === undefined || transform.texCoord === texture.channel )\n\t\t\t&& transform.offset === undefined\n\t\t\t&& transform.rotation === undefined\n\t\t\t&& transform.scale === undefined ) {\n\n\t\t\t// See https://github.com/mrdoob/three.js/issues/21819.\n\t\t\treturn texture;\n\n\t\t}\n\n\t\ttexture = texture.clone();\n\n\t\tif ( transform.texCoord !== undefined ) {\n\n\t\t\ttexture.channel = transform.texCoord;\n\n\t\t}\n\n\t\tif ( transform.offset !== undefined ) {\n\n\t\t\ttexture.offset.fromArray( transform.offset );\n\n\t\t}\n\n\t\tif ( transform.rotation !== undefined ) {\n\n\t\t\ttexture.rotation = transform.rotation;\n\n\t\t}\n\n\t\tif ( transform.scale !== undefined ) {\n\n\t\t\ttexture.repeat.fromArray( transform.scale );\n\n\t\t}\n\n\t\ttexture.needsUpdate = true;\n\n\t\treturn texture;\n\n\t}\n\n}\n\n/**\n * Mesh Quantization Extension\n *\n * Specification: https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_mesh_quantization\n *\n * @private\n */\nclass GLTFMeshQuantizationExtension {\n\n\tconstructor() {\n\n\t\tthis.name = EXTENSIONS.KHR_MESH_QUANTIZATION;\n\n\t}\n\n}\n\n/*********************************/\n/********** INTERPOLATION ********/\n/*********************************/\n\n// Spline Interpolation\n// Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#appendix-c-spline-interpolation\nclass GLTFCubicSplineInterpolant extends Interpolant {\n\n\tconstructor( parameterPositions, sampleValues, sampleSize, resultBuffer ) {\n\n\t\tsuper( parameterPositions, sampleValues, sampleSize, resultBuffer );\n\n\t}\n\n\tcopySampleValue_( index ) {\n\n\t\t// Copies a sample value to the result buffer. See description of glTF\n\t\t// CUBICSPLINE values layout in interpolate_() function below.\n\n\t\tconst result = this.resultBuffer,\n\t\t\tvalues = this.sampleValues,\n\t\t\tvalueSize = this.valueSize,\n\t\t\toffset = index * valueSize * 3 + valueSize;\n\n\t\tfor ( let i = 0; i !== valueSize; i ++ ) {\n\n\t\t\tresult[ i ] = values[ offset + i ];\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n\tinterpolate_( i1, t0, t, t1 ) {\n\n\t\tconst result = this.resultBuffer;\n\t\tconst values = this.sampleValues;\n\t\tconst stride = this.valueSize;\n\n\t\tconst stride2 = stride * 2;\n\t\tconst stride3 = stride * 3;\n\n\t\tconst td = t1 - t0;\n\n\t\tconst p = ( t - t0 ) / td;\n\t\tconst pp = p * p;\n\t\tconst ppp = pp * p;\n\n\t\tconst offset1 = i1 * stride3;\n\t\tconst offset0 = offset1 - stride3;\n\n\t\tconst s2 = - 2 * ppp + 3 * pp;\n\t\tconst s3 = ppp - pp;\n\t\tconst s0 = 1 - s2;\n\t\tconst s1 = s3 - pp + p;\n\n\t\t// Layout of keyframe output values for CUBICSPLINE animations:\n\t\t//   [ inTangent_1, splineVertex_1, outTangent_1, inTangent_2, splineVertex_2, ... ]\n\t\tfor ( let i = 0; i !== stride; i ++ ) {\n\n\t\t\tconst p0 = values[ offset0 + i + stride ]; // splineVertex_k\n\t\t\tconst m0 = values[ offset0 + i + stride2 ] * td; // outTangent_k * (t_k+1 - t_k)\n\t\t\tconst p1 = values[ offset1 + i + stride ]; // splineVertex_k+1\n\t\t\tconst m1 = values[ offset1 + i ] * td; // inTangent_k+1 * (t_k+1 - t_k)\n\n\t\t\tresult[ i ] = s0 * p0 + s1 * m0 + s2 * p1 + s3 * m1;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n}\n\nconst _quaternion = new Quaternion();\n\nclass GLTFCubicSplineQuaternionInterpolant extends GLTFCubicSplineInterpolant {\n\n\tinterpolate_( i1, t0, t, t1 ) {\n\n\t\tconst result = super.interpolate_( i1, t0, t, t1 );\n\n\t\t_quaternion.fromArray( result ).normalize().toArray( result );\n\n\t\treturn result;\n\n\t}\n\n}\n\n\n/*********************************/\n/********** INTERNALS ************/\n/*********************************/\n\n/* CONSTANTS */\n\nconst WEBGL_CONSTANTS = {\n\tFLOAT: 5126,\n\t//FLOAT_MAT2: 35674,\n\tFLOAT_MAT3: 35675,\n\tFLOAT_MAT4: 35676,\n\tFLOAT_VEC2: 35664,\n\tFLOAT_VEC3: 35665,\n\tFLOAT_VEC4: 35666,\n\tLINEAR: 9729,\n\tREPEAT: 10497,\n\tSAMPLER_2D: 35678,\n\tPOINTS: 0,\n\tLINES: 1,\n\tLINE_LOOP: 2,\n\tLINE_STRIP: 3,\n\tTRIANGLES: 4,\n\tTRIANGLE_STRIP: 5,\n\tTRIANGLE_FAN: 6,\n\tUNSIGNED_BYTE: 5121,\n\tUNSIGNED_SHORT: 5123\n};\n\nconst WEBGL_COMPONENT_TYPES = {\n\t5120: Int8Array,\n\t5121: Uint8Array,\n\t5122: Int16Array,\n\t5123: Uint16Array,\n\t5125: Uint32Array,\n\t5126: Float32Array\n};\n\nconst WEBGL_FILTERS = {\n\t9728: NearestFilter,\n\t9729: LinearFilter,\n\t9984: NearestMipmapNearestFilter,\n\t9985: LinearMipmapNearestFilter,\n\t9986: NearestMipmapLinearFilter,\n\t9987: LinearMipmapLinearFilter\n};\n\nconst WEBGL_WRAPPINGS = {\n\t33071: ClampToEdgeWrapping,\n\t33648: MirroredRepeatWrapping,\n\t10497: RepeatWrapping\n};\n\nconst WEBGL_TYPE_SIZES = {\n\t'SCALAR': 1,\n\t'VEC2': 2,\n\t'VEC3': 3,\n\t'VEC4': 4,\n\t'MAT2': 4,\n\t'MAT3': 9,\n\t'MAT4': 16\n};\n\nconst ATTRIBUTES = {\n\tPOSITION: 'position',\n\tNORMAL: 'normal',\n\tTANGENT: 'tangent',\n\tTEXCOORD_0: 'uv',\n\tTEXCOORD_1: 'uv1',\n\tTEXCOORD_2: 'uv2',\n\tTEXCOORD_3: 'uv3',\n\tCOLOR_0: 'color',\n\tWEIGHTS_0: 'skinWeight',\n\tJOINTS_0: 'skinIndex',\n};\n\nconst PATH_PROPERTIES = {\n\tscale: 'scale',\n\ttranslation: 'position',\n\trotation: 'quaternion',\n\tweights: 'morphTargetInfluences'\n};\n\nconst INTERPOLATION = {\n\tCUBICSPLINE: undefined, // We use a custom interpolant (GLTFCubicSplineInterpolation) for CUBICSPLINE tracks. Each\n\t\t                        // keyframe track will be initialized with a default interpolation type, then modified.\n\tLINEAR: InterpolateLinear,\n\tSTEP: InterpolateDiscrete\n};\n\nconst ALPHA_MODES = {\n\tOPAQUE: 'OPAQUE',\n\tMASK: 'MASK',\n\tBLEND: 'BLEND'\n};\n\n/**\n * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#default-material\n *\n * @private\n * @param {Object<string, Material>} cache\n * @return {Material}\n */\nfunction createDefaultMaterial( cache ) {\n\n\tif ( cache[ 'DefaultMaterial' ] === undefined ) {\n\n\t\tcache[ 'DefaultMaterial' ] = new MeshStandardMaterial( {\n\t\t\tcolor: 0xFFFFFF,\n\t\t\temissive: 0x000000,\n\t\t\tmetalness: 1,\n\t\t\troughness: 1,\n\t\t\ttransparent: false,\n\t\t\tdepthTest: true,\n\t\t\tside: FrontSide\n\t\t} );\n\n\t}\n\n\treturn cache[ 'DefaultMaterial' ];\n\n}\n\nfunction addUnknownExtensionsToUserData( knownExtensions, object, objectDef ) {\n\n\t// Add unknown glTF extensions to an object's userData.\n\n\tfor ( const name in objectDef.extensions ) {\n\n\t\tif ( knownExtensions[ name ] === undefined ) {\n\n\t\t\tobject.userData.gltfExtensions = object.userData.gltfExtensions || {};\n\t\t\tobject.userData.gltfExtensions[ name ] = objectDef.extensions[ name ];\n\n\t\t}\n\n\t}\n\n}\n\n/**\n *\n * @private\n * @param {Object3D|Material|BufferGeometry|Object|AnimationClip} object\n * @param {GLTF.definition} gltfDef\n */\nfunction assignExtrasToUserData( object, gltfDef ) {\n\n\tif ( gltfDef.extras !== undefined ) {\n\n\t\tif ( typeof gltfDef.extras === 'object' ) {\n\n\t\t\tObject.assign( object.userData, gltfDef.extras );\n\n\t\t} else {\n\n\t\t\tconsole.warn( 'THREE.GLTFLoader: Ignoring primitive type .extras, ' + gltfDef.extras );\n\n\t\t}\n\n\t}\n\n}\n\n/**\n * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#morph-targets\n *\n * @private\n * @param {BufferGeometry} geometry\n * @param {Array<GLTF.Target>} targets\n * @param {GLTFParser} parser\n * @return {Promise<BufferGeometry>}\n */\nfunction addMorphTargets( geometry, targets, parser ) {\n\n\tlet hasMorphPosition = false;\n\tlet hasMorphNormal = false;\n\tlet hasMorphColor = false;\n\n\tfor ( let i = 0, il = targets.length; i < il; i ++ ) {\n\n\t\tconst target = targets[ i ];\n\n\t\tif ( target.POSITION !== undefined ) hasMorphPosition = true;\n\t\tif ( target.NORMAL !== undefined ) hasMorphNormal = true;\n\t\tif ( target.COLOR_0 !== undefined ) hasMorphColor = true;\n\n\t\tif ( hasMorphPosition && hasMorphNormal && hasMorphColor ) break;\n\n\t}\n\n\tif ( ! hasMorphPosition && ! hasMorphNormal && ! hasMorphColor ) return Promise.resolve( geometry );\n\n\tconst pendingPositionAccessors = [];\n\tconst pendingNormalAccessors = [];\n\tconst pendingColorAccessors = [];\n\n\tfor ( let i = 0, il = targets.length; i < il; i ++ ) {\n\n\t\tconst target = targets[ i ];\n\n\t\tif ( hasMorphPosition ) {\n\n\t\t\tconst pendingAccessor = target.POSITION !== undefined\n\t\t\t\t? parser.getDependency( 'accessor', target.POSITION )\n\t\t\t\t: geometry.attributes.position;\n\n\t\t\tpendingPositionAccessors.push( pendingAccessor );\n\n\t\t}\n\n\t\tif ( hasMorphNormal ) {\n\n\t\t\tconst pendingAccessor = target.NORMAL !== undefined\n\t\t\t\t? parser.getDependency( 'accessor', target.NORMAL )\n\t\t\t\t: geometry.attributes.normal;\n\n\t\t\tpendingNormalAccessors.push( pendingAccessor );\n\n\t\t}\n\n\t\tif ( hasMorphColor ) {\n\n\t\t\tconst pendingAccessor = target.COLOR_0 !== undefined\n\t\t\t\t? parser.getDependency( 'accessor', target.COLOR_0 )\n\t\t\t\t: geometry.attributes.color;\n\n\t\t\tpendingColorAccessors.push( pendingAccessor );\n\n\t\t}\n\n\t}\n\n\treturn Promise.all( [\n\t\tPromise.all( pendingPositionAccessors ),\n\t\tPromise.all( pendingNormalAccessors ),\n\t\tPromise.all( pendingColorAccessors )\n\t] ).then( function ( accessors ) {\n\n\t\tconst morphPositions = accessors[ 0 ];\n\t\tconst morphNormals = accessors[ 1 ];\n\t\tconst morphColors = accessors[ 2 ];\n\n\t\tif ( hasMorphPosition ) geometry.morphAttributes.position = morphPositions;\n\t\tif ( hasMorphNormal ) geometry.morphAttributes.normal = morphNormals;\n\t\tif ( hasMorphColor ) geometry.morphAttributes.color = morphColors;\n\t\tgeometry.morphTargetsRelative = true;\n\n\t\treturn geometry;\n\n\t} );\n\n}\n\n/**\n *\n * @private\n * @param {Mesh} mesh\n * @param {GLTF.Mesh} meshDef\n */\nfunction updateMorphTargets( mesh, meshDef ) {\n\n\tmesh.updateMorphTargets();\n\n\tif ( meshDef.weights !== undefined ) {\n\n\t\tfor ( let i = 0, il = meshDef.weights.length; i < il; i ++ ) {\n\n\t\t\tmesh.morphTargetInfluences[ i ] = meshDef.weights[ i ];\n\n\t\t}\n\n\t}\n\n\t// .extras has user-defined data, so check that .extras.targetNames is an array.\n\tif ( meshDef.extras && Array.isArray( meshDef.extras.targetNames ) ) {\n\n\t\tconst targetNames = meshDef.extras.targetNames;\n\n\t\tif ( mesh.morphTargetInfluences.length === targetNames.length ) {\n\n\t\t\tmesh.morphTargetDictionary = {};\n\n\t\t\tfor ( let i = 0, il = targetNames.length; i < il; i ++ ) {\n\n\t\t\t\tmesh.morphTargetDictionary[ targetNames[ i ] ] = i;\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconsole.warn( 'THREE.GLTFLoader: Invalid extras.targetNames length. Ignoring names.' );\n\n\t\t}\n\n\t}\n\n}\n\nfunction createPrimitiveKey( primitiveDef ) {\n\n\tlet geometryKey;\n\n\tconst dracoExtension = primitiveDef.extensions && primitiveDef.extensions[ EXTENSIONS.KHR_DRACO_MESH_COMPRESSION ];\n\n\tif ( dracoExtension ) {\n\n\t\tgeometryKey = 'draco:' + dracoExtension.bufferView\n\t\t\t\t+ ':' + dracoExtension.indices\n\t\t\t\t+ ':' + createAttributesKey( dracoExtension.attributes );\n\n\t} else {\n\n\t\tgeometryKey = primitiveDef.indices + ':' + createAttributesKey( primitiveDef.attributes ) + ':' + primitiveDef.mode;\n\n\t}\n\n\tif ( primitiveDef.targets !== undefined ) {\n\n\t\tfor ( let i = 0, il = primitiveDef.targets.length; i < il; i ++ ) {\n\n\t\t\tgeometryKey += ':' + createAttributesKey( primitiveDef.targets[ i ] );\n\n\t\t}\n\n\t}\n\n\treturn geometryKey;\n\n}\n\nfunction createAttributesKey( attributes ) {\n\n\tlet attributesKey = '';\n\n\tconst keys = Object.keys( attributes ).sort();\n\n\tfor ( let i = 0, il = keys.length; i < il; i ++ ) {\n\n\t\tattributesKey += keys[ i ] + ':' + attributes[ keys[ i ] ] + ';';\n\n\t}\n\n\treturn attributesKey;\n\n}\n\nfunction getNormalizedComponentScale( constructor ) {\n\n\t// Reference:\n\t// https://github.com/KhronosGroup/glTF/tree/master/extensions/2.0/Khronos/KHR_mesh_quantization#encoding-quantized-data\n\n\tswitch ( constructor ) {\n\n\t\tcase Int8Array:\n\t\t\treturn 1 / 127;\n\n\t\tcase Uint8Array:\n\t\t\treturn 1 / 255;\n\n\t\tcase Int16Array:\n\t\t\treturn 1 / 32767;\n\n\t\tcase Uint16Array:\n\t\t\treturn 1 / 65535;\n\n\t\tdefault:\n\t\t\tthrow new Error( 'THREE.GLTFLoader: Unsupported normalized accessor component type.' );\n\n\t}\n\n}\n\nfunction getImageURIMimeType( uri ) {\n\n\tif ( uri.search( /\\.jpe?g($|\\?)/i ) > 0 || uri.search( /^data\\:image\\/jpeg/ ) === 0 ) return 'image/jpeg';\n\tif ( uri.search( /\\.webp($|\\?)/i ) > 0 || uri.search( /^data\\:image\\/webp/ ) === 0 ) return 'image/webp';\n\tif ( uri.search( /\\.ktx2($|\\?)/i ) > 0 || uri.search( /^data\\:image\\/ktx2/ ) === 0 ) return 'image/ktx2';\n\n\treturn 'image/png';\n\n}\n\nconst _identityMatrix = new Matrix4();\n\n/* GLTF PARSER */\n\nclass GLTFParser {\n\n\tconstructor( json = {}, options = {} ) {\n\n\t\tthis.json = json;\n\t\tthis.extensions = {};\n\t\tthis.plugins = {};\n\t\tthis.options = options;\n\n\t\t// loader object cache\n\t\tthis.cache = new GLTFRegistry();\n\n\t\t// associations between Three.js objects and glTF elements\n\t\tthis.associations = new Map();\n\n\t\t// BufferGeometry caching\n\t\tthis.primitiveCache = {};\n\n\t\t// Node cache\n\t\tthis.nodeCache = {};\n\n\t\t// Object3D instance caches\n\t\tthis.meshCache = { refs: {}, uses: {} };\n\t\tthis.cameraCache = { refs: {}, uses: {} };\n\t\tthis.lightCache = { refs: {}, uses: {} };\n\n\t\tthis.sourceCache = {};\n\t\tthis.textureCache = {};\n\n\t\t// Track node names, to ensure no duplicates\n\t\tthis.nodeNamesUsed = {};\n\n\t\t// Use an ImageBitmapLoader if imageBitmaps are supported. Moves much of the\n\t\t// expensive work of uploading a texture to the GPU off the main thread.\n\n\t\tlet isSafari = false;\n\t\tlet safariVersion = - 1;\n\t\tlet isFirefox = false;\n\t\tlet firefoxVersion = - 1;\n\n\t\tif ( typeof navigator !== 'undefined' ) {\n\n\t\t\tconst userAgent = navigator.userAgent;\n\n\t\t\tisSafari = /^((?!chrome|android).)*safari/i.test( userAgent ) === true;\n\t\t\tconst safariMatch = userAgent.match( /Version\\/(\\d+)/ );\n\t\t\tsafariVersion = isSafari && safariMatch ? parseInt( safariMatch[ 1 ], 10 ) : - 1;\n\n\t\t\tisFirefox = userAgent.indexOf( 'Firefox' ) > - 1;\n\t\t\tfirefoxVersion = isFirefox ? userAgent.match( /Firefox\\/([0-9]+)\\./ )[ 1 ] : - 1;\n\n\t\t}\n\n\t\tif ( typeof createImageBitmap === 'undefined' || ( isSafari && safariVersion < 17 ) || ( isFirefox && firefoxVersion < 98 ) ) {\n\n\t\t\tthis.textureLoader = new TextureLoader( this.options.manager );\n\n\t\t} else {\n\n\t\t\tthis.textureLoader = new ImageBitmapLoader( this.options.manager );\n\n\t\t}\n\n\t\tthis.textureLoader.setCrossOrigin( this.options.crossOrigin );\n\t\tthis.textureLoader.setRequestHeader( this.options.requestHeader );\n\n\t\tthis.fileLoader = new FileLoader( this.options.manager );\n\t\tthis.fileLoader.setResponseType( 'arraybuffer' );\n\n\t\tif ( this.options.crossOrigin === 'use-credentials' ) {\n\n\t\t\tthis.fileLoader.setWithCredentials( true );\n\n\t\t}\n\n\t}\n\n\tsetExtensions( extensions ) {\n\n\t\tthis.extensions = extensions;\n\n\t}\n\n\tsetPlugins( plugins ) {\n\n\t\tthis.plugins = plugins;\n\n\t}\n\n\tparse( onLoad, onError ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\t\tconst extensions = this.extensions;\n\n\t\t// Clear the loader cache\n\t\tthis.cache.removeAll();\n\t\tthis.nodeCache = {};\n\n\t\t// Mark the special nodes/meshes in json for efficient parse\n\t\tthis._invokeAll( function ( ext ) {\n\n\t\t\treturn ext._markDefs && ext._markDefs();\n\n\t\t} );\n\n\t\tPromise.all( this._invokeAll( function ( ext ) {\n\n\t\t\treturn ext.beforeRoot && ext.beforeRoot();\n\n\t\t} ) ).then( function () {\n\n\t\t\treturn Promise.all( [\n\n\t\t\t\tparser.getDependencies( 'scene' ),\n\t\t\t\tparser.getDependencies( 'animation' ),\n\t\t\t\tparser.getDependencies( 'camera' ),\n\n\t\t\t] );\n\n\t\t} ).then( function ( dependencies ) {\n\n\t\t\tconst result = {\n\t\t\t\tscene: dependencies[ 0 ][ json.scene || 0 ],\n\t\t\t\tscenes: dependencies[ 0 ],\n\t\t\t\tanimations: dependencies[ 1 ],\n\t\t\t\tcameras: dependencies[ 2 ],\n\t\t\t\tasset: json.asset,\n\t\t\t\tparser: parser,\n\t\t\t\tuserData: {}\n\t\t\t};\n\n\t\t\taddUnknownExtensionsToUserData( extensions, result, json );\n\n\t\t\tassignExtrasToUserData( result, json );\n\n\t\t\treturn Promise.all( parser._invokeAll( function ( ext ) {\n\n\t\t\t\treturn ext.afterRoot && ext.afterRoot( result );\n\n\t\t\t} ) ).then( function () {\n\n\t\t\t\tfor ( const scene of result.scenes ) {\n\n\t\t\t\t\tscene.updateMatrixWorld();\n\n\t\t\t\t}\n\n\t\t\t\tonLoad( result );\n\n\t\t\t} );\n\n\t\t} ).catch( onError );\n\n\t}\n\n\t/**\n\t * Marks the special nodes/meshes in json for efficient parse.\n\t *\n\t * @private\n\t */\n\t_markDefs() {\n\n\t\tconst nodeDefs = this.json.nodes || [];\n\t\tconst skinDefs = this.json.skins || [];\n\t\tconst meshDefs = this.json.meshes || [];\n\n\t\t// Nothing in the node definition indicates whether it is a Bone or an\n\t\t// Object3D. Use the skins' joint references to mark bones.\n\t\tfor ( let skinIndex = 0, skinLength = skinDefs.length; skinIndex < skinLength; skinIndex ++ ) {\n\n\t\t\tconst joints = skinDefs[ skinIndex ].joints;\n\n\t\t\tfor ( let i = 0, il = joints.length; i < il; i ++ ) {\n\n\t\t\t\tnodeDefs[ joints[ i ] ].isBone = true;\n\n\t\t\t}\n\n\t\t}\n\n\t\t// Iterate over all nodes, marking references to shared resources,\n\t\t// as well as skeleton joints.\n\t\tfor ( let nodeIndex = 0, nodeLength = nodeDefs.length; nodeIndex < nodeLength; nodeIndex ++ ) {\n\n\t\t\tconst nodeDef = nodeDefs[ nodeIndex ];\n\n\t\t\tif ( nodeDef.mesh !== undefined ) {\n\n\t\t\t\tthis._addNodeRef( this.meshCache, nodeDef.mesh );\n\n\t\t\t\t// Nothing in the mesh definition indicates whether it is\n\t\t\t\t// a SkinnedMesh or Mesh. Use the node's mesh reference\n\t\t\t\t// to mark SkinnedMesh if node has skin.\n\t\t\t\tif ( nodeDef.skin !== undefined ) {\n\n\t\t\t\t\tmeshDefs[ nodeDef.mesh ].isSkinnedMesh = true;\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( nodeDef.camera !== undefined ) {\n\n\t\t\t\tthis._addNodeRef( this.cameraCache, nodeDef.camera );\n\n\t\t\t}\n\n\t\t}\n\n\t}\n\n\t/**\n\t * Counts references to shared node / Object3D resources. These resources\n\t * can be reused, or \"instantiated\", at multiple nodes in the scene\n\t * hierarchy. Mesh, Camera, and Light instances are instantiated and must\n\t * be marked. Non-scenegraph resources (like Materials, Geometries, and\n\t * Textures) can be reused directly and are not marked here.\n\t *\n\t * Example: CesiumMilkTruck sample model reuses \"Wheel\" meshes.\n\t *\n\t * @private\n\t * @param {Object} cache\n\t * @param {Object3D} index\n\t */\n\t_addNodeRef( cache, index ) {\n\n\t\tif ( index === undefined ) return;\n\n\t\tif ( cache.refs[ index ] === undefined ) {\n\n\t\t\tcache.refs[ index ] = cache.uses[ index ] = 0;\n\n\t\t}\n\n\t\tcache.refs[ index ] ++;\n\n\t}\n\n\t/**\n\t * Returns a reference to a shared resource, cloning it if necessary.\n\t *\n\t * @private\n\t * @param {Object} cache\n\t * @param {number} index\n\t * @param {Object} object\n\t * @return {Object}\n\t */\n\t_getNodeRef( cache, index, object ) {\n\n\t\tif ( cache.refs[ index ] <= 1 ) return object;\n\n\t\tconst ref = object.clone();\n\n\t\t// Propagates mappings to the cloned object, prevents mappings on the\n\t\t// original object from being lost.\n\t\tconst updateMappings = ( original, clone ) => {\n\n\t\t\tconst mappings = this.associations.get( original );\n\t\t\tif ( mappings != null ) {\n\n\t\t\t\tthis.associations.set( clone, mappings );\n\n\t\t\t}\n\n\t\t\tfor ( const [ i, child ] of original.children.entries() ) {\n\n\t\t\t\tupdateMappings( child, clone.children[ i ] );\n\n\t\t\t}\n\n\t\t};\n\n\t\tupdateMappings( object, ref );\n\n\t\tref.name += '_instance_' + ( cache.uses[ index ] ++ );\n\n\t\treturn ref;\n\n\t}\n\n\t_invokeOne( func ) {\n\n\t\tconst extensions = Object.values( this.plugins );\n\t\textensions.push( this );\n\n\t\tfor ( let i = 0; i < extensions.length; i ++ ) {\n\n\t\t\tconst result = func( extensions[ i ] );\n\n\t\t\tif ( result ) return result;\n\n\t\t}\n\n\t\treturn null;\n\n\t}\n\n\t_invokeAll( func ) {\n\n\t\tconst extensions = Object.values( this.plugins );\n\t\textensions.unshift( this );\n\n\t\tconst pending = [];\n\n\t\tfor ( let i = 0; i < extensions.length; i ++ ) {\n\n\t\t\tconst result = func( extensions[ i ] );\n\n\t\t\tif ( result ) pending.push( result );\n\n\t\t}\n\n\t\treturn pending;\n\n\t}\n\n\t/**\n\t * Requests the specified dependency asynchronously, with caching.\n\t *\n\t * @private\n\t * @param {string} type\n\t * @param {number} index\n\t * @return {Promise<Object3D|Material|Texture|AnimationClip|ArrayBuffer|Object>}\n\t */\n\tgetDependency( type, index ) {\n\n\t\tconst cacheKey = type + ':' + index;\n\t\tlet dependency = this.cache.get( cacheKey );\n\n\t\tif ( ! dependency ) {\n\n\t\t\tswitch ( type ) {\n\n\t\t\t\tcase 'scene':\n\t\t\t\t\tdependency = this.loadScene( index );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'node':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadNode && ext.loadNode( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'mesh':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadMesh && ext.loadMesh( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'accessor':\n\t\t\t\t\tdependency = this.loadAccessor( index );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'bufferView':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadBufferView && ext.loadBufferView( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'buffer':\n\t\t\t\t\tdependency = this.loadBuffer( index );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'material':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadMaterial && ext.loadMaterial( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'texture':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadTexture && ext.loadTexture( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'skin':\n\t\t\t\t\tdependency = this.loadSkin( index );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'animation':\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext.loadAnimation && ext.loadAnimation( index );\n\n\t\t\t\t\t} );\n\t\t\t\t\tbreak;\n\n\t\t\t\tcase 'camera':\n\t\t\t\t\tdependency = this.loadCamera( index );\n\t\t\t\t\tbreak;\n\n\t\t\t\tdefault:\n\t\t\t\t\tdependency = this._invokeOne( function ( ext ) {\n\n\t\t\t\t\t\treturn ext != this && ext.getDependency && ext.getDependency( type, index );\n\n\t\t\t\t\t} );\n\n\t\t\t\t\tif ( ! dependency ) {\n\n\t\t\t\t\t\tthrow new Error( 'Unknown type: ' + type );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tbreak;\n\n\t\t\t}\n\n\t\t\tthis.cache.add( cacheKey, dependency );\n\n\t\t}\n\n\t\treturn dependency;\n\n\t}\n\n\t/**\n\t * Requests all dependencies of the specified type asynchronously, with caching.\n\t *\n\t * @private\n\t * @param {string} type\n\t * @return {Promise<Array<Object>>}\n\t */\n\tgetDependencies( type ) {\n\n\t\tlet dependencies = this.cache.get( type );\n\n\t\tif ( ! dependencies ) {\n\n\t\t\tconst parser = this;\n\t\t\tconst defs = this.json[ type + ( type === 'mesh' ? 'es' : 's' ) ] || [];\n\n\t\t\tdependencies = Promise.all( defs.map( function ( def, index ) {\n\n\t\t\t\treturn parser.getDependency( type, index );\n\n\t\t\t} ) );\n\n\t\t\tthis.cache.add( type, dependencies );\n\n\t\t}\n\n\t\treturn dependencies;\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#buffers-and-buffer-views\n\t *\n\t * @private\n\t * @param {number} bufferIndex\n\t * @return {Promise<ArrayBuffer>}\n\t */\n\tloadBuffer( bufferIndex ) {\n\n\t\tconst bufferDef = this.json.buffers[ bufferIndex ];\n\t\tconst loader = this.fileLoader;\n\n\t\tif ( bufferDef.type && bufferDef.type !== 'arraybuffer' ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: ' + bufferDef.type + ' buffer type is not supported.' );\n\n\t\t}\n\n\t\t// If present, GLB container is required to be the first buffer.\n\t\tif ( bufferDef.uri === undefined && bufferIndex === 0 ) {\n\n\t\t\treturn Promise.resolve( this.extensions[ EXTENSIONS.KHR_BINARY_GLTF ].body );\n\n\t\t}\n\n\t\tconst options = this.options;\n\n\t\treturn new Promise( function ( resolve, reject ) {\n\n\t\t\tloader.load( LoaderUtils.resolveURL( bufferDef.uri, options.path ), resolve, undefined, function () {\n\n\t\t\t\treject( new Error( 'THREE.GLTFLoader: Failed to load buffer \"' + bufferDef.uri + '\".' ) );\n\n\t\t\t} );\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#buffers-and-buffer-views\n\t *\n\t * @private\n\t * @param {number} bufferViewIndex\n\t * @return {Promise<ArrayBuffer>}\n\t */\n\tloadBufferView( bufferViewIndex ) {\n\n\t\tconst bufferViewDef = this.json.bufferViews[ bufferViewIndex ];\n\n\t\treturn this.getDependency( 'buffer', bufferViewDef.buffer ).then( function ( buffer ) {\n\n\t\t\tconst byteLength = bufferViewDef.byteLength || 0;\n\t\t\tconst byteOffset = bufferViewDef.byteOffset || 0;\n\t\t\treturn buffer.slice( byteOffset, byteOffset + byteLength );\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#accessors\n\t *\n\t * @private\n\t * @param {number} accessorIndex\n\t * @return {Promise<BufferAttribute|InterleavedBufferAttribute>}\n\t */\n\tloadAccessor( accessorIndex ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\n\t\tconst accessorDef = this.json.accessors[ accessorIndex ];\n\n\t\tif ( accessorDef.bufferView === undefined && accessorDef.sparse === undefined ) {\n\n\t\t\tconst itemSize = WEBGL_TYPE_SIZES[ accessorDef.type ];\n\t\t\tconst TypedArray = WEBGL_COMPONENT_TYPES[ accessorDef.componentType ];\n\t\t\tconst normalized = accessorDef.normalized === true;\n\n\t\t\tconst array = new TypedArray( accessorDef.count * itemSize );\n\t\t\treturn Promise.resolve( new BufferAttribute( array, itemSize, normalized ) );\n\n\t\t}\n\n\t\tconst pendingBufferViews = [];\n\n\t\tif ( accessorDef.bufferView !== undefined ) {\n\n\t\t\tpendingBufferViews.push( this.getDependency( 'bufferView', accessorDef.bufferView ) );\n\n\t\t} else {\n\n\t\t\tpendingBufferViews.push( null );\n\n\t\t}\n\n\t\tif ( accessorDef.sparse !== undefined ) {\n\n\t\t\tpendingBufferViews.push( this.getDependency( 'bufferView', accessorDef.sparse.indices.bufferView ) );\n\t\t\tpendingBufferViews.push( this.getDependency( 'bufferView', accessorDef.sparse.values.bufferView ) );\n\n\t\t}\n\n\t\treturn Promise.all( pendingBufferViews ).then( function ( bufferViews ) {\n\n\t\t\tconst bufferView = bufferViews[ 0 ];\n\n\t\t\tconst itemSize = WEBGL_TYPE_SIZES[ accessorDef.type ];\n\t\t\tconst TypedArray = WEBGL_COMPONENT_TYPES[ accessorDef.componentType ];\n\n\t\t\t// For VEC3: itemSize is 3, elementBytes is 4, itemBytes is 12.\n\t\t\tconst elementBytes = TypedArray.BYTES_PER_ELEMENT;\n\t\t\tconst itemBytes = elementBytes * itemSize;\n\t\t\tconst byteOffset = accessorDef.byteOffset || 0;\n\t\t\tconst byteStride = accessorDef.bufferView !== undefined ? json.bufferViews[ accessorDef.bufferView ].byteStride : undefined;\n\t\t\tconst normalized = accessorDef.normalized === true;\n\t\t\tlet array, bufferAttribute;\n\n\t\t\t// The buffer is not interleaved if the stride is the item size in bytes.\n\t\t\tif ( byteStride && byteStride !== itemBytes ) {\n\n\t\t\t\t// Each \"slice\" of the buffer, as defined by 'count' elements of 'byteStride' bytes, gets its own InterleavedBuffer\n\t\t\t\t// This makes sure that IBA.count reflects accessor.count properly\n\t\t\t\tconst ibSlice = Math.floor( byteOffset / byteStride );\n\t\t\t\tconst ibCacheKey = 'InterleavedBuffer:' + accessorDef.bufferView + ':' + accessorDef.componentType + ':' + ibSlice + ':' + accessorDef.count;\n\t\t\t\tlet ib = parser.cache.get( ibCacheKey );\n\n\t\t\t\tif ( ! ib ) {\n\n\t\t\t\t\tarray = new TypedArray( bufferView, ibSlice * byteStride, accessorDef.count * byteStride / elementBytes );\n\n\t\t\t\t\t// Integer parameters to IB/IBA are in array elements, not bytes.\n\t\t\t\t\tib = new InterleavedBuffer( array, byteStride / elementBytes );\n\n\t\t\t\t\tparser.cache.add( ibCacheKey, ib );\n\n\t\t\t\t}\n\n\t\t\t\tbufferAttribute = new InterleavedBufferAttribute( ib, itemSize, ( byteOffset % byteStride ) / elementBytes, normalized );\n\n\t\t\t} else {\n\n\t\t\t\tif ( bufferView === null ) {\n\n\t\t\t\t\tarray = new TypedArray( accessorDef.count * itemSize );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tarray = new TypedArray( bufferView, byteOffset, accessorDef.count * itemSize );\n\n\t\t\t\t}\n\n\t\t\t\tbufferAttribute = new BufferAttribute( array, itemSize, normalized );\n\n\t\t\t}\n\n\t\t\t// https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#sparse-accessors\n\t\t\tif ( accessorDef.sparse !== undefined ) {\n\n\t\t\t\tconst itemSizeIndices = WEBGL_TYPE_SIZES.SCALAR;\n\t\t\t\tconst TypedArrayIndices = WEBGL_COMPONENT_TYPES[ accessorDef.sparse.indices.componentType ];\n\n\t\t\t\tconst byteOffsetIndices = accessorDef.sparse.indices.byteOffset || 0;\n\t\t\t\tconst byteOffsetValues = accessorDef.sparse.values.byteOffset || 0;\n\n\t\t\t\tconst sparseIndices = new TypedArrayIndices( bufferViews[ 1 ], byteOffsetIndices, accessorDef.sparse.count * itemSizeIndices );\n\t\t\t\tconst sparseValues = new TypedArray( bufferViews[ 2 ], byteOffsetValues, accessorDef.sparse.count * itemSize );\n\n\t\t\t\tif ( bufferView !== null ) {\n\n\t\t\t\t\t// Avoid modifying the original ArrayBuffer, if the bufferView wasn't initialized with zeroes.\n\t\t\t\t\tbufferAttribute = new BufferAttribute( bufferAttribute.array.slice(), bufferAttribute.itemSize, bufferAttribute.normalized );\n\n\t\t\t\t}\n\n\t\t\t\t// Ignore normalized since we copy from sparse\n\t\t\t\tbufferAttribute.normalized = false;\n\n\t\t\t\tfor ( let i = 0, il = sparseIndices.length; i < il; i ++ ) {\n\n\t\t\t\t\tconst index = sparseIndices[ i ];\n\n\t\t\t\t\tbufferAttribute.setX( index, sparseValues[ i * itemSize ] );\n\t\t\t\t\tif ( itemSize >= 2 ) bufferAttribute.setY( index, sparseValues[ i * itemSize + 1 ] );\n\t\t\t\t\tif ( itemSize >= 3 ) bufferAttribute.setZ( index, sparseValues[ i * itemSize + 2 ] );\n\t\t\t\t\tif ( itemSize >= 4 ) bufferAttribute.setW( index, sparseValues[ i * itemSize + 3 ] );\n\t\t\t\t\tif ( itemSize >= 5 ) throw new Error( 'THREE.GLTFLoader: Unsupported itemSize in sparse BufferAttribute.' );\n\n\t\t\t\t}\n\n\t\t\t\tbufferAttribute.normalized = normalized;\n\n\t\t\t}\n\n\t\t\treturn bufferAttribute;\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#textures\n\t *\n\t * @private\n\t * @param {number} textureIndex\n\t * @return {Promise<?Texture>}\n\t */\n\tloadTexture( textureIndex ) {\n\n\t\tconst json = this.json;\n\t\tconst options = this.options;\n\t\tconst textureDef = json.textures[ textureIndex ];\n\t\tconst sourceIndex = textureDef.source;\n\t\tconst sourceDef = json.images[ sourceIndex ];\n\n\t\tlet loader = this.textureLoader;\n\n\t\tif ( sourceDef.uri ) {\n\n\t\t\tconst handler = options.manager.getHandler( sourceDef.uri );\n\t\t\tif ( handler !== null ) loader = handler;\n\n\t\t}\n\n\t\treturn this.loadTextureImage( textureIndex, sourceIndex, loader );\n\n\t}\n\n\tloadTextureImage( textureIndex, sourceIndex, loader ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\n\t\tconst textureDef = json.textures[ textureIndex ];\n\t\tconst sourceDef = json.images[ sourceIndex ];\n\n\t\tconst cacheKey = ( sourceDef.uri || sourceDef.bufferView ) + ':' + textureDef.sampler;\n\n\t\tif ( this.textureCache[ cacheKey ] ) {\n\n\t\t\t// See https://github.com/mrdoob/three.js/issues/21559.\n\t\t\treturn this.textureCache[ cacheKey ];\n\n\t\t}\n\n\t\tconst promise = this.loadImageSource( sourceIndex, loader ).then( function ( texture ) {\n\n\t\t\ttexture.flipY = false;\n\n\t\t\ttexture.name = textureDef.name || sourceDef.name || '';\n\n\t\t\tif ( texture.name === '' && typeof sourceDef.uri === 'string' && sourceDef.uri.startsWith( 'data:image/' ) === false ) {\n\n\t\t\t\ttexture.name = sourceDef.uri;\n\n\t\t\t}\n\n\t\t\tconst samplers = json.samplers || {};\n\t\t\tconst sampler = samplers[ textureDef.sampler ] || {};\n\n\t\t\ttexture.magFilter = WEBGL_FILTERS[ sampler.magFilter ] || LinearFilter;\n\t\t\ttexture.minFilter = WEBGL_FILTERS[ sampler.minFilter ] || LinearMipmapLinearFilter;\n\t\t\ttexture.wrapS = WEBGL_WRAPPINGS[ sampler.wrapS ] || RepeatWrapping;\n\t\t\ttexture.wrapT = WEBGL_WRAPPINGS[ sampler.wrapT ] || RepeatWrapping;\n\t\t\ttexture.generateMipmaps = ! texture.isCompressedTexture && texture.minFilter !== NearestFilter && texture.minFilter !== LinearFilter;\n\n\t\t\tparser.associations.set( texture, { textures: textureIndex } );\n\n\t\t\treturn texture;\n\n\t\t} ).catch( function () {\n\n\t\t\treturn null;\n\n\t\t} );\n\n\t\tthis.textureCache[ cacheKey ] = promise;\n\n\t\treturn promise;\n\n\t}\n\n\tloadImageSource( sourceIndex, loader ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\t\tconst options = this.options;\n\n\t\tif ( this.sourceCache[ sourceIndex ] !== undefined ) {\n\n\t\t\treturn this.sourceCache[ sourceIndex ].then( ( texture ) => texture.clone() );\n\n\t\t}\n\n\t\tconst sourceDef = json.images[ sourceIndex ];\n\n\t\tconst URL = self.URL || self.webkitURL;\n\n\t\tlet sourceURI = sourceDef.uri || '';\n\t\tlet isObjectURL = false;\n\n\t\tif ( sourceDef.bufferView !== undefined ) {\n\n\t\t\t// Load binary image data from bufferView, if provided.\n\n\t\t\tsourceURI = parser.getDependency( 'bufferView', sourceDef.bufferView ).then( function ( bufferView ) {\n\n\t\t\t\tisObjectURL = true;\n\t\t\t\tconst blob = new Blob( [ bufferView ], { type: sourceDef.mimeType } );\n\t\t\t\tsourceURI = URL.createObjectURL( blob );\n\t\t\t\treturn sourceURI;\n\n\t\t\t} );\n\n\t\t} else if ( sourceDef.uri === undefined ) {\n\n\t\t\tthrow new Error( 'THREE.GLTFLoader: Image ' + sourceIndex + ' is missing URI and bufferView' );\n\n\t\t}\n\n\t\tconst promise = Promise.resolve( sourceURI ).then( function ( sourceURI ) {\n\n\t\t\treturn new Promise( function ( resolve, reject ) {\n\n\t\t\t\tlet onLoad = resolve;\n\n\t\t\t\tif ( loader.isImageBitmapLoader === true ) {\n\n\t\t\t\t\tonLoad = function ( imageBitmap ) {\n\n\t\t\t\t\t\tconst texture = new Texture( imageBitmap );\n\t\t\t\t\t\ttexture.needsUpdate = true;\n\n\t\t\t\t\t\tresolve( texture );\n\n\t\t\t\t\t};\n\n\t\t\t\t}\n\n\t\t\t\tloader.load( LoaderUtils.resolveURL( sourceURI, options.path ), onLoad, undefined, reject );\n\n\t\t\t} );\n\n\t\t} ).then( function ( texture ) {\n\n\t\t\t// Clean up resources and configure Texture.\n\n\t\t\tif ( isObjectURL === true ) {\n\n\t\t\t\tURL.revokeObjectURL( sourceURI );\n\n\t\t\t}\n\n\t\t\tassignExtrasToUserData( texture, sourceDef );\n\n\t\t\ttexture.userData.mimeType = sourceDef.mimeType || getImageURIMimeType( sourceDef.uri );\n\n\t\t\treturn texture;\n\n\t\t} ).catch( function ( error ) {\n\n\t\t\tconsole.error( 'THREE.GLTFLoader: Couldn\\'t load texture', sourceURI );\n\t\t\tthrow error;\n\n\t\t} );\n\n\t\tthis.sourceCache[ sourceIndex ] = promise;\n\t\treturn promise;\n\n\t}\n\n\t/**\n\t * Asynchronously assigns a texture to the given material parameters.\n\t *\n\t * @private\n\t * @param {Object} materialParams\n\t * @param {string} mapName\n\t * @param {Object} mapDef\n\t * @param {string} [colorSpace]\n\t * @return {Promise<Texture>}\n\t */\n\tassignTexture( materialParams, mapName, mapDef, colorSpace ) {\n\n\t\tconst parser = this;\n\n\t\treturn this.getDependency( 'texture', mapDef.index ).then( function ( texture ) {\n\n\t\t\tif ( ! texture ) return null;\n\n\t\t\tif ( mapDef.texCoord !== undefined && mapDef.texCoord > 0 ) {\n\n\t\t\t\ttexture = texture.clone();\n\t\t\t\ttexture.channel = mapDef.texCoord;\n\n\t\t\t}\n\n\t\t\tif ( parser.extensions[ EXTENSIONS.KHR_TEXTURE_TRANSFORM ] ) {\n\n\t\t\t\tconst transform = mapDef.extensions !== undefined ? mapDef.extensions[ EXTENSIONS.KHR_TEXTURE_TRANSFORM ] : undefined;\n\n\t\t\t\tif ( transform ) {\n\n\t\t\t\t\tconst gltfReference = parser.associations.get( texture );\n\t\t\t\t\ttexture = parser.extensions[ EXTENSIONS.KHR_TEXTURE_TRANSFORM ].extendTexture( texture, transform );\n\t\t\t\t\tparser.associations.set( texture, gltfReference );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( colorSpace !== undefined ) {\n\n\t\t\t\ttexture.colorSpace = colorSpace;\n\n\t\t\t}\n\n\t\t\tmaterialParams[ mapName ] = texture;\n\n\t\t\treturn texture;\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Assigns final material to a Mesh, Line, or Points instance. The instance\n\t * already has a material (generated from the glTF material options alone)\n\t * but reuse of the same glTF material may require multiple threejs materials\n\t * to accommodate different primitive types, defines, etc. New materials will\n\t * be created if necessary, and reused from a cache.\n\t *\n\t * @private\n\t * @param {Object3D} mesh Mesh, Line, or Points instance.\n\t */\n\tassignFinalMaterial( mesh ) {\n\n\t\tconst geometry = mesh.geometry;\n\t\tlet material = mesh.material;\n\n\t\tconst useDerivativeTangents = geometry.attributes.tangent === undefined;\n\t\tconst useVertexColors = geometry.attributes.color !== undefined;\n\t\tconst useFlatShading = geometry.attributes.normal === undefined;\n\n\t\tif ( mesh.isPoints ) {\n\n\t\t\tconst cacheKey = 'PointsMaterial:' + material.uuid;\n\n\t\t\tlet pointsMaterial = this.cache.get( cacheKey );\n\n\t\t\tif ( ! pointsMaterial ) {\n\n\t\t\t\tpointsMaterial = new PointsMaterial();\n\t\t\t\tMaterial.prototype.copy.call( pointsMaterial, material );\n\t\t\t\tpointsMaterial.color.copy( material.color );\n\t\t\t\tpointsMaterial.map = material.map;\n\t\t\t\tpointsMaterial.sizeAttenuation = false; // glTF spec says points should be 1px\n\n\t\t\t\tthis.cache.add( cacheKey, pointsMaterial );\n\n\t\t\t}\n\n\t\t\tmaterial = pointsMaterial;\n\n\t\t} else if ( mesh.isLine ) {\n\n\t\t\tconst cacheKey = 'LineBasicMaterial:' + material.uuid;\n\n\t\t\tlet lineMaterial = this.cache.get( cacheKey );\n\n\t\t\tif ( ! lineMaterial ) {\n\n\t\t\t\tlineMaterial = new LineBasicMaterial();\n\t\t\t\tMaterial.prototype.copy.call( lineMaterial, material );\n\t\t\t\tlineMaterial.color.copy( material.color );\n\t\t\t\tlineMaterial.map = material.map;\n\n\t\t\t\tthis.cache.add( cacheKey, lineMaterial );\n\n\t\t\t}\n\n\t\t\tmaterial = lineMaterial;\n\n\t\t}\n\n\t\t// Clone the material if it will be modified\n\t\tif ( useDerivativeTangents || useVertexColors || useFlatShading ) {\n\n\t\t\tlet cacheKey = 'ClonedMaterial:' + material.uuid + ':';\n\n\t\t\tif ( useDerivativeTangents ) cacheKey += 'derivative-tangents:';\n\t\t\tif ( useVertexColors ) cacheKey += 'vertex-colors:';\n\t\t\tif ( useFlatShading ) cacheKey += 'flat-shading:';\n\n\t\t\tlet cachedMaterial = this.cache.get( cacheKey );\n\n\t\t\tif ( ! cachedMaterial ) {\n\n\t\t\t\tcachedMaterial = material.clone();\n\n\t\t\t\tif ( useVertexColors ) cachedMaterial.vertexColors = true;\n\t\t\t\tif ( useFlatShading ) cachedMaterial.flatShading = true;\n\n\t\t\t\tif ( useDerivativeTangents ) {\n\n\t\t\t\t\t// https://github.com/mrdoob/three.js/issues/11438#issuecomment-507003995\n\t\t\t\t\tif ( cachedMaterial.normalScale ) cachedMaterial.normalScale.y *= - 1;\n\t\t\t\t\tif ( cachedMaterial.clearcoatNormalScale ) cachedMaterial.clearcoatNormalScale.y *= - 1;\n\n\t\t\t\t}\n\n\t\t\t\tthis.cache.add( cacheKey, cachedMaterial );\n\n\t\t\t\tthis.associations.set( cachedMaterial, this.associations.get( material ) );\n\n\t\t\t}\n\n\t\t\tmaterial = cachedMaterial;\n\n\t\t}\n\n\t\tmesh.material = material;\n\n\t}\n\n\tgetMaterialType( /* materialIndex */ ) {\n\n\t\treturn MeshStandardMaterial;\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#materials\n\t *\n\t * @private\n\t * @param {number} materialIndex\n\t * @return {Promise<Material>}\n\t */\n\tloadMaterial( materialIndex ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\t\tconst extensions = this.extensions;\n\t\tconst materialDef = json.materials[ materialIndex ];\n\n\t\tlet materialType;\n\t\tconst materialParams = {};\n\t\tconst materialExtensions = materialDef.extensions || {};\n\n\t\tconst pending = [];\n\n\t\tif ( materialExtensions[ EXTENSIONS.KHR_MATERIALS_UNLIT ] ) {\n\n\t\t\tconst kmuExtension = extensions[ EXTENSIONS.KHR_MATERIALS_UNLIT ];\n\t\t\tmaterialType = kmuExtension.getMaterialType();\n\t\t\tpending.push( kmuExtension.extendParams( materialParams, materialDef, parser ) );\n\n\t\t} else {\n\n\t\t\t// Specification:\n\t\t\t// https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#metallic-roughness-material\n\n\t\t\tconst metallicRoughness = materialDef.pbrMetallicRoughness || {};\n\n\t\t\tmaterialParams.color = new Color( 1.0, 1.0, 1.0 );\n\t\t\tmaterialParams.opacity = 1.0;\n\n\t\t\tif ( Array.isArray( metallicRoughness.baseColorFactor ) ) {\n\n\t\t\t\tconst array = metallicRoughness.baseColorFactor;\n\n\t\t\t\tmaterialParams.color.setRGB( array[ 0 ], array[ 1 ], array[ 2 ], LinearSRGBColorSpace );\n\t\t\t\tmaterialParams.opacity = array[ 3 ];\n\n\t\t\t}\n\n\t\t\tif ( metallicRoughness.baseColorTexture !== undefined ) {\n\n\t\t\t\tpending.push( parser.assignTexture( materialParams, 'map', metallicRoughness.baseColorTexture, SRGBColorSpace ) );\n\n\t\t\t}\n\n\t\t\tmaterialParams.metalness = metallicRoughness.metallicFactor !== undefined ? metallicRoughness.metallicFactor : 1.0;\n\t\t\tmaterialParams.roughness = metallicRoughness.roughnessFactor !== undefined ? metallicRoughness.roughnessFactor : 1.0;\n\n\t\t\tif ( metallicRoughness.metallicRoughnessTexture !== undefined ) {\n\n\t\t\t\tpending.push( parser.assignTexture( materialParams, 'metalnessMap', metallicRoughness.metallicRoughnessTexture ) );\n\t\t\t\tpending.push( parser.assignTexture( materialParams, 'roughnessMap', metallicRoughness.metallicRoughnessTexture ) );\n\n\t\t\t}\n\n\t\t\tmaterialType = this._invokeOne( function ( ext ) {\n\n\t\t\t\treturn ext.getMaterialType && ext.getMaterialType( materialIndex );\n\n\t\t\t} );\n\n\t\t\tpending.push( Promise.all( this._invokeAll( function ( ext ) {\n\n\t\t\t\treturn ext.extendMaterialParams && ext.extendMaterialParams( materialIndex, materialParams );\n\n\t\t\t} ) ) );\n\n\t\t}\n\n\t\tif ( materialDef.doubleSided === true ) {\n\n\t\t\tmaterialParams.side = DoubleSide;\n\n\t\t}\n\n\t\tconst alphaMode = materialDef.alphaMode || ALPHA_MODES.OPAQUE;\n\n\t\tif ( alphaMode === ALPHA_MODES.BLEND ) {\n\n\t\t\tmaterialParams.transparent = true;\n\n\t\t\t// See: https://github.com/mrdoob/three.js/issues/17706\n\t\t\tmaterialParams.depthWrite = false;\n\n\t\t} else {\n\n\t\t\tmaterialParams.transparent = false;\n\n\t\t\tif ( alphaMode === ALPHA_MODES.MASK ) {\n\n\t\t\t\tmaterialParams.alphaTest = materialDef.alphaCutoff !== undefined ? materialDef.alphaCutoff : 0.5;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( materialDef.normalTexture !== undefined && materialType !== MeshBasicMaterial ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'normalMap', materialDef.normalTexture ) );\n\n\t\t\tmaterialParams.normalScale = new Vector2( 1, 1 );\n\n\t\t\tif ( materialDef.normalTexture.scale !== undefined ) {\n\n\t\t\t\tconst scale = materialDef.normalTexture.scale;\n\n\t\t\t\tmaterialParams.normalScale.set( scale, scale );\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( materialDef.occlusionTexture !== undefined && materialType !== MeshBasicMaterial ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'aoMap', materialDef.occlusionTexture ) );\n\n\t\t\tif ( materialDef.occlusionTexture.strength !== undefined ) {\n\n\t\t\t\tmaterialParams.aoMapIntensity = materialDef.occlusionTexture.strength;\n\n\t\t\t}\n\n\t\t}\n\n\t\tif ( materialDef.emissiveFactor !== undefined && materialType !== MeshBasicMaterial ) {\n\n\t\t\tconst emissiveFactor = materialDef.emissiveFactor;\n\t\t\tmaterialParams.emissive = new Color().setRGB( emissiveFactor[ 0 ], emissiveFactor[ 1 ], emissiveFactor[ 2 ], LinearSRGBColorSpace );\n\n\t\t}\n\n\t\tif ( materialDef.emissiveTexture !== undefined && materialType !== MeshBasicMaterial ) {\n\n\t\t\tpending.push( parser.assignTexture( materialParams, 'emissiveMap', materialDef.emissiveTexture, SRGBColorSpace ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending ).then( function () {\n\n\t\t\tconst material = new materialType( materialParams );\n\n\t\t\tif ( materialDef.name ) material.name = materialDef.name;\n\n\t\t\tassignExtrasToUserData( material, materialDef );\n\n\t\t\tparser.associations.set( material, { materials: materialIndex } );\n\n\t\t\tif ( materialDef.extensions ) addUnknownExtensionsToUserData( extensions, material, materialDef );\n\n\t\t\treturn material;\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * When Object3D instances are targeted by animation, they need unique names.\n\t *\n\t * @private\n\t * @param {string} originalName\n\t * @return {string}\n\t */\n\tcreateUniqueName( originalName ) {\n\n\t\tconst sanitizedName = PropertyBinding.sanitizeNodeName( originalName || '' );\n\n\t\tif ( sanitizedName in this.nodeNamesUsed ) {\n\n\t\t\treturn sanitizedName + '_' + ( ++ this.nodeNamesUsed[ sanitizedName ] );\n\n\t\t} else {\n\n\t\t\tthis.nodeNamesUsed[ sanitizedName ] = 0;\n\n\t\t\treturn sanitizedName;\n\n\t\t}\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#geometry\n\t *\n\t * Creates BufferGeometries from primitives.\n\t *\n\t * @private\n\t * @param {Array<GLTF.Primitive>} primitives\n\t * @return {Promise<Array<BufferGeometry>>}\n\t */\n\tloadGeometries( primitives ) {\n\n\t\tconst parser = this;\n\t\tconst extensions = this.extensions;\n\t\tconst cache = this.primitiveCache;\n\n\t\tfunction createDracoPrimitive( primitive ) {\n\n\t\t\treturn extensions[ EXTENSIONS.KHR_DRACO_MESH_COMPRESSION ]\n\t\t\t\t.decodePrimitive( primitive, parser )\n\t\t\t\t.then( function ( geometry ) {\n\n\t\t\t\t\treturn addPrimitiveAttributes( geometry, primitive, parser );\n\n\t\t\t\t} );\n\n\t\t}\n\n\t\tconst pending = [];\n\n\t\tfor ( let i = 0, il = primitives.length; i < il; i ++ ) {\n\n\t\t\tconst primitive = primitives[ i ];\n\t\t\tconst cacheKey = createPrimitiveKey( primitive );\n\n\t\t\t// See if we've already created this geometry\n\t\t\tconst cached = cache[ cacheKey ];\n\n\t\t\tif ( cached ) {\n\n\t\t\t\t// Use the cached geometry if it exists\n\t\t\t\tpending.push( cached.promise );\n\n\t\t\t} else {\n\n\t\t\t\tlet geometryPromise;\n\n\t\t\t\tif ( primitive.extensions && primitive.extensions[ EXTENSIONS.KHR_DRACO_MESH_COMPRESSION ] ) {\n\n\t\t\t\t\t// Use DRACO geometry if available\n\t\t\t\t\tgeometryPromise = createDracoPrimitive( primitive );\n\n\t\t\t\t} else {\n\n\t\t\t\t\t// Otherwise create a new geometry\n\t\t\t\t\tgeometryPromise = addPrimitiveAttributes( new BufferGeometry(), primitive, parser );\n\n\t\t\t\t}\n\n\t\t\t\t// Cache this geometry\n\t\t\t\tcache[ cacheKey ] = { primitive: primitive, promise: geometryPromise };\n\n\t\t\t\tpending.push( geometryPromise );\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn Promise.all( pending );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/blob/master/specification/2.0/README.md#meshes\n\t *\n\t * @private\n\t * @param {number} meshIndex\n\t * @return {Promise<Group|Mesh|SkinnedMesh|Line|Points>}\n\t */\n\tloadMesh( meshIndex ) {\n\n\t\tconst parser = this;\n\t\tconst json = this.json;\n\t\tconst extensions = this.extensions;\n\n\t\tconst meshDef = json.meshes[ meshIndex ];\n\t\tconst primitives = meshDef.primitives;\n\n\t\tconst pending = [];\n\n\t\tfor ( let i = 0, il = primitives.length; i < il; i ++ ) {\n\n\t\t\tconst material = primitives[ i ].material === undefined\n\t\t\t\t? createDefaultMaterial( this.cache )\n\t\t\t\t: this.getDependency( 'material', primitives[ i ].material );\n\n\t\t\tpending.push( material );\n\n\t\t}\n\n\t\tpending.push( parser.loadGeometries( primitives ) );\n\n\t\treturn Promise.all( pending ).then( function ( results ) {\n\n\t\t\tconst materials = results.slice( 0, results.length - 1 );\n\t\t\tconst geometries = results[ results.length - 1 ];\n\n\t\t\tconst meshes = [];\n\n\t\t\tfor ( let i = 0, il = geometries.length; i < il; i ++ ) {\n\n\t\t\t\tconst geometry = geometries[ i ];\n\t\t\t\tconst primitive = primitives[ i ];\n\n\t\t\t\t// 1. create Mesh\n\n\t\t\t\tlet mesh;\n\n\t\t\t\tconst material = materials[ i ];\n\n\t\t\t\tif ( primitive.mode === WEBGL_CONSTANTS.TRIANGLES ||\n\t\t\t\t\t\tprimitive.mode === WEBGL_CONSTANTS.TRIANGLE_STRIP ||\n\t\t\t\t\t\tprimitive.mode === WEBGL_CONSTANTS.TRIANGLE_FAN ||\n\t\t\t\t\t\tprimitive.mode === undefined ) {\n\n\t\t\t\t\t// .isSkinnedMesh isn't in glTF spec. See ._markDefs()\n\t\t\t\t\tmesh = meshDef.isSkinnedMesh === true\n\t\t\t\t\t\t? new SkinnedMesh( geometry, material )\n\t\t\t\t\t\t: new Mesh( geometry, material );\n\n\t\t\t\t\tif ( mesh.isSkinnedMesh === true ) {\n\n\t\t\t\t\t\t// normalize skin weights to fix malformed assets (see #15319)\n\t\t\t\t\t\tmesh.normalizeSkinWeights();\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( primitive.mode === WEBGL_CONSTANTS.TRIANGLE_STRIP ) {\n\n\t\t\t\t\t\tmesh.geometry = toTrianglesDrawMode( mesh.geometry, TriangleStripDrawMode );\n\n\t\t\t\t\t} else if ( primitive.mode === WEBGL_CONSTANTS.TRIANGLE_FAN ) {\n\n\t\t\t\t\t\tmesh.geometry = toTrianglesDrawMode( mesh.geometry, TriangleFanDrawMode );\n\n\t\t\t\t\t}\n\n\t\t\t\t} else if ( primitive.mode === WEBGL_CONSTANTS.LINES ) {\n\n\t\t\t\t\tmesh = new LineSegments( geometry, material );\n\n\t\t\t\t} else if ( primitive.mode === WEBGL_CONSTANTS.LINE_STRIP ) {\n\n\t\t\t\t\tmesh = new Line( geometry, material );\n\n\t\t\t\t} else if ( primitive.mode === WEBGL_CONSTANTS.LINE_LOOP ) {\n\n\t\t\t\t\tmesh = new LineLoop( geometry, material );\n\n\t\t\t\t} else if ( primitive.mode === WEBGL_CONSTANTS.POINTS ) {\n\n\t\t\t\t\tmesh = new Points( geometry, material );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tthrow new Error( 'THREE.GLTFLoader: Primitive mode unsupported: ' + primitive.mode );\n\n\t\t\t\t}\n\n\t\t\t\tif ( Object.keys( mesh.geometry.morphAttributes ).length > 0 ) {\n\n\t\t\t\t\tupdateMorphTargets( mesh, meshDef );\n\n\t\t\t\t}\n\n\t\t\t\tmesh.name = parser.createUniqueName( meshDef.name || ( 'mesh_' + meshIndex ) );\n\n\t\t\t\tassignExtrasToUserData( mesh, meshDef );\n\n\t\t\t\tif ( primitive.extensions ) addUnknownExtensionsToUserData( extensions, mesh, primitive );\n\n\t\t\t\tparser.assignFinalMaterial( mesh );\n\n\t\t\t\tmeshes.push( mesh );\n\n\t\t\t}\n\n\t\t\tfor ( let i = 0, il = meshes.length; i < il; i ++ ) {\n\n\t\t\t\tparser.associations.set( meshes[ i ], {\n\t\t\t\t\tmeshes: meshIndex,\n\t\t\t\t\tprimitives: i\n\t\t\t\t} );\n\n\t\t\t}\n\n\t\t\tif ( meshes.length === 1 ) {\n\n\t\t\t\tif ( meshDef.extensions ) addUnknownExtensionsToUserData( extensions, meshes[ 0 ], meshDef );\n\n\t\t\t\treturn meshes[ 0 ];\n\n\t\t\t}\n\n\t\t\tconst group = new Group();\n\n\t\t\tif ( meshDef.extensions ) addUnknownExtensionsToUserData( extensions, group, meshDef );\n\n\t\t\tparser.associations.set( group, { meshes: meshIndex } );\n\n\t\t\tfor ( let i = 0, il = meshes.length; i < il; i ++ ) {\n\n\t\t\t\tgroup.add( meshes[ i ] );\n\n\t\t\t}\n\n\t\t\treturn group;\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#cameras\n\t *\n\t * @private\n\t * @param {number} cameraIndex\n\t * @return {Promise<Camera>|undefined}\n\t */\n\tloadCamera( cameraIndex ) {\n\n\t\tlet camera;\n\t\tconst cameraDef = this.json.cameras[ cameraIndex ];\n\t\tconst params = cameraDef[ cameraDef.type ];\n\n\t\tif ( ! params ) {\n\n\t\t\tconsole.warn( 'THREE.GLTFLoader: Missing camera parameters.' );\n\t\t\treturn;\n\n\t\t}\n\n\t\tif ( cameraDef.type === 'perspective' ) {\n\n\t\t\tcamera = new PerspectiveCamera( MathUtils.radToDeg( params.yfov ), params.aspectRatio || 1, params.znear || 1, params.zfar || 2e6 );\n\n\t\t} else if ( cameraDef.type === 'orthographic' ) {\n\n\t\t\tcamera = new OrthographicCamera( - params.xmag, params.xmag, params.ymag, - params.ymag, params.znear, params.zfar );\n\n\t\t}\n\n\t\tif ( cameraDef.name ) camera.name = this.createUniqueName( cameraDef.name );\n\n\t\tassignExtrasToUserData( camera, cameraDef );\n\n\t\treturn Promise.resolve( camera );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#skins\n\t *\n\t * @private\n\t * @param {number} skinIndex\n\t * @return {Promise<Skeleton>}\n\t */\n\tloadSkin( skinIndex ) {\n\n\t\tconst skinDef = this.json.skins[ skinIndex ];\n\n\t\tconst pending = [];\n\n\t\tfor ( let i = 0, il = skinDef.joints.length; i < il; i ++ ) {\n\n\t\t\tpending.push( this._loadNodeShallow( skinDef.joints[ i ] ) );\n\n\t\t}\n\n\t\tif ( skinDef.inverseBindMatrices !== undefined ) {\n\n\t\t\tpending.push( this.getDependency( 'accessor', skinDef.inverseBindMatrices ) );\n\n\t\t} else {\n\n\t\t\tpending.push( null );\n\n\t\t}\n\n\t\treturn Promise.all( pending ).then( function ( results ) {\n\n\t\t\tconst inverseBindMatrices = results.pop();\n\t\t\tconst jointNodes = results;\n\n\t\t\t// Note that bones (joint nodes) may or may not be in the\n\t\t\t// scene graph at this time.\n\n\t\t\tconst bones = [];\n\t\t\tconst boneInverses = [];\n\n\t\t\tfor ( let i = 0, il = jointNodes.length; i < il; i ++ ) {\n\n\t\t\t\tconst jointNode = jointNodes[ i ];\n\n\t\t\t\tif ( jointNode ) {\n\n\t\t\t\t\tbones.push( jointNode );\n\n\t\t\t\t\tconst mat = new Matrix4();\n\n\t\t\t\t\tif ( inverseBindMatrices !== null ) {\n\n\t\t\t\t\t\tmat.fromArray( inverseBindMatrices.array, i * 16 );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tboneInverses.push( mat );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconsole.warn( 'THREE.GLTFLoader: Joint \"%s\" could not be found.', skinDef.joints[ i ] );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\treturn new Skeleton( bones, boneInverses );\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#animations\n\t *\n\t * @private\n\t * @param {number} animationIndex\n\t * @return {Promise<AnimationClip>}\n\t */\n\tloadAnimation( animationIndex ) {\n\n\t\tconst json = this.json;\n\t\tconst parser = this;\n\n\t\tconst animationDef = json.animations[ animationIndex ];\n\t\tconst animationName = animationDef.name ? animationDef.name : 'animation_' + animationIndex;\n\n\t\tconst pendingNodes = [];\n\t\tconst pendingInputAccessors = [];\n\t\tconst pendingOutputAccessors = [];\n\t\tconst pendingSamplers = [];\n\t\tconst pendingTargets = [];\n\n\t\tfor ( let i = 0, il = animationDef.channels.length; i < il; i ++ ) {\n\n\t\t\tconst channel = animationDef.channels[ i ];\n\t\t\tconst sampler = animationDef.samplers[ channel.sampler ];\n\t\t\tconst target = channel.target;\n\t\t\tconst name = target.node;\n\t\t\tconst input = animationDef.parameters !== undefined ? animationDef.parameters[ sampler.input ] : sampler.input;\n\t\t\tconst output = animationDef.parameters !== undefined ? animationDef.parameters[ sampler.output ] : sampler.output;\n\n\t\t\tif ( target.node === undefined ) continue;\n\n\t\t\tpendingNodes.push( this.getDependency( 'node', name ) );\n\t\t\tpendingInputAccessors.push( this.getDependency( 'accessor', input ) );\n\t\t\tpendingOutputAccessors.push( this.getDependency( 'accessor', output ) );\n\t\t\tpendingSamplers.push( sampler );\n\t\t\tpendingTargets.push( target );\n\n\t\t}\n\n\t\treturn Promise.all( [\n\n\t\t\tPromise.all( pendingNodes ),\n\t\t\tPromise.all( pendingInputAccessors ),\n\t\t\tPromise.all( pendingOutputAccessors ),\n\t\t\tPromise.all( pendingSamplers ),\n\t\t\tPromise.all( pendingTargets )\n\n\t\t] ).then( function ( dependencies ) {\n\n\t\t\tconst nodes = dependencies[ 0 ];\n\t\t\tconst inputAccessors = dependencies[ 1 ];\n\t\t\tconst outputAccessors = dependencies[ 2 ];\n\t\t\tconst samplers = dependencies[ 3 ];\n\t\t\tconst targets = dependencies[ 4 ];\n\n\t\t\tconst tracks = [];\n\n\t\t\tfor ( let i = 0, il = nodes.length; i < il; i ++ ) {\n\n\t\t\t\tconst node = nodes[ i ];\n\t\t\t\tconst inputAccessor = inputAccessors[ i ];\n\t\t\t\tconst outputAccessor = outputAccessors[ i ];\n\t\t\t\tconst sampler = samplers[ i ];\n\t\t\t\tconst target = targets[ i ];\n\n\t\t\t\tif ( node === undefined ) continue;\n\n\t\t\t\tif ( node.updateMatrix ) {\n\n\t\t\t\t\tnode.updateMatrix();\n\n\t\t\t\t}\n\n\t\t\t\tconst createdTracks = parser._createAnimationTracks( node, inputAccessor, outputAccessor, sampler, target );\n\n\t\t\t\tif ( createdTracks ) {\n\n\t\t\t\t\tfor ( let k = 0; k < createdTracks.length; k ++ ) {\n\n\t\t\t\t\t\ttracks.push( createdTracks[ k ] );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tconst animation = new AnimationClip( animationName, undefined, tracks );\n\n\t\t\tassignExtrasToUserData( animation, animationDef );\n\n\t\t\treturn animation;\n\n\t\t} );\n\n\t}\n\n\tcreateNodeMesh( nodeIndex ) {\n\n\t\tconst json = this.json;\n\t\tconst parser = this;\n\t\tconst nodeDef = json.nodes[ nodeIndex ];\n\n\t\tif ( nodeDef.mesh === undefined ) return null;\n\n\t\treturn parser.getDependency( 'mesh', nodeDef.mesh ).then( function ( mesh ) {\n\n\t\t\tconst node = parser._getNodeRef( parser.meshCache, nodeDef.mesh, mesh );\n\n\t\t\t// if weights are provided on the node, override weights on the mesh.\n\t\t\tif ( nodeDef.weights !== undefined ) {\n\n\t\t\t\tnode.traverse( function ( o ) {\n\n\t\t\t\t\tif ( ! o.isMesh ) return;\n\n\t\t\t\t\tfor ( let i = 0, il = nodeDef.weights.length; i < il; i ++ ) {\n\n\t\t\t\t\t\to.morphTargetInfluences[ i ] = nodeDef.weights[ i ];\n\n\t\t\t\t\t}\n\n\t\t\t\t} );\n\n\t\t\t}\n\n\t\t\treturn node;\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#nodes-and-hierarchy\n\t *\n\t * @private\n\t * @param {number} nodeIndex\n\t * @return {Promise<Object3D>}\n\t */\n\tloadNode( nodeIndex ) {\n\n\t\tconst json = this.json;\n\t\tconst parser = this;\n\n\t\tconst nodeDef = json.nodes[ nodeIndex ];\n\n\t\tconst nodePending = parser._loadNodeShallow( nodeIndex );\n\n\t\tconst childPending = [];\n\t\tconst childrenDef = nodeDef.children || [];\n\n\t\tfor ( let i = 0, il = childrenDef.length; i < il; i ++ ) {\n\n\t\t\tchildPending.push( parser.getDependency( 'node', childrenDef[ i ] ) );\n\n\t\t}\n\n\t\tconst skeletonPending = nodeDef.skin === undefined\n\t\t\t? Promise.resolve( null )\n\t\t\t: parser.getDependency( 'skin', nodeDef.skin );\n\n\t\treturn Promise.all( [\n\t\t\tnodePending,\n\t\t\tPromise.all( childPending ),\n\t\t\tskeletonPending\n\t\t] ).then( function ( results ) {\n\n\t\t\tconst node = results[ 0 ];\n\t\t\tconst children = results[ 1 ];\n\t\t\tconst skeleton = results[ 2 ];\n\n\t\t\tif ( skeleton !== null ) {\n\n\t\t\t\t// This full traverse should be fine because\n\t\t\t\t// child glTF nodes have not been added to this node yet.\n\t\t\t\tnode.traverse( function ( mesh ) {\n\n\t\t\t\t\tif ( ! mesh.isSkinnedMesh ) return;\n\n\t\t\t\t\tmesh.bind( skeleton, _identityMatrix );\n\n\t\t\t\t} );\n\n\t\t\t}\n\n\t\t\tfor ( let i = 0, il = children.length; i < il; i ++ ) {\n\n\t\t\t\tnode.add( children[ i ] );\n\n\t\t\t}\n\n\t\t\treturn node;\n\n\t\t} );\n\n\t}\n\n\t// ._loadNodeShallow() parses a single node.\n\t// skin and child nodes are created and added in .loadNode() (no '_' prefix).\n\t_loadNodeShallow( nodeIndex ) {\n\n\t\tconst json = this.json;\n\t\tconst extensions = this.extensions;\n\t\tconst parser = this;\n\n\t\t// This method is called from .loadNode() and .loadSkin().\n\t\t// Cache a node to avoid duplication.\n\n\t\tif ( this.nodeCache[ nodeIndex ] !== undefined ) {\n\n\t\t\treturn this.nodeCache[ nodeIndex ];\n\n\t\t}\n\n\t\tconst nodeDef = json.nodes[ nodeIndex ];\n\n\t\t// reserve node's name before its dependencies, so the root has the intended name.\n\t\tconst nodeName = nodeDef.name ? parser.createUniqueName( nodeDef.name ) : '';\n\n\t\tconst pending = [];\n\n\t\tconst meshPromise = parser._invokeOne( function ( ext ) {\n\n\t\t\treturn ext.createNodeMesh && ext.createNodeMesh( nodeIndex );\n\n\t\t} );\n\n\t\tif ( meshPromise ) {\n\n\t\t\tpending.push( meshPromise );\n\n\t\t}\n\n\t\tif ( nodeDef.camera !== undefined ) {\n\n\t\t\tpending.push( parser.getDependency( 'camera', nodeDef.camera ).then( function ( camera ) {\n\n\t\t\t\treturn parser._getNodeRef( parser.cameraCache, nodeDef.camera, camera );\n\n\t\t\t} ) );\n\n\t\t}\n\n\t\tparser._invokeAll( function ( ext ) {\n\n\t\t\treturn ext.createNodeAttachment && ext.createNodeAttachment( nodeIndex );\n\n\t\t} ).forEach( function ( promise ) {\n\n\t\t\tpending.push( promise );\n\n\t\t} );\n\n\t\tthis.nodeCache[ nodeIndex ] = Promise.all( pending ).then( function ( objects ) {\n\n\t\t\tlet node;\n\n\t\t\t// .isBone isn't in glTF spec. See ._markDefs\n\t\t\tif ( nodeDef.isBone === true ) {\n\n\t\t\t\tnode = new Bone();\n\n\t\t\t} else if ( objects.length > 1 ) {\n\n\t\t\t\tnode = new Group();\n\n\t\t\t} else if ( objects.length === 1 ) {\n\n\t\t\t\tnode = objects[ 0 ];\n\n\t\t\t} else {\n\n\t\t\t\tnode = new Object3D();\n\n\t\t\t}\n\n\t\t\tif ( node !== objects[ 0 ] ) {\n\n\t\t\t\tfor ( let i = 0, il = objects.length; i < il; i ++ ) {\n\n\t\t\t\t\tnode.add( objects[ i ] );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( nodeDef.name ) {\n\n\t\t\t\tnode.userData.name = nodeDef.name;\n\t\t\t\tnode.name = nodeName;\n\n\t\t\t}\n\n\t\t\tassignExtrasToUserData( node, nodeDef );\n\n\t\t\tif ( nodeDef.extensions ) addUnknownExtensionsToUserData( extensions, node, nodeDef );\n\n\t\t\tif ( nodeDef.matrix !== undefined ) {\n\n\t\t\t\tconst matrix = new Matrix4();\n\t\t\t\tmatrix.fromArray( nodeDef.matrix );\n\t\t\t\tnode.applyMatrix4( matrix );\n\n\t\t\t} else {\n\n\t\t\t\tif ( nodeDef.translation !== undefined ) {\n\n\t\t\t\t\tnode.position.fromArray( nodeDef.translation );\n\n\t\t\t\t}\n\n\t\t\t\tif ( nodeDef.rotation !== undefined ) {\n\n\t\t\t\t\tnode.quaternion.fromArray( nodeDef.rotation );\n\n\t\t\t\t}\n\n\t\t\t\tif ( nodeDef.scale !== undefined ) {\n\n\t\t\t\t\tnode.scale.fromArray( nodeDef.scale );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t\tif ( ! parser.associations.has( node ) ) {\n\n\t\t\t\tparser.associations.set( node, {} );\n\n\t\t\t} else if ( nodeDef.mesh !== undefined && parser.meshCache.refs[ nodeDef.mesh ] > 1 ) {\n\n\t\t\t\tconst mapping = parser.associations.get( node );\n\t\t\t\tparser.associations.set( node, { ...mapping } );\n\n\t\t\t}\n\n\t\t\tparser.associations.get( node ).nodes = nodeIndex;\n\n\t\t\treturn node;\n\n\t\t} );\n\n\t\treturn this.nodeCache[ nodeIndex ];\n\n\t}\n\n\t/**\n\t * Specification: https://github.com/KhronosGroup/glTF/tree/master/specification/2.0#scenes\n\t *\n\t * @private\n\t * @param {number} sceneIndex\n\t * @return {Promise<Group>}\n\t */\n\tloadScene( sceneIndex ) {\n\n\t\tconst extensions = this.extensions;\n\t\tconst sceneDef = this.json.scenes[ sceneIndex ];\n\t\tconst parser = this;\n\n\t\t// Loader returns Group, not Scene.\n\t\t// See: https://github.com/mrdoob/three.js/issues/18342#issuecomment-578981172\n\t\tconst scene = new Group();\n\t\tif ( sceneDef.name ) scene.name = parser.createUniqueName( sceneDef.name );\n\n\t\tassignExtrasToUserData( scene, sceneDef );\n\n\t\tif ( sceneDef.extensions ) addUnknownExtensionsToUserData( extensions, scene, sceneDef );\n\n\t\tconst nodeIds = sceneDef.nodes || [];\n\n\t\tconst pending = [];\n\n\t\tfor ( let i = 0, il = nodeIds.length; i < il; i ++ ) {\n\n\t\t\tpending.push( parser.getDependency( 'node', nodeIds[ i ] ) );\n\n\t\t}\n\n\t\treturn Promise.all( pending ).then( function ( nodes ) {\n\n\t\t\tfor ( let i = 0, il = nodes.length; i < il; i ++ ) {\n\n\t\t\t\tscene.add( nodes[ i ] );\n\n\t\t\t}\n\n\t\t\t// Removes dangling associations, associations that reference a node that\n\t\t\t// didn't make it into the scene.\n\t\t\tconst reduceAssociations = ( node ) => {\n\n\t\t\t\tconst reducedAssociations = new Map();\n\n\t\t\t\tfor ( const [ key, value ] of parser.associations ) {\n\n\t\t\t\t\tif ( key instanceof Material || key instanceof Texture ) {\n\n\t\t\t\t\t\treducedAssociations.set( key, value );\n\n\t\t\t\t\t}\n\n\t\t\t\t}\n\n\t\t\t\tnode.traverse( ( node ) => {\n\n\t\t\t\t\tconst mappings = parser.associations.get( node );\n\n\t\t\t\t\tif ( mappings != null ) {\n\n\t\t\t\t\t\treducedAssociations.set( node, mappings );\n\n\t\t\t\t\t}\n\n\t\t\t\t} );\n\n\t\t\t\treturn reducedAssociations;\n\n\t\t\t};\n\n\t\t\tparser.associations = reduceAssociations( scene );\n\n\t\t\treturn scene;\n\n\t\t} );\n\n\t}\n\n\t_createAnimationTracks( node, inputAccessor, outputAccessor, sampler, target ) {\n\n\t\tconst tracks = [];\n\n\t\tconst targetName = node.name ? node.name : node.uuid;\n\t\tconst targetNames = [];\n\n\t\tif ( PATH_PROPERTIES[ target.path ] === PATH_PROPERTIES.weights ) {\n\n\t\t\tnode.traverse( function ( object ) {\n\n\t\t\t\tif ( object.morphTargetInfluences ) {\n\n\t\t\t\t\ttargetNames.push( object.name ? object.name : object.uuid );\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t} else {\n\n\t\t\ttargetNames.push( targetName );\n\n\t\t}\n\n\t\tlet TypedKeyframeTrack;\n\n\t\tswitch ( PATH_PROPERTIES[ target.path ] ) {\n\n\t\t\tcase PATH_PROPERTIES.weights:\n\n\t\t\t\tTypedKeyframeTrack = NumberKeyframeTrack;\n\t\t\t\tbreak;\n\n\t\t\tcase PATH_PROPERTIES.rotation:\n\n\t\t\t\tTypedKeyframeTrack = QuaternionKeyframeTrack;\n\t\t\t\tbreak;\n\n\t\t\tcase PATH_PROPERTIES.translation:\n\t\t\tcase PATH_PROPERTIES.scale:\n\n\t\t\t\tTypedKeyframeTrack = VectorKeyframeTrack;\n\t\t\t\tbreak;\n\n\t\t\tdefault:\n\n\t\t\t\tswitch ( outputAccessor.itemSize ) {\n\n\t\t\t\t\tcase 1:\n\t\t\t\t\t\tTypedKeyframeTrack = NumberKeyframeTrack;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\tcase 2:\n\t\t\t\t\tcase 3:\n\t\t\t\t\tdefault:\n\t\t\t\t\t\tTypedKeyframeTrack = VectorKeyframeTrack;\n\t\t\t\t\t\tbreak;\n\n\t\t\t\t}\n\n\t\t\t\tbreak;\n\n\t\t}\n\n\t\tconst interpolation = sampler.interpolation !== undefined ? INTERPOLATION[ sampler.interpolation ] : InterpolateLinear;\n\n\n\t\tconst outputArray = this._getArrayFromAccessor( outputAccessor );\n\n\t\tfor ( let j = 0, jl = targetNames.length; j < jl; j ++ ) {\n\n\t\t\tconst track = new TypedKeyframeTrack(\n\t\t\t\ttargetNames[ j ] + '.' + PATH_PROPERTIES[ target.path ],\n\t\t\t\tinputAccessor.array,\n\t\t\t\toutputArray,\n\t\t\t\tinterpolation\n\t\t\t);\n\n\t\t\t// Override interpolation with custom factory method.\n\t\t\tif ( sampler.interpolation === 'CUBICSPLINE' ) {\n\n\t\t\t\tthis._createCubicSplineTrackInterpolant( track );\n\n\t\t\t}\n\n\t\t\ttracks.push( track );\n\n\t\t}\n\n\t\treturn tracks;\n\n\t}\n\n\t_getArrayFromAccessor( accessor ) {\n\n\t\tlet outputArray = accessor.array;\n\n\t\tif ( accessor.normalized ) {\n\n\t\t\tconst scale = getNormalizedComponentScale( outputArray.constructor );\n\t\t\tconst scaled = new Float32Array( outputArray.length );\n\n\t\t\tfor ( let j = 0, jl = outputArray.length; j < jl; j ++ ) {\n\n\t\t\t\tscaled[ j ] = outputArray[ j ] * scale;\n\n\t\t\t}\n\n\t\t\toutputArray = scaled;\n\n\t\t}\n\n\t\treturn outputArray;\n\n\t}\n\n\t_createCubicSplineTrackInterpolant( track ) {\n\n\t\ttrack.createInterpolant = function InterpolantFactoryMethodGLTFCubicSpline( result ) {\n\n\t\t\t// A CUBICSPLINE keyframe in glTF has three output values for each input value,\n\t\t\t// representing inTangent, splineVertex, and outTangent. As a result, track.getValueSize()\n\t\t\t// must be divided by three to get the interpolant's sampleSize argument.\n\n\t\t\tconst interpolantType = ( this instanceof QuaternionKeyframeTrack ) ? GLTFCubicSplineQuaternionInterpolant : GLTFCubicSplineInterpolant;\n\n\t\t\treturn new interpolantType( this.times, this.values, this.getValueSize() / 3, result );\n\n\t\t};\n\n\t\t// Mark as CUBICSPLINE. `track.getInterpolation()` doesn't support custom interpolants.\n\t\ttrack.createInterpolant.isInterpolantFactoryMethodGLTFCubicSpline = true;\n\n\t}\n\n}\n\n/**\n *\n * @private\n * @param {BufferGeometry} geometry\n * @param {GLTF.Primitive} primitiveDef\n * @param {GLTFParser} parser\n */\nfunction computeBounds( geometry, primitiveDef, parser ) {\n\n\tconst attributes = primitiveDef.attributes;\n\n\tconst box = new Box3();\n\n\tif ( attributes.POSITION !== undefined ) {\n\n\t\tconst accessor = parser.json.accessors[ attributes.POSITION ];\n\n\t\tconst min = accessor.min;\n\t\tconst max = accessor.max;\n\n\t\t// glTF requires 'min' and 'max', but VRM (which extends glTF) currently ignores that requirement.\n\n\t\tif ( min !== undefined && max !== undefined ) {\n\n\t\t\tbox.set(\n\t\t\t\tnew Vector3( min[ 0 ], min[ 1 ], min[ 2 ] ),\n\t\t\t\tnew Vector3( max[ 0 ], max[ 1 ], max[ 2 ] )\n\t\t\t);\n\n\t\t\tif ( accessor.normalized ) {\n\n\t\t\t\tconst boxScale = getNormalizedComponentScale( WEBGL_COMPONENT_TYPES[ accessor.componentType ] );\n\t\t\t\tbox.min.multiplyScalar( boxScale );\n\t\t\t\tbox.max.multiplyScalar( boxScale );\n\n\t\t\t}\n\n\t\t} else {\n\n\t\t\tconsole.warn( 'THREE.GLTFLoader: Missing min/max properties for accessor POSITION.' );\n\n\t\t\treturn;\n\n\t\t}\n\n\t} else {\n\n\t\treturn;\n\n\t}\n\n\tconst targets = primitiveDef.targets;\n\n\tif ( targets !== undefined ) {\n\n\t\tconst maxDisplacement = new Vector3();\n\t\tconst vector = new Vector3();\n\n\t\tfor ( let i = 0, il = targets.length; i < il; i ++ ) {\n\n\t\t\tconst target = targets[ i ];\n\n\t\t\tif ( target.POSITION !== undefined ) {\n\n\t\t\t\tconst accessor = parser.json.accessors[ target.POSITION ];\n\t\t\t\tconst min = accessor.min;\n\t\t\t\tconst max = accessor.max;\n\n\t\t\t\t// glTF requires 'min' and 'max', but VRM (which extends glTF) currently ignores that requirement.\n\n\t\t\t\tif ( min !== undefined && max !== undefined ) {\n\n\t\t\t\t\t// we need to get max of absolute components because target weight is [-1,1]\n\t\t\t\t\tvector.setX( Math.max( Math.abs( min[ 0 ] ), Math.abs( max[ 0 ] ) ) );\n\t\t\t\t\tvector.setY( Math.max( Math.abs( min[ 1 ] ), Math.abs( max[ 1 ] ) ) );\n\t\t\t\t\tvector.setZ( Math.max( Math.abs( min[ 2 ] ), Math.abs( max[ 2 ] ) ) );\n\n\n\t\t\t\t\tif ( accessor.normalized ) {\n\n\t\t\t\t\t\tconst boxScale = getNormalizedComponentScale( WEBGL_COMPONENT_TYPES[ accessor.componentType ] );\n\t\t\t\t\t\tvector.multiplyScalar( boxScale );\n\n\t\t\t\t\t}\n\n\t\t\t\t\t// Note: this assumes that the sum of all weights is at most 1. This isn't quite correct - it's more conservative\n\t\t\t\t\t// to assume that each target can have a max weight of 1. However, for some use cases - notably, when morph targets\n\t\t\t\t\t// are used to implement key-frame animations and as such only two are active at a time - this results in very large\n\t\t\t\t\t// boxes. So for now we make a box that's sometimes a touch too small but is hopefully mostly of reasonable size.\n\t\t\t\t\tmaxDisplacement.max( vector );\n\n\t\t\t\t} else {\n\n\t\t\t\t\tconsole.warn( 'THREE.GLTFLoader: Missing min/max properties for accessor POSITION.' );\n\n\t\t\t\t}\n\n\t\t\t}\n\n\t\t}\n\n\t\t// As per comment above this box isn't conservative, but has a reasonable size for a very large number of morph targets.\n\t\tbox.expandByVector( maxDisplacement );\n\n\t}\n\n\tgeometry.boundingBox = box;\n\n\tconst sphere = new Sphere();\n\n\tbox.getCenter( sphere.center );\n\tsphere.radius = box.min.distanceTo( box.max ) / 2;\n\n\tgeometry.boundingSphere = sphere;\n\n}\n\n/**\n *\n * @private\n * @param {BufferGeometry} geometry\n * @param {GLTF.Primitive} primitiveDef\n * @param {GLTFParser} parser\n * @return {Promise<BufferGeometry>}\n */\nfunction addPrimitiveAttributes( geometry, primitiveDef, parser ) {\n\n\tconst attributes = primitiveDef.attributes;\n\n\tconst pending = [];\n\n\tfunction assignAttributeAccessor( accessorIndex, attributeName ) {\n\n\t\treturn parser.getDependency( 'accessor', accessorIndex )\n\t\t\t.then( function ( accessor ) {\n\n\t\t\t\tgeometry.setAttribute( attributeName, accessor );\n\n\t\t\t} );\n\n\t}\n\n\tfor ( const gltfAttributeName in attributes ) {\n\n\t\tconst threeAttributeName = ATTRIBUTES[ gltfAttributeName ] || gltfAttributeName.toLowerCase();\n\n\t\t// Skip attributes already provided by e.g. Draco extension.\n\t\tif ( threeAttributeName in geometry.attributes ) continue;\n\n\t\tpending.push( assignAttributeAccessor( attributes[ gltfAttributeName ], threeAttributeName ) );\n\n\t}\n\n\tif ( primitiveDef.indices !== undefined && ! geometry.index ) {\n\n\t\tconst accessor = parser.getDependency( 'accessor', primitiveDef.indices ).then( function ( accessor ) {\n\n\t\t\tgeometry.setIndex( accessor );\n\n\t\t} );\n\n\t\tpending.push( accessor );\n\n\t}\n\n\tif ( ColorManagement.workingColorSpace !== LinearSRGBColorSpace && 'COLOR_0' in attributes ) {\n\n\t\tconsole.warn( `THREE.GLTFLoader: Converting vertex colors from \"srgb-linear\" to \"${ColorManagement.workingColorSpace}\" not supported.` );\n\n\t}\n\n\tassignExtrasToUserData( geometry, primitiveDef );\n\n\tcomputeBounds( geometry, primitiveDef, parser );\n\n\treturn Promise.all( pending ).then( function () {\n\n\t\treturn primitiveDef.targets !== undefined\n\t\t\t? addMorphTargets( geometry, primitiveDef.targets, parser )\n\t\t\t: geometry;\n\n\t} );\n\n}\n\n/**\n * Loader result of `GLTFLoader`.\n *\n * @typedef {Object} GLTFLoader~LoadObject\n * @property {Array<AnimationClip>} animations - An array of animation clips.\n * @property {Object} asset - Meta data about the loaded asset.\n * @property {Array<Camera>} cameras - An array of cameras.\n * @property {GLTFParser} parser - A reference to the internal parser.\n * @property {Group} scene - The default scene.\n * @property {Array<Group>} scenes - glTF assets might define multiple scenes.\n * @property {Object} userData - Additional data.\n **/\n\nexport { GLTFLoader };\n","import {\n\tBufferAttribute,\n\tBufferGeometry,\n\tColor,\n\tColorManagement,\n\tFileLoader,\n\tLoader,\n\tLinearSRGBColorSpace,\n\tSRGBColorSpace,\n\tInterleavedBuffer,\n\tInterleavedBufferAttribute\n} from 'three';\n\nconst _taskCache = new WeakMap();\n\n/**\n * A loader for the Draco format.\n *\n * [Draco](https://google.github.io/draco/) is an open source library for compressing\n * and decompressing 3D meshes and point clouds. Compressed geometry can be significantly smaller,\n * at the cost of additional decoding time on the client device.\n *\n * Standalone Draco files have a `.drc` extension, and contain vertex positions, normals, colors,\n * and other attributes. Draco files do not contain materials, textures, animation, or node hierarchies –\n * to use these features, embed Draco geometry inside of a glTF file. A normal glTF file can be converted\n * to a Draco-compressed glTF file using [glTF-Pipeline](https://github.com/CesiumGS/gltf-pipeline).\n * When using Draco with glTF, an instance of `DRACOLoader` will be used internally by {@link GLTFLoader}.\n *\n * It is recommended to create one DRACOLoader instance and reuse it to avoid loading and creating\n * multiple decoder instances.\n *\n * `DRACOLoader` will automatically use either the JS or the WASM decoding library, based on\n * browser capabilities.\n *\n * ```js\n * const loader = new DRACOLoader();\n * loader.setDecoderPath( '/examples/jsm/libs/draco/' );\n *\n * const geometry = await dracoLoader.loadAsync( 'models/draco/bunny.drc' );\n * geometry.computeVertexNormals(); // optional\n *\n * dracoLoader.dispose();\n * ```\n *\n * @augments Loader\n * @three_import import { DRACOLoader } from 'three/addons/loaders/DRACOLoader.js';\n */\nclass DRACOLoader extends Loader {\n\n\t/**\n\t * Constructs a new Draco loader.\n\t *\n\t * @param {LoadingManager} [manager] - The loading manager.\n\t */\n\tconstructor( manager ) {\n\n\t\tsuper( manager );\n\n\t\tthis.decoderPath = '';\n\t\tthis.decoderConfig = {};\n\t\tthis.decoderBinary = null;\n\t\tthis.decoderPending = null;\n\n\t\tthis.workerLimit = 4;\n\t\tthis.workerPool = [];\n\t\tthis.workerNextTaskID = 1;\n\t\tthis.workerSourceURL = '';\n\n\t\tthis.defaultAttributeIDs = {\n\t\t\tposition: 'POSITION',\n\t\t\tnormal: 'NORMAL',\n\t\t\tcolor: 'COLOR',\n\t\t\tuv: 'TEX_COORD'\n\t\t};\n\t\tthis.defaultAttributeTypes = {\n\t\t\tposition: 'Float32Array',\n\t\t\tnormal: 'Float32Array',\n\t\t\tcolor: 'Float32Array',\n\t\t\tuv: 'Float32Array'\n\t\t};\n\n\t}\n\n\t/**\n\t * Provides configuration for the decoder libraries. Configuration cannot be changed after decoding begins.\n\t *\n\t * @param {string} path - The decoder path.\n\t * @return {DRACOLoader} A reference to this loader.\n\t */\n\tsetDecoderPath( path ) {\n\n\t\tthis.decoderPath = path;\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Provides configuration for the decoder libraries. Configuration cannot be changed after decoding begins.\n\t *\n\t * @param {{type:('js'|'wasm')}} config - The decoder config.\n\t * @return {DRACOLoader} A reference to this loader.\n\t */\n\tsetDecoderConfig( config ) {\n\n\t\tthis.decoderConfig = config;\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Sets the maximum number of Web Workers to be used during decoding.\n\t * A lower limit may be preferable if workers are also for other tasks in the application.\n\t *\n\t * @param {number} workerLimit - The worker limit.\n\t * @return {DRACOLoader} A reference to this loader.\n\t */\n\tsetWorkerLimit( workerLimit ) {\n\n\t\tthis.workerLimit = workerLimit;\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Starts loading from the given URL and passes the loaded Draco asset\n\t * to the `onLoad()` callback.\n\t *\n\t * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.\n\t * @param {function(BufferGeometry)} onLoad - Executed when the loading process has been finished.\n\t * @param {onProgressCallback} onProgress - Executed while the loading is in progress.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t */\n\tload( url, onLoad, onProgress, onError ) {\n\n\t\tconst loader = new FileLoader( this.manager );\n\n\t\tloader.setPath( this.path );\n\t\tloader.setResponseType( 'arraybuffer' );\n\t\tloader.setRequestHeader( this.requestHeader );\n\t\tloader.setWithCredentials( this.withCredentials );\n\n\t\tloader.load( url, ( buffer ) => {\n\n\t\t\tthis.parse( buffer, onLoad, onError );\n\n\t\t}, onProgress, onError );\n\n\t}\n\n\t/**\n\t * Parses the given Draco data.\n\t *\n\t * @param {ArrayBuffer} buffer - The raw Draco data as an array buffer.\n\t * @param {function(BufferGeometry)} onLoad - Executed when the loading/parsing process has been finished.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t */\n\tparse( buffer, onLoad, onError = ()=>{} ) {\n\n\t\tthis.decodeDracoFile( buffer, onLoad, null, null, SRGBColorSpace, onError ).catch( onError );\n\n\t}\n\n\t//\n\n\tdecodeDracoFile( buffer, callback, attributeIDs, attributeTypes, vertexColorSpace = LinearSRGBColorSpace, onError = () => {} ) {\n\n\t\tconst taskConfig = {\n\t\t\tattributeIDs: attributeIDs || this.defaultAttributeIDs,\n\t\t\tattributeTypes: attributeTypes || this.defaultAttributeTypes,\n\t\t\tuseUniqueIDs: !! attributeIDs,\n\t\t\tvertexColorSpace: vertexColorSpace,\n\t\t};\n\n\t\treturn this.decodeGeometry( buffer, taskConfig ).then( callback ).catch( onError );\n\n\t}\n\n\tdecodeGeometry( buffer, taskConfig ) {\n\n\t\tconst taskKey = JSON.stringify( taskConfig );\n\n\t\t// Check for an existing task using this buffer. A transferred buffer cannot be transferred\n\t\t// again from this thread.\n\t\tif ( _taskCache.has( buffer ) ) {\n\n\t\t\tconst cachedTask = _taskCache.get( buffer );\n\n\t\t\tif ( cachedTask.key === taskKey ) {\n\n\t\t\t\treturn cachedTask.promise;\n\n\t\t\t} else if ( buffer.byteLength === 0 ) {\n\n\t\t\t\t// Technically, it would be possible to wait for the previous task to complete,\n\t\t\t\t// transfer the buffer back, and decode again with the second configuration. That\n\t\t\t\t// is complex, and I don't know of any reason to decode a Draco buffer twice in\n\t\t\t\t// different ways, so this is left unimplemented.\n\t\t\t\tthrow new Error(\n\n\t\t\t\t\t'THREE.DRACOLoader: Unable to re-decode a buffer with different ' +\n\t\t\t\t\t'settings. Buffer has already been transferred.'\n\n\t\t\t\t);\n\n\t\t\t}\n\n\t\t}\n\n\t\t//\n\n\t\tlet worker;\n\t\tconst taskID = this.workerNextTaskID ++;\n\t\tconst taskCost = buffer.byteLength;\n\n\t\t// Obtain a worker and assign a task, and construct a geometry instance\n\t\t// when the task completes.\n\t\tconst geometryPending = this._getWorker( taskID, taskCost )\n\t\t\t.then( ( _worker ) => {\n\n\t\t\t\tworker = _worker;\n\n\t\t\t\treturn new Promise( ( resolve, reject ) => {\n\n\t\t\t\t\tworker._callbacks[ taskID ] = { resolve, reject };\n\n\t\t\t\t\tworker.postMessage( { type: 'decode', id: taskID, taskConfig, buffer }, [ buffer ] );\n\n\t\t\t\t\t// this.debug();\n\n\t\t\t\t} );\n\n\t\t\t} )\n\t\t\t.then( ( message ) => this._createGeometry( message.geometry ) );\n\n\t\t// Remove task from the task list.\n\t\t// Note: replaced '.finally()' with '.catch().then()' block - iOS 11 support (#19416)\n\t\tgeometryPending\n\t\t\t.catch( () => true )\n\t\t\t.then( () => {\n\n\t\t\t\tif ( worker && taskID ) {\n\n\t\t\t\t\tthis._releaseTask( worker, taskID );\n\n\t\t\t\t\t// this.debug();\n\n\t\t\t\t}\n\n\t\t\t} );\n\n\t\t// Cache the task result.\n\t\t_taskCache.set( buffer, {\n\n\t\t\tkey: taskKey,\n\t\t\tpromise: geometryPending\n\n\t\t} );\n\n\t\treturn geometryPending;\n\n\t}\n\n\t_createGeometry( geometryData ) {\n\n\t\tconst geometry = new BufferGeometry();\n\n\t\tif ( geometryData.index ) {\n\n\t\t\tgeometry.setIndex( new BufferAttribute( geometryData.index.array, 1 ) );\n\n\t\t}\n\n\t\tfor ( let i = 0; i < geometryData.attributes.length; i ++ ) {\n\n\t\t\tconst { name, array, itemSize, stride, vertexColorSpace } = geometryData.attributes[ i ];\n\n\t\t\tlet attribute;\n\n\t\t\tif ( itemSize === stride ) {\n\n\t\t\t\tattribute = new BufferAttribute( array, itemSize );\n\n\t\t\t} else {\n\n\t\t\t\tconst buffer = new InterleavedBuffer( array, stride );\n\n\t\t\t\tattribute = new InterleavedBufferAttribute( buffer, itemSize, 0 );\n\n\t\t\t}\n\n\t\t\tif ( name === 'color' ) {\n\n\t\t\t\tthis._assignVertexColorSpace( attribute, vertexColorSpace );\n\n\t\t\t\tattribute.normalized = ( array instanceof Float32Array ) === false;\n\n\t\t\t}\n\n\t\t\tgeometry.setAttribute( name, attribute );\n\n\t\t}\n\n\t\treturn geometry;\n\n\t}\n\n\t_assignVertexColorSpace( attribute, inputColorSpace ) {\n\n\t\t// While .drc files do not specify colorspace, the only 'official' tooling\n\t\t// is PLY and OBJ converters, which use sRGB. We'll assume sRGB when a .drc\n\t\t// file is passed into .load() or .parse(). GLTFLoader uses internal APIs\n\t\t// to decode geometry, and vertex colors are already Linear-sRGB in there.\n\n\t\tif ( inputColorSpace !== SRGBColorSpace ) return;\n\n\t\tconst _color = new Color();\n\n\t\tfor ( let i = 0, il = attribute.count; i < il; i ++ ) {\n\n\t\t\t_color.fromBufferAttribute( attribute, i );\n\t\t\tColorManagement.colorSpaceToWorking( _color, SRGBColorSpace );\n\t\t\tattribute.setXYZ( i, _color.r, _color.g, _color.b );\n\n\t\t}\n\n\t}\n\n\t_loadLibrary( url, responseType ) {\n\n\t\tconst loader = new FileLoader( this.manager );\n\t\tloader.setPath( this.decoderPath );\n\t\tloader.setResponseType( responseType );\n\t\tloader.setWithCredentials( this.withCredentials );\n\n\t\treturn new Promise( ( resolve, reject ) => {\n\n\t\t\tloader.load( url, resolve, undefined, reject );\n\n\t\t} );\n\n\t}\n\n\tpreload() {\n\n\t\tthis._initDecoder();\n\n\t\treturn this;\n\n\t}\n\n\t_initDecoder() {\n\n\t\tif ( this.decoderPending ) return this.decoderPending;\n\n\t\tconst useJS = typeof WebAssembly !== 'object' || this.decoderConfig.type === 'js';\n\t\tconst librariesPending = [];\n\n\t\tif ( useJS ) {\n\n\t\t\tlibrariesPending.push( this._loadLibrary( 'draco_decoder.js', 'text' ) );\n\n\t\t} else {\n\n\t\t\tlibrariesPending.push( this._loadLibrary( 'draco_wasm_wrapper.js', 'text' ) );\n\t\t\tlibrariesPending.push( this._loadLibrary( 'draco_decoder.wasm', 'arraybuffer' ) );\n\n\t\t}\n\n\t\tthis.decoderPending = Promise.all( librariesPending )\n\t\t\t.then( ( libraries ) => {\n\n\t\t\t\tconst jsContent = libraries[ 0 ];\n\n\t\t\t\tif ( ! useJS ) {\n\n\t\t\t\t\tthis.decoderConfig.wasmBinary = libraries[ 1 ];\n\n\t\t\t\t}\n\n\t\t\t\tconst fn = DRACOWorker.toString();\n\n\t\t\t\tconst body = [\n\t\t\t\t\t'/* draco decoder */',\n\t\t\t\t\tjsContent,\n\t\t\t\t\t'',\n\t\t\t\t\t'/* worker */',\n\t\t\t\t\tfn.substring( fn.indexOf( '{' ) + 1, fn.lastIndexOf( '}' ) )\n\t\t\t\t].join( '\\n' );\n\n\t\t\t\tthis.workerSourceURL = URL.createObjectURL( new Blob( [ body ] ) );\n\n\t\t\t} );\n\n\t\treturn this.decoderPending;\n\n\t}\n\n\t_getWorker( taskID, taskCost ) {\n\n\t\treturn this._initDecoder().then( () => {\n\n\t\t\tif ( this.workerPool.length < this.workerLimit ) {\n\n\t\t\t\tconst worker = new Worker( this.workerSourceURL );\n\n\t\t\t\tworker._callbacks = {};\n\t\t\t\tworker._taskCosts = {};\n\t\t\t\tworker._taskLoad = 0;\n\n\t\t\t\tworker.postMessage( { type: 'init', decoderConfig: this.decoderConfig } );\n\n\t\t\t\tworker.onmessage = function ( e ) {\n\n\t\t\t\t\tconst message = e.data;\n\n\t\t\t\t\tswitch ( message.type ) {\n\n\t\t\t\t\t\tcase 'decode':\n\t\t\t\t\t\t\tworker._callbacks[ message.id ].resolve( message );\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tcase 'error':\n\t\t\t\t\t\t\tworker._callbacks[ message.id ].reject( message );\n\t\t\t\t\t\t\tbreak;\n\n\t\t\t\t\t\tdefault:\n\t\t\t\t\t\t\tconsole.error( 'THREE.DRACOLoader: Unexpected message, \"' + message.type + '\"' );\n\n\t\t\t\t\t}\n\n\t\t\t\t};\n\n\t\t\t\tthis.workerPool.push( worker );\n\n\t\t\t} else {\n\n\t\t\t\tthis.workerPool.sort( function ( a, b ) {\n\n\t\t\t\t\treturn a._taskLoad > b._taskLoad ? - 1 : 1;\n\n\t\t\t\t} );\n\n\t\t\t}\n\n\t\t\tconst worker = this.workerPool[ this.workerPool.length - 1 ];\n\t\t\tworker._taskCosts[ taskID ] = taskCost;\n\t\t\tworker._taskLoad += taskCost;\n\t\t\treturn worker;\n\n\t\t} );\n\n\t}\n\n\t_releaseTask( worker, taskID ) {\n\n\t\tworker._taskLoad -= worker._taskCosts[ taskID ];\n\t\tdelete worker._callbacks[ taskID ];\n\t\tdelete worker._taskCosts[ taskID ];\n\n\t}\n\n\tdebug() {\n\n\t\tconsole.log( 'Task load: ', this.workerPool.map( ( worker ) => worker._taskLoad ) );\n\n\t}\n\n\tdispose() {\n\n\t\tfor ( let i = 0; i < this.workerPool.length; ++ i ) {\n\n\t\t\tthis.workerPool[ i ].terminate();\n\n\t\t}\n\n\t\tthis.workerPool.length = 0;\n\n\t\tif ( this.workerSourceURL !== '' ) {\n\n\t\t\tURL.revokeObjectURL( this.workerSourceURL );\n\n\t\t}\n\n\t\treturn this;\n\n\t}\n\n}\n\n/* WEB WORKER */\n\nfunction DRACOWorker() {\n\n\tlet decoderConfig;\n\tlet decoderPending;\n\n\tonmessage = function ( e ) {\n\n\t\tconst message = e.data;\n\n\t\tswitch ( message.type ) {\n\n\t\t\tcase 'init':\n\t\t\t\tdecoderConfig = message.decoderConfig;\n\t\t\t\tdecoderPending = new Promise( function ( resolve/*, reject*/ ) {\n\n\t\t\t\t\tdecoderConfig.onModuleLoaded = function ( draco ) {\n\n\t\t\t\t\t\t// Module is Promise-like. Wrap before resolving to avoid loop.\n\t\t\t\t\t\tresolve( { draco: draco } );\n\n\t\t\t\t\t};\n\n\t\t\t\t\tDracoDecoderModule( decoderConfig ); // eslint-disable-line no-undef\n\n\t\t\t\t} );\n\t\t\t\tbreak;\n\n\t\t\tcase 'decode':\n\t\t\t\tconst buffer = message.buffer;\n\t\t\t\tconst taskConfig = message.taskConfig;\n\t\t\t\tdecoderPending.then( ( module ) => {\n\n\t\t\t\t\tconst draco = module.draco;\n\t\t\t\t\tconst decoder = new draco.Decoder();\n\n\t\t\t\t\ttry {\n\n\t\t\t\t\t\tconst geometry = decodeGeometry( draco, decoder, new Int8Array( buffer ), taskConfig );\n\n\t\t\t\t\t\tconst buffers = geometry.attributes.map( ( attr ) => attr.array.buffer );\n\n\t\t\t\t\t\tif ( geometry.index ) buffers.push( geometry.index.array.buffer );\n\n\t\t\t\t\t\tself.postMessage( { type: 'decode', id: message.id, geometry }, buffers );\n\n\t\t\t\t\t} catch ( error ) {\n\n\t\t\t\t\t\tconsole.error( error );\n\n\t\t\t\t\t\tself.postMessage( { type: 'error', id: message.id, error: error.message } );\n\n\t\t\t\t\t} finally {\n\n\t\t\t\t\t\tdraco.destroy( decoder );\n\n\t\t\t\t\t}\n\n\t\t\t\t} );\n\t\t\t\tbreak;\n\n\t\t}\n\n\t};\n\n\tfunction decodeGeometry( draco, decoder, array, taskConfig ) {\n\n\t\tconst attributeIDs = taskConfig.attributeIDs;\n\t\tconst attributeTypes = taskConfig.attributeTypes;\n\n\t\tlet dracoGeometry;\n\t\tlet decodingStatus;\n\n\t\tconst geometryType = decoder.GetEncodedGeometryType( array );\n\n\t\tif ( geometryType === draco.TRIANGULAR_MESH ) {\n\n\t\t\tdracoGeometry = new draco.Mesh();\n\t\t\tdecodingStatus = decoder.DecodeArrayToMesh( array, array.byteLength, dracoGeometry );\n\n\t\t} else if ( geometryType === draco.POINT_CLOUD ) {\n\n\t\t\tdracoGeometry = new draco.PointCloud();\n\t\t\tdecodingStatus = decoder.DecodeArrayToPointCloud( array, array.byteLength, dracoGeometry );\n\n\t\t} else {\n\n\t\t\tthrow new Error( 'THREE.DRACOLoader: Unexpected geometry type.' );\n\n\t\t}\n\n\t\tif ( ! decodingStatus.ok() || dracoGeometry.ptr === 0 ) {\n\n\t\t\tthrow new Error( 'THREE.DRACOLoader: Decoding failed: ' + decodingStatus.error_msg() );\n\n\t\t}\n\n\t\tconst geometry = { index: null, attributes: [] };\n\n\t\t// Gather all vertex attributes.\n\t\tfor ( const attributeName in attributeIDs ) {\n\n\t\t\tconst attributeType = self[ attributeTypes[ attributeName ] ];\n\n\t\t\tlet attribute;\n\t\t\tlet attributeID;\n\n\t\t\t// A Draco file may be created with default vertex attributes, whose attribute IDs\n\t\t\t// are mapped 1:1 from their semantic name (POSITION, NORMAL, ...). Alternatively,\n\t\t\t// a Draco file may contain a custom set of attributes, identified by known unique\n\t\t\t// IDs. glTF files always do the latter, and `.drc` files typically do the former.\n\t\t\tif ( taskConfig.useUniqueIDs ) {\n\n\t\t\t\tattributeID = attributeIDs[ attributeName ];\n\t\t\t\tattribute = decoder.GetAttributeByUniqueId( dracoGeometry, attributeID );\n\n\t\t\t} else {\n\n\t\t\t\tattributeID = decoder.GetAttributeId( dracoGeometry, draco[ attributeIDs[ attributeName ] ] );\n\n\t\t\t\tif ( attributeID === - 1 ) continue;\n\n\t\t\t\tattribute = decoder.GetAttribute( dracoGeometry, attributeID );\n\n\t\t\t}\n\n\t\t\tconst attributeResult = decodeAttribute( draco, decoder, dracoGeometry, attributeName, attributeType, attribute );\n\n\t\t\tif ( attributeName === 'color' ) {\n\n\t\t\t\tattributeResult.vertexColorSpace = taskConfig.vertexColorSpace;\n\n\t\t\t}\n\n\t\t\tgeometry.attributes.push( attributeResult );\n\n\t\t}\n\n\t\t// Add index.\n\t\tif ( geometryType === draco.TRIANGULAR_MESH ) {\n\n\t\t\tgeometry.index = decodeIndex( draco, decoder, dracoGeometry );\n\n\t\t}\n\n\t\tdraco.destroy( dracoGeometry );\n\n\t\treturn geometry;\n\n\t}\n\n\tfunction decodeIndex( draco, decoder, dracoGeometry ) {\n\n\t\tconst numFaces = dracoGeometry.num_faces();\n\t\tconst numIndices = numFaces * 3;\n\t\tconst byteLength = numIndices * 4;\n\n\t\tconst ptr = draco._malloc( byteLength );\n\t\tdecoder.GetTrianglesUInt32Array( dracoGeometry, byteLength, ptr );\n\t\tconst index = new Uint32Array( draco.HEAPF32.buffer, ptr, numIndices ).slice();\n\t\tdraco._free( ptr );\n\n\t\treturn { array: index, itemSize: 1 };\n\n\t}\n\n\tfunction decodeAttribute( draco, decoder, dracoGeometry, attributeName, TypedArray, attribute ) {\n\n\t\tconst count = dracoGeometry.num_points();\n\t\tconst itemSize = attribute.num_components();\n\t\tconst dracoDataType = getDracoDataType( draco, TypedArray );\n\n\t\t// Reference: https://registry.khronos.org/glTF/specs/2.0/glTF-2.0.html#data-alignment\n\t\tconst srcByteStride = itemSize * TypedArray.BYTES_PER_ELEMENT;\n\t\tconst dstByteStride = Math.ceil( srcByteStride / 4 ) * 4;\n\n\t\tconst dstStride = dstByteStride / TypedArray.BYTES_PER_ELEMENT;\n\n\t\tconst srcByteLength = count * srcByteStride;\n\t\tconst dstByteLength = count * dstByteStride;\n\n\t\tconst ptr = draco._malloc( srcByteLength );\n\t\tdecoder.GetAttributeDataArrayForAllPoints( dracoGeometry, attribute, dracoDataType, srcByteLength, ptr );\n\n\t\tconst srcArray = new TypedArray( draco.HEAPF32.buffer, ptr, srcByteLength / TypedArray.BYTES_PER_ELEMENT );\n\t\tlet dstArray;\n\n\t\tif ( srcByteStride === dstByteStride ) {\n\n\t\t\t// THREE.BufferAttribute\n\n\t\t\tdstArray = srcArray.slice();\n\n\t\t} else {\n\n\t\t\t// THREE.InterleavedBufferAttribute\n\n\t\t\tdstArray = new TypedArray( dstByteLength / TypedArray.BYTES_PER_ELEMENT );\n\n\t\t\tlet dstOffset = 0;\n\n\t\t\tfor ( let i = 0, il = srcArray.length; i < il; i ++ ) {\n\n\t\t\t\tfor ( let j = 0; j < itemSize; j ++ ) {\n\n\t\t\t\t\tdstArray[ dstOffset + j ] = srcArray[ i * itemSize + j ];\n\n\t\t\t\t}\n\n\t\t\t\tdstOffset += dstStride;\n\n\t\t\t}\n\n\t\t}\n\n\t\tdraco._free( ptr );\n\n\t\treturn {\n\t\t\tname: attributeName,\n\t\t\tcount: count,\n\t\t\titemSize: itemSize,\n\t\t\tarray: dstArray,\n\t\t\tstride: dstStride\n\t\t};\n\n\t}\n\n\tfunction getDracoDataType( draco, TypedArray ) {\n\n\t\tswitch ( TypedArray ) {\n\n\t\t\tcase Float32Array: return draco.DT_FLOAT32;\n\t\t\tcase Int8Array: return draco.DT_INT8;\n\t\t\tcase Int16Array: return draco.DT_INT16;\n\t\t\tcase Int32Array: return draco.DT_INT32;\n\t\t\tcase Uint8Array: return draco.DT_UINT8;\n\t\t\tcase Uint16Array: return draco.DT_UINT16;\n\t\t\tcase Uint32Array: return draco.DT_UINT32;\n\n\t\t}\n\n\t}\n\n}\n\nexport { DRACOLoader };\n","/**\n * A simple pool for managing Web Workers.\n *\n * @three_import import { WorkerPool } from 'three/addons/utils/WorkerPool.js';\n */\nexport class WorkerPool {\n\n\t/**\n\t * Constructs a new Worker pool.\n\t *\n\t * @param {number} [pool=4] - The size of the pool.\n\t */\n\tconstructor( pool = 4 ) {\n\n\t\t/**\n\t\t * The size of the pool.\n\t\t *\n\t\t * @type {number}\n\t\t * @default 4\n\t\t */\n\t\tthis.pool = pool;\n\n\t\t/**\n\t\t * A message queue.\n\t\t *\n\t\t * @type {Array<Object>}\n\t\t */\n\t\tthis.queue = [];\n\n\t\t/**\n\t\t * An array of Workers.\n\t\t *\n\t\t * @type {Array<Worker>}\n\t\t */\n\t\tthis.workers = [];\n\n\t\t/**\n\t\t * An array with resolve functions for messages.\n\t\t *\n\t\t * @type {Array<Function>}\n\t\t */\n\t\tthis.workersResolve = [];\n\n\t\t/**\n\t\t * The current worker status.\n\t\t *\n\t\t * @type {number}\n\t\t */\n\t\tthis.workerStatus = 0;\n\n\t\t/**\n\t\t * A factory function for creating workers.\n\t\t *\n\t\t * @type {?Function}\n\t\t */\n\t\tthis.workerCreator = null;\n\n\t}\n\n\t_initWorker( workerId ) {\n\n\t\tif ( ! this.workers[ workerId ] ) {\n\n\t\t\tconst worker = this.workerCreator();\n\t\t\tworker.addEventListener( 'message', this._onMessage.bind( this, workerId ) );\n\t\t\tthis.workers[ workerId ] = worker;\n\n\t\t}\n\n\t}\n\n\t_getIdleWorker() {\n\n\t\tfor ( let i = 0; i < this.pool; i ++ )\n\t\t\tif ( ! ( this.workerStatus & ( 1 << i ) ) ) return i;\n\n\t\treturn - 1;\n\n\t}\n\n\t_onMessage( workerId, msg ) {\n\n\t\tconst resolve = this.workersResolve[ workerId ];\n\t\tresolve && resolve( msg );\n\n\t\tif ( this.queue.length ) {\n\n\t\t\tconst { resolve, msg, transfer } = this.queue.shift();\n\t\t\tthis.workersResolve[ workerId ] = resolve;\n\t\t\tthis.workers[ workerId ].postMessage( msg, transfer );\n\n\t\t} else {\n\n\t\t\tthis.workerStatus ^= 1 << workerId;\n\n\t\t}\n\n\t}\n\n\t/**\n\t * Sets a function that is responsible for creating Workers.\n\t *\n\t * @param {Function} workerCreator - The worker creator function.\n\t */\n\tsetWorkerCreator( workerCreator ) {\n\n\t\tthis.workerCreator = workerCreator;\n\n\t}\n\n\t/**\n\t * Sets the Worker limit\n\t *\n\t * @param {number} pool - The size of the pool.\n\t */\n\tsetWorkerLimit( pool ) {\n\n\t\tthis.pool = pool;\n\n\t}\n\n\t/**\n\t * Post a message to an idle Worker. If no Worker is available,\n\t * the message is pushed into a message queue for later processing.\n\t *\n\t * @param {Object} msg - The message.\n\t * @param {Array<ArrayBuffer>} transfer - An array with array buffers for data transfer.\n\t * @return {Promise} A Promise that resolves when the message has been processed.\n\t */\n\tpostMessage( msg, transfer ) {\n\n\t\treturn new Promise( ( resolve ) => {\n\n\t\t\tconst workerId = this._getIdleWorker();\n\n\t\t\tif ( workerId !== - 1 ) {\n\n\t\t\t\tthis._initWorker( workerId );\n\t\t\t\tthis.workerStatus |= 1 << workerId;\n\t\t\t\tthis.workersResolve[ workerId ] = resolve;\n\t\t\t\tthis.workers[ workerId ].postMessage( msg, transfer );\n\n\t\t\t} else {\n\n\t\t\t\tthis.queue.push( { resolve, msg, transfer } );\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n\t/**\n\t * Terminates all Workers of this pool. Call this  method whenever this\n\t * Worker pool is no longer used in your app.\n\t */\n\tdispose() {\n\n\t\tthis.workers.forEach( ( worker ) => worker.terminate() );\n\t\tthis.workersResolve.length = 0;\n\t\tthis.workers.length = 0;\n\t\tthis.queue.length = 0;\n\t\tthis.workerStatus = 0;\n\n\t}\n\n}\n","const t=0,e=1,n=2,i=3,s=0,a=0,r=2,o=0,l=1,f=160,c=161,U=162,h=163,p=166,_=0,u=1,g=0,x=1,y=2,b=3,m=4,d=5,D=6,w=7,v=8,B=9,L=10,A=11,k=12,I=13,V=14,C=15,F=16,O=17,T=18,S=0,E=1,P=2,M=3,N=4,W=5,H=6,z=7,j=8,K=9,X=10,Y=11,R=0,G=1,q=2,J=13,Q=14,Z=15,$=128,tt=64,et=32,nt=16,it=0,st=1,at=2,rt=3,ot=4,lt=5,ft=6,ct=7,Ut=8,ht=9,pt=10,_t=13,ut=14,gt=15,xt=16,yt=17,bt=20,mt=21,dt=22,Dt=23,wt=24,vt=27,Bt=28,Lt=29,At=30,kt=31,It=34,Vt=35,Ct=36,Ft=37,Ot=38,Tt=41,St=42,Et=43,Pt=44,Mt=45,Nt=48,Wt=49,Ht=50,zt=58,jt=59,Kt=62,Xt=63,Yt=64,Rt=65,Gt=68,qt=69,Jt=70,Qt=71,Zt=74,$t=75,te=76,ee=77,ne=78,ie=81,se=82,ae=83,re=84,oe=85,le=88,fe=89,ce=90,Ue=91,he=92,pe=95,_e=96,ue=97,ge=98,xe=99,ye=100,be=101,me=102,de=103,De=104,we=105,ve=106,Be=107,Le=108,Ae=109,ke=110,Ie=111,Ve=112,Ce=113,Fe=114,Oe=115,Te=116,Se=117,Ee=118,Pe=119,Me=120,Ne=121,We=122,He=123,ze=124,je=125,Ke=126,Xe=127,Ye=128,Re=129,Ge=130,qe=131,Je=132,Qe=133,Ze=134,$e=135,tn=136,en=137,nn=138,sn=139,an=140,rn=141,on=142,ln=143,fn=144,cn=145,Un=146,hn=147,pn=148,_n=149,un=150,gn=151,xn=152,yn=153,bn=154,mn=155,dn=156,Dn=157,wn=158,vn=159,Bn=160,Ln=161,An=162,kn=163,In=164,Vn=165,Cn=166,Fn=167,On=168,Tn=169,Sn=170,En=171,Pn=172,Mn=173,Nn=174,Wn=175,Hn=176,zn=177,jn=178,Kn=179,Xn=180,Yn=181,Rn=182,Gn=183,qn=184,Jn=1000156007,Qn=1000156008,Zn=1000156009,$n=1000156010,ti=1000156011,ei=1000156017,ni=1000156018,ii=1000156019,si=1000156020,ai=1000156021,ri=1000054e3,oi=1000054001,li=1000054002,fi=1000054003,ci=1000054004,Ui=1000054005,hi=1000054006,pi=1000054007,_i=1000066e3,ui=1000066001,gi=1000066002,xi=1000066003,yi=1000066004,bi=1000066005,mi=1000066006,di=1000066007,Di=1000066008,wi=1000066009,vi=1000066010,Bi=1000066011,Li=1000066012,Ai=1000066013,ki=100034e4,Ii=1000340001;function Vi(){return{vkFormat:0,typeSize:1,pixelWidth:0,pixelHeight:0,pixelDepth:0,layerCount:0,faceCount:1,levelCount:0,supercompressionScheme:0,levels:[],dataFormatDescriptor:[{vendorId:0,descriptorType:0,versionNumber:2,colorModel:0,colorPrimaries:1,transferFunction:2,flags:0,texelBlockDimension:[0,0,0,0],bytesPlane:[0,0,0,0,0,0,0,0],samples:[]}],keyValue:{},globalData:null}}class Ci{constructor(t,e,n,i){this._dataView=void 0,this._littleEndian=void 0,this._offset=void 0,this._dataView=new DataView(t.buffer,t.byteOffset+e,n),this._littleEndian=i,this._offset=0}_nextUint8(){const t=this._dataView.getUint8(this._offset);return this._offset+=1,t}_nextUint16(){const t=this._dataView.getUint16(this._offset,this._littleEndian);return this._offset+=2,t}_nextUint32(){const t=this._dataView.getUint32(this._offset,this._littleEndian);return this._offset+=4,t}_nextUint64(){const t=this._dataView.getUint32(this._offset,this._littleEndian)+2**32*this._dataView.getUint32(this._offset+4,this._littleEndian);return this._offset+=8,t}_nextInt32(){const t=this._dataView.getInt32(this._offset,this._littleEndian);return this._offset+=4,t}_nextUint8Array(t){const e=new Uint8Array(this._dataView.buffer,this._dataView.byteOffset+this._offset,t);return this._offset+=t,e}_skip(t){return this._offset+=t,this}_scan(t,e=0){const n=this._offset;let i=0;for(;this._dataView.getUint8(this._offset)!==e&&i<t;)i++,this._offset++;return i<t&&this._offset++,new Uint8Array(this._dataView.buffer,this._dataView.byteOffset+n,i)}}const Fi=new Uint8Array([0]),Oi=[171,75,84,88,32,50,48,187,13,10,26,10];function Ti(t){return(new TextEncoder).encode(t)}function Si(t){return(new TextDecoder).decode(t)}function Ei(t){let e=0;for(const n of t)e+=n.byteLength;const n=new Uint8Array(e);let i=0;for(const e of t)n.set(new Uint8Array(e),i),i+=e.byteLength;return n}function Pi(t,e=4){return Math.ceil(t/e)*e-t}function Mi(t){const e=new Uint8Array(t.buffer,t.byteOffset,Oi.length);if(e[0]!==Oi[0]||e[1]!==Oi[1]||e[2]!==Oi[2]||e[3]!==Oi[3]||e[4]!==Oi[4]||e[5]!==Oi[5]||e[6]!==Oi[6]||e[7]!==Oi[7]||e[8]!==Oi[8]||e[9]!==Oi[9]||e[10]!==Oi[10]||e[11]!==Oi[11])throw new Error(\"Missing KTX 2.0 identifier.\");const n={vkFormat:0,typeSize:1,pixelWidth:0,pixelHeight:0,pixelDepth:0,layerCount:0,faceCount:1,levelCount:0,supercompressionScheme:0,levels:[],dataFormatDescriptor:[{vendorId:0,descriptorType:0,versionNumber:2,colorModel:0,colorPrimaries:1,transferFunction:2,flags:0,texelBlockDimension:[0,0,0,0],bytesPlane:[0,0,0,0,0,0,0,0],samples:[]}],keyValue:{},globalData:null},i=17*Uint32Array.BYTES_PER_ELEMENT,s=new Ci(t,Oi.length,i,!0);n.vkFormat=s._nextUint32(),n.typeSize=s._nextUint32(),n.pixelWidth=s._nextUint32(),n.pixelHeight=s._nextUint32(),n.pixelDepth=s._nextUint32(),n.layerCount=s._nextUint32(),n.faceCount=s._nextUint32(),n.levelCount=s._nextUint32(),n.supercompressionScheme=s._nextUint32();const a=s._nextUint32(),r=s._nextUint32(),o=s._nextUint32(),l=s._nextUint32(),f=s._nextUint64(),c=s._nextUint64(),U=3*Math.max(n.levelCount,1)*8,h=new Ci(t,Oi.length+i,U,!0);for(let e=0,i=Math.max(n.levelCount,1);e<i;e++)n.levels.push({levelData:new Uint8Array(t.buffer,t.byteOffset+h._nextUint64(),h._nextUint64()),uncompressedByteLength:h._nextUint64()});const p=new Ci(t,a,r,!0);p._skip(4);const _=p._nextUint16(),u=p._nextUint16(),g=p._nextUint16(),x=p._nextUint16(),y={vendorId:_,descriptorType:u,versionNumber:g,colorModel:p._nextUint8(),colorPrimaries:p._nextUint8(),transferFunction:p._nextUint8(),flags:p._nextUint8(),texelBlockDimension:[p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8()],bytesPlane:[p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8()],samples:[]},b=(x/4-6)/4;for(let t=0;t<b;t++){const e={bitOffset:p._nextUint16(),bitLength:p._nextUint8(),channelType:p._nextUint8(),samplePosition:[p._nextUint8(),p._nextUint8(),p._nextUint8(),p._nextUint8()],sampleLower:Number.NEGATIVE_INFINITY,sampleUpper:Number.POSITIVE_INFINITY};64&e.channelType?(e.sampleLower=p._nextInt32(),e.sampleUpper=p._nextInt32()):(e.sampleLower=p._nextUint32(),e.sampleUpper=p._nextUint32()),y.samples[t]=e}n.dataFormatDescriptor.length=0,n.dataFormatDescriptor.push(y);const m=new Ci(t,o,l,!0);for(;m._offset<l;){const t=m._nextUint32(),e=m._scan(t),i=Si(e);if(n.keyValue[i]=m._nextUint8Array(t-e.byteLength-1),i.match(/^ktx/i)){const t=Si(n.keyValue[i]);n.keyValue[i]=t.substring(0,t.lastIndexOf(\"\\0\"))}m._skip(t%4?4-t%4:0)}if(c<=0)return n;const d=new Ci(t,f,c,!0),D=d._nextUint16(),w=d._nextUint16(),v=d._nextUint32(),B=d._nextUint32(),L=d._nextUint32(),A=d._nextUint32(),k=[];for(let t=0,e=Math.max(n.levelCount,1);t<e;t++)k.push({imageFlags:d._nextUint32(),rgbSliceByteOffset:d._nextUint32(),rgbSliceByteLength:d._nextUint32(),alphaSliceByteOffset:d._nextUint32(),alphaSliceByteLength:d._nextUint32()});const I=f+d._offset,V=I+v,C=V+B,F=C+L,O=new Uint8Array(t.buffer,t.byteOffset+I,v),T=new Uint8Array(t.buffer,t.byteOffset+V,B),S=new Uint8Array(t.buffer,t.byteOffset+C,L),E=new Uint8Array(t.buffer,t.byteOffset+F,A);return n.globalData={endpointCount:D,selectorCount:w,imageDescs:k,endpointsData:O,selectorsData:T,tablesData:S,extendedData:E},n}function Ni(){return Ni=Object.assign?Object.assign.bind():function(t){for(var e=1;e<arguments.length;e++){var n=arguments[e];for(var i in n)({}).hasOwnProperty.call(n,i)&&(t[i]=n[i])}return t},Ni.apply(null,arguments)}const Wi={keepWriter:!1};function Hi(t,e={}){e=Ni({},Wi,e);let n=new ArrayBuffer(0);if(t.globalData){const e=new ArrayBuffer(20+5*t.globalData.imageDescs.length*4),i=new DataView(e);i.setUint16(0,t.globalData.endpointCount,!0),i.setUint16(2,t.globalData.selectorCount,!0),i.setUint32(4,t.globalData.endpointsData.byteLength,!0),i.setUint32(8,t.globalData.selectorsData.byteLength,!0),i.setUint32(12,t.globalData.tablesData.byteLength,!0),i.setUint32(16,t.globalData.extendedData.byteLength,!0);for(let e=0;e<t.globalData.imageDescs.length;e++){const n=t.globalData.imageDescs[e];i.setUint32(20+5*e*4+0,n.imageFlags,!0),i.setUint32(20+5*e*4+4,n.rgbSliceByteOffset,!0),i.setUint32(20+5*e*4+8,n.rgbSliceByteLength,!0),i.setUint32(20+5*e*4+12,n.alphaSliceByteOffset,!0),i.setUint32(20+5*e*4+16,n.alphaSliceByteLength,!0)}n=Ei([e,t.globalData.endpointsData,t.globalData.selectorsData,t.globalData.tablesData,t.globalData.extendedData])}const i=[],s=Object.entries(Ni({},t.keyValue,!e.keepWriter&&{KTXwriter:\"KTX-Parse v1.0.1\"}));s.sort((t,e)=>t[0]>e[0]?1:-1);for(const[t,e]of s){const n=Ti(t),s=\"string\"==typeof e?Ei([Ti(e),Fi]):e,a=n.byteLength+1+s.byteLength,r=Pi(a,4);i.push(Ei([new Uint32Array([a]),n,Fi,s,new Uint8Array(r).fill(0)]))}const a=Ei(i);if(1!==t.dataFormatDescriptor.length||0!==t.dataFormatDescriptor[0].descriptorType)throw new Error(\"Only BASICFORMAT Data Format Descriptor output supported.\");const r=t.dataFormatDescriptor[0],o=new ArrayBuffer(28+16*r.samples.length),l=new DataView(o),f=24+16*r.samples.length;if(l.setUint32(0,o.byteLength,!0),l.setUint16(4,r.vendorId,!0),l.setUint16(6,r.descriptorType,!0),l.setUint16(8,r.versionNumber,!0),l.setUint16(10,f,!0),l.setUint8(12,r.colorModel),l.setUint8(13,r.colorPrimaries),l.setUint8(14,r.transferFunction),l.setUint8(15,r.flags),!Array.isArray(r.texelBlockDimension))throw new Error(\"texelBlockDimension is now an array. For dimensionality `d`, set `d - 1`.\");l.setUint8(16,r.texelBlockDimension[0]),l.setUint8(17,r.texelBlockDimension[1]),l.setUint8(18,r.texelBlockDimension[2]),l.setUint8(19,r.texelBlockDimension[3]);for(let t=0;t<8;t++)l.setUint8(20+t,r.bytesPlane[t]);for(let t=0;t<r.samples.length;t++){const e=r.samples[t],n=28+16*t;l.setUint16(n+0,e.bitOffset,!0),l.setUint8(n+2,e.bitLength),l.setUint8(n+3,e.channelType),l.setUint8(n+4,e.samplePosition[0]),l.setUint8(n+5,e.samplePosition[1]),l.setUint8(n+6,e.samplePosition[2]),l.setUint8(n+7,e.samplePosition[3]),64&e.channelType?(l.setInt32(n+8,e.sampleLower,!0),l.setInt32(n+12,e.sampleUpper,!0)):(l.setUint32(n+8,e.sampleLower,!0),l.setUint32(n+12,e.sampleUpper,!0))}const c=Oi.length+68+3*t.levels.length*8,U=c+o.byteLength;let h=n.byteLength>0?U+a.byteLength:0;h%8&&(h+=8-h%8);const p=[],_=new DataView(new ArrayBuffer(3*t.levels.length*8)),u=new Uint32Array(t.levels.length);let g=0;0===t.supercompressionScheme&&(g=function(t){const e=Math.max(t,4),n=Math.min(t,4);let i=e;for(;i%n!==0;)i+=e;return i}(function(t){return t.levels[0].levelData.byteLength/function(t){let e=1;const n=[t.pixelWidth,t.pixelHeight,t.pixelDepth],i=function(t){const[e,n,i]=t.dataFormatDescriptor[0].texelBlockDimension;return[e+1,n+1,i+1]}(t);for(let t=0;t<3;t++)if(n[t]>0){const s=Math.ceil(Math.floor(1*n[t])/i[t]);e*=Math.max(1,s)}return t.layerCount>0&&(e*=t.layerCount),t.faceCount>0&&(e*=t.faceCount),e}(t)}(t)));let x=(h||U+a.byteLength)+n.byteLength;for(let e=t.levels.length-1;e>=0;e--){if(x%g){const t=Pi(x,g);p.push(new Uint8Array(t)),x+=t}const n=t.levels[e];p.push(n.levelData),u[e]=x,x+=n.levelData.byteLength}for(let e=0;e<t.levels.length;e++){const n=t.levels[e];_.setBigUint64(24*e+0,BigInt(u[e]),!0),_.setBigUint64(24*e+8,BigInt(n.levelData.byteLength),!0),_.setBigUint64(24*e+16,BigInt(n.uncompressedByteLength),!0)}const y=new ArrayBuffer(68),b=new DataView(y);return b.setUint32(0,t.vkFormat,!0),b.setUint32(4,t.typeSize,!0),b.setUint32(8,t.pixelWidth,!0),b.setUint32(12,t.pixelHeight,!0),b.setUint32(16,t.pixelDepth,!0),b.setUint32(20,t.layerCount,!0),b.setUint32(24,t.faceCount,!0),b.setUint32(28,t.levelCount,!0),b.setUint32(32,t.supercompressionScheme,!0),b.setUint32(36,c,!0),b.setUint32(40,o.byteLength,!0),b.setUint32(44,U,!0),b.setUint32(48,a.byteLength,!0),b.setBigUint64(52,BigInt(n.byteLength>0?h:0),!0),b.setBigUint64(60,BigInt(n.byteLength),!0),new Uint8Array(Ei([new Uint8Array(Oi).buffer,y,_.buffer,o,a,h>0?new ArrayBuffer(h-(U+a.byteLength)):new ArrayBuffer(0),n,...p]))}export{Z as KHR_DF_CHANNEL_RGBSDA_ALPHA,q as KHR_DF_CHANNEL_RGBSDA_BLUE,Q as KHR_DF_CHANNEL_RGBSDA_DEPTH,G as KHR_DF_CHANNEL_RGBSDA_GREEN,R as KHR_DF_CHANNEL_RGBSDA_RED,J as KHR_DF_CHANNEL_RGBSDA_STENCIL,u as KHR_DF_FLAG_ALPHA_PREMULTIPLIED,_ as KHR_DF_FLAG_ALPHA_STRAIGHT,s as KHR_DF_KHR_DESCRIPTORTYPE_BASICFORMAT,U as KHR_DF_MODEL_ASTC,f as KHR_DF_MODEL_ETC1,h as KHR_DF_MODEL_ETC1S,c as KHR_DF_MODEL_ETC2,l as KHR_DF_MODEL_RGBSDA,p as KHR_DF_MODEL_UASTC,o as KHR_DF_MODEL_UNSPECIFIED,H as KHR_DF_PRIMARIES_ACES,z as KHR_DF_PRIMARIES_ACESCC,Y as KHR_DF_PRIMARIES_ADOBERGB,N as KHR_DF_PRIMARIES_BT2020,P as KHR_DF_PRIMARIES_BT601_EBU,M as KHR_DF_PRIMARIES_BT601_SMPTE,E as KHR_DF_PRIMARIES_BT709,W as KHR_DF_PRIMARIES_CIEXYZ,X as KHR_DF_PRIMARIES_DISPLAYP3,j as KHR_DF_PRIMARIES_NTSC1953,K as KHR_DF_PRIMARIES_PAL525,S as KHR_DF_PRIMARIES_UNSPECIFIED,et as KHR_DF_SAMPLE_DATATYPE_EXPONENT,$ as KHR_DF_SAMPLE_DATATYPE_FLOAT,nt as KHR_DF_SAMPLE_DATATYPE_LINEAR,tt as KHR_DF_SAMPLE_DATATYPE_SIGNED,F as KHR_DF_TRANSFER_ACESCC,O as KHR_DF_TRANSFER_ACESCCT,T as KHR_DF_TRANSFER_ADOBERGB,w as KHR_DF_TRANSFER_BT1886,k as KHR_DF_TRANSFER_DCIP3,B as KHR_DF_TRANSFER_HLG_EOTF,v as KHR_DF_TRANSFER_HLG_OETF,b as KHR_DF_TRANSFER_ITU,x as KHR_DF_TRANSFER_LINEAR,m as KHR_DF_TRANSFER_NTSC,V as KHR_DF_TRANSFER_PAL625_EOTF,I as KHR_DF_TRANSFER_PAL_OETF,L as KHR_DF_TRANSFER_PQ_EOTF,A as KHR_DF_TRANSFER_PQ_OETF,d as KHR_DF_TRANSFER_SLOG,D as KHR_DF_TRANSFER_SLOG2,y as KHR_DF_TRANSFER_SRGB,C as KHR_DF_TRANSFER_ST240,g as KHR_DF_TRANSFER_UNSPECIFIED,a as KHR_DF_VENDORID_KHRONOS,r as KHR_DF_VERSION,e as KHR_SUPERCOMPRESSION_BASISLZ,t as KHR_SUPERCOMPRESSION_NONE,i as KHR_SUPERCOMPRESSION_ZLIB,n as KHR_SUPERCOMPRESSION_ZSTD,Ut as VK_FORMAT_A1R5G5B5_UNORM_PACK16,qt as VK_FORMAT_A2B10G10R10_SINT_PACK32,Rt as VK_FORMAT_A2B10G10R10_SNORM_PACK32,Gt as VK_FORMAT_A2B10G10R10_UINT_PACK32,Yt as VK_FORMAT_A2B10G10R10_UNORM_PACK32,Xt as VK_FORMAT_A2R10G10B10_SINT_PACK32,jt as VK_FORMAT_A2R10G10B10_SNORM_PACK32,Kt as VK_FORMAT_A2R10G10B10_UINT_PACK32,zt as VK_FORMAT_A2R10G10B10_UNORM_PACK32,Ii as VK_FORMAT_A4B4G4R4_UNORM_PACK16_EXT,ki as VK_FORMAT_A4R4G4B4_UNORM_PACK16_EXT,Bi as VK_FORMAT_ASTC_10x10_SFLOAT_BLOCK_EXT,Xn as VK_FORMAT_ASTC_10x10_SRGB_BLOCK,Kn as VK_FORMAT_ASTC_10x10_UNORM_BLOCK,Di as VK_FORMAT_ASTC_10x5_SFLOAT_BLOCK_EXT,Nn as VK_FORMAT_ASTC_10x5_SRGB_BLOCK,Mn as VK_FORMAT_ASTC_10x5_UNORM_BLOCK,wi as VK_FORMAT_ASTC_10x6_SFLOAT_BLOCK_EXT,Hn as VK_FORMAT_ASTC_10x6_SRGB_BLOCK,Wn as VK_FORMAT_ASTC_10x6_UNORM_BLOCK,vi as VK_FORMAT_ASTC_10x8_SFLOAT_BLOCK_EXT,jn as VK_FORMAT_ASTC_10x8_SRGB_BLOCK,zn as VK_FORMAT_ASTC_10x8_UNORM_BLOCK,Li as VK_FORMAT_ASTC_12x10_SFLOAT_BLOCK_EXT,Rn as VK_FORMAT_ASTC_12x10_SRGB_BLOCK,Yn as VK_FORMAT_ASTC_12x10_UNORM_BLOCK,Ai as VK_FORMAT_ASTC_12x12_SFLOAT_BLOCK_EXT,qn as VK_FORMAT_ASTC_12x12_SRGB_BLOCK,Gn as VK_FORMAT_ASTC_12x12_UNORM_BLOCK,_i as VK_FORMAT_ASTC_4x4_SFLOAT_BLOCK_EXT,wn as VK_FORMAT_ASTC_4x4_SRGB_BLOCK,Dn as VK_FORMAT_ASTC_4x4_UNORM_BLOCK,ui as VK_FORMAT_ASTC_5x4_SFLOAT_BLOCK_EXT,Bn as VK_FORMAT_ASTC_5x4_SRGB_BLOCK,vn as VK_FORMAT_ASTC_5x4_UNORM_BLOCK,gi as VK_FORMAT_ASTC_5x5_SFLOAT_BLOCK_EXT,An as VK_FORMAT_ASTC_5x5_SRGB_BLOCK,Ln as VK_FORMAT_ASTC_5x5_UNORM_BLOCK,xi as VK_FORMAT_ASTC_6x5_SFLOAT_BLOCK_EXT,In as VK_FORMAT_ASTC_6x5_SRGB_BLOCK,kn as VK_FORMAT_ASTC_6x5_UNORM_BLOCK,yi as VK_FORMAT_ASTC_6x6_SFLOAT_BLOCK_EXT,Cn as VK_FORMAT_ASTC_6x6_SRGB_BLOCK,Vn as VK_FORMAT_ASTC_6x6_UNORM_BLOCK,bi as VK_FORMAT_ASTC_8x5_SFLOAT_BLOCK_EXT,On as VK_FORMAT_ASTC_8x5_SRGB_BLOCK,Fn as VK_FORMAT_ASTC_8x5_UNORM_BLOCK,mi as VK_FORMAT_ASTC_8x6_SFLOAT_BLOCK_EXT,Sn as VK_FORMAT_ASTC_8x6_SRGB_BLOCK,Tn as VK_FORMAT_ASTC_8x6_UNORM_BLOCK,di as VK_FORMAT_ASTC_8x8_SFLOAT_BLOCK_EXT,Pn as VK_FORMAT_ASTC_8x8_SRGB_BLOCK,En as VK_FORMAT_ASTC_8x8_UNORM_BLOCK,We as VK_FORMAT_B10G11R11_UFLOAT_PACK32,ti as VK_FORMAT_B10X6G10X6R10X6G10X6_422_UNORM_4PACK16,ai as VK_FORMAT_B12X4G12X4R12X4G12X4_422_UNORM_4PACK16,rt as VK_FORMAT_B4G4R4A4_UNORM_PACK16,ct as VK_FORMAT_B5G5R5A1_UNORM_PACK16,lt as VK_FORMAT_B5G6R5_UNORM_PACK16,Wt as VK_FORMAT_B8G8R8A8_SINT,Mt as VK_FORMAT_B8G8R8A8_SNORM,Ht as VK_FORMAT_B8G8R8A8_SRGB,Nt as VK_FORMAT_B8G8R8A8_UINT,Pt as VK_FORMAT_B8G8R8A8_UNORM,Vt as VK_FORMAT_B8G8R8_SINT,kt as VK_FORMAT_B8G8R8_SNORM,Ct as VK_FORMAT_B8G8R8_SRGB,It as VK_FORMAT_B8G8R8_UINT,At as VK_FORMAT_B8G8R8_UNORM,Ze as VK_FORMAT_BC1_RGBA_SRGB_BLOCK,Qe as VK_FORMAT_BC1_RGBA_UNORM_BLOCK,Je as VK_FORMAT_BC1_RGB_SRGB_BLOCK,qe as VK_FORMAT_BC1_RGB_UNORM_BLOCK,tn as VK_FORMAT_BC2_SRGB_BLOCK,$e as VK_FORMAT_BC2_UNORM_BLOCK,nn as VK_FORMAT_BC3_SRGB_BLOCK,en as VK_FORMAT_BC3_UNORM_BLOCK,an as VK_FORMAT_BC4_SNORM_BLOCK,sn as VK_FORMAT_BC4_UNORM_BLOCK,on as VK_FORMAT_BC5_SNORM_BLOCK,rn as VK_FORMAT_BC5_UNORM_BLOCK,fn as VK_FORMAT_BC6H_SFLOAT_BLOCK,ln as VK_FORMAT_BC6H_UFLOAT_BLOCK,Un as VK_FORMAT_BC7_SRGB_BLOCK,cn as VK_FORMAT_BC7_UNORM_BLOCK,ze as VK_FORMAT_D16_UNORM,Ye as VK_FORMAT_D16_UNORM_S8_UINT,Re as VK_FORMAT_D24_UNORM_S8_UINT,Ke as VK_FORMAT_D32_SFLOAT,Ge as VK_FORMAT_D32_SFLOAT_S8_UINT,He as VK_FORMAT_E5B9G9R9_UFLOAT_PACK32,dn as VK_FORMAT_EAC_R11G11_SNORM_BLOCK,mn as VK_FORMAT_EAC_R11G11_UNORM_BLOCK,bn as VK_FORMAT_EAC_R11_SNORM_BLOCK,yn as VK_FORMAT_EAC_R11_UNORM_BLOCK,un as VK_FORMAT_ETC2_R8G8B8A1_SRGB_BLOCK,_n as VK_FORMAT_ETC2_R8G8B8A1_UNORM_BLOCK,xn as VK_FORMAT_ETC2_R8G8B8A8_SRGB_BLOCK,gn as VK_FORMAT_ETC2_R8G8B8A8_UNORM_BLOCK,pn as VK_FORMAT_ETC2_R8G8B8_SRGB_BLOCK,hn as VK_FORMAT_ETC2_R8G8B8_UNORM_BLOCK,$n as VK_FORMAT_G10X6B10X6G10X6R10X6_422_UNORM_4PACK16,si as VK_FORMAT_G12X4B12X4G12X4R12X4_422_UNORM_4PACK16,ci as VK_FORMAT_PVRTC1_2BPP_SRGB_BLOCK_IMG,ri as VK_FORMAT_PVRTC1_2BPP_UNORM_BLOCK_IMG,Ui as VK_FORMAT_PVRTC1_4BPP_SRGB_BLOCK_IMG,oi as VK_FORMAT_PVRTC1_4BPP_UNORM_BLOCK_IMG,hi as VK_FORMAT_PVRTC2_2BPP_SRGB_BLOCK_IMG,li as VK_FORMAT_PVRTC2_2BPP_UNORM_BLOCK_IMG,pi as VK_FORMAT_PVRTC2_4BPP_SRGB_BLOCK_IMG,fi as VK_FORMAT_PVRTC2_4BPP_UNORM_BLOCK_IMG,Zn as VK_FORMAT_R10X6G10X6B10X6A10X6_UNORM_4PACK16,Qn as VK_FORMAT_R10X6G10X6_UNORM_2PACK16,Jn as VK_FORMAT_R10X6_UNORM_PACK16,ii as VK_FORMAT_R12X4G12X4B12X4A12X4_UNORM_4PACK16,ni as VK_FORMAT_R12X4G12X4_UNORM_2PACK16,ei as VK_FORMAT_R12X4_UNORM_PACK16,ue as VK_FORMAT_R16G16B16A16_SFLOAT,_e as VK_FORMAT_R16G16B16A16_SINT,he as VK_FORMAT_R16G16B16A16_SNORM,pe as VK_FORMAT_R16G16B16A16_UINT,Ue as VK_FORMAT_R16G16B16A16_UNORM,ce as VK_FORMAT_R16G16B16_SFLOAT,fe as VK_FORMAT_R16G16B16_SINT,oe as VK_FORMAT_R16G16B16_SNORM,le as VK_FORMAT_R16G16B16_UINT,re as VK_FORMAT_R16G16B16_UNORM,ae as VK_FORMAT_R16G16_SFLOAT,se as VK_FORMAT_R16G16_SINT,ne as VK_FORMAT_R16G16_SNORM,ie as VK_FORMAT_R16G16_UINT,ee as VK_FORMAT_R16G16_UNORM,te as VK_FORMAT_R16_SFLOAT,$t as VK_FORMAT_R16_SINT,Qt as VK_FORMAT_R16_SNORM,Zt as VK_FORMAT_R16_UINT,Jt as VK_FORMAT_R16_UNORM,Ae as VK_FORMAT_R32G32B32A32_SFLOAT,Le as VK_FORMAT_R32G32B32A32_SINT,Be as VK_FORMAT_R32G32B32A32_UINT,ve as VK_FORMAT_R32G32B32_SFLOAT,we as VK_FORMAT_R32G32B32_SINT,De as VK_FORMAT_R32G32B32_UINT,de as VK_FORMAT_R32G32_SFLOAT,me as VK_FORMAT_R32G32_SINT,be as VK_FORMAT_R32G32_UINT,ye as VK_FORMAT_R32_SFLOAT,xe as VK_FORMAT_R32_SINT,ge as VK_FORMAT_R32_UINT,at as VK_FORMAT_R4G4B4A4_UNORM_PACK16,st as VK_FORMAT_R4G4_UNORM_PACK8,ft as VK_FORMAT_R5G5B5A1_UNORM_PACK16,ot as VK_FORMAT_R5G6B5_UNORM_PACK16,Ne as VK_FORMAT_R64G64B64A64_SFLOAT,Me as VK_FORMAT_R64G64B64A64_SINT,Pe as VK_FORMAT_R64G64B64A64_UINT,Ee as VK_FORMAT_R64G64B64_SFLOAT,Se as VK_FORMAT_R64G64B64_SINT,Te as VK_FORMAT_R64G64B64_UINT,Oe as VK_FORMAT_R64G64_SFLOAT,Fe as VK_FORMAT_R64G64_SINT,Ce as VK_FORMAT_R64G64_UINT,Ve as VK_FORMAT_R64_SFLOAT,Ie as VK_FORMAT_R64_SINT,ke as VK_FORMAT_R64_UINT,St as VK_FORMAT_R8G8B8A8_SINT,Ot as VK_FORMAT_R8G8B8A8_SNORM,Et as VK_FORMAT_R8G8B8A8_SRGB,Tt as VK_FORMAT_R8G8B8A8_UINT,Ft as VK_FORMAT_R8G8B8A8_UNORM,Bt as VK_FORMAT_R8G8B8_SINT,wt as VK_FORMAT_R8G8B8_SNORM,Lt as VK_FORMAT_R8G8B8_SRGB,vt as VK_FORMAT_R8G8B8_UINT,Dt as VK_FORMAT_R8G8B8_UNORM,mt as VK_FORMAT_R8G8_SINT,yt as VK_FORMAT_R8G8_SNORM,dt as VK_FORMAT_R8G8_SRGB,bt as VK_FORMAT_R8G8_UINT,xt as VK_FORMAT_R8G8_UNORM,ut as VK_FORMAT_R8_SINT,pt as VK_FORMAT_R8_SNORM,gt as VK_FORMAT_R8_SRGB,_t as VK_FORMAT_R8_UINT,ht as VK_FORMAT_R8_UNORM,Xe as VK_FORMAT_S8_UINT,it as VK_FORMAT_UNDEFINED,je as VK_FORMAT_X8_D24_UNORM_PACK32,Vi as createDefaultContainer,Mi as read,Hi as write};\n","let A,I,B;const g={env:{emscripten_notify_memory_growth:function(A){B=new Uint8Array(I.exports.memory.buffer)}}};class Q{init(){return A||(A=\"undefined\"!=typeof fetch?fetch(\"data:application/wasm;base64,\"+C).then(A=>A.arrayBuffer()).then(A=>WebAssembly.instantiate(A,g)).then(this._init):WebAssembly.instantiate(Buffer.from(C,\"base64\"),g).then(this._init),A)}_init(A){I=A.instance,g.env.emscripten_notify_memory_growth(0)}decode(A,g=0){if(!I)throw new Error(\"ZSTDDecoder: Await .init() before decoding.\");const Q=A.byteLength,C=I.exports.malloc(Q);B.set(A,C),g=g||Number(I.exports.ZSTD_findDecompressedSize(C,Q));const E=I.exports.malloc(g),i=I.exports.ZSTD_decompress(E,g,C,Q),D=B.slice(E,E+i);return I.exports.free(C),I.exports.free(E),D}}const C=\"AGFzbQEAAAABpQEVYAF/AX9gAn9/AGADf39/AX9gBX9/f39/AX9gAX8AYAJ/fwF/YAR/f39/AX9gA39/fwBgBn9/f39/fwF/YAd/f39/f39/AX9gAn9/AX5gAn5+AX5gAABgBX9/f39/AGAGf39/f39/AGAIf39/f39/f38AYAl/f39/f39/f38AYAABf2AIf39/f39/f38Bf2ANf39/f39/f39/f39/fwF/YAF/AX4CJwEDZW52H2Vtc2NyaXB0ZW5fbm90aWZ5X21lbW9yeV9ncm93dGgABANpaAEFAAAFAgEFCwACAQABAgIFBQcAAwABDgsBAQcAEhMHAAUBDAQEAAANBwQCAgYCBAgDAwMDBgEACQkHBgICAAYGAgQUBwYGAwIGAAMCAQgBBwUGCgoEEQAEBAEIAwgDBQgDEA8IAAcABAUBcAECAgUEAQCAAgYJAX8BQaCgwAILB2AHBm1lbW9yeQIABm1hbGxvYwAoBGZyZWUAJgxaU1REX2lzRXJyb3IAaBlaU1REX2ZpbmREZWNvbXByZXNzZWRTaXplAFQPWlNURF9kZWNvbXByZXNzAEoGX3N0YXJ0ACQJBwEAQQELASQKussBaA8AIAAgACgCBCABajYCBAsZACAAKAIAIAAoAgRBH3F0QQAgAWtBH3F2CwgAIABBiH9LC34BBH9BAyEBIAAoAgQiA0EgTQRAIAAoAggiASAAKAIQTwRAIAAQDQ8LIAAoAgwiAiABRgRAQQFBAiADQSBJGw8LIAAgASABIAJrIANBA3YiBCABIARrIAJJIgEbIgJrIgQ2AgggACADIAJBA3RrNgIEIAAgBCgAADYCAAsgAQsUAQF/IAAgARACIQIgACABEAEgAgv3AQECfyACRQRAIABCADcCACAAQQA2AhAgAEIANwIIQbh/DwsgACABNgIMIAAgAUEEajYCECACQQRPBEAgACABIAJqIgFBfGoiAzYCCCAAIAMoAAA2AgAgAUF/ai0AACIBBEAgAEEIIAEQFGs2AgQgAg8LIABBADYCBEF/DwsgACABNgIIIAAgAS0AACIDNgIAIAJBfmoiBEEBTQRAIARBAWtFBEAgACABLQACQRB0IANyIgM2AgALIAAgAS0AAUEIdCADajYCAAsgASACakF/ai0AACIBRQRAIABBADYCBEFsDwsgAEEoIAEQFCACQQN0ams2AgQgAgsWACAAIAEpAAA3AAAgACABKQAINwAICy8BAX8gAUECdEGgHWooAgAgACgCAEEgIAEgACgCBGprQR9xdnEhAiAAIAEQASACCyEAIAFCz9bTvtLHq9lCfiAAfEIfiUKHla+vmLbem55/fgsdAQF/IAAoAgggACgCDEYEfyAAKAIEQSBGBUEACwuCBAEDfyACQYDAAE8EQCAAIAEgAhBnIAAPCyAAIAJqIQMCQCAAIAFzQQNxRQRAAkAgAkEBSARAIAAhAgwBCyAAQQNxRQRAIAAhAgwBCyAAIQIDQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAiADTw0BIAJBA3ENAAsLAkAgA0F8cSIEQcAASQ0AIAIgBEFAaiIFSw0AA0AgAiABKAIANgIAIAIgASgCBDYCBCACIAEoAgg2AgggAiABKAIMNgIMIAIgASgCEDYCECACIAEoAhQ2AhQgAiABKAIYNgIYIAIgASgCHDYCHCACIAEoAiA2AiAgAiABKAIkNgIkIAIgASgCKDYCKCACIAEoAiw2AiwgAiABKAIwNgIwIAIgASgCNDYCNCACIAEoAjg2AjggAiABKAI8NgI8IAFBQGshASACQUBrIgIgBU0NAAsLIAIgBE8NAQNAIAIgASgCADYCACABQQRqIQEgAkEEaiICIARJDQALDAELIANBBEkEQCAAIQIMAQsgA0F8aiIEIABJBEAgACECDAELIAAhAgNAIAIgAS0AADoAACACIAEtAAE6AAEgAiABLQACOgACIAIgAS0AAzoAAyABQQRqIQEgAkEEaiICIARNDQALCyACIANJBEADQCACIAEtAAA6AAAgAUEBaiEBIAJBAWoiAiADRw0ACwsgAAsMACAAIAEpAAA3AAALQQECfyAAKAIIIgEgACgCEEkEQEEDDwsgACAAKAIEIgJBB3E2AgQgACABIAJBA3ZrIgE2AgggACABKAAANgIAQQALDAAgACABKAIANgAAC/cCAQJ/AkAgACABRg0AAkAgASACaiAASwRAIAAgAmoiBCABSw0BCyAAIAEgAhALDwsgACABc0EDcSEDAkACQCAAIAFJBEAgAwRAIAAhAwwDCyAAQQNxRQRAIAAhAwwCCyAAIQMDQCACRQ0EIAMgAS0AADoAACABQQFqIQEgAkF/aiECIANBAWoiA0EDcQ0ACwwBCwJAIAMNACAEQQNxBEADQCACRQ0FIAAgAkF/aiICaiIDIAEgAmotAAA6AAAgA0EDcQ0ACwsgAkEDTQ0AA0AgACACQXxqIgJqIAEgAmooAgA2AgAgAkEDSw0ACwsgAkUNAgNAIAAgAkF/aiICaiABIAJqLQAAOgAAIAINAAsMAgsgAkEDTQ0AIAIhBANAIAMgASgCADYCACABQQRqIQEgA0EEaiEDIARBfGoiBEEDSw0ACyACQQNxIQILIAJFDQADQCADIAEtAAA6AAAgA0EBaiEDIAFBAWohASACQX9qIgINAAsLIAAL8wICAn8BfgJAIAJFDQAgACACaiIDQX9qIAE6AAAgACABOgAAIAJBA0kNACADQX5qIAE6AAAgACABOgABIANBfWogAToAACAAIAE6AAIgAkEHSQ0AIANBfGogAToAACAAIAE6AAMgAkEJSQ0AIABBACAAa0EDcSIEaiIDIAFB/wFxQYGChAhsIgE2AgAgAyACIARrQXxxIgRqIgJBfGogATYCACAEQQlJDQAgAyABNgIIIAMgATYCBCACQXhqIAE2AgAgAkF0aiABNgIAIARBGUkNACADIAE2AhggAyABNgIUIAMgATYCECADIAE2AgwgAkFwaiABNgIAIAJBbGogATYCACACQWhqIAE2AgAgAkFkaiABNgIAIAQgA0EEcUEYciIEayICQSBJDQAgAa0iBUIghiAFhCEFIAMgBGohAQNAIAEgBTcDGCABIAU3AxAgASAFNwMIIAEgBTcDACABQSBqIQEgAkFgaiICQR9LDQALCyAACy8BAn8gACgCBCAAKAIAQQJ0aiICLQACIQMgACACLwEAIAEgAi0AAxAIajYCACADCy8BAn8gACgCBCAAKAIAQQJ0aiICLQACIQMgACACLwEAIAEgAi0AAxAFajYCACADCx8AIAAgASACKAIEEAg2AgAgARAEGiAAIAJBCGo2AgQLCAAgAGdBH3MLugUBDX8jAEEQayIKJAACfyAEQQNNBEAgCkEANgIMIApBDGogAyAEEAsaIAAgASACIApBDGpBBBAVIgBBbCAAEAMbIAAgACAESxsMAQsgAEEAIAEoAgBBAXRBAmoQECENQVQgAygAACIGQQ9xIgBBCksNABogAiAAQQVqNgIAIAMgBGoiAkF8aiEMIAJBeWohDiACQXtqIRAgAEEGaiELQQQhBSAGQQR2IQRBICAAdCIAQQFyIQkgASgCACEPQQAhAiADIQYCQANAIAlBAkggAiAPS3JFBEAgAiEHAkAgCARAA0AgBEH//wNxQf//A0YEQCAHQRhqIQcgBiAQSQR/IAZBAmoiBigAACAFdgUgBUEQaiEFIARBEHYLIQQMAQsLA0AgBEEDcSIIQQNGBEAgBUECaiEFIARBAnYhBCAHQQNqIQcMAQsLIAcgCGoiByAPSw0EIAVBAmohBQNAIAIgB0kEQCANIAJBAXRqQQA7AQAgAkEBaiECDAELCyAGIA5LQQAgBiAFQQN1aiIHIAxLG0UEQCAHKAAAIAVBB3EiBXYhBAwCCyAEQQJ2IQQLIAYhBwsCfyALQX9qIAQgAEF/anEiBiAAQQF0QX9qIgggCWsiEUkNABogBCAIcSIEQQAgESAEIABIG2shBiALCyEIIA0gAkEBdGogBkF/aiIEOwEAIAlBASAGayAEIAZBAUgbayEJA0AgCSAASARAIABBAXUhACALQX9qIQsMAQsLAn8gByAOS0EAIAcgBSAIaiIFQQN1aiIGIAxLG0UEQCAFQQdxDAELIAUgDCIGIAdrQQN0awshBSACQQFqIQIgBEUhCCAGKAAAIAVBH3F2IQQMAQsLQWwgCUEBRyAFQSBKcg0BGiABIAJBf2o2AgAgBiAFQQdqQQN1aiADawwBC0FQCyEAIApBEGokACAACwkAQQFBBSAAGwsMACAAIAEoAAA2AAALqgMBCn8jAEHwAGsiCiQAIAJBAWohDiAAQQhqIQtBgIAEIAVBf2p0QRB1IQxBACECQQEhBkEBIAV0IglBf2oiDyEIA0AgAiAORkUEQAJAIAEgAkEBdCINai8BACIHQf//A0YEQCALIAhBA3RqIAI2AgQgCEF/aiEIQQEhBwwBCyAGQQAgDCAHQRB0QRB1ShshBgsgCiANaiAHOwEAIAJBAWohAgwBCwsgACAFNgIEIAAgBjYCACAJQQN2IAlBAXZqQQNqIQxBACEAQQAhBkEAIQIDQCAGIA5GBEADQAJAIAAgCUYNACAKIAsgAEEDdGoiASgCBCIGQQF0aiICIAIvAQAiAkEBajsBACABIAUgAhAUayIIOgADIAEgAiAIQf8BcXQgCWs7AQAgASAEIAZBAnQiAmooAgA6AAIgASACIANqKAIANgIEIABBAWohAAwBCwsFIAEgBkEBdGouAQAhDUEAIQcDQCAHIA1ORQRAIAsgAkEDdGogBjYCBANAIAIgDGogD3EiAiAISw0ACyAHQQFqIQcMAQsLIAZBAWohBgwBCwsgCkHwAGokAAsjAEIAIAEQCSAAhUKHla+vmLbem55/fkLj3MqV/M7y9YV/fAsQACAAQn43AwggACABNgIACyQBAX8gAARAIAEoAgQiAgRAIAEoAgggACACEQEADwsgABAmCwsfACAAIAEgAi8BABAINgIAIAEQBBogACACQQRqNgIEC0oBAX9BoCAoAgAiASAAaiIAQX9MBEBBiCBBMDYCAEF/DwsCQCAAPwBBEHRNDQAgABBmDQBBiCBBMDYCAEF/DwtBoCAgADYCACABC9cBAQh/Qbp/IQoCQCACKAIEIgggAigCACIJaiIOIAEgAGtLDQBBbCEKIAkgBCADKAIAIgtrSw0AIAAgCWoiBCACKAIIIgxrIQ0gACABQWBqIg8gCyAJQQAQKSADIAkgC2o2AgACQAJAIAwgBCAFa00EQCANIQUMAQsgDCAEIAZrSw0CIAcgDSAFayIAaiIBIAhqIAdNBEAgBCABIAgQDxoMAgsgBCABQQAgAGsQDyEBIAIgACAIaiIINgIEIAEgAGshBAsgBCAPIAUgCEEBECkLIA4hCgsgCgubAgEBfyMAQYABayINJAAgDSADNgJ8AkAgAkEDSwRAQX8hCQwBCwJAAkACQAJAIAJBAWsOAwADAgELIAZFBEBBuH8hCQwEC0FsIQkgBS0AACICIANLDQMgACAHIAJBAnQiAmooAgAgAiAIaigCABA7IAEgADYCAEEBIQkMAwsgASAJNgIAQQAhCQwCCyAKRQRAQWwhCQwCC0EAIQkgC0UgDEEZSHINAUEIIAR0QQhqIQBBACECA0AgAiAATw0CIAJBQGshAgwAAAsAC0FsIQkgDSANQfwAaiANQfgAaiAFIAYQFSICEAMNACANKAJ4IgMgBEsNACAAIA0gDSgCfCAHIAggAxAYIAEgADYCACACIQkLIA1BgAFqJAAgCQsLACAAIAEgAhALGgsQACAALwAAIAAtAAJBEHRyCy8AAn9BuH8gAUEISQ0AGkFyIAAoAAQiAEF3Sw0AGkG4fyAAQQhqIgAgACABSxsLCwkAIAAgATsAAAsDAAELigYBBX8gACAAKAIAIgVBfnE2AgBBACAAIAVBAXZqQYQgKAIAIgQgAEYbIQECQAJAIAAoAgQiAkUNACACKAIAIgNBAXENACACQQhqIgUgA0EBdkF4aiIDQQggA0EISxtnQR9zQQJ0QYAfaiIDKAIARgRAIAMgAigCDDYCAAsgAigCCCIDBEAgAyACKAIMNgIECyACKAIMIgMEQCADIAIoAgg2AgALIAIgAigCACAAKAIAQX5xajYCAEGEICEAAkACQCABRQ0AIAEgAjYCBCABKAIAIgNBAXENASADQQF2QXhqIgNBCCADQQhLG2dBH3NBAnRBgB9qIgMoAgAgAUEIakYEQCADIAEoAgw2AgALIAEoAggiAwRAIAMgASgCDDYCBAsgASgCDCIDBEAgAyABKAIINgIAQYQgKAIAIQQLIAIgAigCACABKAIAQX5xajYCACABIARGDQAgASABKAIAQQF2akEEaiEACyAAIAI2AgALIAIoAgBBAXZBeGoiAEEIIABBCEsbZ0Efc0ECdEGAH2oiASgCACEAIAEgBTYCACACIAA2AgwgAkEANgIIIABFDQEgACAFNgIADwsCQCABRQ0AIAEoAgAiAkEBcQ0AIAJBAXZBeGoiAkEIIAJBCEsbZ0Efc0ECdEGAH2oiAigCACABQQhqRgRAIAIgASgCDDYCAAsgASgCCCICBEAgAiABKAIMNgIECyABKAIMIgIEQCACIAEoAgg2AgBBhCAoAgAhBAsgACAAKAIAIAEoAgBBfnFqIgI2AgACQCABIARHBEAgASABKAIAQQF2aiAANgIEIAAoAgAhAgwBC0GEICAANgIACyACQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgIoAgAhASACIABBCGoiAjYCACAAIAE2AgwgAEEANgIIIAFFDQEgASACNgIADwsgBUEBdkF4aiIBQQggAUEISxtnQR9zQQJ0QYAfaiICKAIAIQEgAiAAQQhqIgI2AgAgACABNgIMIABBADYCCCABRQ0AIAEgAjYCAAsLDgAgAARAIABBeGoQJQsLgAIBA38CQCAAQQ9qQXhxQYQgKAIAKAIAQQF2ayICEB1Bf0YNAAJAQYQgKAIAIgAoAgAiAUEBcQ0AIAFBAXZBeGoiAUEIIAFBCEsbZ0Efc0ECdEGAH2oiASgCACAAQQhqRgRAIAEgACgCDDYCAAsgACgCCCIBBEAgASAAKAIMNgIECyAAKAIMIgFFDQAgASAAKAIINgIAC0EBIQEgACAAKAIAIAJBAXRqIgI2AgAgAkEBcQ0AIAJBAXZBeGoiAkEIIAJBCEsbZ0Efc0ECdEGAH2oiAygCACECIAMgAEEIaiIDNgIAIAAgAjYCDCAAQQA2AgggAkUNACACIAM2AgALIAELtwIBA38CQAJAIABBASAAGyICEDgiAA0AAkACQEGEICgCACIARQ0AIAAoAgAiA0EBcQ0AIAAgA0EBcjYCACADQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgEoAgAgAEEIakYEQCABIAAoAgw2AgALIAAoAggiAQRAIAEgACgCDDYCBAsgACgCDCIBBEAgASAAKAIINgIACyACECchAkEAIQFBhCAoAgAhACACDQEgACAAKAIAQX5xNgIAQQAPCyACQQ9qQXhxIgMQHSICQX9GDQIgAkEHakF4cSIAIAJHBEAgACACaxAdQX9GDQMLAkBBhCAoAgAiAUUEQEGAICAANgIADAELIAAgATYCBAtBhCAgADYCACAAIANBAXRBAXI2AgAMAQsgAEUNAQsgAEEIaiEBCyABC7kDAQJ/IAAgA2ohBQJAIANBB0wEQANAIAAgBU8NAiAAIAItAAA6AAAgAEEBaiEAIAJBAWohAgwAAAsACyAEQQFGBEACQCAAIAJrIgZBB00EQCAAIAItAAA6AAAgACACLQABOgABIAAgAi0AAjoAAiAAIAItAAM6AAMgAEEEaiACIAZBAnQiBkHAHmooAgBqIgIQFyACIAZB4B5qKAIAayECDAELIAAgAhAMCyACQQhqIQIgAEEIaiEACwJAAkACQAJAIAUgAU0EQCAAIANqIQEgBEEBRyAAIAJrQQ9Kcg0BA0AgACACEAwgAkEIaiECIABBCGoiACABSQ0ACwwFCyAAIAFLBEAgACEBDAQLIARBAUcgACACa0EPSnINASAAIQMgAiEEA0AgAyAEEAwgBEEIaiEEIANBCGoiAyABSQ0ACwwCCwNAIAAgAhAHIAJBEGohAiAAQRBqIgAgAUkNAAsMAwsgACEDIAIhBANAIAMgBBAHIARBEGohBCADQRBqIgMgAUkNAAsLIAIgASAAa2ohAgsDQCABIAVPDQEgASACLQAAOgAAIAFBAWohASACQQFqIQIMAAALAAsLQQECfyAAIAAoArjgASIDNgLE4AEgACgCvOABIQQgACABNgK84AEgACABIAJqNgK44AEgACABIAQgA2tqNgLA4AELpgEBAX8gACAAKALs4QEQFjYCyOABIABCADcD+OABIABCADcDuOABIABBwOABakIANwMAIABBqNAAaiIBQYyAgOAANgIAIABBADYCmOIBIABCADcDiOEBIABCAzcDgOEBIABBrNABakHgEikCADcCACAAQbTQAWpB6BIoAgA2AgAgACABNgIMIAAgAEGYIGo2AgggACAAQaAwajYCBCAAIABBEGo2AgALYQEBf0G4fyEDAkAgAUEDSQ0AIAIgABAhIgFBA3YiADYCCCACIAFBAXE2AgQgAiABQQF2QQNxIgM2AgACQCADQX9qIgFBAksNAAJAIAFBAWsOAgEAAgtBbA8LIAAhAwsgAwsMACAAIAEgAkEAEC4LiAQCA38CfiADEBYhBCAAQQBBKBAQIQAgBCACSwRAIAQPCyABRQRAQX8PCwJAAkAgA0EBRg0AIAEoAAAiBkGo6r5pRg0AQXYhAyAGQXBxQdDUtMIBRw0BQQghAyACQQhJDQEgAEEAQSgQECEAIAEoAAQhASAAQQE2AhQgACABrTcDAEEADwsgASACIAMQLyIDIAJLDQAgACADNgIYQXIhAyABIARqIgVBf2otAAAiAkEIcQ0AIAJBIHEiBkUEQEFwIQMgBS0AACIFQacBSw0BIAVBB3GtQgEgBUEDdkEKaq2GIgdCA4h+IAd8IQggBEEBaiEECyACQQZ2IQMgAkECdiEFAkAgAkEDcUF/aiICQQJLBEBBACECDAELAkACQAJAIAJBAWsOAgECAAsgASAEai0AACECIARBAWohBAwCCyABIARqLwAAIQIgBEECaiEEDAELIAEgBGooAAAhAiAEQQRqIQQLIAVBAXEhBQJ+AkACQAJAIANBf2oiA0ECTQRAIANBAWsOAgIDAQtCfyAGRQ0DGiABIARqMQAADAMLIAEgBGovAACtQoACfAwCCyABIARqKAAArQwBCyABIARqKQAACyEHIAAgBTYCICAAIAI2AhwgACAHNwMAQQAhAyAAQQA2AhQgACAHIAggBhsiBzcDCCAAIAdCgIAIIAdCgIAIVBs+AhALIAMLWwEBf0G4fyEDIAIQFiICIAFNBH8gACACakF/ai0AACIAQQNxQQJ0QaAeaigCACACaiAAQQZ2IgFBAnRBsB5qKAIAaiAAQSBxIgBFaiABRSAAQQV2cWoFQbh/CwsdACAAKAKQ4gEQWiAAQQA2AqDiASAAQgA3A5DiAQu1AwEFfyMAQZACayIKJABBuH8hBgJAIAVFDQAgBCwAACIIQf8BcSEHAkAgCEF/TARAIAdBgn9qQQF2IgggBU8NAkFsIQYgB0GBf2oiBUGAAk8NAiAEQQFqIQdBACEGA0AgBiAFTwRAIAUhBiAIIQcMAwUgACAGaiAHIAZBAXZqIgQtAABBBHY6AAAgACAGQQFyaiAELQAAQQ9xOgAAIAZBAmohBgwBCwAACwALIAcgBU8NASAAIARBAWogByAKEFMiBhADDQELIAYhBEEAIQYgAUEAQTQQECEJQQAhBQNAIAQgBkcEQCAAIAZqIggtAAAiAUELSwRAQWwhBgwDBSAJIAFBAnRqIgEgASgCAEEBajYCACAGQQFqIQZBASAILQAAdEEBdSAFaiEFDAILAAsLQWwhBiAFRQ0AIAUQFEEBaiIBQQxLDQAgAyABNgIAQQFBASABdCAFayIDEBQiAXQgA0cNACAAIARqIAFBAWoiADoAACAJIABBAnRqIgAgACgCAEEBajYCACAJKAIEIgBBAkkgAEEBcXINACACIARBAWo2AgAgB0EBaiEGCyAKQZACaiQAIAYLxhEBDH8jAEHwAGsiBSQAQWwhCwJAIANBCkkNACACLwAAIQogAi8AAiEJIAIvAAQhByAFQQhqIAQQDgJAIAMgByAJIApqakEGaiIMSQ0AIAUtAAohCCAFQdgAaiACQQZqIgIgChAGIgsQAw0BIAVBQGsgAiAKaiICIAkQBiILEAMNASAFQShqIAIgCWoiAiAHEAYiCxADDQEgBUEQaiACIAdqIAMgDGsQBiILEAMNASAAIAFqIg9BfWohECAEQQRqIQZBASELIAAgAUEDakECdiIDaiIMIANqIgIgA2oiDiEDIAIhBCAMIQcDQCALIAMgEElxBEAgACAGIAVB2ABqIAgQAkECdGoiCS8BADsAACAFQdgAaiAJLQACEAEgCS0AAyELIAcgBiAFQUBrIAgQAkECdGoiCS8BADsAACAFQUBrIAktAAIQASAJLQADIQogBCAGIAVBKGogCBACQQJ0aiIJLwEAOwAAIAVBKGogCS0AAhABIAktAAMhCSADIAYgBUEQaiAIEAJBAnRqIg0vAQA7AAAgBUEQaiANLQACEAEgDS0AAyENIAAgC2oiCyAGIAVB2ABqIAgQAkECdGoiAC8BADsAACAFQdgAaiAALQACEAEgAC0AAyEAIAcgCmoiCiAGIAVBQGsgCBACQQJ0aiIHLwEAOwAAIAVBQGsgBy0AAhABIActAAMhByAEIAlqIgkgBiAFQShqIAgQAkECdGoiBC8BADsAACAFQShqIAQtAAIQASAELQADIQQgAyANaiIDIAYgBUEQaiAIEAJBAnRqIg0vAQA7AAAgBUEQaiANLQACEAEgACALaiEAIAcgCmohByAEIAlqIQQgAyANLQADaiEDIAVB2ABqEA0gBUFAaxANciAFQShqEA1yIAVBEGoQDXJFIQsMAQsLIAQgDksgByACS3INAEFsIQsgACAMSw0BIAxBfWohCQNAQQAgACAJSSAFQdgAahAEGwRAIAAgBiAFQdgAaiAIEAJBAnRqIgovAQA7AAAgBUHYAGogCi0AAhABIAAgCi0AA2oiACAGIAVB2ABqIAgQAkECdGoiCi8BADsAACAFQdgAaiAKLQACEAEgACAKLQADaiEADAEFIAxBfmohCgNAIAVB2ABqEAQgACAKS3JFBEAgACAGIAVB2ABqIAgQAkECdGoiCS8BADsAACAFQdgAaiAJLQACEAEgACAJLQADaiEADAELCwNAIAAgCk0EQCAAIAYgBUHYAGogCBACQQJ0aiIJLwEAOwAAIAVB2ABqIAktAAIQASAAIAktAANqIQAMAQsLAkAgACAMTw0AIAAgBiAFQdgAaiAIEAIiAEECdGoiDC0AADoAACAMLQADQQFGBEAgBUHYAGogDC0AAhABDAELIAUoAlxBH0sNACAFQdgAaiAGIABBAnRqLQACEAEgBSgCXEEhSQ0AIAVBIDYCXAsgAkF9aiEMA0BBACAHIAxJIAVBQGsQBBsEQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiIAIAYgBUFAayAIEAJBAnRqIgcvAQA7AAAgBUFAayAHLQACEAEgACAHLQADaiEHDAEFIAJBfmohDANAIAVBQGsQBCAHIAxLckUEQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiEHDAELCwNAIAcgDE0EQCAHIAYgBUFAayAIEAJBAnRqIgAvAQA7AAAgBUFAayAALQACEAEgByAALQADaiEHDAELCwJAIAcgAk8NACAHIAYgBUFAayAIEAIiAEECdGoiAi0AADoAACACLQADQQFGBEAgBUFAayACLQACEAEMAQsgBSgCREEfSw0AIAVBQGsgBiAAQQJ0ai0AAhABIAUoAkRBIUkNACAFQSA2AkQLIA5BfWohAgNAQQAgBCACSSAFQShqEAQbBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2oiACAGIAVBKGogCBACQQJ0aiIELwEAOwAAIAVBKGogBC0AAhABIAAgBC0AA2ohBAwBBSAOQX5qIQIDQCAFQShqEAQgBCACS3JFBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2ohBAwBCwsDQCAEIAJNBEAgBCAGIAVBKGogCBACQQJ0aiIALwEAOwAAIAVBKGogAC0AAhABIAQgAC0AA2ohBAwBCwsCQCAEIA5PDQAgBCAGIAVBKGogCBACIgBBAnRqIgItAAA6AAAgAi0AA0EBRgRAIAVBKGogAi0AAhABDAELIAUoAixBH0sNACAFQShqIAYgAEECdGotAAIQASAFKAIsQSFJDQAgBUEgNgIsCwNAQQAgAyAQSSAFQRBqEAQbBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2oiACAGIAVBEGogCBACQQJ0aiICLwEAOwAAIAVBEGogAi0AAhABIAAgAi0AA2ohAwwBBSAPQX5qIQIDQCAFQRBqEAQgAyACS3JFBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2ohAwwBCwsDQCADIAJNBEAgAyAGIAVBEGogCBACQQJ0aiIALwEAOwAAIAVBEGogAC0AAhABIAMgAC0AA2ohAwwBCwsCQCADIA9PDQAgAyAGIAVBEGogCBACIgBBAnRqIgItAAA6AAAgAi0AA0EBRgRAIAVBEGogAi0AAhABDAELIAUoAhRBH0sNACAFQRBqIAYgAEECdGotAAIQASAFKAIUQSFJDQAgBUEgNgIUCyABQWwgBUHYAGoQCiAFQUBrEApxIAVBKGoQCnEgBUEQahAKcRshCwwJCwAACwALAAALAAsAAAsACwAACwALQWwhCwsgBUHwAGokACALC7UEAQ5/IwBBEGsiBiQAIAZBBGogABAOQVQhBQJAIARB3AtJDQAgBi0ABCEHIANB8ARqQQBB7AAQECEIIAdBDEsNACADQdwJaiIJIAggBkEIaiAGQQxqIAEgAhAxIhAQA0UEQCAGKAIMIgQgB0sNASADQdwFaiEPIANBpAVqIREgAEEEaiESIANBqAVqIQEgBCEFA0AgBSICQX9qIQUgCCACQQJ0aigCAEUNAAsgAkEBaiEOQQEhBQNAIAUgDk9FBEAgCCAFQQJ0IgtqKAIAIQwgASALaiAKNgIAIAVBAWohBSAKIAxqIQoMAQsLIAEgCjYCAEEAIQUgBigCCCELA0AgBSALRkUEQCABIAUgCWotAAAiDEECdGoiDSANKAIAIg1BAWo2AgAgDyANQQF0aiINIAw6AAEgDSAFOgAAIAVBAWohBQwBCwtBACEBIANBADYCqAUgBEF/cyAHaiEJQQEhBQNAIAUgDk9FBEAgCCAFQQJ0IgtqKAIAIQwgAyALaiABNgIAIAwgBSAJanQgAWohASAFQQFqIQUMAQsLIAcgBEEBaiIBIAJrIgRrQQFqIQgDQEEBIQUgBCAIT0UEQANAIAUgDk9FBEAgBUECdCIJIAMgBEE0bGpqIAMgCWooAgAgBHY2AgAgBUEBaiEFDAELCyAEQQFqIQQMAQsLIBIgByAPIAogESADIAIgARBkIAZBAToABSAGIAc6AAYgACAGKAIENgIACyAQIQULIAZBEGokACAFC8ENAQt/IwBB8ABrIgUkAEFsIQkCQCADQQpJDQAgAi8AACEKIAIvAAIhDCACLwAEIQYgBUEIaiAEEA4CQCADIAYgCiAMampBBmoiDUkNACAFLQAKIQcgBUHYAGogAkEGaiICIAoQBiIJEAMNASAFQUBrIAIgCmoiAiAMEAYiCRADDQEgBUEoaiACIAxqIgIgBhAGIgkQAw0BIAVBEGogAiAGaiADIA1rEAYiCRADDQEgACABaiIOQX1qIQ8gBEEEaiEGQQEhCSAAIAFBA2pBAnYiAmoiCiACaiIMIAJqIg0hAyAMIQQgCiECA0AgCSADIA9JcQRAIAYgBUHYAGogBxACQQF0aiIILQAAIQsgBUHYAGogCC0AARABIAAgCzoAACAGIAVBQGsgBxACQQF0aiIILQAAIQsgBUFAayAILQABEAEgAiALOgAAIAYgBUEoaiAHEAJBAXRqIggtAAAhCyAFQShqIAgtAAEQASAEIAs6AAAgBiAFQRBqIAcQAkEBdGoiCC0AACELIAVBEGogCC0AARABIAMgCzoAACAGIAVB2ABqIAcQAkEBdGoiCC0AACELIAVB2ABqIAgtAAEQASAAIAs6AAEgBiAFQUBrIAcQAkEBdGoiCC0AACELIAVBQGsgCC0AARABIAIgCzoAASAGIAVBKGogBxACQQF0aiIILQAAIQsgBUEoaiAILQABEAEgBCALOgABIAYgBUEQaiAHEAJBAXRqIggtAAAhCyAFQRBqIAgtAAEQASADIAs6AAEgA0ECaiEDIARBAmohBCACQQJqIQIgAEECaiEAIAkgBUHYAGoQDUVxIAVBQGsQDUVxIAVBKGoQDUVxIAVBEGoQDUVxIQkMAQsLIAQgDUsgAiAMS3INAEFsIQkgACAKSw0BIApBfWohCQNAIAVB2ABqEAQgACAJT3JFBEAgBiAFQdgAaiAHEAJBAXRqIggtAAAhCyAFQdgAaiAILQABEAEgACALOgAAIAYgBUHYAGogBxACQQF0aiIILQAAIQsgBUHYAGogCC0AARABIAAgCzoAASAAQQJqIQAMAQsLA0AgBUHYAGoQBCAAIApPckUEQCAGIAVB2ABqIAcQAkEBdGoiCS0AACEIIAVB2ABqIAktAAEQASAAIAg6AAAgAEEBaiEADAELCwNAIAAgCkkEQCAGIAVB2ABqIAcQAkEBdGoiCS0AACEIIAVB2ABqIAktAAEQASAAIAg6AAAgAEEBaiEADAELCyAMQX1qIQADQCAFQUBrEAQgAiAAT3JFBEAgBiAFQUBrIAcQAkEBdGoiCi0AACEJIAVBQGsgCi0AARABIAIgCToAACAGIAVBQGsgBxACQQF0aiIKLQAAIQkgBUFAayAKLQABEAEgAiAJOgABIAJBAmohAgwBCwsDQCAFQUBrEAQgAiAMT3JFBEAgBiAFQUBrIAcQAkEBdGoiAC0AACEKIAVBQGsgAC0AARABIAIgCjoAACACQQFqIQIMAQsLA0AgAiAMSQRAIAYgBUFAayAHEAJBAXRqIgAtAAAhCiAFQUBrIAAtAAEQASACIAo6AAAgAkEBaiECDAELCyANQX1qIQADQCAFQShqEAQgBCAAT3JFBEAgBiAFQShqIAcQAkEBdGoiAi0AACEKIAVBKGogAi0AARABIAQgCjoAACAGIAVBKGogBxACQQF0aiICLQAAIQogBUEoaiACLQABEAEgBCAKOgABIARBAmohBAwBCwsDQCAFQShqEAQgBCANT3JFBEAgBiAFQShqIAcQAkEBdGoiAC0AACECIAVBKGogAC0AARABIAQgAjoAACAEQQFqIQQMAQsLA0AgBCANSQRAIAYgBUEoaiAHEAJBAXRqIgAtAAAhAiAFQShqIAAtAAEQASAEIAI6AAAgBEEBaiEEDAELCwNAIAVBEGoQBCADIA9PckUEQCAGIAVBEGogBxACQQF0aiIALQAAIQIgBUEQaiAALQABEAEgAyACOgAAIAYgBUEQaiAHEAJBAXRqIgAtAAAhAiAFQRBqIAAtAAEQASADIAI6AAEgA0ECaiEDDAELCwNAIAVBEGoQBCADIA5PckUEQCAGIAVBEGogBxACQQF0aiIALQAAIQIgBUEQaiAALQABEAEgAyACOgAAIANBAWohAwwBCwsDQCADIA5JBEAgBiAFQRBqIAcQAkEBdGoiAC0AACECIAVBEGogAC0AARABIAMgAjoAACADQQFqIQMMAQsLIAFBbCAFQdgAahAKIAVBQGsQCnEgBUEoahAKcSAFQRBqEApxGyEJDAELQWwhCQsgBUHwAGokACAJC8oCAQR/IwBBIGsiBSQAIAUgBBAOIAUtAAIhByAFQQhqIAIgAxAGIgIQA0UEQCAEQQRqIQIgACABaiIDQX1qIQQDQCAFQQhqEAQgACAET3JFBEAgAiAFQQhqIAcQAkEBdGoiBi0AACEIIAVBCGogBi0AARABIAAgCDoAACACIAVBCGogBxACQQF0aiIGLQAAIQggBUEIaiAGLQABEAEgACAIOgABIABBAmohAAwBCwsDQCAFQQhqEAQgACADT3JFBEAgAiAFQQhqIAcQAkEBdGoiBC0AACEGIAVBCGogBC0AARABIAAgBjoAACAAQQFqIQAMAQsLA0AgACADT0UEQCACIAVBCGogBxACQQF0aiIELQAAIQYgBUEIaiAELQABEAEgACAGOgAAIABBAWohAAwBCwsgAUFsIAVBCGoQChshAgsgBUEgaiQAIAILtgMBCX8jAEEQayIGJAAgBkEANgIMIAZBADYCCEFUIQQCQAJAIANBQGsiDCADIAZBCGogBkEMaiABIAIQMSICEAMNACAGQQRqIAAQDiAGKAIMIgcgBi0ABEEBaksNASAAQQRqIQogBkEAOgAFIAYgBzoABiAAIAYoAgQ2AgAgB0EBaiEJQQEhBANAIAQgCUkEQCADIARBAnRqIgEoAgAhACABIAU2AgAgACAEQX9qdCAFaiEFIARBAWohBAwBCwsgB0EBaiEHQQAhBSAGKAIIIQkDQCAFIAlGDQEgAyAFIAxqLQAAIgRBAnRqIgBBASAEdEEBdSILIAAoAgAiAWoiADYCACAHIARrIQhBACEEAkAgC0EDTQRAA0AgBCALRg0CIAogASAEakEBdGoiACAIOgABIAAgBToAACAEQQFqIQQMAAALAAsDQCABIABPDQEgCiABQQF0aiIEIAg6AAEgBCAFOgAAIAQgCDoAAyAEIAU6AAIgBCAIOgAFIAQgBToABCAEIAg6AAcgBCAFOgAGIAFBBGohAQwAAAsACyAFQQFqIQUMAAALAAsgAiEECyAGQRBqJAAgBAutAQECfwJAQYQgKAIAIABHIAAoAgBBAXYiAyABa0F4aiICQXhxQQhHcgR/IAIFIAMQJ0UNASACQQhqC0EQSQ0AIAAgACgCACICQQFxIAAgAWpBD2pBeHEiASAAa0EBdHI2AgAgASAANgIEIAEgASgCAEEBcSAAIAJBAXZqIAFrIgJBAXRyNgIAQYQgIAEgAkH/////B3FqQQRqQYQgKAIAIABGGyABNgIAIAEQJQsLygIBBX8CQAJAAkAgAEEIIABBCEsbZ0EfcyAAaUEBR2oiAUEESSAAIAF2cg0AIAFBAnRB/B5qKAIAIgJFDQADQCACQXhqIgMoAgBBAXZBeGoiBSAATwRAIAIgBUEIIAVBCEsbZ0Efc0ECdEGAH2oiASgCAEYEQCABIAIoAgQ2AgALDAMLIARBHksNASAEQQFqIQQgAigCBCICDQALC0EAIQMgAUEgTw0BA0AgAUECdEGAH2ooAgAiAkUEQCABQR5LIQIgAUEBaiEBIAJFDQEMAwsLIAIgAkF4aiIDKAIAQQF2QXhqIgFBCCABQQhLG2dBH3NBAnRBgB9qIgEoAgBGBEAgASACKAIENgIACwsgAigCACIBBEAgASACKAIENgIECyACKAIEIgEEQCABIAIoAgA2AgALIAMgAygCAEEBcjYCACADIAAQNwsgAwvhCwINfwV+IwBB8ABrIgckACAHIAAoAvDhASIINgJcIAEgAmohDSAIIAAoAoDiAWohDwJAAkAgBUUEQCABIQQMAQsgACgCxOABIRAgACgCwOABIREgACgCvOABIQ4gAEEBNgKM4QFBACEIA0AgCEEDRwRAIAcgCEECdCICaiAAIAJqQazQAWooAgA2AkQgCEEBaiEIDAELC0FsIQwgB0EYaiADIAQQBhADDQEgB0EsaiAHQRhqIAAoAgAQEyAHQTRqIAdBGGogACgCCBATIAdBPGogB0EYaiAAKAIEEBMgDUFgaiESIAEhBEEAIQwDQCAHKAIwIAcoAixBA3RqKQIAIhRCEIinQf8BcSEIIAcoAkAgBygCPEEDdGopAgAiFUIQiKdB/wFxIQsgBygCOCAHKAI0QQN0aikCACIWQiCIpyEJIBVCIIghFyAUQiCIpyECAkAgFkIQiKdB/wFxIgNBAk8EQAJAIAZFIANBGUlyRQRAIAkgB0EYaiADQSAgBygCHGsiCiAKIANLGyIKEAUgAyAKayIDdGohCSAHQRhqEAQaIANFDQEgB0EYaiADEAUgCWohCQwBCyAHQRhqIAMQBSAJaiEJIAdBGGoQBBoLIAcpAkQhGCAHIAk2AkQgByAYNwNIDAELAkAgA0UEQCACBEAgBygCRCEJDAMLIAcoAkghCQwBCwJAAkAgB0EYakEBEAUgCSACRWpqIgNBA0YEQCAHKAJEQX9qIgMgA0VqIQkMAQsgA0ECdCAHaigCRCIJIAlFaiEJIANBAUYNAQsgByAHKAJINgJMCwsgByAHKAJENgJIIAcgCTYCRAsgF6chAyALBEAgB0EYaiALEAUgA2ohAwsgCCALakEUTwRAIAdBGGoQBBoLIAgEQCAHQRhqIAgQBSACaiECCyAHQRhqEAQaIAcgB0EYaiAUQhiIp0H/AXEQCCAUp0H//wNxajYCLCAHIAdBGGogFUIYiKdB/wFxEAggFadB//8DcWo2AjwgB0EYahAEGiAHIAdBGGogFkIYiKdB/wFxEAggFqdB//8DcWo2AjQgByACNgJgIAcoAlwhCiAHIAk2AmggByADNgJkAkACQAJAIAQgAiADaiILaiASSw0AIAIgCmoiEyAPSw0AIA0gBGsgC0Egak8NAQsgByAHKQNoNwMQIAcgBykDYDcDCCAEIA0gB0EIaiAHQdwAaiAPIA4gESAQEB4hCwwBCyACIARqIQggBCAKEAcgAkERTwRAIARBEGohAgNAIAIgCkEQaiIKEAcgAkEQaiICIAhJDQALCyAIIAlrIQIgByATNgJcIAkgCCAOa0sEQCAJIAggEWtLBEBBbCELDAILIBAgAiAOayICaiIKIANqIBBNBEAgCCAKIAMQDxoMAgsgCCAKQQAgAmsQDyEIIAcgAiADaiIDNgJkIAggAmshCCAOIQILIAlBEE8EQCADIAhqIQMDQCAIIAIQByACQRBqIQIgCEEQaiIIIANJDQALDAELAkAgCUEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgCUECdCIDQcAeaigCAGoiAhAXIAIgA0HgHmooAgBrIQIgBygCZCEDDAELIAggAhAMCyADQQlJDQAgAyAIaiEDIAhBCGoiCCACQQhqIgJrQQ9MBEADQCAIIAIQDCACQQhqIQIgCEEIaiIIIANJDQAMAgALAAsDQCAIIAIQByACQRBqIQIgCEEQaiIIIANJDQALCyAHQRhqEAQaIAsgDCALEAMiAhshDCAEIAQgC2ogAhshBCAFQX9qIgUNAAsgDBADDQFBbCEMIAdBGGoQBEECSQ0BQQAhCANAIAhBA0cEQCAAIAhBAnQiAmpBrNABaiACIAdqKAJENgIAIAhBAWohCAwBCwsgBygCXCEIC0G6fyEMIA8gCGsiACANIARrSw0AIAQEfyAEIAggABALIABqBUEACyABayEMCyAHQfAAaiQAIAwLkRcCFn8FfiMAQdABayIHJAAgByAAKALw4QEiCDYCvAEgASACaiESIAggACgCgOIBaiETAkACQCAFRQRAIAEhAwwBCyAAKALE4AEhESAAKALA4AEhFSAAKAK84AEhDyAAQQE2AozhAUEAIQgDQCAIQQNHBEAgByAIQQJ0IgJqIAAgAmpBrNABaigCADYCVCAIQQFqIQgMAQsLIAcgETYCZCAHIA82AmAgByABIA9rNgJoQWwhECAHQShqIAMgBBAGEAMNASAFQQQgBUEESBshFyAHQTxqIAdBKGogACgCABATIAdBxABqIAdBKGogACgCCBATIAdBzABqIAdBKGogACgCBBATQQAhBCAHQeAAaiEMIAdB5ABqIQoDQCAHQShqEARBAksgBCAXTnJFBEAgBygCQCAHKAI8QQN0aikCACIdQhCIp0H/AXEhCyAHKAJQIAcoAkxBA3RqKQIAIh5CEIinQf8BcSEJIAcoAkggBygCREEDdGopAgAiH0IgiKchCCAeQiCIISAgHUIgiKchAgJAIB9CEIinQf8BcSIDQQJPBEACQCAGRSADQRlJckUEQCAIIAdBKGogA0EgIAcoAixrIg0gDSADSxsiDRAFIAMgDWsiA3RqIQggB0EoahAEGiADRQ0BIAdBKGogAxAFIAhqIQgMAQsgB0EoaiADEAUgCGohCCAHQShqEAQaCyAHKQJUISEgByAINgJUIAcgITcDWAwBCwJAIANFBEAgAgRAIAcoAlQhCAwDCyAHKAJYIQgMAQsCQAJAIAdBKGpBARAFIAggAkVqaiIDQQNGBEAgBygCVEF/aiIDIANFaiEIDAELIANBAnQgB2ooAlQiCCAIRWohCCADQQFGDQELIAcgBygCWDYCXAsLIAcgBygCVDYCWCAHIAg2AlQLICCnIQMgCQRAIAdBKGogCRAFIANqIQMLIAkgC2pBFE8EQCAHQShqEAQaCyALBEAgB0EoaiALEAUgAmohAgsgB0EoahAEGiAHIAcoAmggAmoiCSADajYCaCAKIAwgCCAJSxsoAgAhDSAHIAdBKGogHUIYiKdB/wFxEAggHadB//8DcWo2AjwgByAHQShqIB5CGIinQf8BcRAIIB6nQf//A3FqNgJMIAdBKGoQBBogB0EoaiAfQhiIp0H/AXEQCCEOIAdB8ABqIARBBHRqIgsgCSANaiAIazYCDCALIAg2AgggCyADNgIEIAsgAjYCACAHIA4gH6dB//8DcWo2AkQgBEEBaiEEDAELCyAEIBdIDQEgEkFgaiEYIAdB4ABqIRogB0HkAGohGyABIQMDQCAHQShqEARBAksgBCAFTnJFBEAgBygCQCAHKAI8QQN0aikCACIdQhCIp0H/AXEhCyAHKAJQIAcoAkxBA3RqKQIAIh5CEIinQf8BcSEIIAcoAkggBygCREEDdGopAgAiH0IgiKchCSAeQiCIISAgHUIgiKchDAJAIB9CEIinQf8BcSICQQJPBEACQCAGRSACQRlJckUEQCAJIAdBKGogAkEgIAcoAixrIgogCiACSxsiChAFIAIgCmsiAnRqIQkgB0EoahAEGiACRQ0BIAdBKGogAhAFIAlqIQkMAQsgB0EoaiACEAUgCWohCSAHQShqEAQaCyAHKQJUISEgByAJNgJUIAcgITcDWAwBCwJAIAJFBEAgDARAIAcoAlQhCQwDCyAHKAJYIQkMAQsCQAJAIAdBKGpBARAFIAkgDEVqaiICQQNGBEAgBygCVEF/aiICIAJFaiEJDAELIAJBAnQgB2ooAlQiCSAJRWohCSACQQFGDQELIAcgBygCWDYCXAsLIAcgBygCVDYCWCAHIAk2AlQLICCnIRQgCARAIAdBKGogCBAFIBRqIRQLIAggC2pBFE8EQCAHQShqEAQaCyALBEAgB0EoaiALEAUgDGohDAsgB0EoahAEGiAHIAcoAmggDGoiGSAUajYCaCAbIBogCSAZSxsoAgAhHCAHIAdBKGogHUIYiKdB/wFxEAggHadB//8DcWo2AjwgByAHQShqIB5CGIinQf8BcRAIIB6nQf//A3FqNgJMIAdBKGoQBBogByAHQShqIB9CGIinQf8BcRAIIB+nQf//A3FqNgJEIAcgB0HwAGogBEEDcUEEdGoiDSkDCCIdNwPIASAHIA0pAwAiHjcDwAECQAJAAkAgBygCvAEiDiAepyICaiIWIBNLDQAgAyAHKALEASIKIAJqIgtqIBhLDQAgEiADayALQSBqTw0BCyAHIAcpA8gBNwMQIAcgBykDwAE3AwggAyASIAdBCGogB0G8AWogEyAPIBUgERAeIQsMAQsgAiADaiEIIAMgDhAHIAJBEU8EQCADQRBqIQIDQCACIA5BEGoiDhAHIAJBEGoiAiAISQ0ACwsgCCAdpyIOayECIAcgFjYCvAEgDiAIIA9rSwRAIA4gCCAVa0sEQEFsIQsMAgsgESACIA9rIgJqIhYgCmogEU0EQCAIIBYgChAPGgwCCyAIIBZBACACaxAPIQggByACIApqIgo2AsQBIAggAmshCCAPIQILIA5BEE8EQCAIIApqIQoDQCAIIAIQByACQRBqIQIgCEEQaiIIIApJDQALDAELAkAgDkEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgDkECdCIKQcAeaigCAGoiAhAXIAIgCkHgHmooAgBrIQIgBygCxAEhCgwBCyAIIAIQDAsgCkEJSQ0AIAggCmohCiAIQQhqIgggAkEIaiICa0EPTARAA0AgCCACEAwgAkEIaiECIAhBCGoiCCAKSQ0ADAIACwALA0AgCCACEAcgAkEQaiECIAhBEGoiCCAKSQ0ACwsgCxADBEAgCyEQDAQFIA0gDDYCACANIBkgHGogCWs2AgwgDSAJNgIIIA0gFDYCBCAEQQFqIQQgAyALaiEDDAILAAsLIAQgBUgNASAEIBdrIQtBACEEA0AgCyAFSARAIAcgB0HwAGogC0EDcUEEdGoiAikDCCIdNwPIASAHIAIpAwAiHjcDwAECQAJAAkAgBygCvAEiDCAepyICaiIKIBNLDQAgAyAHKALEASIJIAJqIhBqIBhLDQAgEiADayAQQSBqTw0BCyAHIAcpA8gBNwMgIAcgBykDwAE3AxggAyASIAdBGGogB0G8AWogEyAPIBUgERAeIRAMAQsgAiADaiEIIAMgDBAHIAJBEU8EQCADQRBqIQIDQCACIAxBEGoiDBAHIAJBEGoiAiAISQ0ACwsgCCAdpyIGayECIAcgCjYCvAEgBiAIIA9rSwRAIAYgCCAVa0sEQEFsIRAMAgsgESACIA9rIgJqIgwgCWogEU0EQCAIIAwgCRAPGgwCCyAIIAxBACACaxAPIQggByACIAlqIgk2AsQBIAggAmshCCAPIQILIAZBEE8EQCAIIAlqIQYDQCAIIAIQByACQRBqIQIgCEEQaiIIIAZJDQALDAELAkAgBkEHTQRAIAggAi0AADoAACAIIAItAAE6AAEgCCACLQACOgACIAggAi0AAzoAAyAIQQRqIAIgBkECdCIGQcAeaigCAGoiAhAXIAIgBkHgHmooAgBrIQIgBygCxAEhCQwBCyAIIAIQDAsgCUEJSQ0AIAggCWohBiAIQQhqIgggAkEIaiICa0EPTARAA0AgCCACEAwgAkEIaiECIAhBCGoiCCAGSQ0ADAIACwALA0AgCCACEAcgAkEQaiECIAhBEGoiCCAGSQ0ACwsgEBADDQMgC0EBaiELIAMgEGohAwwBCwsDQCAEQQNHBEAgACAEQQJ0IgJqQazQAWogAiAHaigCVDYCACAEQQFqIQQMAQsLIAcoArwBIQgLQbp/IRAgEyAIayIAIBIgA2tLDQAgAwR/IAMgCCAAEAsgAGoFQQALIAFrIRALIAdB0AFqJAAgEAslACAAQgA3AgAgAEEAOwEIIABBADoACyAAIAE2AgwgACACOgAKC7QFAQN/IwBBMGsiBCQAIABB/wFqIgVBfWohBgJAIAMvAQIEQCAEQRhqIAEgAhAGIgIQAw0BIARBEGogBEEYaiADEBwgBEEIaiAEQRhqIAMQHCAAIQMDQAJAIARBGGoQBCADIAZPckUEQCADIARBEGogBEEYahASOgAAIAMgBEEIaiAEQRhqEBI6AAEgBEEYahAERQ0BIANBAmohAwsgBUF+aiEFAn8DQEG6fyECIAMiASAFSw0FIAEgBEEQaiAEQRhqEBI6AAAgAUEBaiEDIARBGGoQBEEDRgRAQQIhAiAEQQhqDAILIAMgBUsNBSABIARBCGogBEEYahASOgABIAFBAmohA0EDIQIgBEEYahAEQQNHDQALIARBEGoLIQUgAyAFIARBGGoQEjoAACABIAJqIABrIQIMAwsgAyAEQRBqIARBGGoQEjoAAiADIARBCGogBEEYahASOgADIANBBGohAwwAAAsACyAEQRhqIAEgAhAGIgIQAw0AIARBEGogBEEYaiADEBwgBEEIaiAEQRhqIAMQHCAAIQMDQAJAIARBGGoQBCADIAZPckUEQCADIARBEGogBEEYahAROgAAIAMgBEEIaiAEQRhqEBE6AAEgBEEYahAERQ0BIANBAmohAwsgBUF+aiEFAn8DQEG6fyECIAMiASAFSw0EIAEgBEEQaiAEQRhqEBE6AAAgAUEBaiEDIARBGGoQBEEDRgRAQQIhAiAEQQhqDAILIAMgBUsNBCABIARBCGogBEEYahAROgABIAFBAmohA0EDIQIgBEEYahAEQQNHDQALIARBEGoLIQUgAyAFIARBGGoQEToAACABIAJqIABrIQIMAgsgAyAEQRBqIARBGGoQEToAAiADIARBCGogBEEYahAROgADIANBBGohAwwAAAsACyAEQTBqJAAgAgtpAQF/An8CQAJAIAJBB00NACABKAAAQbfIwuF+Rw0AIAAgASgABDYCmOIBQWIgAEEQaiABIAIQPiIDEAMNAhogAEKBgICAEDcDiOEBIAAgASADaiACIANrECoMAQsgACABIAIQKgtBAAsLrQMBBn8jAEGAAWsiAyQAQWIhCAJAIAJBCUkNACAAQZjQAGogAUEIaiIEIAJBeGogAEGY0AAQMyIFEAMiBg0AIANBHzYCfCADIANB/ABqIANB+ABqIAQgBCAFaiAGGyIEIAEgAmoiAiAEaxAVIgUQAw0AIAMoAnwiBkEfSw0AIAMoAngiB0EJTw0AIABBiCBqIAMgBkGAC0GADCAHEBggA0E0NgJ8IAMgA0H8AGogA0H4AGogBCAFaiIEIAIgBGsQFSIFEAMNACADKAJ8IgZBNEsNACADKAJ4IgdBCk8NACAAQZAwaiADIAZBgA1B4A4gBxAYIANBIzYCfCADIANB/ABqIANB+ABqIAQgBWoiBCACIARrEBUiBRADDQAgAygCfCIGQSNLDQAgAygCeCIHQQpPDQAgACADIAZBwBBB0BEgBxAYIAQgBWoiBEEMaiIFIAJLDQAgAiAFayEFQQAhAgNAIAJBA0cEQCAEKAAAIgZBf2ogBU8NAiAAIAJBAnRqQZzQAWogBjYCACACQQFqIQIgBEEEaiEEDAELCyAEIAFrIQgLIANBgAFqJAAgCAtGAQN/IABBCGohAyAAKAIEIQJBACEAA0AgACACdkUEQCABIAMgAEEDdGotAAJBFktqIQEgAEEBaiEADAELCyABQQggAmt0C4YDAQV/Qbh/IQcCQCADRQ0AIAItAAAiBEUEQCABQQA2AgBBAUG4fyADQQFGGw8LAn8gAkEBaiIFIARBGHRBGHUiBkF/Sg0AGiAGQX9GBEAgA0EDSA0CIAUvAABBgP4BaiEEIAJBA2oMAQsgA0ECSA0BIAItAAEgBEEIdHJBgIB+aiEEIAJBAmoLIQUgASAENgIAIAVBAWoiASACIANqIgNLDQBBbCEHIABBEGogACAFLQAAIgVBBnZBI0EJIAEgAyABa0HAEEHQEUHwEiAAKAKM4QEgACgCnOIBIAQQHyIGEAMiCA0AIABBmCBqIABBCGogBUEEdkEDcUEfQQggASABIAZqIAgbIgEgAyABa0GAC0GADEGAFyAAKAKM4QEgACgCnOIBIAQQHyIGEAMiCA0AIABBoDBqIABBBGogBUECdkEDcUE0QQkgASABIAZqIAgbIgEgAyABa0GADUHgDkGQGSAAKAKM4QEgACgCnOIBIAQQHyIAEAMNACAAIAFqIAJrIQcLIAcLrQMBCn8jAEGABGsiCCQAAn9BUiACQf8BSw0AGkFUIANBDEsNABogAkEBaiELIABBBGohCUGAgAQgA0F/anRBEHUhCkEAIQJBASEEQQEgA3QiB0F/aiIMIQUDQCACIAtGRQRAAkAgASACQQF0Ig1qLwEAIgZB//8DRgRAIAkgBUECdGogAjoAAiAFQX9qIQVBASEGDAELIARBACAKIAZBEHRBEHVKGyEECyAIIA1qIAY7AQAgAkEBaiECDAELCyAAIAQ7AQIgACADOwEAIAdBA3YgB0EBdmpBA2ohBkEAIQRBACECA0AgBCALRkUEQCABIARBAXRqLgEAIQpBACEAA0AgACAKTkUEQCAJIAJBAnRqIAQ6AAIDQCACIAZqIAxxIgIgBUsNAAsgAEEBaiEADAELCyAEQQFqIQQMAQsLQX8gAg0AGkEAIQIDfyACIAdGBH9BAAUgCCAJIAJBAnRqIgAtAAJBAXRqIgEgAS8BACIBQQFqOwEAIAAgAyABEBRrIgU6AAMgACABIAVB/wFxdCAHazsBACACQQFqIQIMAQsLCyEFIAhBgARqJAAgBQvjBgEIf0FsIQcCQCACQQNJDQACQAJAAkACQCABLQAAIgNBA3EiCUEBaw4DAwEAAgsgACgCiOEBDQBBYg8LIAJBBUkNAkEDIQYgASgAACEFAn8CQAJAIANBAnZBA3EiCEF+aiIEQQFNBEAgBEEBaw0BDAILIAVBDnZB/wdxIQQgBUEEdkH/B3EhAyAIRQwCCyAFQRJ2IQRBBCEGIAVBBHZB//8AcSEDQQAMAQsgBUEEdkH//w9xIgNBgIAISw0DIAEtAARBCnQgBUEWdnIhBEEFIQZBAAshBSAEIAZqIgogAksNAgJAIANBgQZJDQAgACgCnOIBRQ0AQQAhAgNAIAJBg4ABSw0BIAJBQGshAgwAAAsACwJ/IAlBA0YEQCABIAZqIQEgAEHw4gFqIQIgACgCDCEGIAUEQCACIAMgASAEIAYQXwwCCyACIAMgASAEIAYQXQwBCyAAQbjQAWohAiABIAZqIQEgAEHw4gFqIQYgAEGo0ABqIQggBQRAIAggBiADIAEgBCACEF4MAQsgCCAGIAMgASAEIAIQXAsQAw0CIAAgAzYCgOIBIABBATYCiOEBIAAgAEHw4gFqNgLw4QEgCUECRgRAIAAgAEGo0ABqNgIMCyAAIANqIgBBiOMBakIANwAAIABBgOMBakIANwAAIABB+OIBakIANwAAIABB8OIBakIANwAAIAoPCwJ/AkACQAJAIANBAnZBA3FBf2oiBEECSw0AIARBAWsOAgACAQtBASEEIANBA3YMAgtBAiEEIAEvAABBBHYMAQtBAyEEIAEQIUEEdgsiAyAEaiIFQSBqIAJLBEAgBSACSw0CIABB8OIBaiABIARqIAMQCyEBIAAgAzYCgOIBIAAgATYC8OEBIAEgA2oiAEIANwAYIABCADcAECAAQgA3AAggAEIANwAAIAUPCyAAIAM2AoDiASAAIAEgBGo2AvDhASAFDwsCfwJAAkACQCADQQJ2QQNxQX9qIgRBAksNACAEQQFrDgIAAgELQQEhByADQQN2DAILQQIhByABLwAAQQR2DAELIAJBBEkgARAhIgJBj4CAAUtyDQFBAyEHIAJBBHYLIQIgAEHw4gFqIAEgB2otAAAgAkEgahAQIQEgACACNgKA4gEgACABNgLw4QEgB0EBaiEHCyAHC0sAIABC+erQ0OfJoeThADcDICAAQgA3AxggAELP1tO+0ser2UI3AxAgAELW64Lu6v2J9eAANwMIIABCADcDACAAQShqQQBBKBAQGgviAgICfwV+IABBKGoiASAAKAJIaiECAn4gACkDACIDQiBaBEAgACkDECIEQgeJIAApAwgiBUIBiXwgACkDGCIGQgyJfCAAKQMgIgdCEol8IAUQGSAEEBkgBhAZIAcQGQwBCyAAKQMYQsXP2bLx5brqJ3wLIAN8IQMDQCABQQhqIgAgAk0EQEIAIAEpAAAQCSADhUIbiUKHla+vmLbem55/fkLj3MqV/M7y9YV/fCEDIAAhAQwBCwsCQCABQQRqIgAgAksEQCABIQAMAQsgASgAAK1Ch5Wvr5i23puef34gA4VCF4lCz9bTvtLHq9lCfkL5893xmfaZqxZ8IQMLA0AgACACSQRAIAAxAABCxc/ZsvHluuonfiADhUILiUKHla+vmLbem55/fiEDIABBAWohAAwBCwsgA0IhiCADhULP1tO+0ser2UJ+IgNCHYggA4VC+fPd8Zn2masWfiIDQiCIIAOFC+8CAgJ/BH4gACAAKQMAIAKtfDcDAAJAAkAgACgCSCIDIAJqIgRBH00EQCABRQ0BIAAgA2pBKGogASACECAgACgCSCACaiEEDAELIAEgAmohAgJ/IAMEQCAAQShqIgQgA2ogAUEgIANrECAgACAAKQMIIAQpAAAQCTcDCCAAIAApAxAgACkAMBAJNwMQIAAgACkDGCAAKQA4EAk3AxggACAAKQMgIABBQGspAAAQCTcDICAAKAJIIQMgAEEANgJIIAEgA2tBIGohAQsgAUEgaiACTQsEQCACQWBqIQMgACkDICEFIAApAxghBiAAKQMQIQcgACkDCCEIA0AgCCABKQAAEAkhCCAHIAEpAAgQCSEHIAYgASkAEBAJIQYgBSABKQAYEAkhBSABQSBqIgEgA00NAAsgACAFNwMgIAAgBjcDGCAAIAc3AxAgACAINwMICyABIAJPDQEgAEEoaiABIAIgAWsiBBAgCyAAIAQ2AkgLCy8BAX8gAEUEQEG2f0EAIAMbDwtBun8hBCADIAFNBH8gACACIAMQEBogAwVBun8LCy8BAX8gAEUEQEG2f0EAIAMbDwtBun8hBCADIAFNBH8gACACIAMQCxogAwVBun8LC6gCAQZ/IwBBEGsiByQAIABB2OABaikDAEKAgIAQViEIQbh/IQUCQCAEQf//B0sNACAAIAMgBBBCIgUQAyIGDQAgACgCnOIBIQkgACAHQQxqIAMgAyAFaiAGGyIKIARBACAFIAYbayIGEEAiAxADBEAgAyEFDAELIAcoAgwhBCABRQRAQbp/IQUgBEEASg0BCyAGIANrIQUgAyAKaiEDAkAgCQRAIABBADYCnOIBDAELAkACQAJAIARBBUgNACAAQdjgAWopAwBCgICACFgNAAwBCyAAQQA2ApziAQwBCyAAKAIIED8hBiAAQQA2ApziASAGQRRPDQELIAAgASACIAMgBSAEIAgQOSEFDAELIAAgASACIAMgBSAEIAgQOiEFCyAHQRBqJAAgBQtnACAAQdDgAWogASACIAAoAuzhARAuIgEQAwRAIAEPC0G4fyECAkAgAQ0AIABB7OABaigCACIBBEBBYCECIAAoApjiASABRw0BC0EAIQIgAEHw4AFqKAIARQ0AIABBkOEBahBDCyACCycBAX8QVyIERQRAQUAPCyAEIAAgASACIAMgBBBLEE8hACAEEFYgAAs/AQF/AkACQAJAIAAoAqDiAUEBaiIBQQJLDQAgAUEBaw4CAAECCyAAEDBBAA8LIABBADYCoOIBCyAAKAKU4gELvAMCB38BfiMAQRBrIgkkAEG4fyEGAkAgBCgCACIIQQVBCSAAKALs4QEiBRtJDQAgAygCACIHQQFBBSAFGyAFEC8iBRADBEAgBSEGDAELIAggBUEDakkNACAAIAcgBRBJIgYQAw0AIAEgAmohCiAAQZDhAWohCyAIIAVrIQIgBSAHaiEHIAEhBQNAIAcgAiAJECwiBhADDQEgAkF9aiICIAZJBEBBuH8hBgwCCyAJKAIAIghBAksEQEFsIQYMAgsgB0EDaiEHAn8CQAJAAkAgCEEBaw4CAgABCyAAIAUgCiAFayAHIAYQSAwCCyAFIAogBWsgByAGEEcMAQsgBSAKIAVrIActAAAgCSgCCBBGCyIIEAMEQCAIIQYMAgsgACgC8OABBEAgCyAFIAgQRQsgAiAGayECIAYgB2ohByAFIAhqIQUgCSgCBEUNAAsgACkD0OABIgxCf1IEQEFsIQYgDCAFIAFrrFINAQsgACgC8OABBEBBaiEGIAJBBEkNASALEEQhDCAHKAAAIAynRw0BIAdBBGohByACQXxqIQILIAMgBzYCACAEIAI2AgAgBSABayEGCyAJQRBqJAAgBgsuACAAECsCf0EAQQAQAw0AGiABRSACRXJFBEBBYiAAIAEgAhA9EAMNARoLQQALCzcAIAEEQCAAIAAoAsTgASABKAIEIAEoAghqRzYCnOIBCyAAECtBABADIAFFckUEQCAAIAEQWwsL0QIBB38jAEEQayIGJAAgBiAENgIIIAYgAzYCDCAFBEAgBSgCBCEKIAUoAgghCQsgASEIAkACQANAIAAoAuzhARAWIQsCQANAIAQgC0kNASADKAAAQXBxQdDUtMIBRgRAIAMgBBAiIgcQAw0EIAQgB2shBCADIAdqIQMMAQsLIAYgAzYCDCAGIAQ2AggCQCAFBEAgACAFEE5BACEHQQAQA0UNAQwFCyAAIAogCRBNIgcQAw0ECyAAIAgQUCAMQQFHQQAgACAIIAIgBkEMaiAGQQhqEEwiByIDa0EAIAMQAxtBCkdyRQRAQbh/IQcMBAsgBxADDQMgAiAHayECIAcgCGohCEEBIQwgBigCDCEDIAYoAgghBAwBCwsgBiADNgIMIAYgBDYCCEG4fyEHIAQNASAIIAFrIQcMAQsgBiADNgIMIAYgBDYCCAsgBkEQaiQAIAcLRgECfyABIAAoArjgASICRwRAIAAgAjYCxOABIAAgATYCuOABIAAoArzgASEDIAAgATYCvOABIAAgASADIAJrajYCwOABCwutAgIEfwF+IwBBQGoiBCQAAkACQCACQQhJDQAgASgAAEFwcUHQ1LTCAUcNACABIAIQIiEBIABCADcDCCAAQQA2AgQgACABNgIADAELIARBGGogASACEC0iAxADBEAgACADEBoMAQsgAwRAIABBuH8QGgwBCyACIAQoAjAiA2shAiABIANqIQMDQAJAIAAgAyACIARBCGoQLCIFEAMEfyAFBSACIAVBA2oiBU8NAUG4fwsQGgwCCyAGQQFqIQYgAiAFayECIAMgBWohAyAEKAIMRQ0ACyAEKAI4BEAgAkEDTQRAIABBuH8QGgwCCyADQQRqIQMLIAQoAighAiAEKQMYIQcgAEEANgIEIAAgAyABazYCACAAIAIgBmytIAcgB0J/URs3AwgLIARBQGskAAslAQF/IwBBEGsiAiQAIAIgACABEFEgAigCACEAIAJBEGokACAAC30BBH8jAEGQBGsiBCQAIARB/wE2AggCQCAEQRBqIARBCGogBEEMaiABIAIQFSIGEAMEQCAGIQUMAQtBVCEFIAQoAgwiB0EGSw0AIAMgBEEQaiAEKAIIIAcQQSIFEAMNACAAIAEgBmogAiAGayADEDwhBQsgBEGQBGokACAFC4cBAgJ/An5BABAWIQMCQANAIAEgA08EQAJAIAAoAABBcHFB0NS0wgFGBEAgACABECIiAhADRQ0BQn4PCyAAIAEQVSIEQn1WDQMgBCAFfCIFIARUIQJCfiEEIAINAyAAIAEQUiICEAMNAwsgASACayEBIAAgAmohAAwBCwtCfiAFIAEbIQQLIAQLPwIBfwF+IwBBMGsiAiQAAn5CfiACQQhqIAAgARAtDQAaQgAgAigCHEEBRg0AGiACKQMICyEDIAJBMGokACADC40BAQJ/IwBBMGsiASQAAkAgAEUNACAAKAKI4gENACABIABB/OEBaigCADYCKCABIAApAvThATcDICAAEDAgACgCqOIBIQIgASABKAIoNgIYIAEgASkDIDcDECACIAFBEGoQGyAAQQA2AqjiASABIAEoAig2AgggASABKQMgNwMAIAAgARAbCyABQTBqJAALKgECfyMAQRBrIgAkACAAQQA2AgggAEIANwMAIAAQWCEBIABBEGokACABC4cBAQN/IwBBEGsiAiQAAkAgACgCAEUgACgCBEVzDQAgAiAAKAIINgIIIAIgACkCADcDAAJ/IAIoAgAiAQRAIAIoAghBqOMJIAERBQAMAQtBqOMJECgLIgFFDQAgASAAKQIANwL04QEgAUH84QFqIAAoAgg2AgAgARBZIAEhAwsgAkEQaiQAIAMLywEBAn8jAEEgayIBJAAgAEGBgIDAADYCtOIBIABBADYCiOIBIABBADYC7OEBIABCADcDkOIBIABBADYCpOMJIABBADYC3OIBIABCADcCzOIBIABBADYCvOIBIABBADYCxOABIABCADcCnOIBIABBpOIBakIANwIAIABBrOIBakEANgIAIAFCADcCECABQgA3AhggASABKQMYNwMIIAEgASkDEDcDACABKAIIQQh2QQFxIQIgAEEANgLg4gEgACACNgKM4gEgAUEgaiQAC3YBA38jAEEwayIBJAAgAARAIAEgAEHE0AFqIgIoAgA2AiggASAAKQK80AE3AyAgACgCACEDIAEgAigCADYCGCABIAApArzQATcDECADIAFBEGoQGyABIAEoAig2AgggASABKQMgNwMAIAAgARAbCyABQTBqJAALzAEBAX8gACABKAK00AE2ApjiASAAIAEoAgQiAjYCwOABIAAgAjYCvOABIAAgAiABKAIIaiICNgK44AEgACACNgLE4AEgASgCuNABBEAgAEKBgICAEDcDiOEBIAAgAUGk0ABqNgIMIAAgAUGUIGo2AgggACABQZwwajYCBCAAIAFBDGo2AgAgAEGs0AFqIAFBqNABaigCADYCACAAQbDQAWogAUGs0AFqKAIANgIAIABBtNABaiABQbDQAWooAgA2AgAPCyAAQgA3A4jhAQs7ACACRQRAQbp/DwsgBEUEQEFsDwsgAiAEEGAEQCAAIAEgAiADIAQgBRBhDwsgACABIAIgAyAEIAUQZQtGAQF/IwBBEGsiBSQAIAVBCGogBBAOAn8gBS0ACQRAIAAgASACIAMgBBAyDAELIAAgASACIAMgBBA0CyEAIAVBEGokACAACzQAIAAgAyAEIAUQNiIFEAMEQCAFDwsgBSAESQR/IAEgAiADIAVqIAQgBWsgABA1BUG4fwsLRgEBfyMAQRBrIgUkACAFQQhqIAQQDgJ/IAUtAAkEQCAAIAEgAiADIAQQYgwBCyAAIAEgAiADIAQQNQshACAFQRBqJAAgAAtZAQF/QQ8hAiABIABJBEAgAUEEdCAAbiECCyAAQQh2IgEgAkEYbCIAQYwIaigCAGwgAEGICGooAgBqIgJBA3YgAmogAEGACGooAgAgAEGECGooAgAgAWxqSQs3ACAAIAMgBCAFQYAQEDMiBRADBEAgBQ8LIAUgBEkEfyABIAIgAyAFaiAEIAVrIAAQMgVBuH8LC78DAQN/IwBBIGsiBSQAIAVBCGogAiADEAYiAhADRQRAIAAgAWoiB0F9aiEGIAUgBBAOIARBBGohAiAFLQACIQMDQEEAIAAgBkkgBUEIahAEGwRAIAAgAiAFQQhqIAMQAkECdGoiBC8BADsAACAFQQhqIAQtAAIQASAAIAQtAANqIgQgAiAFQQhqIAMQAkECdGoiAC8BADsAACAFQQhqIAAtAAIQASAEIAAtAANqIQAMAQUgB0F+aiEEA0AgBUEIahAEIAAgBEtyRQRAIAAgAiAFQQhqIAMQAkECdGoiBi8BADsAACAFQQhqIAYtAAIQASAAIAYtAANqIQAMAQsLA0AgACAES0UEQCAAIAIgBUEIaiADEAJBAnRqIgYvAQA7AAAgBUEIaiAGLQACEAEgACAGLQADaiEADAELCwJAIAAgB08NACAAIAIgBUEIaiADEAIiA0ECdGoiAC0AADoAACAALQADQQFGBEAgBUEIaiAALQACEAEMAQsgBSgCDEEfSw0AIAVBCGogAiADQQJ0ai0AAhABIAUoAgxBIUkNACAFQSA2AgwLIAFBbCAFQQhqEAobIQILCwsgBUEgaiQAIAILkgIBBH8jAEFAaiIJJAAgCSADQTQQCyEDAkAgBEECSA0AIAMgBEECdGooAgAhCSADQTxqIAgQIyADQQE6AD8gAyACOgA+QQAhBCADKAI8IQoDQCAEIAlGDQEgACAEQQJ0aiAKNgEAIARBAWohBAwAAAsAC0EAIQkDQCAGIAlGRQRAIAMgBSAJQQF0aiIKLQABIgtBAnRqIgwoAgAhBCADQTxqIAotAABBCHQgCGpB//8DcRAjIANBAjoAPyADIAcgC2siCiACajoAPiAEQQEgASAKa3RqIQogAygCPCELA0AgACAEQQJ0aiALNgEAIARBAWoiBCAKSQ0ACyAMIAo2AgAgCUEBaiEJDAELCyADQUBrJAALowIBCX8jAEHQAGsiCSQAIAlBEGogBUE0EAsaIAcgBmshDyAHIAFrIRADQAJAIAMgCkcEQEEBIAEgByACIApBAXRqIgYtAAEiDGsiCGsiC3QhDSAGLQAAIQ4gCUEQaiAMQQJ0aiIMKAIAIQYgCyAPTwRAIAAgBkECdGogCyAIIAUgCEE0bGogCCAQaiIIQQEgCEEBShsiCCACIAQgCEECdGooAgAiCEEBdGogAyAIayAHIA4QYyAGIA1qIQgMAgsgCUEMaiAOECMgCUEBOgAPIAkgCDoADiAGIA1qIQggCSgCDCELA0AgBiAITw0CIAAgBkECdGogCzYBACAGQQFqIQYMAAALAAsgCUHQAGokAA8LIAwgCDYCACAKQQFqIQoMAAALAAs0ACAAIAMgBCAFEDYiBRADBEAgBQ8LIAUgBEkEfyABIAIgAyAFaiAEIAVrIAAQNAVBuH8LCyMAIAA/AEEQdGtB//8DakEQdkAAQX9GBEBBAA8LQQAQAEEBCzsBAX8gAgRAA0AgACABIAJBgCAgAkGAIEkbIgMQCyEAIAFBgCBqIQEgAEGAIGohACACIANrIgINAAsLCwYAIAAQAwsLqBUJAEGICAsNAQAAAAEAAAACAAAAAgBBoAgLswYBAAAAAQAAAAIAAAACAAAAJgAAAIIAAAAhBQAASgAAAGcIAAAmAAAAwAEAAIAAAABJBQAASgAAAL4IAAApAAAALAIAAIAAAABJBQAASgAAAL4IAAAvAAAAygIAAIAAAACKBQAASgAAAIQJAAA1AAAAcwMAAIAAAACdBQAASgAAAKAJAAA9AAAAgQMAAIAAAADrBQAASwAAAD4KAABEAAAAngMAAIAAAABNBgAASwAAAKoKAABLAAAAswMAAIAAAADBBgAATQAAAB8NAABNAAAAUwQAAIAAAAAjCAAAUQAAAKYPAABUAAAAmQQAAIAAAABLCQAAVwAAALESAABYAAAA2gQAAIAAAABvCQAAXQAAACMUAABUAAAARQUAAIAAAABUCgAAagAAAIwUAABqAAAArwUAAIAAAAB2CQAAfAAAAE4QAAB8AAAA0gIAAIAAAABjBwAAkQAAAJAHAACSAAAAAAAAAAEAAAABAAAABQAAAA0AAAAdAAAAPQAAAH0AAAD9AAAA/QEAAP0DAAD9BwAA/Q8AAP0fAAD9PwAA/X8AAP3/AAD9/wEA/f8DAP3/BwD9/w8A/f8fAP3/PwD9/38A/f//AP3//wH9//8D/f//B/3//w/9//8f/f//P/3//38AAAAAAQAAAAIAAAADAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAABEAAAASAAAAEwAAABQAAAAVAAAAFgAAABcAAAAYAAAAGQAAABoAAAAbAAAAHAAAAB0AAAAeAAAAHwAAAAMAAAAEAAAABQAAAAYAAAAHAAAACAAAAAkAAAAKAAAACwAAAAwAAAANAAAADgAAAA8AAAAQAAAAEQAAABIAAAATAAAAFAAAABUAAAAWAAAAFwAAABgAAAAZAAAAGgAAABsAAAAcAAAAHQAAAB4AAAAfAAAAIAAAACEAAAAiAAAAIwAAACUAAAAnAAAAKQAAACsAAAAvAAAAMwAAADsAAABDAAAAUwAAAGMAAACDAAAAAwEAAAMCAAADBAAAAwgAAAMQAAADIAAAA0AAAAOAAAADAAEAQeAPC1EBAAAAAQAAAAEAAAABAAAAAgAAAAIAAAADAAAAAwAAAAQAAAAEAAAABQAAAAcAAAAIAAAACQAAAAoAAAALAAAADAAAAA0AAAAOAAAADwAAABAAQcQQC4sBAQAAAAIAAAADAAAABAAAAAUAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAABIAAAAUAAAAFgAAABgAAAAcAAAAIAAAACgAAAAwAAAAQAAAAIAAAAAAAQAAAAIAAAAEAAAACAAAABAAAAAgAAAAQAAAAIAAAAAAAQBBkBIL5gQBAAAAAQAAAAEAAAABAAAAAgAAAAIAAAADAAAAAwAAAAQAAAAGAAAABwAAAAgAAAAJAAAACgAAAAsAAAAMAAAADQAAAA4AAAAPAAAAEAAAAAEAAAAEAAAACAAAAAAAAAABAAEBBgAAAAAAAAQAAAAAEAAABAAAAAAgAAAFAQAAAAAAAAUDAAAAAAAABQQAAAAAAAAFBgAAAAAAAAUHAAAAAAAABQkAAAAAAAAFCgAAAAAAAAUMAAAAAAAABg4AAAAAAAEFEAAAAAAAAQUUAAAAAAABBRYAAAAAAAIFHAAAAAAAAwUgAAAAAAAEBTAAAAAgAAYFQAAAAAAABwWAAAAAAAAIBgABAAAAAAoGAAQAAAAADAYAEAAAIAAABAAAAAAAAAAEAQAAAAAAAAUCAAAAIAAABQQAAAAAAAAFBQAAACAAAAUHAAAAAAAABQgAAAAgAAAFCgAAAAAAAAULAAAAAAAABg0AAAAgAAEFEAAAAAAAAQUSAAAAIAABBRYAAAAAAAIFGAAAACAAAwUgAAAAAAADBSgAAAAAAAYEQAAAABAABgRAAAAAIAAHBYAAAAAAAAkGAAIAAAAACwYACAAAMAAABAAAAAAQAAAEAQAAACAAAAUCAAAAIAAABQMAAAAgAAAFBQAAACAAAAUGAAAAIAAABQgAAAAgAAAFCQAAACAAAAULAAAAIAAABQwAAAAAAAAGDwAAACAAAQUSAAAAIAABBRQAAAAgAAIFGAAAACAAAgUcAAAAIAADBSgAAAAgAAQFMAAAAAAAEAYAAAEAAAAPBgCAAAAAAA4GAEAAAAAADQYAIABBgBcLhwIBAAEBBQAAAAAAAAUAAAAAAAAGBD0AAAAAAAkF/QEAAAAADwX9fwAAAAAVBf3/HwAAAAMFBQAAAAAABwR9AAAAAAAMBf0PAAAAABIF/f8DAAAAFwX9/38AAAAFBR0AAAAAAAgE/QAAAAAADgX9PwAAAAAUBf3/DwAAAAIFAQAAABAABwR9AAAAAAALBf0HAAAAABEF/f8BAAAAFgX9/z8AAAAEBQ0AAAAQAAgE/QAAAAAADQX9HwAAAAATBf3/BwAAAAEFAQAAABAABgQ9AAAAAAAKBf0DAAAAABAF/f8AAAAAHAX9//8PAAAbBf3//wcAABoF/f//AwAAGQX9//8BAAAYBf3//wBBkBkLhgQBAAEBBgAAAAAAAAYDAAAAAAAABAQAAAAgAAAFBQAAAAAAAAUGAAAAAAAABQgAAAAAAAAFCQAAAAAAAAULAAAAAAAABg0AAAAAAAAGEAAAAAAAAAYTAAAAAAAABhYAAAAAAAAGGQAAAAAAAAYcAAAAAAAABh8AAAAAAAAGIgAAAAAAAQYlAAAAAAABBikAAAAAAAIGLwAAAAAAAwY7AAAAAAAEBlMAAAAAAAcGgwAAAAAACQYDAgAAEAAABAQAAAAAAAAEBQAAACAAAAUGAAAAAAAABQcAAAAgAAAFCQAAAAAAAAUKAAAAAAAABgwAAAAAAAAGDwAAAAAAAAYSAAAAAAAABhUAAAAAAAAGGAAAAAAAAAYbAAAAAAAABh4AAAAAAAAGIQAAAAAAAQYjAAAAAAABBicAAAAAAAIGKwAAAAAAAwYzAAAAAAAEBkMAAAAAAAUGYwAAAAAACAYDAQAAIAAABAQAAAAwAAAEBAAAABAAAAQFAAAAIAAABQcAAAAgAAAFCAAAACAAAAUKAAAAIAAABQsAAAAAAAAGDgAAAAAAAAYRAAAAAAAABhQAAAAAAAAGFwAAAAAAAAYaAAAAAAAABh0AAAAAAAAGIAAAAAAAEAYDAAEAAAAPBgOAAAAAAA4GA0AAAAAADQYDIAAAAAAMBgMQAAAAAAsGAwgAAAAACgYDBABBpB0L2QEBAAAAAwAAAAcAAAAPAAAAHwAAAD8AAAB/AAAA/wAAAP8BAAD/AwAA/wcAAP8PAAD/HwAA/z8AAP9/AAD//wAA//8BAP//AwD//wcA//8PAP//HwD//z8A//9/AP///wD///8B////A////wf///8P////H////z////9/AAAAAAEAAAACAAAABAAAAAAAAAACAAAABAAAAAgAAAAAAAAAAQAAAAIAAAABAAAABAAAAAQAAAAEAAAABAAAAAgAAAAIAAAACAAAAAcAAAAIAAAACQAAAAoAAAALAEGgIAsDwBBQ\";export{Q as ZSTDDecoder};\n","import { LinearTransfer, Matrix3, SRGBTransfer, SRGBColorSpace, ColorManagement } from 'three';\n\n/** @module ColorSpaces */\n\n// Reference: http://www.russellcottrell.com/photo/matrixCalculator.htm\n\nconst P3_PRIMARIES = [ 0.680, 0.320, 0.265, 0.690, 0.150, 0.060 ];\nconst P3_LUMINANCE_COEFFICIENTS = [ 0.2289, 0.6917, 0.0793 ];\nconst REC2020_PRIMARIES = [ 0.708, 0.292, 0.170, 0.797, 0.131, 0.046 ];\nconst REC2020_LUMINANCE_COEFFICIENTS = [ 0.2627, 0.6780, 0.0593 ];\nconst D65 = [ 0.3127, 0.3290 ];\n\n/******************************************************************************\n * Display P3 definitions\n */\n\nconst LINEAR_DISPLAY_P3_TO_XYZ = /*@__PURE__*/ new Matrix3().set(\n\t0.4865709, 0.2656677, 0.1982173,\n\t0.2289746, 0.6917385, 0.0792869,\n\t0.0000000, 0.0451134, 1.0439444\n);\n\nconst XYZ_TO_LINEAR_DISPLAY_P3 = /*@__PURE__*/ new Matrix3().set(\n\t2.4934969, - 0.9313836, - 0.4027108,\n\t- 0.8294890, 1.7626641, 0.0236247,\n\t0.0358458, - 0.0761724, 0.9568845\n);\n\n/**\n * Display-P3 color space.\n *\n * @type {string}\n * @constant\n */\nexport const DisplayP3ColorSpace = 'display-p3';\n\n/**\n * Display-P3-Linear color space.\n *\n * @type {string}\n * @constant\n */\nexport const LinearDisplayP3ColorSpace = 'display-p3-linear';\n\n/**\n * Implementation object for the Display-P3 color space.\n *\n * @type {module:ColorSpaces~ColorSpaceImpl}\n * @constant\n */\nexport const DisplayP3ColorSpaceImpl = {\n\tprimaries: P3_PRIMARIES,\n\twhitePoint: D65,\n\ttransfer: SRGBTransfer,\n\ttoXYZ: LINEAR_DISPLAY_P3_TO_XYZ,\n\tfromXYZ: XYZ_TO_LINEAR_DISPLAY_P3,\n\tluminanceCoefficients: P3_LUMINANCE_COEFFICIENTS,\n\toutputColorSpaceConfig: { drawingBufferColorSpace: DisplayP3ColorSpace }\n};\n\n/**\n * Implementation object for the Display-P3-Linear color space.\n *\n * @type {module:ColorSpaces~ColorSpaceImpl}\n * @constant\n */\nexport const LinearDisplayP3ColorSpaceImpl = {\n\tprimaries: P3_PRIMARIES,\n\twhitePoint: D65,\n\ttransfer: LinearTransfer,\n\ttoXYZ: LINEAR_DISPLAY_P3_TO_XYZ,\n\tfromXYZ: XYZ_TO_LINEAR_DISPLAY_P3,\n\tluminanceCoefficients: P3_LUMINANCE_COEFFICIENTS,\n\tworkingColorSpaceConfig: { unpackColorSpace: DisplayP3ColorSpace },\n\toutputColorSpaceConfig: { drawingBufferColorSpace: DisplayP3ColorSpace }\n};\n\n/******************************************************************************\n * Rec. 2020 definitions\n */\n\nconst LINEAR_REC2020_TO_XYZ = /*@__PURE__*/ new Matrix3().set(\n\t0.6369580, 0.1446169, 0.1688810,\n\t0.2627002, 0.6779981, 0.0593017,\n\t0.0000000, 0.0280727, 1.0609851\n);\n\nconst XYZ_TO_LINEAR_REC2020 = /*@__PURE__*/ new Matrix3().set(\n\t1.7166512, - 0.3556708, - 0.2533663,\n\t- 0.6666844, 1.6164812, 0.0157685,\n\t0.0176399, - 0.0427706, 0.9421031\n);\n\n/**\n * Rec2020-Linear color space.\n *\n * @type {string}\n * @constant\n */\nexport const LinearRec2020ColorSpace = 'rec2020-linear';\n\n/**\n * Implementation object for the Rec2020-Linear color space.\n *\n * @type {module:ColorSpaces~ColorSpaceImpl}\n * @constant\n */\nexport const LinearRec2020ColorSpaceImpl = {\n\tprimaries: REC2020_PRIMARIES,\n\twhitePoint: D65,\n\ttransfer: LinearTransfer,\n\ttoXYZ: LINEAR_REC2020_TO_XYZ,\n\tfromXYZ: XYZ_TO_LINEAR_REC2020,\n\tluminanceCoefficients: REC2020_LUMINANCE_COEFFICIENTS,\n};\n\n/**\n * Extended-sRGB color space.\n *\n * @type {string}\n * @constant\n */\nexport const ExtendedSRGBColorSpace = 'extended-srgb';\n\n/**\n * Implementation object for the Extended-sRGB color space.\n *\n * @type {module:ColorSpaces~ColorSpaceImpl}\n * @constant\n */\nexport const ExtendedSRGBColorSpaceImpl = {\n\t...ColorManagement.spaces[ SRGBColorSpace ],\n\toutputColorSpaceConfig: { drawingBufferColorSpace: SRGBColorSpace, toneMappingMode: 'extended' }\n};\n\n/**\n * An object holding the color space implementation.\n *\n * @typedef {Object} module:ColorSpaces~ColorSpaceImpl\n * @property {Array<number>} primaries - The primaries.\n * @property {Array<number>} whitePoint - The white point.\n * @property {Matrix3} toXYZ - A color space conversion matrix, converting to CIE XYZ.\n * @property {Matrix3} fromXYZ - A color space conversion matrix, converting from CIE XYZ.\n * @property {Array<number>} luminanceCoefficients - The luminance coefficients.\n * @property {{unpackColorSpace:string}} [workingColorSpaceConfig] - The working color space config.\n * @property {{drawingBufferColorSpace:string}} [outputColorSpaceConfig] - The drawing buffer color space config.\n **/\n","import {\n\tCompressedArrayTexture,\n\tCompressedCubeTexture,\n\tCompressedTexture,\n\tData3DTexture,\n\tDataTexture,\n\tFileLoader,\n\tFloatType,\n\tHalfFloatType,\n\tLinearFilter,\n\tLinearMipmapLinearFilter,\n\tNearestFilter,\n\tNearestMipmapNearestFilter,\n\tLinearSRGBColorSpace,\n\tLoader,\n\tNoColorSpace,\n\tRGBAFormat,\n\tRGBA_ASTC_4x4_Format,\n\tRGBA_ASTC_6x6_Format,\n\tRGBA_BPTC_Format,\n\tRGBA_S3TC_DXT3_Format,\n\tRGBA_ETC2_EAC_Format,\n\tR11_EAC_Format,\n\tSIGNED_R11_EAC_Format,\n\tRG11_EAC_Format,\n\tSIGNED_RG11_EAC_Format,\n\tRGBA_PVRTC_4BPPV1_Format,\n\tRGBA_PVRTC_2BPPV1_Format,\n\tRGBA_S3TC_DXT1_Format,\n\tRGBA_S3TC_DXT5_Format,\n\tRGB_BPTC_UNSIGNED_Format,\n\tRGB_ETC1_Format,\n\tRGB_ETC2_Format,\n\tRGB_PVRTC_4BPPV1_Format,\n\tRGB_S3TC_DXT1_Format,\n\tSIGNED_RED_GREEN_RGTC2_Format,\n\tSIGNED_RED_RGTC1_Format,\n\tRED_GREEN_RGTC2_Format,\n\tRED_RGTC1_Format,\n\tRGBFormat,\n\tRGFormat,\n\tRedFormat,\n\tSRGBColorSpace,\n\tUnsignedByteType,\n\tUnsignedInt5999Type,\n\tUnsignedInt101111Type\n} from 'three';\nimport { WorkerPool } from '../utils/WorkerPool.js';\nimport {\n\tread,\n\tKHR_DF_FLAG_ALPHA_PREMULTIPLIED,\n\tKHR_DF_PRIMARIES_BT709,\n\tKHR_DF_PRIMARIES_DISPLAYP3,\n\tKHR_DF_PRIMARIES_UNSPECIFIED,\n\tKHR_DF_TRANSFER_SRGB,\n\tKHR_SUPERCOMPRESSION_NONE,\n\tKHR_SUPERCOMPRESSION_ZSTD,\n\tVK_FORMAT_ASTC_4x4_SFLOAT_BLOCK_EXT,\n\tVK_FORMAT_ASTC_6x6_SFLOAT_BLOCK_EXT,\n\tVK_FORMAT_ASTC_4x4_SRGB_BLOCK,\n\tVK_FORMAT_ASTC_4x4_UNORM_BLOCK,\n\tVK_FORMAT_ASTC_6x6_SRGB_BLOCK,\n\tVK_FORMAT_ASTC_6x6_UNORM_BLOCK,\n\tVK_FORMAT_BC1_RGBA_SRGB_BLOCK,\n\tVK_FORMAT_BC1_RGBA_UNORM_BLOCK,\n\tVK_FORMAT_BC1_RGB_SRGB_BLOCK,\n\tVK_FORMAT_BC1_RGB_UNORM_BLOCK,\n\tVK_FORMAT_BC3_SRGB_BLOCK,\n\tVK_FORMAT_BC3_UNORM_BLOCK,\n\tVK_FORMAT_BC4_SNORM_BLOCK,\n\tVK_FORMAT_BC4_UNORM_BLOCK,\n\tVK_FORMAT_BC5_SNORM_BLOCK,\n\tVK_FORMAT_BC5_UNORM_BLOCK,\n\tVK_FORMAT_BC7_SRGB_BLOCK,\n\tVK_FORMAT_BC7_UNORM_BLOCK,\n\tVK_FORMAT_ETC2_R8G8B8_SRGB_BLOCK,\n\tVK_FORMAT_ETC2_R8G8B8A8_SRGB_BLOCK,\n\tVK_FORMAT_EAC_R11_UNORM_BLOCK,\n\tVK_FORMAT_EAC_R11_SNORM_BLOCK,\n\tVK_FORMAT_EAC_R11G11_UNORM_BLOCK,\n\tVK_FORMAT_EAC_R11G11_SNORM_BLOCK,\n\tVK_FORMAT_PVRTC1_4BPP_SRGB_BLOCK_IMG,\n\tVK_FORMAT_PVRTC1_4BPP_UNORM_BLOCK_IMG,\n\tVK_FORMAT_PVRTC1_2BPP_SRGB_BLOCK_IMG,\n\tVK_FORMAT_PVRTC1_2BPP_UNORM_BLOCK_IMG,\n\tVK_FORMAT_R16G16B16A16_SFLOAT,\n\tVK_FORMAT_R16G16_SFLOAT,\n\tVK_FORMAT_R16_SFLOAT,\n\tVK_FORMAT_R32G32B32A32_SFLOAT,\n\tVK_FORMAT_R32G32_SFLOAT,\n\tVK_FORMAT_R32_SFLOAT,\n\tVK_FORMAT_R8G8B8A8_SRGB,\n\tVK_FORMAT_R8G8B8A8_UNORM,\n\tVK_FORMAT_R8G8_SRGB,\n\tVK_FORMAT_R8G8_UNORM,\n\tVK_FORMAT_R8_SRGB,\n\tVK_FORMAT_R8_UNORM,\n\tVK_FORMAT_E5B9G9R9_UFLOAT_PACK32,\n\tVK_FORMAT_B10G11R11_UFLOAT_PACK32,\n\tVK_FORMAT_UNDEFINED\n} from '../libs/ktx-parse.module.js';\nimport { ZSTDDecoder } from '../libs/zstddec.module.js';\nimport { DisplayP3ColorSpace, LinearDisplayP3ColorSpace } from '../math/ColorSpaces.js';\n\nconst _taskCache = new WeakMap();\n\nlet _activeLoaders = 0;\n\nlet _zstd;\n\n/**\n * A loader for KTX 2.0 GPU Texture containers.\n *\n * KTX 2.0 is a container format for various GPU texture formats. The loader supports Basis Universal GPU textures,\n * which can be quickly transcoded to a wide variety of GPU texture compression formats. While KTX 2.0 also allows\n * other hardware-specific formats, this loader does not yet parse them.\n *\n * This loader parses the KTX 2.0 container and transcodes to a supported GPU compressed texture format.\n * The required WASM transcoder and JS wrapper are available from the `examples/jsm/libs/basis` directory.\n *\n * This loader relies on Web Assembly which is not supported in older browsers.\n *\n * References:\n * - [KTX specification](http://github.khronos.org/KTX-Specification/)\n * - [DFD](https://www.khronos.org/registry/DataFormat/specs/1.3/dataformat.1.3.html#basicdescriptor)\n * - [BasisU HDR](https://github.com/BinomialLLC/basis_universal/wiki/UASTC-HDR-Texture-Specification-v1.0)\n *\n * ```js\n * const loader = new KTX2Loader();\n * loader.setTranscoderPath( 'examples/jsm/libs/basis/' );\n * loader.detectSupport( renderer );\n * const texture = loader.loadAsync( 'diffuse.ktx2' );\n * ```\n *\n * @augments Loader\n * @three_import import { KTX2Loader } from 'three/addons/loaders/KTX2Loader.js';\n */\nclass KTX2Loader extends Loader {\n\n\t/**\n\t * Constructs a new KTX2 loader.\n\t *\n\t * @param {LoadingManager} [manager] - The loading manager.\n\t */\n\tconstructor( manager ) {\n\n\t\tsuper( manager );\n\n\t\tthis.transcoderPath = '';\n\t\tthis.transcoderBinary = null;\n\t\tthis.transcoderPending = null;\n\n\t\tthis.workerPool = new WorkerPool();\n\t\tthis.workerSourceURL = '';\n\t\tthis.workerConfig = null;\n\n\t\tif ( typeof MSC_TRANSCODER !== 'undefined' ) {\n\n\t\t\tconsole.warn(\n\n\t\t\t\t'THREE.KTX2Loader: Please update to latest \"basis_transcoder\".'\n\t\t\t\t+ ' \"msc_basis_transcoder\" is no longer supported in three.js r125+.'\n\n\t\t\t);\n\n\t\t}\n\n\t}\n\n\t/**\n\t * Sets the transcoder path.\n\t *\n\t * The WASM transcoder and JS wrapper are available from the `examples/jsm/libs/basis` directory.\n\t *\n\t * @param {string} path - The transcoder path to set.\n\t * @return {KTX2Loader} A reference to this loader.\n\t */\n\tsetTranscoderPath( path ) {\n\n\t\tthis.transcoderPath = path;\n\n\t\treturn this;\n\n\t}\n\n\t/**\n\t * Sets the maximum number of Web Workers to be allocated by this instance.\n\t *\n\t * @param {number} workerLimit - The worker limit.\n\t * @return {KTX2Loader} A reference to this loader.\n\t */\n\tsetWorkerLimit( workerLimit ) {\n\n\t\tthis.workerPool.setWorkerLimit( workerLimit );\n\n\t\treturn this;\n\n\t}\n\n\n\t/**\n\t * Async version of {@link KTX2Loader#detectSupport}.\n\t *\n\t * @async\n\t * @deprecated\n\t * @param {WebGPURenderer} renderer - The renderer.\n\t * @return {Promise} A Promise that resolves when the support has been detected.\n\t */\n\tasync detectSupportAsync( renderer ) {\n\n\t\tconsole.warn( 'KTX2Loader: \"detectSupportAsync()\" has been deprecated. Use \"detectSupport()\" and \"await renderer.init();\" when creating the renderer.' ); // @deprecated r181\n\n\t\tawait renderer.init();\n\n\t\treturn this.detectSupport( renderer );\n\n\t}\n\n\t/**\n\t * Detects hardware support for available compressed texture formats, to determine\n\t * the output format for the transcoder. Must be called before loading a texture.\n\t *\n\t * @param {WebGPURenderer|WebGLRenderer} renderer - The renderer.\n\t * @return {KTX2Loader} A reference to this loader.\n\t */\n\tdetectSupport( renderer ) {\n\n\t\tif ( renderer.isWebGPURenderer === true ) {\n\n\t\t\tthis.workerConfig = {\n\t\t\t\tastcSupported: renderer.hasFeature( 'texture-compression-astc' ),\n\t\t\t\tastcHDRSupported: false, // https://github.com/gpuweb/gpuweb/issues/3856\n\t\t\t\tetc1Supported: renderer.hasFeature( 'texture-compression-etc1' ),\n\t\t\t\tetc2Supported: renderer.hasFeature( 'texture-compression-etc2' ),\n\t\t\t\tdxtSupported: renderer.hasFeature( 'texture-compression-s3tc' ),\n\t\t\t\tbptcSupported: renderer.hasFeature( 'texture-compression-bc' ),\n\t\t\t\tpvrtcSupported: renderer.hasFeature( 'texture-compression-pvrtc' )\n\t\t\t};\n\n\t\t} else {\n\n\t\t\tthis.workerConfig = {\n\t\t\t\tastcSupported: renderer.extensions.has( 'WEBGL_compressed_texture_astc' ),\n\t\t\t\tastcHDRSupported: renderer.extensions.has( 'WEBGL_compressed_texture_astc' )\n\t\t\t\t\t&& renderer.extensions.get( 'WEBGL_compressed_texture_astc' ).getSupportedProfiles().includes( 'hdr' ),\n\t\t\t\tetc1Supported: renderer.extensions.has( 'WEBGL_compressed_texture_etc1' ),\n\t\t\t\tetc2Supported: renderer.extensions.has( 'WEBGL_compressed_texture_etc' ),\n\t\t\t\tdxtSupported: renderer.extensions.has( 'WEBGL_compressed_texture_s3tc' ),\n\t\t\t\tbptcSupported: renderer.extensions.has( 'EXT_texture_compression_bptc' ),\n\t\t\t\tpvrtcSupported: renderer.extensions.has( 'WEBGL_compressed_texture_pvrtc' )\n\t\t\t\t\t|| renderer.extensions.has( 'WEBKIT_WEBGL_compressed_texture_pvrtc' )\n\t\t\t};\n\n\t\t\tif ( typeof navigator !== 'undefined' &&\n\t\t\t\tnavigator.platform.indexOf( 'Linux' ) >= 0 && navigator.userAgent.indexOf( 'Firefox' ) >= 0 &&\n\t\t\t\tthis.workerConfig.astcSupported && this.workerConfig.etc2Supported &&\n\t\t\t\tthis.workerConfig.bptcSupported && this.workerConfig.dxtSupported ) {\n\n\t\t\t\t// On Linux, Mesa drivers for AMD and Intel GPUs expose ETC2 and ASTC even though the hardware doesn't support these.\n\t\t\t\t// Using these extensions will result in expensive software decompression on the main thread inside the driver, causing performance issues.\n\t\t\t\t// When using ANGLE (e.g. via Chrome), these extensions are not exposed except for some specific Intel GPU models - however, Firefox doesn't perform this filtering.\n\t\t\t\t// Since a granular filter is a little too fragile and we can transcode into other GPU formats, disable formats that are likely to be emulated.\n\n\t\t\t\tthis.workerConfig.astcSupported = false;\n\t\t\t\tthis.workerConfig.etc2Supported = false;\n\n\t\t\t}\n\n\t\t}\n\n\t\treturn this;\n\n\t}\n\n\t// TODO: Make this method private\n\n\tinit() {\n\n\t\tif ( ! this.transcoderPending ) {\n\n\t\t\t// Load transcoder wrapper.\n\t\t\tconst jsLoader = new FileLoader( this.manager );\n\t\t\tjsLoader.setPath( this.transcoderPath );\n\t\t\tjsLoader.setWithCredentials( this.withCredentials );\n\t\t\tconst jsContent = jsLoader.loadAsync( 'basis_transcoder.js' );\n\n\t\t\t// Load transcoder WASM binary.\n\t\t\tconst binaryLoader = new FileLoader( this.manager );\n\t\t\tbinaryLoader.setPath( this.transcoderPath );\n\t\t\tbinaryLoader.setResponseType( 'arraybuffer' );\n\t\t\tbinaryLoader.setWithCredentials( this.withCredentials );\n\t\t\tconst binaryContent = binaryLoader.loadAsync( 'basis_transcoder.wasm' );\n\n\t\t\tthis.transcoderPending = Promise.all( [ jsContent, binaryContent ] )\n\t\t\t\t.then( ( [ jsContent, binaryContent ] ) => {\n\n\t\t\t\t\tconst fn = KTX2Loader.BasisWorker.toString();\n\n\t\t\t\t\tconst body = [\n\t\t\t\t\t\t'/* constants */',\n\t\t\t\t\t\t'let _EngineFormat = ' + JSON.stringify( KTX2Loader.EngineFormat ),\n\t\t\t\t\t\t'let _EngineType = ' + JSON.stringify( KTX2Loader.EngineType ),\n\t\t\t\t\t\t'let _TranscoderFormat = ' + JSON.stringify( KTX2Loader.TranscoderFormat ),\n\t\t\t\t\t\t'let _BasisFormat = ' + JSON.stringify( KTX2Loader.BasisFormat ),\n\t\t\t\t\t\t'/* basis_transcoder.js */',\n\t\t\t\t\t\tjsContent,\n\t\t\t\t\t\t'/* worker */',\n\t\t\t\t\t\tfn.substring( fn.indexOf( '{' ) + 1, fn.lastIndexOf( '}' ) )\n\t\t\t\t\t].join( '\\n' );\n\n\t\t\t\t\tthis.workerSourceURL = URL.createObjectURL( new Blob( [ body ] ) );\n\t\t\t\t\tthis.transcoderBinary = binaryContent;\n\n\t\t\t\t\tthis.workerPool.setWorkerCreator( () => {\n\n\t\t\t\t\t\tconst worker = new Worker( this.workerSourceURL );\n\t\t\t\t\t\tconst transcoderBinary = this.transcoderBinary.slice( 0 );\n\n\t\t\t\t\t\tworker.postMessage( { type: 'init', config: this.workerConfig, transcoderBinary }, [ transcoderBinary ] );\n\n\t\t\t\t\t\treturn worker;\n\n\t\t\t\t\t} );\n\n\t\t\t\t} );\n\n\t\t\tif ( _activeLoaders > 0 ) {\n\n\t\t\t\t// Each instance loads a transcoder and allocates workers, increasing network and memory cost.\n\n\t\t\t\tconsole.warn(\n\n\t\t\t\t\t'THREE.KTX2Loader: Multiple active KTX2 loaders may cause performance issues.'\n\t\t\t\t\t+ ' Use a single KTX2Loader instance, or call .dispose() on old instances.'\n\n\t\t\t\t);\n\n\t\t\t}\n\n\t\t\t_activeLoaders ++;\n\n\t\t}\n\n\t\treturn this.transcoderPending;\n\n\t}\n\n\t/**\n\t * Starts loading from the given URL and passes the loaded KTX2 texture\n\t * to the `onLoad()` callback.\n\t *\n\t * @param {string} url - The path/URL of the file to be loaded. This can also be a data URI.\n\t * @param {function(CompressedTexture)} onLoad - Executed when the loading process has been finished.\n\t * @param {onProgressCallback} onProgress - Executed while the loading is in progress.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t */\n\tload( url, onLoad, onProgress, onError ) {\n\n\t\tif ( this.workerConfig === null ) {\n\n\t\t\tthrow new Error( 'THREE.KTX2Loader: Missing initialization with `.detectSupport( renderer )`.' );\n\n\t\t}\n\n\t\tconst loader = new FileLoader( this.manager );\n\n\t\tloader.setPath( this.path );\n\t\tloader.setCrossOrigin( this.crossOrigin );\n\t\tloader.setWithCredentials( this.withCredentials );\n\t\tloader.setRequestHeader( this.requestHeader );\n\t\tloader.setResponseType( 'arraybuffer' );\n\n\t\tloader.load( url, ( buffer ) => {\n\n\t\t\tthis.parse( buffer, onLoad, onError );\n\n\t\t}, onProgress, onError );\n\n\t}\n\n\t/**\n\t * Parses the given KTX2 data.\n\t *\n\t * @param {ArrayBuffer} buffer - The raw KTX2 data as an array buffer.\n\t * @param {function(CompressedTexture)} onLoad - Executed when the loading/parsing process has been finished.\n\t * @param {onErrorCallback} onError - Executed when errors occur.\n\t * @returns {Promise} A Promise that resolves when the parsing has been finished.\n\t */\n\tparse( buffer, onLoad, onError ) {\n\n\t\tif ( this.workerConfig === null ) {\n\n\t\t\tthrow new Error( 'THREE.KTX2Loader: Missing initialization with `.detectSupport( renderer )`.' );\n\n\t\t}\n\n\t\t// Check for an existing task using this buffer. A transferred buffer cannot be transferred\n\t\t// again from this thread.\n\t\tif ( _taskCache.has( buffer ) ) {\n\n\t\t\tconst cachedTask = _taskCache.get( buffer );\n\n\t\t\treturn cachedTask.promise.then( onLoad ).catch( onError );\n\n\t\t}\n\n\t\tthis._createTexture( buffer )\n\t\t\t.then( ( texture ) => onLoad ? onLoad( texture ) : null )\n\t\t\t.catch( onError );\n\n\t}\n\n\t_createTextureFrom( transcodeResult, container ) {\n\n\t\tconst { type: messageType, error, data: { faces, width, height, format, type, dfdFlags } } = transcodeResult;\n\n\t\tif ( messageType === 'error' ) return Promise.reject( error );\n\n\t\tlet texture;\n\n\t\tif ( container.faceCount === 6 ) {\n\n\t\t\ttexture = new CompressedCubeTexture( faces, format, type );\n\n\t\t} else {\n\n\t\t\tconst mipmaps = faces[ 0 ].mipmaps;\n\n\t\t\ttexture = container.layerCount > 1\n\t\t\t\t? new CompressedArrayTexture( mipmaps, width, height, container.layerCount, format, type )\n\t\t\t\t: new CompressedTexture( mipmaps, width, height, format, type );\n\n\t\t}\n\n\t\ttexture.minFilter = faces[ 0 ].mipmaps.length === 1 ? LinearFilter : LinearMipmapLinearFilter;\n\t\ttexture.magFilter = LinearFilter;\n\t\ttexture.generateMipmaps = false;\n\n\t\ttexture.needsUpdate = true;\n\t\ttexture.colorSpace = parseColorSpace( container );\n\t\ttexture.premultiplyAlpha = !! ( dfdFlags & KHR_DF_FLAG_ALPHA_PREMULTIPLIED );\n\n\t\treturn texture;\n\n\t}\n\n\t/**\n\t * @private\n\t * @param {ArrayBuffer} buffer\n\t * @param {?Object} config\n\t * @return {Promise<CompressedTexture|CompressedArrayTexture|DataTexture|Data3DTexture>}\n\t */\n\tasync _createTexture( buffer, config = {} ) {\n\n\t\tconst container = read( new Uint8Array( buffer ) );\n\n\t\t// Basis UASTC HDR is a subset of ASTC, which can be transcoded efficiently\n\t\t// to BC6H. To detect whether a KTX2 file uses Basis UASTC HDR, or default\n\t\t// ASTC, inspect the DFD color model.\n\t\t//\n\t\t// Source: https://github.com/BinomialLLC/basis_universal/issues/381\n\t\tconst isBasisHDR = container.vkFormat === VK_FORMAT_ASTC_4x4_SFLOAT_BLOCK_EXT\n\t\t\t&& container.dataFormatDescriptor[ 0 ].colorModel === 0xA7;\n\n\t\t// If the device supports ASTC, Basis UASTC HDR requires no transcoder.\n\t\tconst needsTranscoder = container.vkFormat === VK_FORMAT_UNDEFINED\n\t\t\t|| isBasisHDR && ! this.workerConfig.astcHDRSupported;\n\n\t\tif ( ! needsTranscoder ) {\n\n\t\t\treturn createRawTexture( container );\n\n\t\t}\n\n\t\t//\n\t\tconst taskConfig = config;\n\t\tconst texturePending = this.init().then( () => {\n\n\t\t\treturn this.workerPool.postMessage( { type: 'transcode', buffer, taskConfig: taskConfig }, [ buffer ] );\n\n\t\t} ).then( ( e ) => this._createTextureFrom( e.data, container ) );\n\n\t\t// Cache the task result.\n\t\t_taskCache.set( buffer, { promise: texturePending } );\n\n\t\treturn texturePending;\n\n\t}\n\n\t/**\n\t * Frees internal resources. This method should be called\n\t * when the loader is no longer required.\n\t */\n\tdispose() {\n\n\t\tthis.workerPool.dispose();\n\t\tif ( this.workerSourceURL ) URL.revokeObjectURL( this.workerSourceURL );\n\n\t\t_activeLoaders --;\n\n\t}\n\n}\n\n\n/* CONSTANTS */\n\nKTX2Loader.BasisFormat = {\n\tETC1S: 0,\n\tUASTC: 1,\n\tUASTC_HDR: 2,\n};\n\n// Source: https://github.com/BinomialLLC/basis_universal/blob/master/webgl/texture_test/index.html\nKTX2Loader.TranscoderFormat = {\n\tETC1: 0,\n\tETC2: 1,\n\tBC1: 2,\n\tBC3: 3,\n\tBC4: 4,\n\tBC5: 5,\n\tBC7_M6_OPAQUE_ONLY: 6,\n\tBC7_M5: 7,\n\tPVRTC1_4_RGB: 8,\n\tPVRTC1_4_RGBA: 9,\n\tASTC_4x4: 10,\n\tATC_RGB: 11,\n\tATC_RGBA_INTERPOLATED_ALPHA: 12,\n\tRGBA32: 13,\n\tRGB565: 14,\n\tBGR565: 15,\n\tRGBA4444: 16,\n\tBC6H: 22,\n\tRGB_HALF: 24,\n\tRGBA_HALF: 25,\n};\n\nKTX2Loader.EngineFormat = {\n\tRGBAFormat: RGBAFormat,\n\tRGBA_ASTC_4x4_Format: RGBA_ASTC_4x4_Format,\n\tRGB_BPTC_UNSIGNED_Format: RGB_BPTC_UNSIGNED_Format,\n\tRGBA_BPTC_Format: RGBA_BPTC_Format,\n\tRGBA_ETC2_EAC_Format: RGBA_ETC2_EAC_Format,\n\tRGBA_PVRTC_4BPPV1_Format: RGBA_PVRTC_4BPPV1_Format,\n\tRGBA_S3TC_DXT5_Format: RGBA_S3TC_DXT5_Format,\n\tRGB_ETC1_Format: RGB_ETC1_Format,\n\tRGB_ETC2_Format: RGB_ETC2_Format,\n\tRGB_PVRTC_4BPPV1_Format: RGB_PVRTC_4BPPV1_Format,\n\tRGBA_S3TC_DXT1_Format: RGBA_S3TC_DXT1_Format,\n};\n\nKTX2Loader.EngineType = {\n\tUnsignedByteType: UnsignedByteType,\n\tHalfFloatType: HalfFloatType,\n\tFloatType: FloatType,\n};\n\n/* WEB WORKER */\n\nKTX2Loader.BasisWorker = function () {\n\n\tlet config;\n\tlet transcoderPending;\n\tlet BasisModule;\n\n\tconst EngineFormat = _EngineFormat; // eslint-disable-line no-undef\n\tconst EngineType = _EngineType; // eslint-disable-line no-undef\n\tconst TranscoderFormat = _TranscoderFormat; // eslint-disable-line no-undef\n\tconst BasisFormat = _BasisFormat; // eslint-disable-line no-undef\n\n\tself.addEventListener( 'message', function ( e ) {\n\n\t\tconst message = e.data;\n\n\t\tswitch ( message.type ) {\n\n\t\t\tcase 'init':\n\t\t\t\tconfig = message.config;\n\t\t\t\tinit( message.transcoderBinary );\n\t\t\t\tbreak;\n\n\t\t\tcase 'transcode':\n\t\t\t\ttranscoderPending.then( () => {\n\n\t\t\t\t\ttry {\n\n\t\t\t\t\t\tconst { faces, buffers, width, height, hasAlpha, format, type, dfdFlags } = transcode( message.buffer );\n\n\t\t\t\t\t\tself.postMessage( { type: 'transcode', id: message.id, data: { faces, width, height, hasAlpha, format, type, dfdFlags } }, buffers );\n\n\t\t\t\t\t} catch ( error ) {\n\n\t\t\t\t\t\tconsole.error( error );\n\n\t\t\t\t\t\tself.postMessage( { type: 'error', id: message.id, error: error.message } );\n\n\t\t\t\t\t}\n\n\t\t\t\t} );\n\t\t\t\tbreak;\n\n\t\t}\n\n\t} );\n\n\tfunction init( wasmBinary ) {\n\n\t\ttranscoderPending = new Promise( ( resolve ) => {\n\n\t\t\tBasisModule = { wasmBinary, onRuntimeInitialized: resolve };\n\t\t\tBASIS( BasisModule ); // eslint-disable-line no-undef\n\n\t\t} ).then( () => {\n\n\t\t\tBasisModule.initializeBasis();\n\n\t\t\tif ( BasisModule.KTX2File === undefined ) {\n\n\t\t\t\tconsole.warn( 'THREE.KTX2Loader: Please update Basis Universal transcoder.' );\n\n\t\t\t}\n\n\t\t} );\n\n\t}\n\n\tfunction transcode( buffer ) {\n\n\t\tconst ktx2File = new BasisModule.KTX2File( new Uint8Array( buffer ) );\n\n\t\tfunction cleanup() {\n\n\t\t\tktx2File.close();\n\t\t\tktx2File.delete();\n\n\t\t}\n\n\t\tif ( ! ktx2File.isValid() ) {\n\n\t\t\tcleanup();\n\t\t\tthrow new Error( 'THREE.KTX2Loader:\tInvalid or unsupported .ktx2 file' );\n\n\t\t}\n\n\t\tlet basisFormat;\n\n\t\tif ( ktx2File.isUASTC() ) {\n\n\t\t\tbasisFormat = BasisFormat.UASTC;\n\n\t\t} else if ( ktx2File.isETC1S() ) {\n\n\t\t\tbasisFormat = BasisFormat.ETC1S;\n\n\t\t} else if ( ktx2File.isHDR() ) {\n\n\t\t\tbasisFormat = BasisFormat.UASTC_HDR;\n\n\t\t} else {\n\n\t\t\tthrow new Error( 'THREE.KTX2Loader: Unknown Basis encoding' );\n\n\t\t}\n\n\t\tconst width = ktx2File.getWidth();\n\t\tconst height = ktx2File.getHeight();\n\t\tconst layerCount = ktx2File.getLayers() || 1;\n\t\tconst levelCount = ktx2File.getLevels();\n\t\tconst faceCount = ktx2File.getFaces();\n\t\tconst hasAlpha = ktx2File.getHasAlpha();\n\t\tconst dfdFlags = ktx2File.getDFDFlags();\n\n\t\tconst { transcoderFormat, engineFormat, engineType } = getTranscoderFormat( basisFormat, width, height, hasAlpha );\n\n\t\tif ( ! width || ! height || ! levelCount ) {\n\n\t\t\tcleanup();\n\t\t\tthrow new Error( 'THREE.KTX2Loader:\tInvalid texture' );\n\n\t\t}\n\n\t\tif ( ! ktx2File.startTranscoding() ) {\n\n\t\t\tcleanup();\n\t\t\tthrow new Error( 'THREE.KTX2Loader: .startTranscoding failed' );\n\n\t\t}\n\n\t\tconst faces = [];\n\t\tconst buffers = [];\n\n\t\tfor ( let face = 0; face < faceCount; face ++ ) {\n\n\t\t\tconst mipmaps = [];\n\n\t\t\tfor ( let mip = 0; mip < levelCount; mip ++ ) {\n\n\t\t\t\tconst layerMips = [];\n\n\t\t\t\tlet mipWidth, mipHeight;\n\n\t\t\t\tfor ( let layer = 0; layer < layerCount; layer ++ ) {\n\n\t\t\t\t\tconst levelInfo = ktx2File.getImageLevelInfo( mip, layer, face );\n\n\t\t\t\t\tif ( face === 0 && mip === 0 && layer === 0 && ( levelInfo.origWidth % 4 !== 0 || levelInfo.origHeight % 4 !== 0 ) ) {\n\n\t\t\t\t\t\tconsole.warn( 'THREE.KTX2Loader: ETC1S and UASTC textures should use multiple-of-four dimensions.' );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( levelCount > 1 ) {\n\n\t\t\t\t\t\tmipWidth = levelInfo.origWidth;\n\t\t\t\t\t\tmipHeight = levelInfo.origHeight;\n\n\t\t\t\t\t} else {\n\n\t\t\t\t\t\t// Handles non-multiple-of-four dimensions in textures without mipmaps. Textures with\n\t\t\t\t\t\t// mipmaps must use multiple-of-four dimensions, for some texture formats and APIs.\n\t\t\t\t\t\t// See mrdoob/three.js#25908.\n\t\t\t\t\t\tmipWidth = levelInfo.width;\n\t\t\t\t\t\tmipHeight = levelInfo.height;\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlet dst = new Uint8Array( ktx2File.getImageTranscodedSizeInBytes( mip, layer, 0, transcoderFormat ) );\n\t\t\t\t\tconst status = ktx2File.transcodeImage( dst, mip, layer, face, transcoderFormat, 0, - 1, - 1 );\n\n\t\t\t\t\tif ( engineType === EngineType.HalfFloatType ) {\n\n\t\t\t\t\t\tdst = new Uint16Array( dst.buffer, dst.byteOffset, dst.byteLength / Uint16Array.BYTES_PER_ELEMENT );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tif ( ! status ) {\n\n\t\t\t\t\t\tcleanup();\n\t\t\t\t\t\tthrow new Error( 'THREE.KTX2Loader: .transcodeImage failed.' );\n\n\t\t\t\t\t}\n\n\t\t\t\t\tlayerMips.push( dst );\n\n\t\t\t\t}\n\n\t\t\t\tconst mipData = concat( layerMips );\n\n\t\t\t\tmipmaps.push( { data: mipData, width: mipWidth, height: mipHeight } );\n\t\t\t\tbuffers.push( mipData.buffer );\n\n\t\t\t}\n\n\t\t\tfaces.push( { mipmaps, width, height, format: engineFormat, type: engineType } );\n\n\t\t}\n\n\t\tcleanup();\n\n\t\treturn { faces, buffers, width, height, hasAlpha, dfdFlags, format: engineFormat, type: engineType };\n\n\t}\n\n\t//\n\n\t// Optimal choice of a transcoder target format depends on the Basis format (ETC1S, UASTC, or\n\t// UASTC HDR), device capabilities, and texture dimensions. The list below ranks the formats\n\t// separately for each format. Currently, priority is assigned based on:\n\t//\n\t//   high quality > low quality > uncompressed\n\t//\n\t// Prioritization may be revisited, or exposed for configuration, in the future.\n\t//\n\t// Reference: https://github.com/KhronosGroup/3D-Formats-Guidelines/blob/main/KTXDeveloperGuide.md\n\tconst FORMAT_OPTIONS = [\n\t\t{\n\t\t\tif: 'astcSupported',\n\t\t\tbasisFormat: [ BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.ASTC_4x4, TranscoderFormat.ASTC_4x4 ],\n\t\t\tengineFormat: [ EngineFormat.RGBA_ASTC_4x4_Format, EngineFormat.RGBA_ASTC_4x4_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: Infinity,\n\t\t\tpriorityUASTC: 1,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tif: 'bptcSupported',\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.BC7_M5, TranscoderFormat.BC7_M5 ],\n\t\t\tengineFormat: [ EngineFormat.RGBA_BPTC_Format, EngineFormat.RGBA_BPTC_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 3,\n\t\t\tpriorityUASTC: 2,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tif: 'dxtSupported',\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.BC1, TranscoderFormat.BC3 ],\n\t\t\tengineFormat: [ EngineFormat.RGBA_S3TC_DXT1_Format, EngineFormat.RGBA_S3TC_DXT5_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 4,\n\t\t\tpriorityUASTC: 5,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tif: 'etc2Supported',\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.ETC1, TranscoderFormat.ETC2 ],\n\t\t\tengineFormat: [ EngineFormat.RGB_ETC2_Format, EngineFormat.RGBA_ETC2_EAC_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 1,\n\t\t\tpriorityUASTC: 3,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tif: 'etc1Supported',\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.ETC1 ],\n\t\t\tengineFormat: [ EngineFormat.RGB_ETC1_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 2,\n\t\t\tpriorityUASTC: 4,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tif: 'pvrtcSupported',\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.PVRTC1_4_RGB, TranscoderFormat.PVRTC1_4_RGBA ],\n\t\t\tengineFormat: [ EngineFormat.RGB_PVRTC_4BPPV1_Format, EngineFormat.RGBA_PVRTC_4BPPV1_Format ],\n\t\t\tengineType: [ EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 5,\n\t\t\tpriorityUASTC: 6,\n\t\t\tneedsPowerOfTwo: true,\n\t\t},\n\t\t{\n\t\t\tif: 'bptcSupported',\n\t\t\tbasisFormat: [ BasisFormat.UASTC_HDR ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.BC6H ],\n\t\t\tengineFormat: [ EngineFormat.RGB_BPTC_UNSIGNED_Format ],\n\t\t\tengineType: [ EngineType.HalfFloatType ],\n\t\t\tpriorityHDR: 1,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\n\t\t// Uncompressed fallbacks.\n\n\t\t{\n\t\t\tbasisFormat: [ BasisFormat.ETC1S, BasisFormat.UASTC ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.RGBA32, TranscoderFormat.RGBA32 ],\n\t\t\tengineFormat: [ EngineFormat.RGBAFormat, EngineFormat.RGBAFormat ],\n\t\t\tengineType: [ EngineType.UnsignedByteType, EngineType.UnsignedByteType ],\n\t\t\tpriorityETC1S: 100,\n\t\t\tpriorityUASTC: 100,\n\t\t\tneedsPowerOfTwo: false,\n\t\t},\n\t\t{\n\t\t\tbasisFormat: [ BasisFormat.UASTC_HDR ],\n\t\t\ttranscoderFormat: [ TranscoderFormat.RGBA_HALF ],\n\t\t\tengineFormat: [ EngineFormat.RGBAFormat ],\n\t\t\tengineType: [ EngineType.HalfFloatType ],\n\t\t\tpriorityHDR: 100,\n\t\t\tneedsPowerOfTwo: false,\n\t\t}\n\t];\n\n\tconst OPTIONS = {\n\t\t[ BasisFormat.ETC1S ]: FORMAT_OPTIONS\n\t\t\t.filter( ( opt ) => opt.basisFormat.includes( BasisFormat.ETC1S ) )\n\t\t\t.sort( ( a, b ) => a.priorityETC1S - b.priorityETC1S ),\n\n\t\t[ BasisFormat.UASTC ]: FORMAT_OPTIONS\n\t\t\t.filter( ( opt ) => opt.basisFormat.includes( BasisFormat.UASTC ) )\n\t\t\t.sort( ( a, b ) => a.priorityUASTC - b.priorityUASTC ),\n\n\t\t[ BasisFormat.UASTC_HDR ]: FORMAT_OPTIONS\n\t\t\t.filter( ( opt ) => opt.basisFormat.includes( BasisFormat.UASTC_HDR ) )\n\t\t\t.sort( ( a, b ) => a.priorityHDR - b.priorityHDR ),\n\t};\n\n\tfunction getTranscoderFormat( basisFormat, width, height, hasAlpha ) {\n\n\t\tconst options = OPTIONS[ basisFormat ];\n\n\t\tfor ( let i = 0; i < options.length; i ++ ) {\n\n\t\t\tconst opt = options[ i ];\n\n\t\t\tif ( opt.if && ! config[ opt.if ] ) continue;\n\t\t\tif ( ! opt.basisFormat.includes( basisFormat ) ) continue;\n\t\t\tif ( hasAlpha && opt.transcoderFormat.length < 2 ) continue;\n\t\t\tif ( opt.needsPowerOfTwo && ! ( isPowerOfTwo( width ) && isPowerOfTwo( height ) ) ) continue;\n\n\t\t\tconst transcoderFormat = opt.transcoderFormat[ hasAlpha ? 1 : 0 ];\n\t\t\tconst engineFormat = opt.engineFormat[ hasAlpha ? 1 : 0 ];\n\t\t\tconst engineType = opt.engineType[ 0 ];\n\n\t\t\treturn { transcoderFormat, engineFormat, engineType };\n\n\t\t}\n\n\t\tthrow new Error( 'THREE.KTX2Loader: Failed to identify transcoding target.' );\n\n\t}\n\n\tfunction isPowerOfTwo( value ) {\n\n\t\tif ( value <= 2 ) return true;\n\n\t\treturn ( value & ( value - 1 ) ) === 0 && value !== 0;\n\n\t}\n\n\t/**\n\t * Concatenates N byte arrays.\n\t *\n\t * @param {Uint8Array[]} arrays\n\t * @return {Uint8Array}\n\t */\n\tfunction concat( arrays ) {\n\n\t\tif ( arrays.length === 1 ) return arrays[ 0 ];\n\n\t\tlet totalByteLength = 0;\n\n\t\tfor ( let i = 0; i < arrays.length; i ++ ) {\n\n\t\t\tconst array = arrays[ i ];\n\t\t\ttotalByteLength += array.byteLength;\n\n\t\t}\n\n\t\tconst result = new Uint8Array( totalByteLength );\n\n\t\tlet byteOffset = 0;\n\n\t\tfor ( let i = 0; i < arrays.length; i ++ ) {\n\n\t\t\tconst array = arrays[ i ];\n\t\t\tresult.set( array, byteOffset );\n\n\t\t\tbyteOffset += array.byteLength;\n\n\t\t}\n\n\t\treturn result;\n\n\t}\n\n};\n\n// Parsing for non-Basis textures. These textures may have supercompression\n// like Zstd, but they do not require transcoding.\n\nconst UNCOMPRESSED_FORMATS = new Set( [ RGBAFormat, RGBFormat, RGFormat, RedFormat ] );\n\nconst FORMAT_MAP = {\n\n\t[ VK_FORMAT_R32G32B32A32_SFLOAT ]: RGBAFormat,\n\t[ VK_FORMAT_R32G32_SFLOAT ]: RGFormat,\n\t[ VK_FORMAT_R32_SFLOAT ]: RedFormat,\n\n\t[ VK_FORMAT_R16G16B16A16_SFLOAT ]: RGBAFormat,\n\t[ VK_FORMAT_R16G16_SFLOAT ]: RGFormat,\n\t[ VK_FORMAT_R16_SFLOAT ]: RedFormat,\n\n\t[ VK_FORMAT_R8G8B8A8_SRGB ]: RGBAFormat,\n\t[ VK_FORMAT_R8G8B8A8_UNORM ]: RGBAFormat,\n\t[ VK_FORMAT_R8G8_SRGB ]: RGFormat,\n\t[ VK_FORMAT_R8G8_UNORM ]: RGFormat,\n\t[ VK_FORMAT_R8_SRGB ]: RedFormat,\n\t[ VK_FORMAT_R8_UNORM ]: RedFormat,\n\n\t[ VK_FORMAT_E5B9G9R9_UFLOAT_PACK32 ]: RGBFormat,\n\t[ VK_FORMAT_B10G11R11_UFLOAT_PACK32 ]: RGBFormat,\n\n\t[ VK_FORMAT_ETC2_R8G8B8A8_SRGB_BLOCK ]: RGBA_ETC2_EAC_Format,\n\t[ VK_FORMAT_ETC2_R8G8B8_SRGB_BLOCK ]: RGB_ETC2_Format,\n\t[ VK_FORMAT_EAC_R11_UNORM_BLOCK ]: R11_EAC_Format,\n\t[ VK_FORMAT_EAC_R11_SNORM_BLOCK ]: SIGNED_R11_EAC_Format,\n\t[ VK_FORMAT_EAC_R11G11_UNORM_BLOCK ]: RG11_EAC_Format,\n\t[ VK_FORMAT_EAC_R11G11_SNORM_BLOCK ]: SIGNED_RG11_EAC_Format,\n\n\t[ VK_FORMAT_ASTC_4x4_SFLOAT_BLOCK_EXT ]: RGBA_ASTC_4x4_Format,\n\t[ VK_FORMAT_ASTC_4x4_SRGB_BLOCK ]: RGBA_ASTC_4x4_Format,\n\t[ VK_FORMAT_ASTC_4x4_UNORM_BLOCK ]: RGBA_ASTC_4x4_Format,\n\t[ VK_FORMAT_ASTC_6x6_SFLOAT_BLOCK_EXT ]: RGBA_ASTC_6x6_Format,\n\t[ VK_FORMAT_ASTC_6x6_SRGB_BLOCK ]: RGBA_ASTC_6x6_Format,\n\t[ VK_FORMAT_ASTC_6x6_UNORM_BLOCK ]: RGBA_ASTC_6x6_Format,\n\n\t[ VK_FORMAT_BC1_RGBA_SRGB_BLOCK ]: RGBA_S3TC_DXT1_Format,\n\t[ VK_FORMAT_BC1_RGBA_UNORM_BLOCK ]: RGBA_S3TC_DXT1_Format,\n\t[ VK_FORMAT_BC1_RGB_SRGB_BLOCK ]: RGB_S3TC_DXT1_Format,\n\t[ VK_FORMAT_BC1_RGB_UNORM_BLOCK ]: RGB_S3TC_DXT1_Format,\n\n\t[ VK_FORMAT_BC3_SRGB_BLOCK ]: RGBA_S3TC_DXT3_Format,\n\t[ VK_FORMAT_BC3_UNORM_BLOCK ]: RGBA_S3TC_DXT3_Format,\n\n\t[ VK_FORMAT_BC4_SNORM_BLOCK ]: SIGNED_RED_RGTC1_Format,\n\t[ VK_FORMAT_BC4_UNORM_BLOCK ]: RED_RGTC1_Format,\n\n\t[ VK_FORMAT_BC5_SNORM_BLOCK ]: SIGNED_RED_GREEN_RGTC2_Format,\n\t[ VK_FORMAT_BC5_UNORM_BLOCK ]: RED_GREEN_RGTC2_Format,\n\n\t[ VK_FORMAT_BC7_SRGB_BLOCK ]: RGBA_BPTC_Format,\n\t[ VK_FORMAT_BC7_UNORM_BLOCK ]: RGBA_BPTC_Format,\n\n\t[ VK_FORMAT_PVRTC1_4BPP_SRGB_BLOCK_IMG ]: RGBA_PVRTC_4BPPV1_Format,\n\t[ VK_FORMAT_PVRTC1_4BPP_UNORM_BLOCK_IMG ]: RGBA_PVRTC_4BPPV1_Format,\n\t[ VK_FORMAT_PVRTC1_2BPP_SRGB_BLOCK_IMG ]: RGBA_PVRTC_2BPPV1_Format,\n\t[ VK_FORMAT_PVRTC1_2BPP_UNORM_BLOCK_IMG ]: RGBA_PVRTC_2BPPV1_Format,\n\n};\n\nconst TYPE_MAP = {\n\n\t[ VK_FORMAT_R32G32B32A32_SFLOAT ]: FloatType,\n\t[ VK_FORMAT_R32G32_SFLOAT ]: FloatType,\n\t[ VK_FORMAT_R32_SFLOAT ]: FloatType,\n\n\t[ VK_FORMAT_R16G16B16A16_SFLOAT ]: HalfFloatType,\n\t[ VK_FORMAT_R16G16_SFLOAT ]: HalfFloatType,\n\t[ VK_FORMAT_R16_SFLOAT ]: HalfFloatType,\n\n\t[ VK_FORMAT_R8G8B8A8_SRGB ]: UnsignedByteType,\n\t[ VK_FORMAT_R8G8B8A8_UNORM ]: UnsignedByteType,\n\t[ VK_FORMAT_R8G8_SRGB ]: UnsignedByteType,\n\t[ VK_FORMAT_R8G8_UNORM ]: UnsignedByteType,\n\t[ VK_FORMAT_R8_SRGB ]: UnsignedByteType,\n\t[ VK_FORMAT_R8_UNORM ]: UnsignedByteType,\n\n\t[ VK_FORMAT_E5B9G9R9_UFLOAT_PACK32 ]: UnsignedInt5999Type,\n\t[ VK_FORMAT_B10G11R11_UFLOAT_PACK32 ]: UnsignedInt101111Type,\n\n\t[ VK_FORMAT_ETC2_R8G8B8A8_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_ETC2_R8G8B8_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_EAC_R11_UNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_EAC_R11_UNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_EAC_R11G11_UNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_EAC_R11G11_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_ASTC_4x4_SFLOAT_BLOCK_EXT ]: HalfFloatType,\n\t[ VK_FORMAT_ASTC_4x4_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_ASTC_4x4_UNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_ASTC_6x6_SFLOAT_BLOCK_EXT ]: HalfFloatType,\n\t[ VK_FORMAT_ASTC_6x6_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_ASTC_6x6_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_BC1_RGBA_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC1_RGBA_UNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC1_RGB_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC1_RGB_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_BC3_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC3_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_BC4_SNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC4_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_BC5_SNORM_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC5_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_BC7_SRGB_BLOCK ]: UnsignedByteType,\n\t[ VK_FORMAT_BC7_UNORM_BLOCK ]: UnsignedByteType,\n\n\t[ VK_FORMAT_PVRTC1_4BPP_SRGB_BLOCK_IMG ]: UnsignedByteType,\n\t[ VK_FORMAT_PVRTC1_4BPP_UNORM_BLOCK_IMG ]: UnsignedByteType,\n\t[ VK_FORMAT_PVRTC1_2BPP_SRGB_BLOCK_IMG ]: UnsignedByteType,\n\t[ VK_FORMAT_PVRTC1_2BPP_UNORM_BLOCK_IMG ]: UnsignedByteType,\n\n};\n\nasync function createRawTexture( container ) {\n\n\tconst { vkFormat } = container;\n\n\tif ( FORMAT_MAP[ vkFormat ] === undefined ) {\n\n\t\tthrow new Error( 'THREE.KTX2Loader: Unsupported vkFormat: ' + vkFormat );\n\n\t}\n\n\t// TODO: Merge the TYPE_MAP warning into the thrown error above, after r190.\n\tif ( TYPE_MAP[ vkFormat ] === undefined ) {\n\n\t\tconsole.warn( 'THREE.KTX2Loader: Missing \".type\" for vkFormat: ' + vkFormat );\n\n\t}\n\n\t//\n\n\tlet zstd;\n\n\tif ( container.supercompressionScheme === KHR_SUPERCOMPRESSION_ZSTD ) {\n\n\t\tif ( ! _zstd ) {\n\n\t\t\t_zstd = new Promise( async ( resolve ) => {\n\n\t\t\t\tconst zstd = new ZSTDDecoder();\n\t\t\t\tawait zstd.init();\n\t\t\t\tresolve( zstd );\n\n\t\t\t} );\n\n\t\t}\n\n\t\tzstd = await _zstd;\n\n\t}\n\n\t//\n\n\tconst mipmaps = [];\n\n\tfor ( let levelIndex = 0; levelIndex < container.levels.length; levelIndex ++ ) {\n\n\t\tconst levelWidth = Math.max( 1, container.pixelWidth >> levelIndex );\n\t\tconst levelHeight = Math.max( 1, container.pixelHeight >> levelIndex );\n\t\tconst levelDepth = container.pixelDepth ? Math.max( 1, container.pixelDepth >> levelIndex ) : 0;\n\n\t\tconst level = container.levels[ levelIndex ];\n\n\t\tlet levelData;\n\n\t\tif ( container.supercompressionScheme === KHR_SUPERCOMPRESSION_NONE ) {\n\n\t\t\tlevelData = level.levelData;\n\n\t\t} else if ( container.supercompressionScheme === KHR_SUPERCOMPRESSION_ZSTD ) {\n\n\t\t\tlevelData = zstd.decode( level.levelData, level.uncompressedByteLength );\n\n\t\t} else {\n\n\t\t\tthrow new Error( 'THREE.KTX2Loader: Unsupported supercompressionScheme.' );\n\n\t\t}\n\n\t\tlet data;\n\n\t\tif ( TYPE_MAP[ vkFormat ] === FloatType ) {\n\n\t\t\tdata = new Float32Array(\n\n\t\t\t\tlevelData.buffer,\n\t\t\t\tlevelData.byteOffset,\n\t\t\t\tlevelData.byteLength / Float32Array.BYTES_PER_ELEMENT\n\n\t\t\t);\n\n\t\t} else if ( TYPE_MAP[ vkFormat ] === HalfFloatType ) {\n\n\t\t\tdata = new Uint16Array(\n\n\t\t\t\tlevelData.buffer,\n\t\t\t\tlevelData.byteOffset,\n\t\t\t\tlevelData.byteLength / Uint16Array.BYTES_PER_ELEMENT\n\n\t\t\t);\n\n\t\t} else if ( TYPE_MAP[ vkFormat ] === UnsignedInt5999Type || TYPE_MAP[ vkFormat ] === UnsignedInt101111Type ) {\n\n\t\t\tdata = new Uint32Array(\n\n\t\t\t\tlevelData.buffer,\n\t\t\t\tlevelData.byteOffset,\n\t\t\t\tlevelData.byteLength / Uint32Array.BYTES_PER_ELEMENT\n\n\t\t\t);\n\n\t\t} else {\n\n\t\t\tdata = levelData;\n\n\t\t}\n\n\t\tmipmaps.push( {\n\n\t\t\tdata: data,\n\t\t\twidth: levelWidth,\n\t\t\theight: levelHeight,\n\t\t\tdepth: levelDepth,\n\n\t\t} );\n\n\t}\n\n\t// levelCount = 0 implies runtime-generated mipmaps.\n\tconst useMipmaps = container.levelCount === 0 || mipmaps.length > 1;\n\n\tlet texture;\n\n\tif ( UNCOMPRESSED_FORMATS.has( FORMAT_MAP[ vkFormat ] ) ) {\n\n\t\ttexture = container.pixelDepth === 0\n\t\t\t? new DataTexture( mipmaps[ 0 ].data, container.pixelWidth, container.pixelHeight )\n\t\t\t: new Data3DTexture( mipmaps[ 0 ].data, container.pixelWidth, container.pixelHeight, container.pixelDepth );\n\t\ttexture.minFilter = useMipmaps ? NearestMipmapNearestFilter : NearestFilter;\n\t\ttexture.magFilter = NearestFilter;\n\t\ttexture.generateMipmaps = container.levelCount === 0;\n\n\t} else {\n\n\t\tif ( container.pixelDepth > 0 ) throw new Error( 'THREE.KTX2Loader: Unsupported pixelDepth.' );\n\n\t\ttexture = new CompressedTexture( mipmaps, container.pixelWidth, container.pixelHeight );\n\t\ttexture.minFilter = useMipmaps ? LinearMipmapLinearFilter : LinearFilter;\n\t\ttexture.magFilter = LinearFilter;\n\n\t}\n\n\ttexture.mipmaps = mipmaps;\n\n\ttexture.type = TYPE_MAP[ vkFormat ];\n\ttexture.format = FORMAT_MAP[ vkFormat ];\n\ttexture.colorSpace = parseColorSpace( container );\n\ttexture.needsUpdate = true;\n\n\t//\n\n\treturn Promise.resolve( texture );\n\n}\n\nfunction parseColorSpace( container ) {\n\n\tconst dfd = container.dataFormatDescriptor[ 0 ];\n\n\tif ( dfd.colorPrimaries === KHR_DF_PRIMARIES_BT709 ) {\n\n\t\treturn dfd.transferFunction === KHR_DF_TRANSFER_SRGB ? SRGBColorSpace : LinearSRGBColorSpace;\n\n\t} else if ( dfd.colorPrimaries === KHR_DF_PRIMARIES_DISPLAYP3 ) {\n\n\t\treturn dfd.transferFunction === KHR_DF_TRANSFER_SRGB ? DisplayP3ColorSpace : LinearDisplayP3ColorSpace;\n\n\t} else if ( dfd.colorPrimaries === KHR_DF_PRIMARIES_UNSPECIFIED ) {\n\n\t\treturn NoColorSpace;\n\n\t} else {\n\n\t\tconsole.warn( `THREE.KTX2Loader: Unsupported color primaries, \"${ dfd.colorPrimaries }\"` );\n\t\treturn NoColorSpace;\n\n\t}\n\n}\n\nexport { KTX2Loader };\n","async function fetchAndDecodeSubtree(url) {\r\n    const cleanUrl = url.split('?')[0]; // Remove URL parameters\r\n    const extension = cleanUrl.split('.').pop(); // Get the file extension\r\n\r\n    const response = await fetch(url);\r\n    if (!response.ok) {\r\n        throw new Error(`Failed to fetch ${url}: ${response.statusText}`);\r\n    }\r\n\r\n    if (extension === \"json\") {\r\n        // Handle .json file\r\n        const json = await response.json();\r\n        return handleJSONSubtree(json, getDirectoryUrl(url));\r\n    }\r\n    if (extension === \"subtree\") {\r\n        // Handle binary .subtree file\r\n        const buffer = await response.arrayBuffer();\r\n        return decodeSubtreeBinary(buffer, getDirectoryUrl(url));\r\n    } else {\r\n        throw new Error(`Unsupported file extension: ${extension}`);\r\n    }\r\n}\r\nfunction getDirectoryUrl(url) {\r\n    const cleanUrl = url.split('?')[0]; // Removes query parameters\r\n    return cleanUrl.substring(0, cleanUrl.lastIndexOf('/') + 1);\r\n};\r\n\r\nasync function decodeSubtreeJSON(json, baseURL) {\r\n    if (!json.buffers) {\r\n        throw new Error(`subtree has no buffers`);\r\n    }\r\n\r\n    const bufferFetchPromises = json.buffers.map(async (buffer) => {\r\n        if (!buffer.uri) {\r\n            throw new Error(`bad subtree definition. subtrees in json format do not contain internal buffers`);\r\n        }\r\n        const binaryUrl = new URL(buffer.uri, baseURL).href; // Fixed to buffer.uri instead of externalBuffer.uri\r\n        const response = await fetch(binaryUrl);\r\n        if (!response.ok) {\r\n            throw new Error(`Failed to fetch binary file ${binaryUrl}: ${response.statusText}`);\r\n        }\r\n        return response.arrayBuffer();\r\n    });\r\n\r\n    const buffers = await Promise.all(bufferFetchPromises);\r\n\r\n    return decodeSubtree(json, buffers);\r\n}\r\n// Decode binary .subtree file\r\nasync function decodeSubtreeBinary(buffer, baseURL) {\r\n    const dataView = new DataView(buffer);\r\n    const jsonByteLength = dataView.getBigUint64(8, true); // JSON byte length\r\n    const binaryByteLength = dataView.getBigUint64(16, true); // Binary byte length\r\n\r\n    const jsonStart = 24;\r\n    const jsonEnd = jsonStart + Number(jsonByteLength);\r\n    const binaryStart = jsonEnd + (8 - (jsonEnd % 8)) % 8; // Align to 8-byte boundary\r\n    const binaryEnd = binaryStart + Number(binaryByteLength);\r\n\r\n    const jsonBuffer = buffer.slice(jsonStart, jsonEnd);\r\n    const jsonString = new TextDecoder().decode(jsonBuffer).trim();\r\n    const json = JSON.parse(jsonString);\r\n\r\n    if (!json.buffers) {\r\n        throw new Error(`subtree has no buffers`);\r\n    }\r\n\r\n    const bufferFetchPromises = json.buffers.map(async (b) => {\r\n        if (b.uri) {\r\n            const binaryUrl = new URL(b.uri, baseURL).href;\r\n            const response = await fetch(binaryUrl);\r\n            if (!response.ok) {\r\n                throw new Error(`Failed to fetch binary file ${binaryUrl}: ${response.statusText}`);\r\n            }\r\n            return new Uint8Array(await response.arrayBuffer());\r\n        } else {\r\n            // Assuming you meant to directly use the buffer for non-URI cases,\r\n            // which is already available in the function scope.\r\n            return new Uint8Array(buffer.slice(binaryStart, binaryEnd));\r\n        }\r\n    });\r\n\r\n    const buffers = await Promise.all(bufferFetchPromises);\r\n\r\n    return decodeSubtree(json, buffers);\r\n}\r\n\r\nfunction decodeSubtree(json, buffers){\r\n    function isAvailable(availability, index) {\r\n        if (!availability) {\r\n            throw new Error(`incomplete json subtree`);\r\n        }\r\n        if (!!availability.constant) {\r\n            if (availability.constant == 0) {\r\n                return false;\r\n            }\r\n            if (availability.constant == 1) {\r\n                return true;\r\n            }\r\n        }\r\n        if (availability.bitstream == undefined) {\r\n            throw new Error(`json subtree \"tileAvailability\" does not specify a bitstream`);\r\n        }\r\n        if (!json.bufferViews || !json.bufferViews[availability.bitstream]) {\r\n            throw new Error(`json subtree \"bufferViews\" does not specify a bitstream`);\r\n        }\r\n        const bufferView = json.bufferViews[availability.bitstream];\r\n\r\n        return isAvailable2(buffers[bufferView.buffer], bufferView.byteOffset, index);\r\n    }\r\n\r\n    function isAvailable2(buffer, byteOffset, index) {\r\n        const byteIndex = byteOffset + Math.floor(index / 8);\r\n        const bitIndex = index % 8;\r\n        return (buffer[byteIndex] >> bitIndex) & 1 == 1;\r\n    }\r\n\r\n    function isTileAvailable(address) {\r\n\r\n        let index = 0;\r\n        if (address.z==undefined) {\r\n            index = computeQuadtreeIndex(address.x, address.y, address.level);\r\n        } else {\r\n            index = computeOctreeIndex(address.x, address.y, address.z, address.level);\r\n        }\r\n        return isAvailable(json.tileAvailability, index);\r\n    }\r\n    function isContentAvailable(address) {\r\n        let index = 0;\r\n        if (address.z==undefined) {\r\n            index = computeQuadtreeIndex(address.x, address.y, address.level);\r\n        } else {\r\n            index = computeOctreeIndex(address.x, address.y, address.z, address.level);\r\n        }\r\n        const contentAvailability = [];\r\n        json.contentAvailability.forEach(availability=>{\r\n            contentAvailability.push(isAvailable(availability, index));\r\n        })\r\n        return contentAvailability;\r\n    }\r\n    function isChildSubtreeAvailable(address) {\r\n        let index = 0;\r\n        if (address.z==undefined) {\r\n            index = computeQuadtreeIndex(address.x, address.y);\r\n        } else {\r\n            index = computeOctreeIndex(address.x, address.y, address.z);\r\n        }\r\n        return isAvailable(json.childSubtreeAvailability, index);\r\n    }\r\n\r\n\r\n    return { isTileAvailable: isTileAvailable, isContentAvailable: isContentAvailable, isChildSubtreeAvailable: isChildSubtreeAvailable };\r\n}\r\n\r\n// Handle JSON subtree, fetching external binary file if necessary\r\n\r\n\r\nfunction part1By1(n) {\r\n    n &= 0x0000ffff;                  // n = ------------------------fedcba9876543210\r\n    n = (n ^ (n << 8)) & 0x00ff00ff;  // n = ----------------fedcba98--------76543210\r\n    n = (n ^ (n << 4)) & 0x0f0f0f0f;  // n = ------------fedc--------ba98--------7654--------3210\r\n    n = (n ^ (n << 2)) & 0x33333333;  // n = --------fedc----ba98----7654----3210\r\n    n = (n ^ (n << 1)) & 0x55555555;  // n = ----f--e--d--c----b--a--9--8----7--6--5--4----3--2--1--0\r\n    return n;\r\n}\r\n\r\nfunction computeQuadtreeIndex(x, y, level) {\r\n    let offset = 0;\r\n    if (level) {\r\n        offset = (Math.pow(4, level) - 1) / 3;\r\n    }\r\n    return offset + (part1By1(x) | (part1By1(y) << 1));\r\n}\r\n\r\nfunction part1By2(n) {\r\n    n &= 0x000003ff;                  // n = ------------------9876543210\r\n    n = (n ^ (n << 16)) & 0xff0000ff; // n = ----9876--------5432--------10--------------------\r\n    n = (n ^ (n << 8)) & 0x0300f00f;  // n = ----9--8--7--6--------5--4--3--2--------------------\r\n    n = (n ^ (n << 4)) & 0x030c30c3;  // n = ----9-----8--7-----6--------5-----4--3-----2--------\r\n    n = (n ^ (n << 2)) & 0x09249249;  // n = ----9--------8--------7--------6--------5--------4--------3--------2--------\r\n    return n;\r\n}\r\n\r\nfunction computeOctreeIndex(x, y, z, level) {\r\n    let offset = 0;\r\n    if (level) {\r\n        offset = (Math.pow(8, level) - 1) / 7;\r\n    }\r\n    return offset + (part1By2(x) | (part1By2(y) << 1) | (part1By2(z) << 2));\r\n}\r\nexport{\r\n    fetchAndDecodeSubtree\r\n};","import { fetchAndDecodeSubtree } from './SubtreeDecoder.js';\r\nconst subtreeMap = new Map();\r\n\r\n\r\nasync function resolveImplicite(rootTile, url) {\r\n    if (!rootTile.root || !rootTile.root.implicitTiling) {\r\n        return rootTile;\r\n    }\r\n\r\n    if (!rootTile.root.content && !rootTile.root.contents) {\r\n        throw new Error(\"implicit tiling requires a Template URI\");\r\n    }\r\n\r\n    let isQuad = true;\r\n    if (rootTile.root.implicitTiling.subdivisionScheme) {\r\n        isQuad = \"QUADTREE\" === rootTile.root.implicitTiling.subdivisionScheme.toUpperCase()\r\n    }\r\n    let subtreeUriTemplate = \"\";\r\n    if (rootTile.root.implicitTiling.subtrees) {\r\n        if (rootTile.root.implicitTiling.subtrees.uri) {\r\n            subtreeUriTemplate = rootTile.root.implicitTiling.subtrees.uri;\r\n        } else if (rootTile.root.implicitTiling.subtrees.url) {\r\n            subtreeUriTemplate = rootTile.root.implicitTiling.subtrees.url;\r\n        }\r\n    }\r\n\r\n    let contentURITemplates = [];\r\n    if (rootTile.root.content) {\r\n        if (rootTile.root.content.uri) {\r\n            contentURITemplates.push(rootTile.root.content.uri);\r\n        } else if (rootTile.root.content.url) {\r\n            contentURITemplates.push(rootTile.root.content.url);\r\n        }\r\n    } else if (rootTile.root.contents) {\r\n        rootTile.root.contents.forEach(content => {\r\n            if (content.uri) {\r\n                contentURITemplates.push(content.uri);\r\n            } else if (content.url) {\r\n                contentURITemplates.push(content.url);\r\n            }\r\n        })\r\n    }\r\n\r\n    const rootURL = getDirectoryUrl(url);\r\n\r\n    let subtreeUri;\r\n    if (isQuad) {\r\n        subtreeUri = subtreeUriTemplate\r\n            .replace(\"{level}\", 0)\r\n            .replace(\"{x}\", 0)\r\n            .replace(\"{y}\", 0);\r\n    }\r\n    if (!isQuad) {\r\n        subtreeUri = subtreeUriTemplate\r\n            .replace(\"{level}\", 0)\r\n            .replace(\"{x}\", 0)\r\n            .replace(\"{y}\", 0)\r\n            .replace(\"{z}\", 0);\r\n    }\r\n\r\n    const globalAddress = { level: 0, x: 0, y: 0 };\r\n    const localAddress = { level: 0, x: 0, y: 0 };\r\n    if (!isQuad) {\r\n        globalAddress.z = 0;\r\n        localAddress.z = 0;\r\n    }\r\n\r\n    subtreeMap.set(subtreeUri, await fetchAndDecodeSubtree(rootURL + subtreeUri))\r\n    const subtree = subtreeMap.get(subtreeUri);\r\n    const contents = [];\r\n    if (subtree.isContentAvailable(localAddress)) {\r\n        contentURITemplates.forEach(contentURI => {\r\n            let uri;\r\n            if (isQuad) {\r\n                uri = contentURI\r\n                    .replace(\"{level}\", globalAddress.level)\r\n                    .replace(\"{x}\", globalAddress.x)\r\n                    .replace(\"{y}\", globalAddress.y);\r\n            }\r\n            if (!isQuad) {\r\n                uri = contentURI\r\n                    .replace(\"{level}\", globalAddress.level)\r\n                    .replace(\"{x}\", globalAddress.x)\r\n                    .replace(\"{y}\", globalAddress.y)\r\n                    .replace(\"{z}\", globalAddress.z);\r\n            }\r\n            contents.push({ uri: uri });\r\n        });\r\n    }\r\n    const explicitTileset = {\r\n        geometricError: rootTile.root.geometricError,\r\n        boundingVolume: rootTile.root.boundingVolume,\r\n        refine: rootTile.root.refine,\r\n        globalAddress: globalAddress,\r\n        localAddress: localAddress,\r\n        subtree: subtree,\r\n        contents: contents,\r\n        getChildren: async () => {\r\n            return buildChildren(explicitTileset)\r\n        }\r\n    }\r\n    return {\r\n        root: explicitTileset\r\n\r\n    }\r\n\r\n\r\n    async function buildChildren(parent) {\r\n        const children = [];\r\n        if (parent.localAddress.level == rootTile.root.implicitTiling.availableLevels - 1) return children;\r\n\r\n        if ((parent.localAddress.level + 1) % rootTile.root.implicitTiling.subtreeLevels == 0) { // end of subtree \r\n\r\n            const localAddresses = getChildrenAddresses(parent.localAddress);\r\n            const globalAddresses = getChildrenAddresses(parent.globalAddress);\r\n            const boundingVolumes = computeBoundingVolumes(isQuad, rootTile.root.boundingVolume, globalAddresses);\r\n\r\n            for (let i = 0; i < localAddresses.length; i++) {\r\n                const childLocalAddress = localAddresses[i];\r\n                const childGlobalAddress = globalAddresses[i];\r\n                if (parent.subtree.isChildSubtreeAvailable(childLocalAddress)) {\r\n                    let subtreeUri;\r\n                    if (isQuad) {\r\n                        subtreeUri = subtreeUriTemplate\r\n                            .replace(\"{level}\", childGlobalAddress.level)\r\n                            .replace(\"{x}\", childGlobalAddress.x)\r\n                            .replace(\"{y}\", childGlobalAddress.y);\r\n                    }\r\n                    if (!isQuad) {\r\n                        subtreeUri = subtreeUriTemplate\r\n                            .replace(\"{level}\", childGlobalAddress.level)\r\n                            .replace(\"{x}\", childGlobalAddress.x)\r\n                            .replace(\"{y}\", childGlobalAddress.y)\r\n                            .replace(\"{z}\", childGlobalAddress.z);\r\n                    }\r\n                }\r\n                if (!subtreeMap.has(subtreeUri)) {\r\n                    subtreeMap.set(subtreeUri, await fetchAndDecodeSubtree(rootURL + subtreeUri))\r\n                }\r\n                const newSubtree = subtreeMap.get(subtreeUri)\r\n                const newLocalAddress = { level: 0, x: 0, y: 0 };\r\n                if (!isQuad) newLocalAddress.z = 0;\r\n\r\n                const contents = [];\r\n                if (newSubtree.isContentAvailable(newLocalAddress)) {\r\n                    contentURITemplates.forEach(contentURI => {\r\n                        let uri;\r\n                        if (isQuad) {\r\n                            uri = contentURI\r\n                                .replace(\"{level}\", childGlobalAddress.level)\r\n                                .replace(\"{x}\", childGlobalAddress.x)\r\n                                .replace(\"{y}\", childGlobalAddress.y);\r\n                        }\r\n                        if (!isQuad) {\r\n                            //let rootZ = Math.floor(z / factor);\r\n                            uri = contentURI\r\n                                .replace(\"{level}\", childGlobalAddress.level)\r\n                                .replace(\"{x}\", childGlobalAddress.x)\r\n                                .replace(\"{y}\", childGlobalAddress.y)\r\n                                .replace(\"{z}\", childGlobalAddress.z);\r\n                        }\r\n                        contents.push({ uri: uri });\r\n                    });\r\n                }\r\n                const child = {\r\n                    geometricError: parent.geometricError / 2,\r\n                    boundingVolume: boundingVolumes[i],\r\n                    refine: rootTile.root.refine,\r\n                    globalAddress: childGlobalAddress,\r\n                    localAddress: newLocalAddress,\r\n                    subtree: newSubtree,\r\n                    contents: contents,\r\n                    getChildren: async () => {\r\n                        return buildChildren(child);\r\n                    }\r\n                }\r\n                children.push(child);\r\n            }\r\n        } else { // not the end of the subtree\r\n            const localAddresses = getChildrenAddresses(parent.localAddress);\r\n            const globalAddresses = getChildrenAddresses(parent.globalAddress);\r\n            const boundingVolumes = computeBoundingVolumes(isQuad, rootTile.root.boundingVolume, globalAddresses);\r\n\r\n            for (let i = 0; i < localAddresses.length; i++) {\r\n                const childLocalAddress = localAddresses[i];\r\n                const childGlobalAddress = globalAddresses[i];\r\n                if (!parent.subtree.isTileAvailable(childLocalAddress)) {\r\n                    continue;\r\n                }\r\n                const contents = [];\r\n                const contentAvailability = parent.subtree.isContentAvailable(childLocalAddress);\r\n                for (let i = 0; i < contentURITemplates.length; i++) {\r\n                    if (!contentAvailability[i]) continue;\r\n                    const contentURITemplate = contentURITemplates[i];\r\n                    let uri;\r\n                    if (isQuad) {\r\n                        uri = contentURITemplate\r\n                            .replace(\"{level}\", childGlobalAddress.level)\r\n                            .replace(\"{x}\", childGlobalAddress.x)\r\n                            .replace(\"{y}\", childGlobalAddress.y);\r\n                    }\r\n                    if (!isQuad) {\r\n                        uri = contentURITemplate\r\n                            .replace(\"{level}\", childGlobalAddress.level)\r\n                            .replace(\"{x}\", childGlobalAddress.x)\r\n                            .replace(\"{y}\", childGlobalAddress.y)\r\n                            .replace(\"{z}\", childGlobalAddress.z);\r\n                    }\r\n                    contents.push({ uri: uri });\r\n                }\r\n\r\n\r\n                const child = {\r\n                    geometricError: parent.geometricError / 2,\r\n                    boundingVolume: boundingVolumes[i],\r\n                    refine: rootTile.root.refine,\r\n                    globalAddress: childGlobalAddress,\r\n                    localAddress: childLocalAddress,\r\n                    subtree: parent.subtree,\r\n                    contents: contents,\r\n                    getChildren: async () => {\r\n                        return buildChildren(child);\r\n                    }\r\n                }\r\n                children.push(child)\r\n            }\r\n        }\r\n\r\n        return children.length>0?children:undefined;\r\n    }\r\n\r\n}\r\n\r\nfunction getChildrenAddresses(tileAddress) {\r\n    const { level, x, y, z } = tileAddress;\r\n    const nextLevel = level + 1;\r\n    let children = [];\r\n\r\n    if (z === undefined) {\r\n        // Quadtree\r\n        children = [\r\n            { level: nextLevel, x: x * 2, y: y * 2 }, // Bottom left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2 }, // Bottom right\r\n            { level: nextLevel, x: x * 2, y: y * 2 + 1 }, // Top left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2 + 1 }  // Top right\r\n        ];\r\n    } else {\r\n        // Octree\r\n        children = [\r\n            { level: nextLevel, x: x * 2, y: y * 2, z: z * 2 },     // Bottom front left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2, z: z * 2 },     // Bottom front right\r\n            { level: nextLevel, x: x * 2, y: y * 2 + 1, z: z * 2 },     // Bottom back left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2 + 1, z: z * 2 },     // Bottom back right\r\n            { level: nextLevel, x: x * 2, y: y * 2, z: z * 2 + 1 }, // Top front left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2, z: z * 2 + 1 }, // Top front right\r\n            { level: nextLevel, x: x * 2, y: y * 2 + 1, z: z * 2 + 1 }, // Top back left\r\n            { level: nextLevel, x: x * 2 + 1, y: y * 2 + 1, z: z * 2 + 1 }  // Top back right\r\n        ];\r\n    }\r\n\r\n    return children;\r\n}\r\n\r\nfunction getDirectoryUrl(url) {\r\n    const cleanUrl = url.split('?')[0]; // Removes query parameters\r\n    return cleanUrl.substring(0, cleanUrl.lastIndexOf('/') + 1);\r\n};\r\n\r\nfunction computeBoundingVolumes(isQuad, rootBoundingVolume, addresses) {\r\n    const boundingVolumes = [];\r\n    for (let i = 0; i < addresses.length; i++) {\r\n        boundingVolumes.push(computeBoundingVolume(isQuad, rootBoundingVolume, addresses[i]))\r\n    }\r\n    return boundingVolumes;\r\n}\r\n\r\nfunction computeBoundingVolume(isQuad, rootBoundingVolume, address) {\r\n    if (rootBoundingVolume.region) {\r\n        return splitRegion(isQuad, rootBoundingVolume.region, address);\r\n    } else if (rootBoundingVolume.box) {\r\n        return splitBox(isQuad, rootBoundingVolume.box, address);\r\n    } else {\r\n        throw new Error('Unsupported bounding volume type');\r\n    }\r\n}\r\n\r\nfunction splitRegion(isQuad, rootRegion, address) {\r\n    // Destructure the rootRegion for clarity\r\n    const [west, south, east, north, minHeight, maxHeight] = rootRegion;\r\n  \r\n    // Calculate the size of each division step based on the tile's level\r\n    const xStep = (east - west) / (2 ** address.level);\r\n    const yStep = (north - south) / (2 ** address.level);\r\n    const zStep = isQuad ? 0 : (maxHeight - minHeight) / (2 ** address.level);\r\n  \r\n    // Calculate the new bounds for the tile\r\n    const newWest = west + (xStep * address.x);\r\n    const newSouth = south + (yStep * address.y);\r\n    const newEast = newWest + xStep;\r\n    const newNorth = newSouth + yStep;\r\n    \r\n    // For quadtrees, the z dimension remains unchanged. For octrees, calculate new heights.\r\n    const newMinHeight = isQuad ? minHeight : minHeight + (zStep * address.z);\r\n    const newMaxHeight = isQuad ? maxHeight : newMinHeight + zStep;\r\n  \r\n    return {region:[newWest, newSouth, newEast, newNorth, newMinHeight, newMaxHeight]};\r\n  }\r\n\r\n  function splitBox(isQuad, box, address) {\r\n    // Extract center and half-length vectors from the box\r\n    const center = box.slice(0, 3);\r\n    const vectors = [\r\n      box.slice(3, 6),  // First half-length vector\r\n      box.slice(6, 9),  // Second half-length vector\r\n      box.slice(9, 12)  // Third half-length vector\r\n    ];\r\n  \r\n    // Determine scale factors for each axis\r\n    const s = 1/Math.pow(2,address.level);\r\n    const scaleFactors = [s, s, isQuad ? 1 : s];\r\n  \r\n    // Adjust the half-length vectors according to the scale factor\r\n    const newVectors = vectors.map((vector, index) => vector.map(component => component * scaleFactors[index]));\r\n  \r\n    const origin = [center[0]-vectors[0][0]-vectors[1][0]-vectors[2][0], center[1]-vectors[0][1]-vectors[1][1]-vectors[2][1], center[2]-vectors[0][2]-vectors[1][2]-vectors[2][2]]\r\n    // Calculate new center based on the child address\r\n    const newCenter = [\r\n        origin[0] + (address.x*2+1)*(newVectors[0][0]+newVectors[1][0]+newVectors[2][0]),\r\n        origin[1] + (address.y*2+1)*(newVectors[0][1]+newVectors[1][1]+newVectors[2][1]),\r\n        isQuad?center[2]:origin[2] + (address.z*2+1)*(newVectors[0][2]+newVectors[1][2]+newVectors[2][2]),\r\n    ];\r\n  \r\n    // Construct the new box with the updated center and scaled half-length vectors\r\n    const newBox = newCenter.concat(...newVectors);\r\n  \r\n    return {box:newBox};\r\n  }\r\n  \r\n\r\n\r\nexport {\r\n    resolveImplicite\r\n}\r\n","// This file is part of meshoptimizer library and is distributed under the terms of MIT License.\n// Copyright (C) 2016-2025, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)\nvar MeshoptEncoder = (function () {\n\t// Built with clang version 19.1.5-wasi-sdk\n\t// Built from meshoptimizer 0.25\n\tvar wasm =\n\t\t'b9H79Tebbbe9ok9Geueu9Geub9Gbb9Gruuuuuuueu9Gvuuuuueu9Gduueu9Gluuuueu9Gvuuuuub9Gouuuuuub9Gluuuub9GiuuueuiE8AdilveoveovrrwrrrDDoDrbqqbelve9Weiiviebeoweuec;G:Qdkr:PlCo9TW9T9VV95dbH9F9F939H79T9F9J9H229F9Jt9VV7bb8F9TW79O9V9Wt9FW9U9J9V9KW9wWVtW949c919M9MWV9mW4W2be8A9TW79O9V9Wt9FW9U9J9V9KW9wWVtW949c919M9MWVbd8F9TW79O9V9Wt9FW9U9J9V9KW9wWVtW949c919M9MWV9c9V919U9KbiE9TW79O9V9Wt9FW9U9J9V9KW9wWVtW949wWV79P9V9UblY9TW79O9V9Wt9FW9U9J9V9KW69U9KW949c919M9MWVbv8E9TW79O9V9Wt9FW9U9J9V9KW69U9KW949c919M9MWV9c9V919U9Kbo8A9TW79O9V9Wt9FW9U9J9V9KW69U9KW949wWV79P9V9UbrE9TW79O9V9Wt9FW9U9J9V9KW69U9KW949tWG91W9U9JWbwa9TW79O9V9Wt9FW9U9J9V9KW69U9KW949tWG91W9U9JW9c9V919U9KbDL9TW79O9V9Wt9FW9U9J9V9KWS9P2tWV9p9JtbqK9TW79O9V9Wt9FW9U9J9V9KWS9P2tWV9r919HtbkL9TW79O9V9Wt9FW9U9J9V9KWS9P2tWVT949WbxY9TW79O9V9Wt9FW9U9J9V9KWS9P2tWVJ9V29VVbmE9TW79O9V9Wt9F9V9Wt9P9T9P96W9wWVtW94J9H9J9OWbza9TW79O9V9Wt9F9V9Wt9P9T9P96W9wWVtW94J9H9J9OW9ttV9P9WbHa9TW79O9V9Wt9F9V9Wt9P9T9P96W9wWVtW94SWt9J9O9sW9T9H9WbOK9TW79O9V9Wt9F79W9Ht9P9H29t9VVt9sW9T9H9WbAl79IV9RbXDwebcekdKYq;i28Adbk:Bhdhud9:8Jjjjjbc;qw9Rgr8KjjjjbcbhwdnaeTmbabcbyd;C:kjjbaoaocb9iEgDc:GeV86bbarc;adfcbcjdz:xjjjb8AdnaiTmbarc;adfadalz:wjjjb8Akarc;abfalfcbcbcjdal9RalcFe0Ez:xjjjb8Aarc;abfarc;adfalz:wjjjb8AarcUf9cb83ibarc8Wf9cb83ibarcyf9cb83ibarcaf9cb83ibarcKf9cb83ibarczf9cb83ibar9cb83iwar9cb83ibcj;abal9Uc;WFbGcjdalca0Ehqdnaicd6mbavcd9imbaDTmbadcefhkaqci2gxal2hmarc;alfclfhParc;qlfceVhsarc;qofclVhzarc;qofcKfhHarc;qofczfhOcbhAincdhCcbhodnavci6mbaH9cb83ibaO9cb83ibar9cb83i;yoar9cb83i;qoadaAfgoybbhXcbhQincbhwcbhLdninaoalfhKaoybbgYaX7aLVhLawcP0meaKhoaYhXawcefgwaQfai6mbkkcbhXarc;qofhwincwh8AcwhEdnaLaX93gocFeGg3cs0mbclhEa3ci0mba3cb9hcethEkdnaocw4cFeGg3cs0mbclh8Aa3ci0mba3cb9hceth8Aka8AaEfh3awydbh5cwh8AcwhEdnaocz4cFeGg8Ecs0mbclhEa8Eci0mba8Ecb9hcethEka3a5fh3dnaocFFFFb0mbclh8AaocFFF8F0mbaocFFFr0ceth8Akawa3aEfa8AfBdbawclfhwaXcefgXcw9hmbkaKhoaYhXaQczfgQai6mbkcbhocehwazhLinawaoaLydbarc;qofaocdtfydb6EhoaLclfhLawcefgwcw9hmbkcihCkcbh3arc;qlfcbcjdz:xjjjb8Aarc;alfcwfcbBdbar9cb83i;alaoclth8Fadhaaqhhakh5inarc;qlfadcba3cufgoaoa30Eal2falz:wjjjb8Aaiahaiah6Ehgdnaqaia39Ra3aqfai6EgYcsfc9WGgoaY9nmbarc;qofaYfcbaoaY9Rz:xjjjb8Akada3al2fh8Jcbh8Kina8Ka8FVcl4hQarc;alfa8Kcdtfh8LaAh8Mcbh8Nina8NaAfhwdndndndndndna8KPldebidkasa8Mc98GgLfhoa5aLfh8Aarc;qlfawc98GgLfRbbhXcwhwinaoRbbawtaXVhXaocefhoawcwfgwca9hmbkaYTmla8Ncith8Ea8JaLfhEcbhKinaERbbhLcwhoa8AhwinawRbbaotaLVhLawcefhwaocwfgoca9hmbkarc;qofaKfaLaX7aQ93a8E486bba8Aalfh8AaEalfhEaLhXaKcefgKaY9hmbxlkkaYTmia8Mc9:Ghoa8NcitcwGhEarc;qlfawceVfRbbcwtarc;qlfawc9:GfRbbVhLarc;qofhwaghXinawa5aofRbbcwtaaaofRbbVg8AaL9RgLcetaLcztcz91cs47cFFiGaE486bbaoalfhoawcefhwa8AhLa3aXcufgX9hmbxikkaYTmda8Jawfhoarc;qlfawfRbbhLarc;qofhwaghXinawaoRbbg8AaL9RgLcetaLcKtcK91cr4786bbawcefhwaoalfhoa8AhLa3aXcufgX9hmbxdkkaYTmeka8LydbhEcbhKarc;qofhoincdhLcbhwinaLaoawfRbbcb9hfhLawcefgwcz9hmbkclhXcbhwinaXaoawfRbbcd0fhXawcefgwcz9hmbkcwh8Acbhwina8AaoawfRbbcP0fh8Aawcefgwcz9hmbkaLaXaLaX6Egwa8Aawa8A6Egwczawcz6EaEfhEaoczfhoaKczfgKaY6mbka8LaEBdbka8Mcefh8Ma8Ncefg8Ncl9hmbka8Kcefg8KaC9hmbkaaamfhaahaxfhha5amfh5a3axfg3ai6mbkcbhocehwaPhLinawaoaLydbarc;alfaocdtfydb6EhoaLclfhLawcefgXhwaCaX9hmbkaraAcd4fa8FcdVaoaocdSE86bbaAclfgAal6mbkkabaefh8Kabcefhoalcd4gecbaDEhkadcefhOarc;abfceVhHcbhmdndninaiam9nmearc;qofcbcjdz:xjjjb8Aa8Kao9Rak6mdadamal2gwfhxcbh8JaOawfhzaocbakz:xjjjbghakfh5aqaiam9Ramaqfai6Egscsfgocl4cifcd4hCaoc9WGg8LThPindndndndndndndndndndnaDTmbara8Jcd4fRbbgLciGPlbedlbkasTmdaxa8Jfhoarc;abfa8JfRbbhLarc;qofhwashXinawaoRbbg8AaL9RgLcetaLcKtcK91cr4786bbawcefhwaoalfhoa8AhLaXcufgXmbxikkasTmia8JcitcwGhEarc;abfa8JceVfRbbcwtarc;abfa8Jc9:GgofRbbVhLaxaofhoarc;qofhwashXinawao8Vbbg8AaL9RgLcetaLcztcz91cs47cFFiGaE486bbawcefhwaoalfhoa8AhLaXcufgXmbxdkkaHa8Jc98GgEfhoazaEfh8Aarc;abfaEfRbbhXcwhwinaoRbbawtaXVhXaocefhoawcwfgwca9hmbkasTmbaLcl4hYa8JcitcKGh3axaEfhEcbhKinaERbbhLcwhoa8AhwinawRbbaotaLVhLawcefhwaocwfgoca9hmbkarc;qofaKfaLaX7aY93a3486bba8Aalfh8AaEalfhEaLhXaKcefgKas9hmbkkaDmbcbhoxlka8LTmbcbhodninarc;qofaofgwcwf8Pibaw8Pib:e9qTmeaoczfgoa8L9pmdxbkkdnavmbcehoxikcbhEaChKaChYinarc;qofaEfgocwf8Pibhyao8Pibh8PcdhLcbhwinaLaoawfRbbcb9hfhLawcefgwcz9hmbkclhXcbhwinaXaoawfRbbcd0fhXawcefgwcz9hmbkcwh8Acbhwina8AaoawfRbbcP0fh8Aawcefgwcz9hmbkaLaXaLaX6Egoa8Aaoa8A6Egoczaocz6EaYfhYaocucbaya8P:e9cb9sEgwaoaw6EaKfhKaEczfgEa8L9pmdxbkkaha8Jcd4fgoaoRbbcda8JcetcoGtV86bbxikdnaKas6mbaYas6mbaha8Jcd4fgoaoRbbcia8JcetcoGtV86bba8Ka59Ras6mra5arc;qofasz:wjjjbasfh5xikaKaY9phokaha8Jcd4fgwawRbbaoa8JcetcoGtV86bbka8Ka59RaC6mla5cbaCz:xjjjbgAaCfhYdndna8LmbaPhoxekdna8KaY9RcK9pmbaPhoxekaocdtc:q1jjbfcj1jjbaDEg5ydxggcetc;:FFFeGh8Fcuh3cuagtcu7cFeGhacbh8Marc;qofhLinarc;qofa8MfhQczhEdndndnagPDbeeeeeeedekcucbaQcwf8PibaQ8Pib:e9cb9sEhExekcbhoa8FhEinaEaaaLaofRbb9nfhEaocefgocz9hmbkkcih8Ecbh8Ainczhwdndndna5a8AcdtfydbgKPDbeeeeeeedekcucbaQcwf8PibaQ8Pib:e9cb9sEhwxekaKcetc;:FFFeGhwcuaKtcu7cFeGhXcbhoinawaXaLaofRbb9nfhwaocefgocz9hmbkkdndnawaE6mbaKa39hmeawaE9hmea5a8EcdtfydbcwSmeka8Ah8EawhEka8Acefg8Aci9hmbkaAa8Mco4fgoaoRbba8Ea8Mci4coGtV86bbdndndna5a8Ecdtfydbg3PDdbbbbbbbebkdncwa39Tg8ETmbcua3tcu7hwdndna3ceSmbcbh8NaLhQinaQhoa8Eh8AcbhXinaoRbbgEawcFeGgKaEaK6EaXa3tVhXaocefhoa8Acufg8AmbkaYaX86bbaQa8EfhQaYcefhYa8Na8Efg8Ncz6mbxdkkcbh8NaLhQinaQhoa8Eh8AcbhXinaoRbbgEawcFeGgKaEaK6EaXcetVhXaocefhoa8Acufg8AmbkaYaX:T9cFe:d9c:c:qj:bw9:9c:q;c1:I1e:d9c:b:c:e1z9:9ca188bbaQa8EfhQaYcefhYa8Na8Efg8Ncz6mbkkcbhoinaYaLaofRbbgX86bbaYaXawcFeG9pfhYaocefgocz9hmbxikkdna3ceSmbinaYcb86bbaYcefhYxbkkinaYcb86bbaYcefhYxbkkaYaQ8Pbb83bbaYcwfaQcwf8Pbb83bbaYczfhYka8Mczfg8Ma8L9pgomeaLczfhLa8KaY9RcK9pmbkkaoTmlaYh5aYTmlka8Jcefg8Jal9hmbkarc;abfaxascufal2falz:wjjjb8Aasamfhma5hoa5mbkcbhwxdkdna8Kao9RakalfgwcKcaaDEgLawaL0EgX9pmbcbhwxdkdnawaL9pmbaocbaXaw9Rgwz:xjjjbawfhokaoarc;adfalz:wjjjbalfhodnaDTmbaoaraez:wjjjbaefhokaoab9Rhwxekcbhwkarc;qwf8Kjjjjbawk5babaeadaialcdcbyd;C:kjjbz:bjjjbk9reduaecd4gdaefgicaaica0Eabcj;abae9Uc;WFbGcjdaeca0Egifcufai9Uae2aiadfaicl4cifcd4f2fcefkmbcbabBd;C:kjjbk:Ese5u8Jjjjjbc;ae9Rgl8Kjjjjbcbhvdnaici9UgocHfae0mbabcbyd;m:kjjbgrc;GeV86bbalc;abfcFecjez:xjjjb8AalcUfgw9cu83ibalc8WfgD9cu83ibalcyfgq9cu83ibalcafgk9cu83ibalcKfgx9cu83ibalczfgm9cu83ibal9cu83iwal9cu83ibabaefc9WfhPabcefgsaofhednaiTmbcmcsarcb9kgzEhHcbhOcbhAcbhCcbhXcbhQindnaeaP9nmbcbhvxikaQcufhvadaCcdtfgLydbhKaLcwfydbhYaLclfydbh8AcbhEdndndninalc;abfavcsGcitfgoydlh3dndndnaoydbgoaK9hmba3a8ASmekdnaoa8A9hmba3aY9hmbaEcefhExekaoaY9hmea3aK9hmeaEcdfhEkaEc870mdaXcufhvaLaEciGcx2goc;i1jjbfydbcdtfydbh3aLaoc;e1jjbfydbcdtfydbh8AaLaoc;a1jjbfydbcdtfydbhKcbhodnindnalavcsGcdtfydba39hmbaohYxdkcuhYavcufhvaocefgocz9hmbkkaOa3aOSgvaYce9iaYaH9oVgoGfhOdndndncbcsavEaYaoEgvcs9hmbarce9imba3a3aAa3cefaASgvEgAcefSmecmcsavEhvkasavaEcdtc;WeGV86bbavcs9hmea3aA9Rgvcetavc8F917hvinaeavcFb0crtavcFbGV86bbaecefheavcje6hoavcr4hvaoTmbka3hAxvkcPhvasaEcdtcPV86bba3hAkavTmiavaH9omicdhocehEaQhYxlkavcufhvaEclfgEc;ab9hmbkkdnaLceaYaOSceta8AaOSEcx2gvc;a1jjbfydbcdtfydbgKTaLavc;e1jjbfydbcdtfydbg8AceSGaLavc;i1jjbfydbcdtfydbg3cdSGaOcb9hGazGg5ce9hmbaw9cu83ibaD9cu83ibaq9cu83ibak9cu83ibax9cu83ibam9cu83ibal9cu83iwal9cu83ibcbhOkcbhEaXcufgvhodnindnalaocsGcdtfydba8A9hmbaEhYxdkcuhYaocufhoaEcefgEcz9hmbkkcbhodnindnalavcsGcdtfydba39hmbaohExdkcuhEavcufhvaocefgocz9hmbkkaOaKaOSg8EfhLdndnaYcm0mbaYcefhYxekcbcsa8AaLSgvEhYaLavfhLkdndnaEcm0mbaEcefhExekcbcsa3aLSgvEhEaLavfhLkc9:cua8EEh8FcbhvaEaYcltVgacFeGhodndndninavc:W1jjbfRbbaoSmeavcefgvcz9hmbxdkka5aKaO9havcm0VVmbasavc;WeV86bbxekasa8F86bbaeaa86bbaecefhekdna8EmbaKaA9Rgvcetavc8F917hvinaeavcFb0gocrtavcFbGV86bbavcr4hvaecefheaombkaKhAkdnaYcs9hmba8AaA9Rgvcetavc8F917hvinaeavcFb0gocrtavcFbGV86bbavcr4hvaecefheaombka8AhAkdnaEcs9hmba3aA9Rgvcetavc8F917hvinaeavcFb0gocrtavcFbGV86bbavcr4hvaecefheaombka3hAkalaXcdtfaKBdbaXcefcsGhvdndnaYPzbeeeeeeeeeeeeeebekalavcdtfa8ABdbaXcdfcsGhvkdndnaEPzbeeeeeeeeeeeeeebekalavcdtfa3BdbavcefcsGhvkcihoalc;abfaQcitfgEaKBdlaEa8ABdbaQcefcsGhYcdhEavhXaLhOxekcdhoalaXcdtfa3BdbcehEaXcefcsGhXaQhYkalc;abfaYcitfgva8ABdlava3Bdbalc;abfaQaEfcsGcitfgva3BdlavaKBdbascefhsaQaofcsGhQaCcifgCai6mbkkdnaeaP9nmbcbhvxekcbhvinaeavfavc:W1jjbfRbb86bbavcefgvcz9hmbkaeab9Ravfhvkalc;aef8KjjjjbavkZeeucbhddninadcefgdc8F0meceadtae6mbkkadcrfcFeGcr9Uci2cdfabci9U2cHfkmbcbabBd;m:kjjbk:Adewu8Jjjjjbcz9Rhlcbhvdnaicvfae0mbcbhvabcbRb;m:kjjbc;qeV86bbal9cb83iwabcefhoabaefc98fhrdnaiTmbcbhwcbhDindnaoar6mbcbskadaDcdtfydbgqalcwfawaqav9Rgvavc8F91gv7av9Rc507gwcdtfgkydb9Rgvc8E91c9:Gavcdt7awVhvinaoavcFb0gecrtavcFbGV86bbavcr4hvaocefhoaembkakaqBdbaqhvaDcefgDai9hmbkkdnaoar9nmbcbskaocbBbbaoab9RclfhvkavkBeeucbhddninadcefgdc8F0meceadtae6mbkkadcwfcFeGcr9Uab2cvfk:bvli99dui99ludnaeTmbcuadcetcuftcu7:Zhvdndncuaicuftcu7:ZgoJbbbZMgr:lJbbb9p9DTmbar:Ohwxekcjjjj94hwkcbhicbhDinalclfIdbgrJbbbbJbbjZalIdbgq:lar:lMalcwfIdbgk:lMgr:varJbbbb9BEgrNhxaqarNhrdndnakJbbbb9GTmbaxhqxekJbbjZar:l:tgqaq:maxJbbbb9GEhqJbbjZax:l:tgxax:marJbbbb9GEhrkdndnalcxfIdbgxJbbj:;axJbbj:;9GEgkJbbjZakJbbjZ9FEavNJbbbZJbbb:;axJbbbb9GEMgx:lJbbb9p9DTmbax:Ohmxekcjjjj94hmkdndnaqJbbj:;aqJbbj:;9GEgxJbbjZaxJbbjZ9FEaoNJbbbZJbbb:;aqJbbbb9GEMgq:lJbbb9p9DTmbaq:OhPxekcjjjj94hPkdndnarJbbj:;arJbbj:;9GEgqJbbjZaqJbbjZ9FEaoNJbbbZJbbb:;arJbbbb9GEMgr:lJbbb9p9DTmbar:Ohsxekcjjjj94hskdndnadcl9hmbabaifgzas86bbazcifam86bbazcdfaw86bbazcefaP86bbxekabaDfgzas87ebazcofam87ebazclfaw87ebazcdfaP87ebkalczfhlaiclfhiaDcwfhDaecufgembkkk;hlld99eud99eudnaeTmbdndncuaicuftcu7:ZgvJbbbZMgo:lJbbb9p9DTmbao:Ohixekcjjjj94hikaic;8FiGhrinabcofcicdalclfIdb:lalIdb:l9EgialcwfIdb:lalaicdtfIdb:l9EEgialcxfIdb:lalaicdtfIdb:l9EEgiarV87ebdndnJbbj:;JbbjZalaicdtfIdbJbbbb9DEgoalaicd7cdtfIdbJ;Zl:1ZNNgwJbbj:;awJbbj:;9GEgDJbbjZaDJbbjZ9FEavNJbbbZJbbb:;awJbbbb9GEMgw:lJbbb9p9DTmbaw:Ohqxekcjjjj94hqkabcdfaq87ebdndnalaicefciGcdtfIdbJ;Zl:1ZNaoNgwJbbj:;awJbbj:;9GEgDJbbjZaDJbbjZ9FEavNJbbbZJbbb:;awJbbbb9GEMgw:lJbbb9p9DTmbaw:Ohqxekcjjjj94hqkabaq87ebdndnaoalaicufciGcdtfIdbJ;Zl:1ZNNgoJbbj:;aoJbbj:;9GEgwJbbjZawJbbjZ9FEavNJbbbZJbbb:;aoJbbbb9GEMgo:lJbbb9p9DTmbao:Ohixekcjjjj94hikabclfai87ebabcwfhbalczfhlaecufgembkkk;3viDue99eu8Jjjjjbcjd9Rgo8Kjjjjbadcd4hrdndndndnavcd9hmbadcl6meaohwarhDinawc:CuBdbawclfhwaDcufgDmbkaeTmiadcl6mdarcdthqalhkcbhxinaohwakhDarhminawawydbgPcbaDIdbgs:8cL4cFeGc:cufasJbbbb9BEgzaPaz9kEBdbaDclfhDawclfhwamcufgmmbkakaqfhkaxcefgxaeSmixbkkaeTmdxekaeTmekarcdthkavce9hhqadcl6hdcbhxindndndnaqmbadmdc:CuhDalhwarhminaDcbawIdbgs:8cL4cFeGc:cufasJbbbb9BEgPaDaP9kEhDawclfhwamcufgmmbxdkkc:CuhDdndnavPleddbdkadmdaohwalhmarhPinawcbamIdbgs:8cL4cFeGgzc;:bazc;:b0Ec:cufasJbbbb9BEBdbamclfhmawclfhwaPcufgPmbxdkkadmecbhwarhminaoawfcbalawfIdbgs:8cL4cFeGgPc8AaPc8A0Ec:cufasJbbbb9BEBdbawclfhwamcufgmmbkkadmbcbhwarhPinaDhmdnavceSmbaoawfydbhmkdndnalawfIdbgscjjj;8iamai9RcefgmcLt9R::NJbbbZJbbb:;asJbbbb9GEMgs:lJbbb9p9DTmbas:Ohzxekcjjjj94hzkabawfazcFFFrGamcKtVBdbawclfhwaPcufgPmbkkabakfhbalakfhlaxcefgxae9hmbkkaocjdf8Kjjjjbk:Ylvdud99due99iudnaeTmbceaicufgvthocuaitcu7:Zhrcuavtcu7:Zhwcbhvadcl9hhDcbhqindndnalcwfIdbgkJbbbbakJbbbb9GEgkJbbjZakJbbjZ9FEarNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikdndnalIdbgkJbbbbakJbbbb9GEgkJbbjZakJbbjZ9FEarNJbbbZMgk:lJbbb9p9DTmbak:Ohdxekcjjjj94hdkadai9Rcd9TgxaifhidndnalclfIdbgkJbbbbakJbbbb9GEgkJbbjZakJbbjZ9FEarNJbbbZMgk:lJbbb9p9DTmbak:Ohdxekcjjjj94hdkadai9Rcd9ThddndnalcxfIdbgkJbbbbakJbbbb9GEgkJbbjZakJbbjZ9FEawNJbbbZMgk:lJbbb9p9DTmbak:Ohmxekcjjjj94hmkadaifhiaoamVhmdndnaDmbabavfgPai86bbaPcifam86bbaPcdfad86bbaPcefax86bbxekabaqfgPai87ebaPcofam87ebaPclfad87ebaPcdfax87ebkalczfhlavclfhvaqcwfhqaecufgembkkk;YqdXui998Jjjjjbc:qd9Rgv8Kjjjjbavc:Sefcbc;Kbz:xjjjb8AcbhodnadTmbcbhoaiTmbdndnabaeSmbaehrxekavcuadcdtgwadcFFFFi0Ecbyd;q:kjjbHjjjjbbgrBd:SeavceBd:mdaraeawz:wjjjb8Akavc:GefcwfcbBdbav9cb83i:Geavc:Gefaradaiavc:Sefz:pjjjbavyd:GehDadci9Ugqcbyd;q:kjjbHjjjjbbheavc:Sefavyd:mdgkcdtfaeBdbavakcefgwBd:mdaecbaqz:xjjjbhxavc:SefawcdtfcuaicdtaicFFFFi0Ecbyd;q:kjjbHjjjjbbgmBdbavakcdfgPBd:mdalc;ebfhsaDheamhwinawalIdbasaeydbgzcwazcw6EcdtfIdbMUdbaeclfheawclfhwaicufgimbkavc:SefaPcdtfcuaqcdtadcFFFF970Ecbyd;q:kjjbHjjjjbbgPBdbdnadci6mbarheaPhwaqhiinawamaeydbcdtfIdbamaeclfydbcdtfIdbMamaecwfydbcdtfIdbMUdbaecxfheawclfhwaicufgimbkkakcifhoalc;ebfhHavc;qbfhOavheavyd:KehAavyd:OehCcbhzcbhwcbhXcehQinaehLcihkarawci2gKcdtfgeydbhsaeclfydbhdabaXcx2fgicwfaecwfydbgYBdbaiclfadBdbaiasBdbaxawfce86bbaOaYBdwaOadBdlaOasBdbaPawcdtfcbBdbdnazTmbcihkaLhiinaOakcdtfaiydbgeBdbakaeaY9haeas9haead9hGGfhkaiclfhiazcufgzmbkkaXcefhXcbhzinaCaAarazaKfcdtfydbcdtgifydbcdtfgYheaDaifgdydbgshidnasTmbdninaeydbawSmeaeclfheaicufgiTmdxbkkaeaYascdtfc98fydbBdbadadydbcufBdbkazcefgzci9hmbkdndnakTmbcuhwJbbbbh8Acbhdavyd:KehYavyd:OehKindndnaDaOadcdtfydbcdtgzfydbgembadcefhdxekadcs0hiamazfgsIdbhEasalcbadcefgdaiEcdtfIdbaHaecwaecw6EcdtfIdbMg3Udba3aE:th3aecdthiaKaYazfydbcdtfheinaPaeydbgzcdtfgsa3asIdbMgEUdbaEa8Aa8AaE9DgsEh8AazawasEhwaeclfheaic98fgimbkkadak9hmbkawcu9hmekaQaq9pmdindnaxaQfRbbmbaQhwxdkaqaQcefgQ9hmbxikkakczakcz6EhzaOheaLhOawcu9hmbkkaocdtavc:Seffc98fhedninaoTmeaeydbcbyd;u:kjjbH:bjjjbbaec98fheaocufhoxbkkavc:qdf8Kjjjjbk;IlevucuaicdtgvaicFFFFi0Egocbyd;q:kjjbHjjjjbbhralalyd9GgwcdtfarBdbalawcefBd9GabarBdbaocbyd;q:kjjbHjjjjbbhralalyd9GgocdtfarBdbalaocefBd9GabarBdlcuadcdtadcFFFFi0Ecbyd;q:kjjbHjjjjbbhralalyd9GgocdtfarBdbalaocefBd9GabarBdwabydbcbavz:xjjjb8Aadci9UhDdnadTmbabydbhoaehladhrinaoalydbcdtfgvavydbcefBdbalclfhlarcufgrmbkkdnaiTmbabydbhlabydlhrcbhvaihoinaravBdbarclfhralydbavfhvalclfhlaocufgombkkdnadci6mbabydlhrabydwhvcbhlinaecwfydbhoaeclfydbhdaraeydbcdtfgwawydbgwcefBdbavawcdtfalBdbaradcdtfgdadydbgdcefBdbavadcdtfalBdbaraocdtfgoaoydbgocefBdbavaocdtfalBdbaecxfheaDalcefgl9hmbkkdnaiTmbabydlheabydbhlinaeaeydbalydb9RBdbalclfhlaeclfheaicufgimbkkkQbabaeadaic;K1jjbz:ojjjbkQbabaeadaic;m:jjjbz:ojjjbk9DeeuabcFeaicdtz:xjjjbhlcbhbdnadTmbindnalaeydbcdtfgiydbcu9hmbaiabBdbabcefhbkaeclfheadcufgdmbkkabk:Vvioud9:du8Jjjjjbc;Wa9Rgl8Kjjjjbcbhvalcxfcbc;Kbz:xjjjb8AalcuadcitgoadcFFFFe0Ecbyd;q:kjjbHjjjjbbgrBdxalceBd2araeadaicezNjjjbalcuaoadcjjjjoGEcbyd;q:kjjbHjjjjbbgwBdzadcdthednadTmbabhiinaiavBdbaiclfhiadavcefgv9hmbkkawaefhDalabBdwalawBdl9cbhqindnadTmbaq9cq9:hkarhvaDhiadheinaiav8Pibak1:NcFrG87ebavcwfhvaicdfhiaecufgembkkalclfaq:NceGcdtfydbhxalclfaq9ce98gq:NceGcdtfydbhmalc;Wbfcbcjaz:xjjjb8AaDhvadhidnadTmbinalc;Wbfav8VebcdtfgeaeydbcefBdbavcdfhvaicufgimbkkcbhvcbhiinalc;WbfavfgeydbhoaeaiBdbaoaifhiavclfgvcja9hmbkadhvdndnadTmbinalc;WbfaDamydbgicetf8VebcdtfgeaeydbgecefBdbaxaecdtfaiBdbamclfhmavcufgvmbkaq9cv9smdcbhvinabawydbcdtfavBdbawclfhwadavcefgv9hmbxdkkaq9cv9smekkclhvdninavc98Smealcxfavfydbcbyd;u:kjjbH:bjjjbbavc98fhvxbkkalc;Waf8Kjjjjbk:Jwliuo99iud9:cbhv8Jjjjjbca9Rgoczfcwfcbyd:8:kjjbBdbaocb8Pd:0:kjjb83izaocwfcbyd;i:kjjbBdbaocb8Pd;a:kjjb83ibaicd4hrdndnadmbJFFuFhwJFFuuhDJFFuuhqJFFuFhkJFFuuhxJFFuFhmxekarcdthPaehsincbhiinaoczfaifgzasaifIdbgwazIdbgDaDaw9EEUdbaoaifgzawazIdbgDaDaw9DEUdbaiclfgicx9hmbkasaPfhsavcefgvad9hmbkaoIdKhDaoIdwhwaoIdChqaoIdlhkaoIdzhxaoIdbhmkdnadTmbJbbbbJbFu9hJbbbbamax:tgmamJbbbb9DEgmakaq:tgkakam9DEgkawaD:tgwawak9DEgw:vawJbbbb9BEhwdnalmbarcdthoindndnaeclfIdbaq:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikai:S9cC:ghHdndnaeIdbax:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikaHai:S:ehHdndnaecwfIdbaD:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikabaHai:T9cy:g:e83ibaeaofheabcwfhbadcufgdmbxdkkarcdthoindndnaeIdbax:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikai:SgH9ca:gaH9cz:g9cjjj;4s:d:eaH9cFe:d:e9cF:bj;4:pj;ar:d9c:bd9:9c:p;G:d;4j:E;ar:d9cH9:9c;d;H:W:y:m:g;d;Hb:d9cv9:9c;j:KM;j:KM;j:Kd:dhOdndnaeclfIdbaq:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikai:SgH9ca:gaH9cz:g9cjjj;4s:d:eaH9cFe:d:e9cF:bj;4:pj;ar:d9c:bd9:9c:p;G:d;4j:E;ar:d9cH9:9c;d;H:W:y:m:g;d;Hb:d9cq9:9cM;j:KM;j:KM;jl:daO:ehOdndnaecwfIdbaD:tawNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikabaOai:SgH9ca:gaH9cz:g9cjjj;4s:d:eaH9cFe:d:e9cF:bj;4:pj;ar:d9c:bd9:9c:p;G:d;4j:E;ar:d9cH9:9c;d;H:W:y:m:g;d;Hb:d9cC9:9c:KM;j:KM;j:KMD:d:e83ibaeaofheabcwfhbadcufgdmbkkk9teiucbcbyd;y:kjjbgeabcifc98GfgbBd;y:kjjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik;teeeudndnaeabVciGTmbabhixekdndnadcz9pmbabhixekabhiinaiaeydbBdbaiaeydlBdlaiaeydwBdwaiaeydxBdxaeczfheaiczfhiadc9Wfgdcs0mbkkadcl6mbinaiaeydbBdbaeclfheaiclfhiadc98fgdci0mbkkdnadTmbinaiaeRbb86bbaicefhiaecefheadcufgdmbkkabk:3eedudndnabciGTmbabhixekaecFeGc:b:c:ew2hldndnadcz9pmbabhixekabhiinaialBdxaialBdwaialBdlaialBdbaiczfhiadc9Wfgdcs0mbkkadcl6mbinaialBdbaiclfhiadc98fgdci0mbkkdnadTmbinaiae86bbaicefhiadcufgdmbkkabk9teiucbcbyd;y:kjjbgeabcrfc94GfgbBd;y:kjjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik9:eiuZbhedndncbyd;y:kjjbgdaecztgi9nmbcuheadai9RcFFifcz4nbcuSmekadhekcbabae9Rcifc98Gcbyd;y:kjjbfgdBd;y:kjjbdnadZbcztge9nmbadae9RcFFifcz4nb8Akkk;Qddbcjwk;mdbbbbdbbblbbbwbbbbbbbebbbdbbblbbbwbbbbbbbbbbbbbbbb4:h9w9N94:P:gW:j9O:ye9Pbbbbbbebbbdbbbebbbdbbbbbbbdbbbbbbbebbbbbbb:l29hZ;69:9kZ;N;76Z;rg97Z;z;o9xZ8J;B85Z;:;u9yZ;b;k9HZ:2;Z9DZ9e:l9mZ59A8KZ:r;T3Z:A:zYZ79OHZ;j4::8::Y:D9V8:bbbb9s:49:Z8R:hBZ9M9M;M8:L;z;o8:;8:PG89q;x:J878R:hQ8::M:B;e87bbbbbbjZbbjZbbjZ:E;V;N8::Y:DsZ9i;H;68:xd;R8:;h0838:;W:NoZbbbb:WV9O8:uf888:9i;H;68:9c9G;L89;n;m9m89;D8Ko8:bbbbf:8tZ9m836ZS:2AZL;zPZZ818EZ9e:lxZ;U98F8:819E;68:FFuuFFuuFFuuFFuFFFuFFFuFbc;mqkzebbbebbbdbbb9G:vbb'; // embed! wasm\n\n\tvar wasmpack = new Uint8Array([\n\t\t32, 0, 65, 2, 1, 106, 34, 33, 3, 128, 11, 4, 13, 64, 6, 253, 10, 7, 15, 116, 127, 5, 8, 12, 40, 16, 19, 54, 20, 9, 27, 255, 113, 17, 42, 67,\n\t\t24, 23, 146, 148, 18, 14, 22, 45, 70, 69, 56, 114, 101, 21, 25, 63, 75, 136, 108, 28, 118, 29, 73, 115,\n\t]);\n\n\tif (typeof WebAssembly !== 'object') {\n\t\treturn {\n\t\t\tsupported: false,\n\t\t};\n\t}\n\n\tvar instance;\n\n\tvar ready = WebAssembly.instantiate(unpack(wasm), {}).then(function (result) {\n\t\tinstance = result.instance;\n\t\tinstance.exports.__wasm_call_ctors();\n\t\tinstance.exports.meshopt_encodeVertexVersion(0);\n\t\tinstance.exports.meshopt_encodeIndexVersion(1);\n\t});\n\n\tfunction unpack(data) {\n\t\tvar result = new Uint8Array(data.length);\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tvar ch = data.charCodeAt(i);\n\t\t\tresult[i] = ch > 96 ? ch - 97 : ch > 64 ? ch - 39 : ch + 4;\n\t\t}\n\t\tvar write = 0;\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tresult[write++] = result[i] < 60 ? wasmpack[result[i]] : (result[i] - 60) * 64 + result[++i];\n\t\t}\n\t\treturn result.buffer.slice(0, write);\n\t}\n\n\tfunction assert(cond) {\n\t\tif (!cond) {\n\t\t\tthrow new Error('Assertion failed');\n\t\t}\n\t}\n\n\tfunction bytes(view) {\n\t\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t}\n\n\tfunction reorder(fun, indices, vertices, optf) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar ip = sbrk(indices.length * 4);\n\t\tvar rp = sbrk(vertices * 4);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar indices8 = bytes(indices);\n\t\theap.set(indices8, ip);\n\t\tif (optf) {\n\t\t\toptf(ip, ip, indices.length, vertices);\n\t\t}\n\t\tvar unique = fun(rp, ip, indices.length, vertices);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar remap = new Uint32Array(vertices);\n\t\tnew Uint8Array(remap.buffer).set(heap.subarray(rp, rp + vertices * 4));\n\t\tindices8.set(heap.subarray(ip, ip + indices.length * 4));\n\t\tsbrk(ip - sbrk(0));\n\n\t\tfor (var i = 0; i < indices.length; ++i) indices[i] = remap[indices[i]];\n\n\t\treturn [remap, unique];\n\t}\n\n\tfunction spatialsort(fun, positions, count, stride) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar ip = sbrk(count * 4);\n\t\tvar sp = sbrk(count * stride);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(positions), sp);\n\t\tfun(ip, sp, count, stride);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar remap = new Uint32Array(count);\n\t\tnew Uint8Array(remap.buffer).set(heap.subarray(ip, ip + count * 4));\n\t\tsbrk(ip - sbrk(0));\n\t\treturn remap;\n\t}\n\n\tfunction encode(fun, bound, source, count, size, level, version) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar tp = sbrk(bound);\n\t\tvar sp = sbrk(count * size);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(source), sp);\n\t\tvar res = fun(tp, bound, sp, count, size, level, version);\n\t\tvar target = new Uint8Array(res);\n\t\ttarget.set(heap.subarray(tp, tp + res));\n\t\tsbrk(tp - sbrk(0));\n\t\treturn target;\n\t}\n\n\tfunction maxindex(source) {\n\t\tvar result = 0;\n\t\tfor (var i = 0; i < source.length; ++i) {\n\t\t\tvar index = source[i];\n\t\t\tresult = result < index ? index : result;\n\t\t}\n\t\treturn result;\n\t}\n\n\tfunction index32(source, size) {\n\t\tassert(size == 2 || size == 4);\n\t\tif (size == 4) {\n\t\t\treturn new Uint32Array(source.buffer, source.byteOffset, source.byteLength / 4);\n\t\t} else {\n\t\t\tvar view = new Uint16Array(source.buffer, source.byteOffset, source.byteLength / 2);\n\t\t\treturn new Uint32Array(view); // copies each element\n\t\t}\n\t}\n\n\tfunction filter(fun, source, count, stride, bits, insize, mode) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar tp = sbrk(count * stride);\n\t\tvar sp = sbrk(count * insize);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(source), sp);\n\t\tfun(tp, count, stride, bits, sp, mode);\n\t\tvar target = new Uint8Array(count * stride);\n\t\ttarget.set(heap.subarray(tp, tp + count * stride));\n\t\tsbrk(tp - sbrk(0));\n\t\treturn target;\n\t}\n\n\treturn {\n\t\tready: ready,\n\t\tsupported: true,\n\t\treorderMesh: function (indices, triangles, optsize) {\n\t\t\tvar optf = triangles\n\t\t\t\t? optsize\n\t\t\t\t\t? instance.exports.meshopt_optimizeVertexCacheStrip\n\t\t\t\t\t: instance.exports.meshopt_optimizeVertexCache\n\t\t\t\t: undefined;\n\t\t\treturn reorder(instance.exports.meshopt_optimizeVertexFetchRemap, indices, maxindex(indices) + 1, optf);\n\t\t},\n\t\treorderPoints: function (positions, positions_stride) {\n\t\t\tassert(positions instanceof Float32Array);\n\t\t\tassert(positions.length % positions_stride == 0);\n\t\t\tassert(positions_stride >= 3);\n\t\t\treturn spatialsort(instance.exports.meshopt_spatialSortRemap, positions, positions.length / positions_stride, positions_stride * 4);\n\t\t},\n\t\tencodeVertexBuffer: function (source, count, size) {\n\t\t\tassert(size > 0 && size <= 256);\n\t\t\tassert(size % 4 == 0);\n\t\t\tvar bound = instance.exports.meshopt_encodeVertexBufferBound(count, size);\n\t\t\treturn encode(instance.exports.meshopt_encodeVertexBuffer, bound, source, count, size);\n\t\t},\n\t\tencodeVertexBufferLevel: function (source, count, size, level, version) {\n\t\t\tassert(size > 0 && size <= 256);\n\t\t\tassert(size % 4 == 0);\n\t\t\tassert(level >= 0 && level <= 3);\n\t\t\tassert(version === undefined || version == 0 || version == 1);\n\t\t\tvar bound = instance.exports.meshopt_encodeVertexBufferBound(count, size);\n\t\t\treturn encode(instance.exports.meshopt_encodeVertexBufferLevel, bound, source, count, size, level, version || 0);\n\t\t},\n\t\tencodeIndexBuffer: function (source, count, size) {\n\t\t\tassert(size == 2 || size == 4);\n\t\t\tassert(count % 3 == 0);\n\t\t\tvar indices = index32(source, size);\n\t\t\tvar bound = instance.exports.meshopt_encodeIndexBufferBound(count, maxindex(indices) + 1);\n\t\t\treturn encode(instance.exports.meshopt_encodeIndexBuffer, bound, indices, count, 4);\n\t\t},\n\t\tencodeIndexSequence: function (source, count, size) {\n\t\t\tassert(size == 2 || size == 4);\n\t\t\tvar indices = index32(source, size);\n\t\t\tvar bound = instance.exports.meshopt_encodeIndexSequenceBound(count, maxindex(indices) + 1);\n\t\t\treturn encode(instance.exports.meshopt_encodeIndexSequence, bound, indices, count, 4);\n\t\t},\n\t\tencodeGltfBuffer: function (source, count, size, mode) {\n\t\t\tvar table = {\n\t\t\t\tATTRIBUTES: this.encodeVertexBuffer,\n\t\t\t\tTRIANGLES: this.encodeIndexBuffer,\n\t\t\t\tINDICES: this.encodeIndexSequence,\n\t\t\t};\n\t\t\tassert(table[mode]);\n\t\t\treturn table[mode](source, count, size);\n\t\t},\n\t\tencodeFilterOct: function (source, count, stride, bits) {\n\t\t\tassert(stride == 4 || stride == 8);\n\t\t\tassert(bits >= 1 && bits <= 16);\n\t\t\treturn filter(instance.exports.meshopt_encodeFilterOct, source, count, stride, bits, 16);\n\t\t},\n\t\tencodeFilterQuat: function (source, count, stride, bits) {\n\t\t\tassert(stride == 8);\n\t\t\tassert(bits >= 4 && bits <= 16);\n\t\t\treturn filter(instance.exports.meshopt_encodeFilterQuat, source, count, stride, bits, 16);\n\t\t},\n\t\tencodeFilterExp: function (source, count, stride, bits, mode) {\n\t\t\tassert(stride > 0 && stride % 4 == 0);\n\t\t\tassert(bits >= 1 && bits <= 24);\n\t\t\tvar table = {\n\t\t\t\tSeparate: 0,\n\t\t\t\tSharedVector: 1,\n\t\t\t\tSharedComponent: 2,\n\t\t\t\tClamped: 3,\n\t\t\t};\n\t\t\treturn filter(instance.exports.meshopt_encodeFilterExp, source, count, stride, bits, stride, mode ? table[mode] : 1);\n\t\t},\n\t\tencodeFilterColor: function (source, count, stride, bits) {\n\t\t\tassert(stride == 4 || stride == 8);\n\t\t\tassert(bits >= 2 && bits <= 16);\n\t\t\treturn filter(instance.exports.meshopt_encodeFilterColor, source, count, stride, bits, 16);\n\t\t},\n\t};\n})();\n\nexport { MeshoptEncoder };\n","// This file is part of meshoptimizer library and is distributed under the terms of MIT License.\n// Copyright (C) 2016-2025, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)\nvar MeshoptDecoder = (function () {\n\t// Built with clang version 19.1.5-wasi-sdk\n\t// Built from meshoptimizer 0.25\n\tvar wasm_base =\n\t\t'b9H79Tebbbe8Fv9Gbb9Gvuuuuueu9Giuuub9Geueu9Giuuueuixkbeeeddddillviebeoweuec:W:Odkr;Neqo9TW9T9VV95dbH9F9F939H79T9F9J9H229F9Jt9VV7bb8A9TW79O9V9Wt9F9KW9J9V9KW9wWVtW949c919M9MWVbeY9TW79O9V9Wt9F9KW9J9V9KW69U9KW949c919M9MWVbdE9TW79O9V9Wt9F9KW9J9V9KW69U9KW949tWG91W9U9JWbiL9TW79O9V9Wt9F9KW9J9V9KWS9P2tWV9p9JtblK9TW79O9V9Wt9F9KW9J9V9KWS9P2tWV9r919HtbvL9TW79O9V9Wt9F9KW9J9V9KWS9P2tWVT949WboY9TW79O9V9Wt9F9KW9J9V9KWS9P2tWVJ9V29VVbrl79IV9Rbwq;BZkdbk;jYi5ud9:du8Jjjjjbcj;kb9Rgv8Kjjjjbc9:hodnalTmbcuhoaiRbbgrc;WeGc:Ge9hmbarcsGgwce0mbc9:hoalcufadcd4cbawEgDadfgrcKcaawEgqaraq0Egk6mbaicefhxcj;abad9Uc;WFbGcjdadca0EhmaialfgPar9Rgoadfhsavaoadz:jjjjbgzceVhHcbhOdndninaeaO9nmeaPax9RaD6mdamaeaO9RaOamfgoae6EgAcsfglc9WGhCabaOad2fhXaAcethQaxaDfhiaOaeaoaeao6E9RhLalcl4cifcd4hKazcj;cbfaAfhYcbh8AazcjdfhEaHh3incbhodnawTmbaxa8Acd4fRbbhokaocFeGh5cbh8Eazcj;cbfhqinaih8Fdndndndna5a8Ecet4ciGgoc9:fPdebdkaPa8F9RaA6mrazcj;cbfa8EaA2fa8FaAz:jjjjb8Aa8FaAfhixdkazcj;cbfa8EaA2fcbaAz:kjjjb8Aa8FhixekaPa8F9RaK6mva8FaKfhidnaCTmbaPai9RcK6mbaocdtc:q1jjbfcj1jjbawEhaczhrcbhlinargoc9Wfghaqfhrdndndndndndnaaa8Fahco4fRbbalcoG4ciGcdtfydbPDbedvivvvlvkar9cb83bbarcwf9cb83bbxlkarcbaiRbdai8Xbb9c:c:qj:bw9:9c:q;c1:I1e:d9c:b:c:e1z9:gg9cjjjjjz:dg8J9qE86bbaqaofgrcGfag9c8F1:NghcKtc8F91aicdfa8J9c8N1:Nfg8KRbbG86bbarcVfcba8KahcjeGcr4fghRbbag9cjjjjjl:dg8J9qE86bbarc7fcbaha8J9c8L1:NfghRbbag9cjjjjjd:dg8J9qE86bbarctfcbaha8J9c8K1:NfghRbbag9cjjjjje:dg8J9qE86bbarc91fcbaha8J9c8J1:NfghRbbag9cjjjj;ab:dg8J9qE86bbarc4fcbaha8J9cg1:NfghRbbag9cjjjja:dg8J9qE86bbarc93fcbaha8J9ch1:NfghRbbag9cjjjjz:dgg9qE86bbarc94fcbahag9ca1:NfghRbbai8Xbe9c:c:qj:bw9:9c:q;c1:I1e:d9c:b:c:e1z9:gg9cjjjjjz:dg8J9qE86bbarc95fag9c8F1:NgicKtc8F91aha8J9c8N1:NfghRbbG86bbarc96fcbahaicjeGcr4fgiRbbag9cjjjjjl:dg8J9qE86bbarc97fcbaia8J9c8L1:NfgiRbbag9cjjjjjd:dg8J9qE86bbarc98fcbaia8J9c8K1:NfgiRbbag9cjjjjje:dg8J9qE86bbarc99fcbaia8J9c8J1:NfgiRbbag9cjjjj;ab:dg8J9qE86bbarc9:fcbaia8J9cg1:NfgiRbbag9cjjjja:dg8J9qE86bbarcufcbaia8J9ch1:NfgiRbbag9cjjjjz:dgg9qE86bbaiag9ca1:NfhixikaraiRblaiRbbghco4g8Ka8KciSg8KE86bbaqaofgrcGfaiclfa8Kfg8KRbbahcl4ciGg8La8LciSg8LE86bbarcVfa8Ka8Lfg8KRbbahcd4ciGg8La8LciSg8LE86bbarc7fa8Ka8Lfg8KRbbahciGghahciSghE86bbarctfa8Kahfg8KRbbaiRbeghco4g8La8LciSg8LE86bbarc91fa8Ka8Lfg8KRbbahcl4ciGg8La8LciSg8LE86bbarc4fa8Ka8Lfg8KRbbahcd4ciGg8La8LciSg8LE86bbarc93fa8Ka8Lfg8KRbbahciGghahciSghE86bbarc94fa8Kahfg8KRbbaiRbdghco4g8La8LciSg8LE86bbarc95fa8Ka8Lfg8KRbbahcl4ciGg8La8LciSg8LE86bbarc96fa8Ka8Lfg8KRbbahcd4ciGg8La8LciSg8LE86bbarc97fa8Ka8Lfg8KRbbahciGghahciSghE86bbarc98fa8KahfghRbbaiRbigico4g8Ka8KciSg8KE86bbarc99faha8KfghRbbaicl4ciGg8Ka8KciSg8KE86bbarc9:faha8KfghRbbaicd4ciGg8Ka8KciSg8KE86bbarcufaha8KfgrRbbaiciGgiaiciSgiE86bbaraifhixdkaraiRbwaiRbbghcl4g8Ka8KcsSg8KE86bbaqaofgrcGfaicwfa8Kfg8KRbbahcsGghahcsSghE86bbarcVfa8KahfghRbbaiRbeg8Kcl4g8La8LcsSg8LE86bbarc7faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarctfaha8KfghRbbaiRbdg8Kcl4g8La8LcsSg8LE86bbarc91faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarc4faha8KfghRbbaiRbig8Kcl4g8La8LcsSg8LE86bbarc93faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarc94faha8KfghRbbaiRblg8Kcl4g8La8LcsSg8LE86bbarc95faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarc96faha8KfghRbbaiRbvg8Kcl4g8La8LcsSg8LE86bbarc97faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarc98faha8KfghRbbaiRbog8Kcl4g8La8LcsSg8LE86bbarc99faha8LfghRbba8KcsGg8Ka8KcsSg8KE86bbarc9:faha8KfghRbbaiRbrgicl4g8Ka8KcsSg8KE86bbarcufaha8KfgrRbbaicsGgiaicsSgiE86bbaraifhixekarai8Pbb83bbarcwfaicwf8Pbb83bbaiczfhikdnaoaC9pmbalcdfhlaoczfhraPai9RcL0mekkaoaC6moaimexokaCmva8FTmvkaqaAfhqa8Ecefg8Ecl9hmbkdndndndnawTmbasa8Acd4fRbbgociGPlbedrbkaATmdaza8Afh8Fazcj;cbfhhcbh8EaEhaina8FRbbhraahocbhlinaoahalfRbbgqce4cbaqceG9R7arfgr86bbaoadfhoaAalcefgl9hmbkaacefhaa8Fcefh8FahaAfhha8Ecefg8Ecl9hmbxikkaATmeaza8Afhaazcj;cbfhhcbhoceh8EaYh8FinaEaofhlaa8Vbbhrcbhoinala8FaofRbbcwtahaofRbbgqVc;:FiGce4cbaqceG9R7arfgr87bbaladfhlaLaocefgofmbka8FaQfh8FcdhoaacdfhaahaQfhha8EceGhlcbh8EalmbxdkkaATmbcbaocl49Rh8Eaza8AfRbbhqcwhoa3hlinalRbbaotaqVhqalcefhlaocwfgoca9hmbkcbhhaEh8FaYhainazcj;cbfahfRbbhrcwhoaahlinalRbbaotarVhralaAfhlaocwfgoca9hmbkara8E93aq7hqcbhoa8Fhlinalaqao486bbalcefhlaocwfgoca9hmbka8Fadfh8FaacefhaahcefghaA9hmbkkaEclfhEa3clfh3a8Aclfg8Aad6mbkaXazcjdfaAad2z:jjjjb8AazazcjdfaAcufad2fadz:jjjjb8AaAaOfhOaihxaimbkc9:hoxdkcbc99aPax9RakSEhoxekc9:hokavcj;kbf8Kjjjjbaok:XseHu8Jjjjjbc;ae9Rgv8Kjjjjbc9:hodnaeci9UgrcHfal0mbcuhoaiRbbgwc;WeGc;Ge9hmbawcsGgDce0mbavc;abfcFecjez:kjjjb8AavcUf9cu83ibavc8Wf9cu83ibavcyf9cu83ibavcaf9cu83ibavcKf9cu83ibavczf9cu83ibav9cu83iwav9cu83ibaialfc9WfhqaicefgwarfhldnaeTmbcmcsaDceSEhkcbhxcbhmcbhrcbhicbhoindnalaq9nmbc9:hoxikdndnawRbbgDc;Ve0mbavc;abfaoaDcu7gPcl4fcsGcitfgsydlhzasydbhHdndnaDcsGgsak9pmbavaiaPfcsGcdtfydbaxasEhDaxasTgOfhxxekdndnascsSmbcehOasc987asamffcefhDxekalcefhDal8SbbgscFeGhPdndnascu9mmbaDhlxekalcvfhlaPcFbGhPcrhsdninaD8SbbgOcFbGastaPVhPaOcu9kmeaDcefhDascrfgsc8J9hmbxdkkaDcefhlkcehOaPce4cbaPceG9R7amfhDkaDhmkavc;abfaocitfgsaDBdbasazBdlavaicdtfaDBdbavc;abfaocefcsGcitfgsaHBdbasaDBdlaocdfhoaOaifhidnadcd9hmbabarcetfgsaH87ebasclfaD87ebascdfaz87ebxdkabarcdtfgsaHBdbascwfaDBdbasclfazBdbxekdnaDcpe0mbaxcefgOavaiaqaDcsGfRbbgscl49RcsGcdtfydbascz6gPEhDavaias9RcsGcdtfydbaOaPfgzascsGgOEhsaOThOdndnadcd9hmbabarcetfgHax87ebaHclfas87ebaHcdfaD87ebxekabarcdtfgHaxBdbaHcwfasBdbaHclfaDBdbkavaicdtfaxBdbavc;abfaocitfgHaDBdbaHaxBdlavaicefgicsGcdtfaDBdbavc;abfaocefcsGcitfgHasBdbaHaDBdlavaiaPfgicsGcdtfasBdbavc;abfaocdfcsGcitfgDaxBdbaDasBdlaocifhoaiaOfhiazaOfhxxekaxcbalRbbgHEgAaDc;:eSgDfhzaHcsGhCaHcl4hXdndnaHcs0mbazcefhOxekazhOavaiaX9RcsGcdtfydbhzkdndnaCmbaOcefhxxekaOhxavaiaH9RcsGcdtfydbhOkdndnaDTmbalcefhDxekalcdfhDal8SbegPcFeGhsdnaPcu9kmbalcofhAascFbGhscrhldninaD8SbbgPcFbGaltasVhsaPcu9kmeaDcefhDalcrfglc8J9hmbkaAhDxekaDcefhDkasce4cbasceG9R7amfgmhAkdndnaXcsSmbaDhsxekaDcefhsaD8SbbglcFeGhPdnalcu9kmbaDcvfhzaPcFbGhPcrhldninas8SbbgDcFbGaltaPVhPaDcu9kmeascefhsalcrfglc8J9hmbkazhsxekascefhskaPce4cbaPceG9R7amfgmhzkdndnaCcsSmbashlxekascefhlas8SbbgDcFeGhPdnaDcu9kmbascvfhOaPcFbGhPcrhDdninal8SbbgscFbGaDtaPVhPascu9kmealcefhlaDcrfgDc8J9hmbkaOhlxekalcefhlkaPce4cbaPceG9R7amfgmhOkdndnadcd9hmbabarcetfgDaA87ebaDclfaO87ebaDcdfaz87ebxekabarcdtfgDaABdbaDcwfaOBdbaDclfazBdbkavc;abfaocitfgDazBdbaDaABdlavaicdtfaABdbavc;abfaocefcsGcitfgDaOBdbaDazBdlavaicefgicsGcdtfazBdbavc;abfaocdfcsGcitfgDaABdbaDaOBdlavaiaHcz6aXcsSVfgicsGcdtfaOBdbaiaCTaCcsSVfhiaocifhokawcefhwaocsGhoaicsGhiarcifgrae6mbkkcbc99alaqSEhokavc;aef8Kjjjjbaok:clevu8Jjjjjbcz9Rhvdnaecvfal9nmbc9:skdnaiRbbc;:eGc;qeSmbcuskav9cb83iwaicefhoaialfc98fhrdnaeTmbdnadcdSmbcbhwindnaoar6mbc9:skaocefhlao8SbbgicFeGhddndnaicu9mmbalhoxekaocvfhoadcFbGhdcrhidninal8SbbgDcFbGaitadVhdaDcu9kmealcefhlaicrfgic8J9hmbxdkkalcefhokabawcdtfadc8Etc8F91adcd47avcwfadceGcdtVglydbfgiBdbalaiBdbawcefgwae9hmbxdkkcbhwindnaoar6mbc9:skaocefhlao8SbbgicFeGhddndnaicu9mmbalhoxekaocvfhoadcFbGhdcrhidninal8SbbgDcFbGaitadVhdaDcu9kmealcefhlaicrfgic8J9hmbxdkkalcefhokabawcetfadc8Etc8F91adcd47avcwfadceGcdtVglydbfgi87ebalaiBdbawcefgwae9hmbkkcbc99aoarSEk:Lvoeue99dud99eud99dndnadcl9hmbaeTmeindndnabcdfgd8Sbb:Yab8Sbbgi:Ygl:l:tabcefgv8Sbbgo:Ygr:l:tgwJbb;:9cawawNJbbbbawawJbbbb9GgDEgq:mgkaqaicb9iEalMgwawNakaqaocb9iEarMgqaqNMM:r:vglNJbbbZJbbb:;aDEMgr:lJbbb9p9DTmbar:Ohixekcjjjj94hikadai86bbdndnaqalNJbbbZJbbb:;aqJbbbb9GEMgq:lJbbb9p9DTmbaq:Ohdxekcjjjj94hdkavad86bbdndnawalNJbbbZJbbb:;awJbbbb9GEMgw:lJbbb9p9DTmbaw:Ohdxekcjjjj94hdkabad86bbabclfhbaecufgembxdkkaeTmbindndnabclfgd8Ueb:Yab8Uebgi:Ygl:l:tabcdfgv8Uebgo:Ygr:l:tgwJb;:FSawawNJbbbbawawJbbbb9GgDEgq:mgkaqaicb9iEalMgwawNakaqaocb9iEarMgqaqNMM:r:vglNJbbbZJbbb:;aDEMgr:lJbbb9p9DTmbar:Ohixekcjjjj94hikadai87ebdndnaqalNJbbbZJbbb:;aqJbbbb9GEMgq:lJbbb9p9DTmbaq:Ohdxekcjjjj94hdkavad87ebdndnawalNJbbbZJbbb:;awJbbbb9GEMgw:lJbbb9p9DTmbaw:Ohdxekcjjjj94hdkabad87ebabcwfhbaecufgembkkk;oiliui99iue99dnaeTmbcbhiabhlindndnJ;Zl81Zalcof8UebgvciV:Y:vgoal8Ueb:YNgrJb;:FSNJbbbZJbbb:;arJbbbb9GEMgw:lJbbb9p9DTmbaw:OhDxekcjjjj94hDkalclf8Uebhqalcdf8UebhkabaiavcefciGfcetfaD87ebdndnaoak:YNgwJb;:FSNJbbbZJbbb:;awJbbbb9GEMgx:lJbbb9p9DTmbax:OhDxekcjjjj94hDkabaiavciGfgkcd7cetfaD87ebdndnaoaq:YNgoJb;:FSNJbbbZJbbb:;aoJbbbb9GEMgx:lJbbb9p9DTmbax:OhDxekcjjjj94hDkabaiavcufciGfcetfaD87ebdndnJbbjZararN:tawawN:taoaoN:tgrJbbbbarJbbbb9GE:rJb;:FSNJbbbZMgr:lJbbb9p9DTmbar:Ohvxekcjjjj94hvkabakcetfav87ebalcwfhlaiclfhiaecufgembkkk9mbdnadcd4ae2gdTmbinababydbgecwtcw91:Yaece91cjjj98Gcjjj;8if::NUdbabclfhbadcufgdmbkkk:Tvirud99eudndnadcl9hmbaeTmeindndnabRbbgiabcefgl8Sbbgvabcdfgo8Sbbgrf9R:YJbbuJabcifgwRbbgdce4adVgDcd4aDVgDcl4aDVgD:Z:vgqNJbbbZMgk:lJbbb9p9DTmbak:Ohxxekcjjjj94hxkaoax86bbdndnaraif:YaqNJbbbZMgk:lJbbb9p9DTmbak:Ohoxekcjjjj94hokalao86bbdndnavaifar9R:YaqNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikabai86bbdndnaDadcetGadceGV:ZaqNJbbbZMgq:lJbbb9p9DTmbaq:Ohdxekcjjjj94hdkawad86bbabclfhbaecufgembxdkkaeTmbindndnab8Vebgiabcdfgl8Uebgvabclfgo8Uebgrf9R:YJbFu9habcofgw8Vebgdce4adVgDcd4aDVgDcl4aDVgDcw4aDVgD:Z:vgqNJbbbZMgk:lJbbb9p9DTmbak:Ohxxekcjjjj94hxkaoax87ebdndnaraif:YaqNJbbbZMgk:lJbbb9p9DTmbak:Ohoxekcjjjj94hokalao87ebdndnavaifar9R:YaqNJbbbZMgk:lJbbb9p9DTmbak:Ohixekcjjjj94hikabai87ebdndnaDadcetGadceGV:ZaqNJbbbZMgq:lJbbb9p9DTmbaq:Ohdxekcjjjj94hdkawad87ebabcwfhbaecufgembkkk9teiucbcbyd:K1jjbgeabcifc98GfgbBd:K1jjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik;teeeudndnaeabVciGTmbabhixekdndnadcz9pmbabhixekabhiinaiaeydbBdbaiaeydlBdlaiaeydwBdwaiaeydxBdxaeczfheaiczfhiadc9Wfgdcs0mbkkadcl6mbinaiaeydbBdbaeclfheaiclfhiadc98fgdci0mbkkdnadTmbinaiaeRbb86bbaicefhiaecefheadcufgdmbkkabk:3eedudndnabciGTmbabhixekaecFeGc:b:c:ew2hldndnadcz9pmbabhixekabhiinaialBdxaialBdwaialBdlaialBdbaiczfhiadc9Wfgdcs0mbkkadcl6mbinaialBdbaiclfhiadc98fgdci0mbkkdnadTmbinaiae86bbaicefhiadcufgdmbkkabkk81dbcjwk8Kbbbbdbbblbbbwbbbbbbbebbbdbbblbbbwbbbbc:Kwkl8WNbb'; // embed! base\n\tvar wasm_simd =\n\t\t'b9H79TebbbeKl9Gbb9Gvuuuuueu9Giuuub9Geueuixkbbebeeddddilve9Weeeviebeoweuec:q:6dkr;Neqo9TW9T9VV95dbH9F9F939H79T9F9J9H229F9Jt9VV7bb8A9TW79O9V9Wt9F9KW9J9V9KW9wWVtW949c919M9MWVbdY9TW79O9V9Wt9F9KW9J9V9KW69U9KW949c919M9MWVblE9TW79O9V9Wt9F9KW9J9V9KW69U9KW949tWG91W9U9JWbvL9TW79O9V9Wt9F9KW9J9V9KWS9P2tWV9p9JtboK9TW79O9V9Wt9F9KW9J9V9KWS9P2tWV9r919HtbrL9TW79O9V9Wt9F9KW9J9V9KWS9P2tWVT949WbwY9TW79O9V9Wt9F9KW9J9V9KWS9P2tWVJ9V29VVbDl79IV9Rbqq;Ctklbzik9:evu8Jjjjjbcz9Rhbcbheincbhdcbhiinabcwfadfaicjuaead4ceGglE86bbaialfhiadcefgdcw9hmbkaec:q:yjjbfai86bbaecitc:q1jjbfab8Piw83ibaecefgecjd9hmbkk:183lYud97dur978Jjjjjbcj;kb9Rgv8Kjjjjbc9:hodnalTmbcuhoaiRbbgrc;WeGc:Ge9hmbarcsGgwce0mbc9:hoalcufadcd4cbawEgDadfgrcKcaawEgqaraq0Egk6mbaicefhxavaialfgmar9Rgoad;8qbbcj;abad9Uc;WFbGcjdadca0EhPdndndnadTmbaoadfhscbhzinaeaz9nmdamax9RaD6miabazad2fhHaxaDfhOaPaeaz9RazaPfae6EgAcsfgocl4cifcd4hCavcj;cbfaoc9WGgXcetfhQavcj;cbfaXci2fhLavcj;cbfaXfhKcbhYaoc;ab6h8AincbhodnawTmbaxaYcd4fRbbhokaocFeGhEcbh3avcj;cbfh5indndndndnaEa3cet4ciGgoc9:fPdebdkamaO9RaX6mwavcj;cbfa3aX2faOaX;8qbbaOaAfhOxdkavcj;cbfa3aX2fcbaX;8kbxekamaO9RaC6moaoclVcbawEhraOaCfhocbhidna8Ambamao9Rc;Gb6mbcbhlina5alfhidndndndndndnaOalco4fRbbgqciGarfPDbedibledibkaipxbbbbbbbbbbbbbbbbpklbxlkaiaopbblaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLg8Ecdp:mea8EpmbzeHdOiAlCvXoQrLpxiiiiiiiiiiiiiiiip9og8Fpxiiiiiiiiiiiiiiiip8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaoclffahc:q:yjjbfRbbfhoxikaiaopbbwaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLpxssssssssssssssssp9og8Fpxssssssssssssssssp8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaocwffahc:q:yjjbfRbbfhoxdkaiaopbbbpklbaoczfhoxekaiaopbbdaoRbbgacitc:q1jjbfpbibaac:q:yjjbfRbbgapsaoRbeghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPpklbaaaocdffahc:q:yjjbfRbbfhokdndndndndndnaqcd4ciGarfPDbedibledibkaiczfpxbbbbbbbbbbbbbbbbpklbxlkaiczfaopbblaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLg8Ecdp:mea8EpmbzeHdOiAlCvXoQrLpxiiiiiiiiiiiiiiiip9og8Fpxiiiiiiiiiiiiiiiip8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaoclffahc:q:yjjbfRbbfhoxikaiczfaopbbwaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLpxssssssssssssssssp9og8Fpxssssssssssssssssp8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaocwffahc:q:yjjbfRbbfhoxdkaiczfaopbbbpklbaoczfhoxekaiczfaopbbdaoRbbgacitc:q1jjbfpbibaac:q:yjjbfRbbgapsaoRbeghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPpklbaaaocdffahc:q:yjjbfRbbfhokdndndndndndnaqcl4ciGarfPDbedibledibkaicafpxbbbbbbbbbbbbbbbbpklbxlkaicafaopbblaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLg8Ecdp:mea8EpmbzeHdOiAlCvXoQrLpxiiiiiiiiiiiiiiiip9og8Fpxiiiiiiiiiiiiiiiip8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaoclffahc:q:yjjbfRbbfhoxikaicafaopbbwaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLpxssssssssssssssssp9og8Fpxssssssssssssssssp8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaaaocwffahc:q:yjjbfRbbfhoxdkaicafaopbbbpklbaoczfhoxekaicafaopbbdaoRbbgacitc:q1jjbfpbibaac:q:yjjbfRbbgapsaoRbeghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPpklbaaaocdffahc:q:yjjbfRbbfhokdndndndndndnaqco4arfPDbedibledibkaic8Wfpxbbbbbbbbbbbbbbbbpklbxlkaic8Wfaopbblaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLg8Ecdp:mea8EpmbzeHdOiAlCvXoQrLpxiiiiiiiiiiiiiiiip9og8Fpxiiiiiiiiiiiiiiiip8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngicitc:q1jjbfpbibaic:q:yjjbfRbbgipsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Ngqcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaiaoclffaqc:q:yjjbfRbbfhoxikaic8Wfaopbbwaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLpxssssssssssssssssp9og8Fpxssssssssssssssssp8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngicitc:q1jjbfpbibaic:q:yjjbfRbbgipsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Ngqcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spklbaiaocwffaqc:q:yjjbfRbbfhoxdkaic8Wfaopbbbpklbaoczfhoxekaic8WfaopbbdaoRbbgicitc:q1jjbfpbibaic:q:yjjbfRbbgipsaoRbegqcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPpklbaiaocdffaqc:q:yjjbfRbbfhokalc;abfhialcjefaX0meaihlamao9Rc;Fb0mbkkdnaiaX9pmbaici4hlinamao9RcK6mwa5aifhqdndndndndndnaOaico4fRbbalcoG4ciGarfPDbedibledibkaqpxbbbbbbbbbbbbbbbbpkbbxlkaqaopbblaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLg8Ecdp:mea8EpmbzeHdOiAlCvXoQrLpxiiiiiiiiiiiiiiiip9og8Fpxiiiiiiiiiiiiiiiip8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spkbbaaaoclffahc:q:yjjbfRbbfhoxikaqaopbbwaopbbbg8Eclp:mea8EpmbzeHdOiAlCvXoQrLpxssssssssssssssssp9og8Fpxssssssssssssssssp8Jg8Ep5b9cjF;8;4;W;G;ab9:9cU1:Ngacitc:q1jjbfpbibaac:q:yjjbfRbbgapsa8Ep5e9cjF;8;4;W;G;ab9:9cU1:Nghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPa8Fa8Ep9spkbbaaaocwffahc:q:yjjbfRbbfhoxdkaqaopbbbpkbbaoczfhoxekaqaopbbdaoRbbgacitc:q1jjbfpbibaac:q:yjjbfRbbgapsaoRbeghcitc:q1jjbfpbibp9UpmbedilvorzHOACXQLpPpkbbaaaocdffahc:q:yjjbfRbbfhokalcdfhlaiczfgiaX6mbkkaohOaoTmoka5aXfh5a3cefg3cl9hmbkdndndndnawTmbasaYcd4fRbbglciGPlbedwbkaXTmdavcjdfaYfhlavaYfpbdbhgcbhoinalavcj;cbfaofpblbg8JaKaofpblbg8KpmbzeHdOiAlCvXoQrLg8LaQaofpblbg8MaLaofpblbg8NpmbzeHdOiAlCvXoQrLgypmbezHdiOAlvCXorQLg8Ecep9Ta8Epxeeeeeeeeeeeeeeeeg8Fp9op9Hp9rg8Eagp9Uggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp9Uggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp9Uggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp9Uggp9Abbbaladfglaga8LaypmwDKYqk8AExm35Ps8E8Fg8Ecep9Ta8Ea8Fp9op9Hp9rg8Ep9Uggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp9Uggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp9Uggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp9Uggp9Abbbaladfglaga8Ja8KpmwKDYq8AkEx3m5P8Es8Fg8Ja8Ma8NpmwKDYq8AkEx3m5P8Es8Fg8KpmbezHdiOAlvCXorQLg8Ecep9Ta8Ea8Fp9op9Hp9rg8Ep9Uggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp9Uggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp9Uggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp9Uggp9Abbbaladfglaga8Ja8KpmwDKYqk8AExm35Ps8E8Fg8Ecep9Ta8Ea8Fp9op9Hp9rg8Ep9Ug8Fp9Abbbaladfgla8Fa8Ea8Epmlvorlvorlvorlvorp9Ug8Fp9Abbbaladfgla8Fa8Ea8EpmwDqkwDqkwDqkwDqkp9Ug8Fp9Abbbaladfgla8Fa8Ea8EpmxmPsxmPsxmPsxmPsp9Uggp9AbbbaladfhlaoczfgoaX6mbxikkaXTmeavcjdfaYfhlavaYfpbdbhgcbhoinalavcj;cbfaofpblbg8JaKaofpblbg8KpmbzeHdOiAlCvXoQrLg8LaQaofpblbg8MaLaofpblbg8NpmbzeHdOiAlCvXoQrLgypmbezHdiOAlvCXorQLg8Ecep:nea8Epxebebebebebebebebg8Fp9op:bep9rg8Eagp:oeggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp:oeggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp:oeggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp:oeggp9Abbbaladfglaga8LaypmwDKYqk8AExm35Ps8E8Fg8Ecep:nea8Ea8Fp9op:bep9rg8Ep:oeggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp:oeggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp:oeggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp:oeggp9Abbbaladfglaga8Ja8KpmwKDYq8AkEx3m5P8Es8Fg8Ja8Ma8NpmwKDYq8AkEx3m5P8Es8Fg8KpmbezHdiOAlvCXorQLg8Ecep:nea8Ea8Fp9op:bep9rg8Ep:oeggp9Abbbaladfglaga8Ea8Epmlvorlvorlvorlvorp:oeggp9Abbbaladfglaga8Ea8EpmwDqkwDqkwDqkwDqkp:oeggp9Abbbaladfglaga8Ea8EpmxmPsxmPsxmPsxmPsp:oeggp9Abbbaladfglaga8Ja8KpmwDKYqk8AExm35Ps8E8Fg8Ecep:nea8Ea8Fp9op:bep9rg8Ep:oeg8Fp9Abbbaladfgla8Fa8Ea8Epmlvorlvorlvorlvorp:oeg8Fp9Abbbaladfgla8Fa8Ea8EpmwDqkwDqkwDqkwDqkp:oeg8Fp9Abbbaladfgla8Fa8Ea8EpmxmPsxmPsxmPsxmPsp:oeggp9AbbbaladfhlaoczfgoaX6mbxdkkaXTmbcbhocbalcl4gl9Rc8FGhiavcjdfaYfhravaYfpbdbh8Finaravcj;cbfaofpblbggaKaofpblbg8JpmbzeHdOiAlCvXoQrLg8KaQaofpblbg8LaLaofpblbg8MpmbzeHdOiAlCvXoQrLg8NpmbezHdiOAlvCXorQLg8Eaip:Rea8Ealp:Sep9qg8Ea8Fp9rg8Fp9Abbbaradfgra8Fa8Ea8Epmlvorlvorlvorlvorp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmwDqkwDqkwDqkwDqkp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmxmPsxmPsxmPsxmPsp9rg8Fp9Abbbaradfgra8Fa8Ka8NpmwDKYqk8AExm35Ps8E8Fg8Eaip:Rea8Ealp:Sep9qg8Ep9rg8Fp9Abbbaradfgra8Fa8Ea8Epmlvorlvorlvorlvorp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmwDqkwDqkwDqkwDqkp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmxmPsxmPsxmPsxmPsp9rg8Fp9Abbbaradfgra8Faga8JpmwKDYq8AkEx3m5P8Es8Fgga8La8MpmwKDYq8AkEx3m5P8Es8Fg8JpmbezHdiOAlvCXorQLg8Eaip:Rea8Ealp:Sep9qg8Ep9rg8Fp9Abbbaradfgra8Fa8Ea8Epmlvorlvorlvorlvorp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmwDqkwDqkwDqkwDqkp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmxmPsxmPsxmPsxmPsp9rg8Fp9Abbbaradfgra8Faga8JpmwDKYqk8AExm35Ps8E8Fg8Eaip:Rea8Ealp:Sep9qg8Ep9rg8Fp9Abbbaradfgra8Fa8Ea8Epmlvorlvorlvorlvorp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmwDqkwDqkwDqkwDqkp9rg8Fp9Abbbaradfgra8Fa8Ea8EpmxmPsxmPsxmPsxmPsp9rg8Fp9AbbbaradfhraoczfgoaX6mbkkaYclfgYad6mbkaHavcjdfaAad2;8qbbavavcjdfaAcufad2fad;8qbbaAazfhzc9:hoaOhxaOmbxlkkaeTmbaDalfhrcbhocuhlinaralaD9RglfaD6mdaPaeao9RaoaPfae6Eaofgoae6mbkaial9Rhxkcbc99amax9RakSEhoxekc9:hokavcj;kbf8Kjjjjbaokwbz:bjjjbk:TseHu8Jjjjjbc;ae9Rgv8Kjjjjbc9:hodnaeci9UgrcHfal0mbcuhoaiRbbgwc;WeGc;Ge9hmbawcsGgDce0mbavc;abfcFecje;8kbavcUf9cu83ibavc8Wf9cu83ibavcyf9cu83ibavcaf9cu83ibavcKf9cu83ibavczf9cu83ibav9cu83iwav9cu83ibaialfc9WfhqaicefgwarfhldnaeTmbcmcsaDceSEhkcbhxcbhmcbhrcbhicbhoindnalaq9nmbc9:hoxikdndnawRbbgDc;Ve0mbavc;abfaoaDcu7gPcl4fcsGcitfgsydlhzasydbhHdndnaDcsGgsak9pmbavaiaPfcsGcdtfydbaxasEhDaxasTgOfhxxekdndnascsSmbcehOasc987asamffcefhDxekalcefhDal8SbbgscFeGhPdndnascu9mmbaDhlxekalcvfhlaPcFbGhPcrhsdninaD8SbbgOcFbGastaPVhPaOcu9kmeaDcefhDascrfgsc8J9hmbxdkkaDcefhlkcehOaPce4cbaPceG9R7amfhDkaDhmkavc;abfaocitfgsaDBdbasazBdlavaicdtfaDBdbavc;abfaocefcsGcitfgsaHBdbasaDBdlaocdfhoaOaifhidnadcd9hmbabarcetfgsaH87ebasclfaD87ebascdfaz87ebxdkabarcdtfgsaHBdbascwfaDBdbasclfazBdbxekdnaDcpe0mbaxcefgOavaiaqaDcsGfRbbgscl49RcsGcdtfydbascz6gPEhDavaias9RcsGcdtfydbaOaPfgzascsGgOEhsaOThOdndnadcd9hmbabarcetfgHax87ebaHclfas87ebaHcdfaD87ebxekabarcdtfgHaxBdbaHcwfasBdbaHclfaDBdbkavaicdtfaxBdbavc;abfaocitfgHaDBdbaHaxBdlavaicefgicsGcdtfaDBdbavc;abfaocefcsGcitfgHasBdbaHaDBdlavaiaPfgicsGcdtfasBdbavc;abfaocdfcsGcitfgDaxBdbaDasBdlaocifhoaiaOfhiazaOfhxxekaxcbalRbbgHEgAaDc;:eSgDfhzaHcsGhCaHcl4hXdndnaHcs0mbazcefhOxekazhOavaiaX9RcsGcdtfydbhzkdndnaCmbaOcefhxxekaOhxavaiaH9RcsGcdtfydbhOkdndnaDTmbalcefhDxekalcdfhDal8SbegPcFeGhsdnaPcu9kmbalcofhAascFbGhscrhldninaD8SbbgPcFbGaltasVhsaPcu9kmeaDcefhDalcrfglc8J9hmbkaAhDxekaDcefhDkasce4cbasceG9R7amfgmhAkdndnaXcsSmbaDhsxekaDcefhsaD8SbbglcFeGhPdnalcu9kmbaDcvfhzaPcFbGhPcrhldninas8SbbgDcFbGaltaPVhPaDcu9kmeascefhsalcrfglc8J9hmbkazhsxekascefhskaPce4cbaPceG9R7amfgmhzkdndnaCcsSmbashlxekascefhlas8SbbgDcFeGhPdnaDcu9kmbascvfhOaPcFbGhPcrhDdninal8SbbgscFbGaDtaPVhPascu9kmealcefhlaDcrfgDc8J9hmbkaOhlxekalcefhlkaPce4cbaPceG9R7amfgmhOkdndnadcd9hmbabarcetfgDaA87ebaDclfaO87ebaDcdfaz87ebxekabarcdtfgDaABdbaDcwfaOBdbaDclfazBdbkavc;abfaocitfgDazBdbaDaABdlavaicdtfaABdbavc;abfaocefcsGcitfgDaOBdbaDazBdlavaicefgicsGcdtfazBdbavc;abfaocdfcsGcitfgDaABdbaDaOBdlavaiaHcz6aXcsSVfgicsGcdtfaOBdbaiaCTaCcsSVfhiaocifhokawcefhwaocsGhoaicsGhiarcifgrae6mbkkcbc99alaqSEhokavc;aef8Kjjjjbaok:clevu8Jjjjjbcz9Rhvdnaecvfal9nmbc9:skdnaiRbbc;:eGc;qeSmbcuskav9cb83iwaicefhoaialfc98fhrdnaeTmbdnadcdSmbcbhwindnaoar6mbc9:skaocefhlao8SbbgicFeGhddndnaicu9mmbalhoxekaocvfhoadcFbGhdcrhidninal8SbbgDcFbGaitadVhdaDcu9kmealcefhlaicrfgic8J9hmbxdkkalcefhokabawcdtfadc8Etc8F91adcd47avcwfadceGcdtVglydbfgiBdbalaiBdbawcefgwae9hmbxdkkcbhwindnaoar6mbc9:skaocefhlao8SbbgicFeGhddndnaicu9mmbalhoxekaocvfhoadcFbGhdcrhidninal8SbbgDcFbGaitadVhdaDcu9kmealcefhlaicrfgic8J9hmbxdkkalcefhokabawcetfadc8Etc8F91adcd47avcwfadceGcdtVglydbfgi87ebalaiBdbawcefgwae9hmbkkcbc99aoarSEk:2Pliur97eue978Jjjjjbc8W9Rhiaec98Ghldndnadcl9hmbdnalTmbcbhvabhdinadadpbbbgocKp:RecKp:Sep;6egraocwp:RecKp:Sep;6earp;Geaoczp:RecKp:Sep;6egwp;Gep;Kep;LegDpxbbbbbbbbbbbbbbbbp:2egqarpxbbbjbbbjbbbjbbbjgkp9op9rp;Kegrpxbb;:9cbb;:9cbb;:9cbb;:9cararp;MeaDaDp;Meawaqawakp9op9rp;Kegrarp;Mep;Kep;Kep;Jep;Negwp;Mepxbbn0bbn0bbn0bbn0gqp;KepxFbbbFbbbFbbbFbbbp9oaopxbbbFbbbFbbbFbbbFp9op9qarawp;Meaqp;Kecwp:RepxbFbbbFbbbFbbbFbbp9op9qaDawp;Meaqp;Keczp:RepxbbFbbbFbbbFbbbFbp9op9qpkbbadczfhdavclfgval6mbkkalaeSmeaipxbbbbbbbbbbbbbbbbgqpklbaiabalcdtfgdaeciGglcdtgv;8qbbdnalTmbaiaipblbgocKp:RecKp:Sep;6egraocwp:RecKp:Sep;6earp;Geaoczp:RecKp:Sep;6egwp;Gep;Kep;LegDaqp:2egqarpxbbbjbbbjbbbjbbbjgkp9op9rp;Kegrpxbb;:9cbb;:9cbb;:9cbb;:9cararp;MeaDaDp;Meawaqawakp9op9rp;Kegrarp;Mep;Kep;Kep;Jep;Negwp;Mepxbbn0bbn0bbn0bbn0gqp;KepxFbbbFbbbFbbbFbbbp9oaopxbbbFbbbFbbbFbbbFp9op9qarawp;Meaqp;Kecwp:RepxbFbbbFbbbFbbbFbbp9op9qaDawp;Meaqp;Keczp:RepxbbFbbbFbbbFbbbFbp9op9qpklbkadaiav;8qbbskaipxFubbFubbFubbFubbgxpklbdnalTmbcbhvabhdinadczfgmampbbbgopxbbbbbbFFbbbbbbFFgkp9oadpbbbgDaopmbediwDqkzHOAKY8AEgwczp:Reczp:Sep;6egraipblbaDaopmlvorxmPsCXQL358E8Fp9op;6eawczp:Sep;6egwp;Gearp;Gep;Kep;Legopxbbbbbbbbbbbbbbbbp:2egqarpxbbbjbbbjbbbjbbbjgPp9op9rp;Kegrpxb;:FSb;:FSb;:FSb;:FSararp;Meaoaop;MeawaqawaPp9op9rp;Kegrarp;Mep;Kep;Kep;Jep;Negwp;Mepxbbn0bbn0bbn0bbn0gqp;KepxFFbbFFbbFFbbFFbbp9oaoawp;Meaqp;Keczp:Rep9qgoarawp;Meaqp;KepxFFbbFFbbFFbbFFbbp9ogrpmwDKYqk8AExm35Ps8E8Fp9qpkbbadaDakp9oaoarpmbezHdiOAlvCXorQLp9qpkbbadcafhdavclfgval6mbkkalaeSmbaiczfpxbbbbbbbbbbbbbbbbgopklbaiaopklbaiabalcitfgdaeciGglcitgv;8qbbaiaxpkladnalTmbaiaipblzgopxbbbbbbFFbbbbbbFFgkp9oaipblbgDaopmbediwDqkzHOAKY8AEgwczp:Reczp:Sep;6egraipblaaDaopmlvorxmPsCXQL358E8Fp9op;6eawczp:Sep;6egwp;Gearp;Gep;Kep;Legopxbbbbbbbbbbbbbbbbp:2egqarpxbbbjbbbjbbbjbbbjgPp9op9rp;Kegrpxb;:FSb;:FSb;:FSb;:FSararp;Meaoaop;MeawaqawaPp9op9rp;Kegrarp;Mep;Kep;Kep;Jep;Negwp;Mepxbbn0bbn0bbn0bbn0gqp;KepxFFbbFFbbFFbbFFbbp9oaoawp;Meaqp;Keczp:Rep9qgoarawp;Meaqp;KepxFFbbFFbbFFbbFFbbp9ogrpmwDKYqk8AExm35Ps8E8Fp9qpklzaiaDakp9oaoarpmbezHdiOAlvCXorQLp9qpklbkadaiav;8qbbkk;Iwllue97euo978Jjjjjbca9Rhidnaec98GglTmbcbhvabhoinaocKfpxbbjZbbjZbbjZbbjZpx;Zl81Z;Zl81Z;Zl81Z;Zl81ZaopbbbgraoczfgwpbbbgDpmlvorxmPsCXQL358E8Fgqczp:Segkpxibbbibbbibbbibbbp9qp;6ep;NegxaraDpmbediwDqkzHOAKY8AEgrczp:Reczp:Sep;6ep;MegDaDp;Meaxarczp:Sep;6ep;Megmamp;Meaxaqczp:Reczp:Sep;6ep;Megqaqp;Mep;Kep;Kep;Lepxbbbbbbbbbbbbbbbbp:4ep;Jepxb;:FSb;:FSb;:FSb;:FSgxp;Mepxbbn0bbn0bbn0bbn0grp;KepxFFbbFFbbFFbbFFbbgPp9oamaxp;Mearp;Keczp:Rep9qgmaDaxp;Mearp;KeaPp9oaqaxp;Mearp;Keczp:Rep9qgrpmwDKYqk8AExm35Ps8E8FgDp5eakclp:RegxpEi:T:j83ibawaDp5baxpEd:T:j83ibaocwfamarpmbezHdiOAlvCXorQLgrp5eaxpEe:T:j83ibaoarp5baxpEb:T:j83ibaocafhoavclfgval6mbkkdnalaeSmbaiczfpxbbbbbbbbbbbbbbbbgxpklbaiaxpklbaiabalcitfgoaeciGgvcitgw;8qbbdnavTmbaipxbbjZbbjZbbjZbbjZpx;Zl81Z;Zl81Z;Zl81Z;Zl81ZaipblbgraipblzgDpmlvorxmPsCXQL358E8Fgqczp:Segkpxibbbibbbibbbibbbp9qp;6ep;NegxaraDpmbediwDqkzHOAKY8AEgrczp:Reczp:Sep;6ep;MegDaDp;Meaxarczp:Sep;6ep;Megmamp;Meaxaqczp:Reczp:Sep;6ep;Megqaqp;Mep;Kep;Kep;Lepxbbbbbbbbbbbbbbbbp:4ep;Jepxb;:FSb;:FSb;:FSb;:FSgxp;Mepxbbn0bbn0bbn0bbn0grp;KepxFFbbFFbbFFbbFFbbgPp9oamaxp;Mearp;Keczp:Rep9qgmaDaxp;Mearp;KeaPp9oaqaxp;Mearp;Keczp:Rep9qgrpmwDKYqk8AExm35Ps8E8FgDp5eakclp:RegxpEi:T:j83iKaiaDp5baxpEd:T:j83izaiamarpmbezHdiOAlvCXorQLgrp5eaxpEe:T:j83iwaiarp5baxpEb:T:j83ibkaoaiaw;8qbbkk;uddiue978Jjjjjbc;ab9Rhidnadcd4ae2glc98GgvTmbcbheabhdinadadpbbbgocwp:Recwp:Sep;6eaocep:SepxbbjFbbjFbbjFbbjFp9opxbbjZbbjZbbjZbbjZp:Uep;Mepkbbadczfhdaeclfgeav6mbkkdnavalSmbaic8WfpxbbbbbbbbbbbbbbbbgopklbaicafaopklbaiczfaopklbaiaopklbaiabavcdtfgdalciGgecdtgv;8qbbdnaeTmbaiaipblbgocwp:Recwp:Sep;6eaocep:SepxbbjFbbjFbbjFbbjFp9opxbbjZbbjZbbjZbbjZp:Uep;Mepklbkadaiav;8qbbkk:CPvdue97euw97eu8Jjjjjbc8W9Rhiaec98Ghldndnadcl9hmbaipxbbbbbbbbbbbbbbbbgvpklbdnalTmbcbhoabhdinadpbbbhradpxbbuJbbuJbbuJbbuJaipblbarcKp:Tep9qgwcep:Seawp9qgDcdp:SeaDp9qgDclp:SeaDp9qgqp;6ep;NegDarcwp:RecKp:SegkarpxFbbbFbbbFbbbFbbbgxp9ogmp:Uep;6ep;Mepxbbn0bbn0bbn0bbn0gPp;Kecwp:RepxbFbbbFbbbFbbbFbbp9oaDamakp:Xearczp:RecKp:Segrp:Uep;6ep;MeaPp;Keaxp9op9qaDamakarp:Uep:Xep;6ep;MeaPp;Keczp:RepxbbFbbbFbbbFbbbFbp9op9qaDaqawcep:Rep9oawpxebbbebbbebbbebbbp9op9qp;6ep;MeaPp;KecKp:Rep9qpkbbadczfhdaoclfgoal6mbkkalaeSmeaiavpklaaicafabalcdtfgdaeciGglcdtgo;8qbbaiavpklbdnalTmbaipblahraipxbbuJbbuJbbuJbbuJaipblbarcKp:Tep9qgwcep:Seawp9qgDcdp:SeaDp9qgDclp:SeaDp9qgqp;6ep;NegDarcwp:RecKp:SegkarpxFbbbFbbbFbbbFbbbgxp9ogmp:Uep;6ep;Mepxbbn0bbn0bbn0bbn0gPp;Kecwp:RepxbFbbbFbbbFbbbFbbp9oaDamakp:Xearczp:RecKp:Segrp:Uep;6ep;MeaPp;Keaxp9op9qaDamakarp:Uep:Xep;6ep;MeaPp;Keczp:RepxbbFbbbFbbbFbbbFbp9op9qaDaqawcep:Rep9oawpxebbbebbbebbbebbbp9op9qp;6ep;MeaPp;KecKp:Rep9qpklakadaicafao;8qbbskaipxbbbbbbbbbbbbbbbbgvpklbdnalTmbcbhoabhdinadczfgspxbFu9hbFu9hbFu9hbFu9hadpbbbgDaspbbbgPpmlvorxmPsCXQL358E8Fgmczp:Teaipblbp9qgrcep:Searp9qgwcdp:Seawp9qgwclp:Seawp9qgwcwp:Seawp9qgqp;6ep;NegwaDaPpmbediwDqkzHOAKY8AEgDpxFFbbFFbbFFbbFFbbgPp9ogkaDczp:Segxp:Ueamczp:Reczp:Segmp:Xep;6ep;Mepxbbn0bbn0bbn0bbn0gDp;KeaPp9oawakaxamp:Uep:Xep;6ep;MeaDp;Keczp:Rep9qgxawaqarcep:Rep9oarpxebbbebbbebbbebbbp9op9qp;6ep;MeaDp;Keczp:Reawamakp:Uep;6ep;MeaDp;KeaPp9op9qgrpmwDKYqk8AExm35Ps8E8FpkbbadaxarpmbezHdiOAlvCXorQLpkbbadcafhdaoclfgoal6mbkkalaeSmbaiczfpxbbbbbbbbbbbbbbbbgrpklbaiarpklbaiabalcitfgdaeciGglcitgo;8qbbaiavpkladnalTmbaipxbFu9hbFu9hbFu9hbFu9haipblbgDaipblzgPpmlvorxmPsCXQL358E8Fgmczp:Teaipblap9qgrcep:Searp9qgwcdp:Seawp9qgwclp:Seawp9qgwcwp:Seawp9qgqp;6ep;NegwaDaPpmbediwDqkzHOAKY8AEgDpxFFbbFFbbFFbbFFbbgPp9ogkaDczp:Segxp:Ueamczp:Reczp:Segmp:Xep;6ep;Mepxbbn0bbn0bbn0bbn0gDp;KeaPp9oawakaxamp:Uep:Xep;6ep;MeaDp;Keczp:Rep9qgxawaqarcep:Rep9oarpxebbbebbbebbbebbbp9op9qp;6ep;MeaDp;Keczp:Reawamakp:Uep;6ep;MeaDp;KeaPp9op9qgrpmwDKYqk8AExm35Ps8E8FpklzaiaxarpmbezHdiOAlvCXorQLpklbkadaiao;8qbbkk9teiucbcbydj1jjbgeabcifc98GfgbBdj1jjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaikkkebcjwklz:Dbb'; // embed! simd\n\n\tvar detector = new Uint8Array([\n\t\t0, 97, 115, 109, 1, 0, 0, 0, 1, 4, 1, 96, 0, 0, 3, 3, 2, 0, 0, 5, 3, 1, 0, 1, 12, 1, 0, 10, 22, 2, 12, 0, 65, 0, 65, 0, 65, 0, 252, 10, 0, 0,\n\t\t11, 7, 0, 65, 0, 253, 15, 26, 11,\n\t]);\n\tvar wasmpack = new Uint8Array([\n\t\t32, 0, 65, 2, 1, 106, 34, 33, 3, 128, 11, 4, 13, 64, 6, 253, 10, 7, 15, 116, 127, 5, 8, 12, 40, 16, 19, 54, 20, 9, 27, 255, 113, 17, 42, 67,\n\t\t24, 23, 146, 148, 18, 14, 22, 45, 70, 69, 56, 114, 101, 21, 25, 63, 75, 136, 108, 28, 118, 29, 73, 115,\n\t]);\n\n\tif (typeof WebAssembly !== 'object') {\n\t\treturn {\n\t\t\tsupported: false,\n\t\t};\n\t}\n\n\tvar wasm = WebAssembly.validate(detector) ? unpack(wasm_simd) : unpack(wasm_base);\n\n\tvar instance;\n\n\tvar ready = WebAssembly.instantiate(wasm, {}).then(function (result) {\n\t\tinstance = result.instance;\n\t\tinstance.exports.__wasm_call_ctors();\n\t});\n\n\tfunction unpack(data) {\n\t\tvar result = new Uint8Array(data.length);\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tvar ch = data.charCodeAt(i);\n\t\t\tresult[i] = ch > 96 ? ch - 97 : ch > 64 ? ch - 39 : ch + 4;\n\t\t}\n\t\tvar write = 0;\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tresult[write++] = result[i] < 60 ? wasmpack[result[i]] : (result[i] - 60) * 64 + result[++i];\n\t\t}\n\t\treturn result.buffer.slice(0, write);\n\t}\n\n\tfunction decode(instance, fun, target, count, size, source, filter) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar count4 = (count + 3) & ~3;\n\t\tvar tp = sbrk(count4 * size);\n\t\tvar sp = sbrk(source.length);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(source, sp);\n\t\tvar res = fun(tp, count, size, sp, source.length);\n\t\tif (res == 0 && filter) {\n\t\t\tfilter(tp, count4, size);\n\t\t}\n\t\ttarget.set(heap.subarray(tp, tp + count * size));\n\t\tsbrk(tp - sbrk(0));\n\t\tif (res != 0) {\n\t\t\tthrow new Error('Malformed buffer data: ' + res);\n\t\t}\n\t}\n\n\tvar filters = {\n\t\tNONE: '',\n\t\tOCTAHEDRAL: 'meshopt_decodeFilterOct',\n\t\tQUATERNION: 'meshopt_decodeFilterQuat',\n\t\tEXPONENTIAL: 'meshopt_decodeFilterExp',\n\t\tCOLOR: 'meshopt_decodeFilterColor',\n\t};\n\n\tvar decoders = {\n\t\tATTRIBUTES: 'meshopt_decodeVertexBuffer',\n\t\tTRIANGLES: 'meshopt_decodeIndexBuffer',\n\t\tINDICES: 'meshopt_decodeIndexSequence',\n\t};\n\n\tvar workers = [];\n\tvar requestId = 0;\n\n\tfunction createWorker(url) {\n\t\tvar worker = {\n\t\t\tobject: new Worker(url),\n\t\t\tpending: 0,\n\t\t\trequests: {},\n\t\t};\n\n\t\tworker.object.onmessage = function (event) {\n\t\t\tvar data = event.data;\n\n\t\t\tworker.pending -= data.count;\n\t\t\tworker.requests[data.id][data.action](data.value);\n\t\t\tdelete worker.requests[data.id];\n\t\t};\n\n\t\treturn worker;\n\t}\n\n\tfunction initWorkers(count) {\n\t\tvar source =\n\t\t\t'self.ready = WebAssembly.instantiate(new Uint8Array([' +\n\t\t\tnew Uint8Array(wasm) +\n\t\t\t']), {})' +\n\t\t\t'.then(function(result) { result.instance.exports.__wasm_call_ctors(); return result.instance; });' +\n\t\t\t'self.onmessage = ' +\n\t\t\tworkerProcess.name +\n\t\t\t';' +\n\t\t\tdecode.toString() +\n\t\t\tworkerProcess.toString();\n\n\t\tvar blob = new Blob([source], { type: 'text/javascript' });\n\t\tvar url = URL.createObjectURL(blob);\n\n\t\tfor (var i = workers.length; i < count; ++i) {\n\t\t\tworkers[i] = createWorker(url);\n\t\t}\n\n\t\tfor (var i = count; i < workers.length; ++i) {\n\t\t\tworkers[i].object.postMessage({});\n\t\t}\n\n\t\tworkers.length = count;\n\n\t\tURL.revokeObjectURL(url);\n\t}\n\n\tfunction decodeWorker(count, size, source, mode, filter) {\n\t\tvar worker = workers[0];\n\n\t\tfor (var i = 1; i < workers.length; ++i) {\n\t\t\tif (workers[i].pending < worker.pending) {\n\t\t\t\tworker = workers[i];\n\t\t\t}\n\t\t}\n\n\t\treturn new Promise(function (resolve, reject) {\n\t\t\tvar data = new Uint8Array(source);\n\t\t\tvar id = ++requestId;\n\n\t\t\tworker.pending += count;\n\t\t\tworker.requests[id] = { resolve: resolve, reject: reject };\n\t\t\tworker.object.postMessage({ id: id, count: count, size: size, source: data, mode: mode, filter: filter }, [data.buffer]);\n\t\t});\n\t}\n\n\tfunction workerProcess(event) {\n\t\tvar data = event.data;\n\t\tif (!data.id) {\n\t\t\treturn self.close();\n\t\t}\n\t\tself.ready.then(function (instance) {\n\t\t\ttry {\n\t\t\t\tvar target = new Uint8Array(data.count * data.size);\n\t\t\t\tdecode(instance, instance.exports[data.mode], target, data.count, data.size, data.source, instance.exports[data.filter]);\n\t\t\t\tself.postMessage({ id: data.id, count: data.count, action: 'resolve', value: target }, [target.buffer]);\n\t\t\t} catch (error) {\n\t\t\t\tself.postMessage({ id: data.id, count: data.count, action: 'reject', value: error });\n\t\t\t}\n\t\t});\n\t}\n\n\treturn {\n\t\tready: ready,\n\t\tsupported: true,\n\t\tuseWorkers: function (count) {\n\t\t\tinitWorkers(count);\n\t\t},\n\t\tdecodeVertexBuffer: function (target, count, size, source, filter) {\n\t\t\tdecode(instance, instance.exports.meshopt_decodeVertexBuffer, target, count, size, source, instance.exports[filters[filter]]);\n\t\t},\n\t\tdecodeIndexBuffer: function (target, count, size, source) {\n\t\t\tdecode(instance, instance.exports.meshopt_decodeIndexBuffer, target, count, size, source);\n\t\t},\n\t\tdecodeIndexSequence: function (target, count, size, source) {\n\t\t\tdecode(instance, instance.exports.meshopt_decodeIndexSequence, target, count, size, source);\n\t\t},\n\t\tdecodeGltfBuffer: function (target, count, size, source, mode, filter) {\n\t\t\tdecode(instance, instance.exports[decoders[mode]], target, count, size, source, instance.exports[filters[filter]]);\n\t\t},\n\t\tdecodeGltfBufferAsync: function (count, size, source, mode, filter) {\n\t\t\tif (workers.length > 0) {\n\t\t\t\treturn decodeWorker(count, size, source, decoders[mode], filters[filter]);\n\t\t\t}\n\n\t\t\treturn ready.then(function () {\n\t\t\t\tvar target = new Uint8Array(count * size);\n\t\t\t\tdecode(instance, instance.exports[decoders[mode]], target, count, size, source, instance.exports[filters[filter]]);\n\t\t\t\treturn target;\n\t\t\t});\n\t\t},\n\t};\n})();\n\nexport { MeshoptDecoder };\n","// This file is part of meshoptimizer library and is distributed under the terms of MIT License.\n// Copyright (C) 2016-2025, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)\nvar MeshoptSimplifier = (function () {\n\t// Built with clang version 19.1.5-wasi-sdk\n\t// Built from meshoptimizer 0.25\n\tvar wasm =\n\t\t'b9H79Tebbbe:Gez9Geueu9Geub9Gbb9Gsuuuuuuuuuuuu99uueu9Gvuuuuub9Gruuuuuuub9Gouuuuuue999Gvuuuuueu9Gquuuuuuu99uueu9GPuuuuuuuuuuu99uueu9Gquuuuuuuu99ueu9Gruuuuuu99eu9Gwuuuuuu99ueu9Giuuue999Gluuuueu9GiuuueuiXCdilvorlwiDqkxmPbssbelve9Weiiviebeoweuec:G:Pdkr;7eko9TW9T9VV95dbH9F9F939H79T9F9J9H229F9Jt9VV7bbz9TW79O9V9Wt9F79P9T9W29P9M95br8E9TW79O9V9Wt9F79P9T9W29P9M959x9Pt9OcttV9P9I91tW7bw8A9TW79O9V9Wt9F79P9T9W29P9M959x9Pt9O9v9W9K9HtWbDQ9TW79O9V9Wt9F79P9T9W29P9M959t29V9W9W95bqX9TW79O9V9Wt9F79P9T9W29P9M959qV919UWbkQ9TW79O9V9Wt9F79P9T9W29P9M959q9V9P9Ut7bxX9TW79O9V9Wt9F79P9T9W29P9M959t9J9H2Wbma9TW79O9V9Wt9F9V9Wt9P9T9P96W9wWVtW94SWt9J9O9sW9T9H9WbPl79IV9RbsDwebcekdOAq:d;OeCdbk:J1eo3ue99euE99Cue9:8Jjjjjbcj;sb9Rgs8Kjjjjbcbhzasc:Cefcbc;Kbz:rjjjb8AdnabaeSmbabaeadcdtz:qjjjb8AkdnamcdGTmbalcrfci4gHcbyd1:jjjbHjjjjbbheasc:Cefasyd;8egOcdtfaeBdbasaOcefBd;8eaecbaHz:rjjjbhAcbhlcbhednadTmbcbhlabheadhHinaAaeydbgOci4fgCaCRbbgCceaOcrGgOtV86bbaCcu7aO4ceGalfhlaeclfheaHcufgHmbkcualcdtalcFFFFi0Ehekaecbyd1:jjjbHjjjjbbhzasc:Cefasyd;8egecdtfazBdbasaecefBd;8ealcd4alfhOcehHinaHgecethHaeaO6mbkcbhXcuaecdtgOaecFFFFi0Ecbyd1:jjjbHjjjjbbhHasc:Cefasyd;8egCcdtfaHBdbasaCcefBd;8eaHcFeaOz:rjjjbhQdnadTmbaecufhLcbhKindndnaQabaXcdtfgYydbgCc:v;t;h;Ev2aLGgOcdtfgAydbgHcuSmbceheinazaHcdtfydbaCSmdaOaefhHaecefheaQaHaLGgOcdtfgAydbgHcu9hmbkkazaKcdtfaCBdbaAaKBdbaKhHaKcefhKkaYaHBdbaXcefgXad9hmbkkaQcbyd:m:jjjbH:bjjjbbasasyd;8ecufBd;8ekcbh8AcualcefgecdtaecFFFFi0Ecbyd1:jjjbHjjjjbbhKasc:Cefasyd;8egecdtfaKBdbasaKBdNeasaecefBd;8ecuadcitadcFFFFe0Ecbyd1:jjjbHjjjjbbhEasc:Cefasyd;8egecdtfaEBdbasaEBd:yeasaecefBd;8eascNefabadalcbz:cjjjbcualcdtgealcFFFFi0Eg3cbyd1:jjjbHjjjjbbhCasc:Cefasyd;8egHcdtfaCBdbasaHcefBd;8ea3cbyd1:jjjbHjjjjbbhYasc:Cefasyd;8egHcdtfaYBdbasaHcefBd;8eaCaYaialavazasc:Cefz:djjjbalcbyd1:jjjbHjjjjbbh5asc:Cefasyd;8egHcdtfa5BdbasaHcefBd;8ea3cbyd1:jjjbHjjjjbbhHasc:Cefasyd;8egOcdtfaHBdbasaOcefBd;8ea3cbyd1:jjjbHjjjjbbhOasc:Cefasyd;8egAcdtfaOBdbasaAcefBd;8eaHcFeaez:rjjjbh8EaOcFeaez:rjjjbh8FdnalTmbaEcwfhaindnaKa8AgOcefg8AcdtfydbgAaKaOcdtgefydbgHSmbaAaH9RhhaEaHcitfhga8Faefh8Ja8Eaefh8KcbhQindndnagaQcitfydbgLaO9hmba8KaOBdba8JaOBdbxekdnaKaLcdtg8LfgeclfydbgHaeydbgeSmbaEaecitgAfydbaOSmeaHae9Rh8Maecu7aHfhXaaaAfhHcbheinaXaeSmeaecefheaHydbhAaHcwfhHaAaO9hmbkaea8M6meka8Fa8LfgeaOaLaeydbcuSEBdba8KaLaOa8KydbcuSEBdbkaQcefgQah9hmbkka8Aal9hmbkaChHaYhOa8FhAa8EhQcbheindndnaeaHydbgL9hmbdnaeaOydbgL9hmbaQydbhLdnaAydbgXcu9hmbaLcu9hmba5aefcb86bbxikdnaXcuSmbaLcuSmbaeaXSmbaCaXcdtfydbaCaLcdtfydb9hmba5aefcd86bbxika5aefh8KdnaeaXSmbaeaLSmba8Kce86bbxika8Kcl86bbxdkdnaeaYaLcdtgXfydb9hmbdnaAydbg8KcuSmbaea8KSmbaQydbghcuSmbaeahSmba8FaXfydbggcuSmbagaLSmba8EaXfydbgXcuSmbaXaLSmbdnaCa8KcdtfydbgLaCaXcdtfydb9hmbaLaCahcdtfydbgXSmbaXaCagcdtfydb9hmba5aefcd86bbxlka5aefcl86bbxika5aefcl86bbxdka5aefcl86bbxeka5aefa5aLfRbb86bbkaHclfhHaOclfhOaAclfhAaQclfhQalaecefge9hmbkdnamcaGTmbaEcwfh8Jcbh8Nindndna5a8NfgyRbbg8Pc9:fPibebekdndndnaCa8Ncdtfydbgea8N9hmbdnaqmbcbhgxdkdnazTmbcbhga8NheinagaqazaecdtgefydbfRbbcdGce4VhgaYaefydbgea8N9hmbxikkcbhga8NheinagaqaefRbbcdGce4VhgaYaecdtfydbgea8N9hmbxdkka5aefRbbhexeka8NheindnaKaecdtgafgeclfydbgHaeydbgeSmbaHae9Rh8AaEaecitfh8MaCaafh8Lcbh8Kina8Ma8KcitfydbgXhednindnaKaecdtgLfgeclfydbgHaeydbgeSmbdnaCaEaecitgOfydbcdtfydba8LydbgQ9hmbcehexikaHae9Rhhaecu7aHfhAa8JaOfhHcbheinaAaeSmeaecefheaHydbhOaHcwfhHaCaOcdtfydbaQ9hmbkaeah6hexdkaYaLfydbgeaX9hmbkcbhekagaece7Vhga8Kcefg8Ka8A9hmbkkaYaafydbgea8N9hmbka8PciagceGEhekayae86bbka8Ncefg8Nal9hmbkkdnaqTmbdndnazTmbazheaChHalhOindnaqaeydbfRbbceGTmba5aHydbfcl86bbkaeclfheaHclfhHaOcufgOmbxdkkaChealhHindnaqRbbceGTmba5aeydbfcl86bbkaqcefhqaeclfheaHcufgHmbkkaChealhOa5hHindna5aeydbfRbbcl9hmbaHcl86bbkaeclfheaHcefhHaOcufgOmbkkamceGTmba5healhHindnaeRbbce9hmbaecl86bbkaecefheaHcufgHmbkkcbhIcualcx2alc;v:Q;v:Qe0Ecbyd1:jjjbHjjjjbbhaasc:Cefasyd;8egecdtfaaBdbasaecefBd;8easc:qefcbBdbas9cb83i1eaaaialavazasc1efz:ejjjbh8RdndnaDmbcbh8Scbh8Lxekcbh8LawhecbhHindnaeIdbJbbbb9ETmbasa8LcdtfaHBdba8Lcefh8LkaeclfheaDaHcefgH9hmbkcua8Lal2gecdtaecFFFFi0Ecbyd1:jjjbHjjjjbbh8Sasc:Cefasyd;8egecdtfa8SBdbasaecefBd;8ealTmbdna8Lmbcbh8Lxekarcd4hXdnazTmba8Lcdth8KcbhLa8ShKinaoazaLcdtfydbaX2cdtfhQasheaKhHa8LhOinaHaQaeydbcdtgAfIdbawaAfIdbNUdbaeclfheaHclfhHaOcufgOmbkaKa8KfhKaLcefgLal9hmbxdkka8Lcdth8KcbhLa8ShKinaoaLaX2cdtfhQasheaKhHa8LhOinaHaQaeydbcdtgAfIdbawaAfIdbNUdbaeclfheaHclfhHaOcufgOmbkaKa8KfhKaLcefgLal9hmbkkcualc8S2gHalc;D;O;f8U0EgAcbyd1:jjjbHjjjjbbheasc:Cefasyd;8egOcdtfaeBdbasaOcefBd;8eaecbaHz:rjjjbhycbhqcbh8Ndna8LTmbcbhIaAcbyd1:jjjbHjjjjbbh8Nasc:Cefasyd;8egecdtfa8NBdbasaecefBd;8ea8NcbaHz:rjjjb8Acua8Lal2gecltgHaecFFFFb0Ecbyd1:jjjbHjjjjbbhqasc:Cefasyd;8egecdtfaqBdbasaecefBd;8eaqcbaHz:rjjjb8AamcjjjjdGTmbcualcltgealcFFFFb0Ecbyd1:jjjbHjjjjbbhIasc:Cefasyd;8egHcdtfaIBdbasaHcefBd;8eaIcbaez:rjjjb8AkdnadTmbcbhQabhHinaaaHclfydbgLcx2fgeIdbaaaHydbgKcx2fgOIdbgR:tg8UaaaHcwfydbgXcx2fgAIdlaOIdlg8V:tg8WNaAIdbaR:tg8XaeIdla8V:tg8YN:tg8Zh80aeIdwaOIdwg81:tgBa8XNaAIdwa81:tg83a8UN:tgUh8Xa8Ya83Na8WaBN:tg8Yh8Udna8Za8ZNa8Ya8YNaUaUNMM:rgBJbbbb9EgOTmba8ZaB:vh80aUaB:vh8Xa8YaB:vh8UkayaCaKcdtfydbgAc8S2fgea8UaB:rg8Wa8UNNg85aeIdbMUdbaea8Xa8Wa8XNg86Ng87aeIdlMUdlaea80a8Wa80Ng83Ng88aeIdwMUdwaea86a8UNg86aeIdxMUdxaea83a8UNg89aeIdzMUdzaea83a8XNg8:aeIdCMUdCaea8Ua8Wa80a81Na8UaRNa8Va8XNMM:mgZNg83Ng8UaeIdKMUdKaea8Xa83Ng8XaeId3MUd3aea80a83Ng80aeIdaMUdaaea83aZNg83aeId8KMUd8Kaea8WaeIdyMUdyayaCaLcdtfydbgLc8S2fgea85aeIdbMUdbaea87aeIdlMUdlaea88aeIdwMUdwaea86aeIdxMUdxaea89aeIdzMUdzaea8:aeIdCMUdCaea8UaeIdKMUdKaea8XaeId3MUd3aea80aeIdaMUdaaea83aeId8KMUd8Kaea8WaeIdyMUdyayaCaXcdtfydbgKc8S2fgea85aeIdbMUdbaea87aeIdlMUdlaea88aeIdwMUdwaea86aeIdxMUdxaea89aeIdzMUdzaea8:aeIdCMUdCaea8UaeIdKMUdKaea8XaeId3MUd3aea80aeIdaMUdaaea83aeId8KMUd8Kaea8WaeIdyMUdydnaITmbdnaOTmba8ZaB:vh8ZaUaB:vhUa8YaB:vh8YkaIaAcltfgeaBJbbbZNg8UaUNg8WaeIdlMUdlaea8Ua8ZNg8XaeIdwMUdwaea8Ua8YNg80aeIdbMUdbaea8UaR:ma8YNaUa8VN:ta81a8ZN:tNg8UaeIdxMUdxaIaLcltfgea8WaeIdlMUdlaea8XaeIdwMUdwaea80aeIdbMUdbaea8UaeIdxMUdxaIaKcltfgea8WaeIdlMUdlaea8XaeIdwMUdwaea80aeIdbMUdbaea8UaeIdxMUdxkaHcxfhHaQcifgQad6mbkkdnalTmbJ;n;m;m89J:v:;;w8ZamczGEh8YcbhOaChAaahHayheindnaOaAydb9hmbaecxfgQaQIdbJbbbbMUdbaeczfgQaQIdbJbbbbMUdbaecCfgQaQIdbJbbbbMUdbaea8YaecyfgQIdbg8ZNg8UaeIdbMUdbaeclfgLa8UaLIdbMUdbaecwfgLa8UaLIdbMUdbaecKfgLaLIdbaHIdbg8Xa8UN:tUdbaHcwfIdbh8Waec3fgLaLIdba8UaHclfIdbg80N:tUdbaecafgLaLIdba8Ua8WN:tUdbaec8KfgLIdbhUaQa8Za8UMUdbaLaUa8Ua8Wa8WNa8Xa8XNa80a80NMMNMUdbkaAclfhAaHcxfhHaec8SfhealaOcefgO9hmbkkdnadTmbcbhXabhKinabaXcdtfhLcbhHina5aLaHc:G1jjbfydbcdtfydbgOfRbbhedndna5aKaHfydbgAfRbbgQc99fcFeGcpe0mbaec99fcFeGc;:e6mekdnaQcufcFeGce0mba8EaAcdtfydbaO9hmekdnaecufcFeGce0mba8FaOcdtfydbaA9hmekJbbacJbbacJbbbZaecFeGceSEaQcFeGceSEh88aaaOcx2fgeIdwaaaAcx2fgQIdwgB:tg80:mh86aeIdlaQIdlg83:tg8Z:mh89aeIdbaQIdbgR:tgU:mh8:dnaaaLaHc:K1jjbfydbcdtfydbcx2fgeIdwaB:tg8Va80a80NaUaUNa8Za8ZNMMg8YNa8Va80NaeIdbaR:tg81aUNa8ZaeIdla83:tg85NMMg8Wa80N:tg8Xa8XNa81a8YNa8WaUN:tg8Ua8UNa85a8YNa8Wa8ZN:tg8Wa8WNMM:rg87Jbbbb9ETmba8Xa87:vh8Xa8Wa87:vh8Wa8Ua87:vh8Uka88a8Y:rNg8Ya8XaBNa8UaRNa83a8WNMM:mgZNg87aZNhZa8Xa87Nhna8Wa87Nhca8Ua87Nh9ca8Ya8XNg87a8WNhJa87a8UNh9ea8Ya8WNgTa8UNhSa8Xa87Nh87a8WaTNhTa8Ua8Ya8UNNh9hdnaUa85Na81a89NMg8Xa8XNa8Za8VNa85a86NMg8Ua8UNa80a81Na8Va8:NMg8Wa8WNMM:rg80Jbbbb9ETmba8Xa80:vh8Xa8Wa80:vh8Wa8Ua80:vh8UkayaCaAcdtfydbc8S2fgeaeIdba9ha8Ua88a80:rNg80a8UNNMgUMUdbaeaTa8Wa80a8WNg8VNMg81aeIdlMUdlaea87a8Xa80a8XNg8ZNMg85aeIdwMUdwaeaSa8Va8UNMg8VaeIdxMUdxaea9ea8Za8UNMg87aeIdzMUdzaeaJa8Za8WNMg8ZaeIdCMUdCaea9ca8Ua80a8XaBNa8UaRNa83a8WNMMgB:mNg80NMg8UaeIdKMUdKaeaca8Wa80NMg8WaeId3MUd3aeana8Xa80NMg8XaeIdaMUdaaeaZaBa80N:tg80aeId8KMUd8Kaea8YJbbbbMg8YaeIdyMUdyayaCaOcdtfydbc8S2fgeaUaeIdbMUdbaea81aeIdlMUdlaea85aeIdwMUdwaea8VaeIdxMUdxaea87aeIdzMUdzaea8ZaeIdCMUdCaea8UaeIdKMUdKaea8WaeId3MUd3aea8XaeIdaMUdaaea80aeId8KMUd8Kaea8YaeIdyMUdykaHclfgHcx9hmbkaKcxfhKaXcifgXad6mbka8LTmbcbhKinJbbbbh8YaaabaKcdtfgeclfydbgXcx2fgHIdwaaaeydbg8Kcx2fgOIdwg81:tg8Wa8WNaHIdbaOIdbg85:tg8Xa8XNaHIdlaOIdlg87:tg80a80NMMgRaaaecwfydbghcx2fgeIdwa81:tg8ZNa8Wa8Wa8ZNa8XaeIdba85:tgUNa80aeIdla87:tgBNMMg8UN:tJbbbbJbbjZaRa8Za8ZNaUaUNaBaBNMMg8VNa8Ua8UN:tg83:va83Jbbbb9BEg83Nh89a8Va8WNa8Za8UN:ta83Nh8:aRaBNa80a8UN:ta83NhZa8Va80NaBa8UN:ta83NhnaRaUNa8Xa8UN:ta83Nhca8Va8XNaUa8UN:ta83Nh9ca8XaBNaUa80N:tg8Ua8UNa80a8ZNaBa8WN:tg8Ua8UNa8WaUNa8Za8XN:tg8Ua8UNMM:rJbbbZNh8Ua8Sa8Ka8L2ggcdtfhHa8Saha8L2gEcdtfhOa8SaXa8L2g8JcdtfhAa81:mhJa87:mh9ea85:mhTcbhQa8LhLJbbbbhBJbbbbh83JbbbbhRJbbbbh8VJbbbbh81Jbbbbh85Jbbbbh87Jbbbbh88Jbbbbh86inascjdfaQfgecwfa8Ua8:aAIdbaHIdbg8Z:tg80Na89aOIdba8Z:tgUNMg8WNUdbaeclfa8Uana80NaZaUNMg8XNUdbaea8Ua9ca80NacaUNMg80NUdbaecxfa8UaJa8WNa9ea8XNa8ZaTa80NMMMg8ZNUdba8Ua8Wa8XNNa8VMh8Va8Ua8Wa80NNa81Mh81a8Ua8Xa80NNa85Mh85a8Ua8Za8ZNNa8YMh8Ya8Ua8Wa8ZNNaBMhBa8Ua8Xa8ZNNa83Mh83a8Ua80a8ZNNaRMhRa8Ua8Wa8WNNa87Mh87a8Ua8Xa8XNNa88Mh88a8Ua80a80NNa86Mh86aHclfhHaAclfhAaOclfhOaQczfhQaLcufgLmbka8Na8Kc8S2fgea86aeIdbMUdbaea88aeIdlMUdlaea87aeIdwMUdwaea85aeIdxMUdxaea81aeIdzMUdzaea8VaeIdCMUdCaeaRaeIdKMUdKaea83aeId3MUd3aeaBaeIdaMUdaaea8YaeId8KMUd8Kaea8UaeIdyMUdya8NaXc8S2fgea86aeIdbMUdbaea88aeIdlMUdlaea87aeIdwMUdwaea85aeIdxMUdxaea81aeIdzMUdzaea8VaeIdCMUdCaeaRaeIdKMUdKaea83aeId3MUd3aeaBaeIdaMUdaaea8YaeId8KMUd8Kaea8UaeIdyMUdya8Nahc8S2fgea86aeIdbMUdbaea88aeIdlMUdlaea87aeIdwMUdwaea85aeIdxMUdxaea81aeIdzMUdzaea8VaeIdCMUdCaeaRaeIdKMUdKaea83aeId3MUd3aeaBaeIdaMUdaaea8YaeId8KMUd8Kaea8UaeIdyMUdyaqagcltfhLcbhHa8LhAinaLaHfgeascjdfaHfgOIdbaeIdbMUdbaeclfgQaOclfIdbaQIdbMUdbaecwfgQaOcwfIdbaQIdbMUdbaecxfgeaOcxfIdbaeIdbMUdbaHczfhHaAcufgAmbkaqa8JcltfhLcbhHa8LhAinaLaHfgeascjdfaHfgOIdbaeIdbMUdbaeclfgQaOclfIdbaQIdbMUdbaecwfgQaOcwfIdbaQIdbMUdbaecxfgeaOcxfIdbaeIdbMUdbaHczfhHaAcufgAmbkaqaEcltfhLcbhHa8LhAinaLaHfgeascjdfaHfgOIdbaeIdbMUdbaeclfgQaOclfIdbaQIdbMUdbaecwfgQaOcwfIdbaQIdbMUdbaecxfgeaOcxfIdbaeIdbMUdbaHczfhHaAcufgAmbkaKcifgKad6mbkkcbhOdndnamcwGg9imbJbbbbh85cbh6cbh9kcbh0xekcbh6a3cbyd1:jjjbHjjjjbbh0asc:Cefasyd;8egecdtfa0BdbasaecefBd;8ecua0alabadaCz:fjjjbgAcltaAcjjjjiGEcbyd1:jjjbHjjjjbbh9kasc:Cefasyd;8egecdtfa9kBdbasaecefBd;8ea9kaAa0aaalz:gjjjbJFFuuh85aATmba9kheaAhHinaeIdbg8Ua85a85a8U9EEh85aeclfheaHcufgHmbkaAh6kasydNeh9mdnalTmba9mclfhea9mydbhAa5hHalhQcbhOincbaeydbgLaA9RaHRbbcpeGEaOfhOaHcefhHaeclfheaLhAaQcufgQmbkaOce4hOkcuadaO9Rcifg9ncx2a9nc;v:Q;v:Qe0Ecbyd1:jjjbHjjjjbbh8Pasc:Cefasyd;8egecdtfa8PBdbasaecefBd;8ecua9ncdta9ncFFFFi0Ecbyd1:jjjbHjjjjbbh9oasc:Cefasyd;8egecdtfa9oBdbasaecefBd;8ea3cbyd1:jjjbHjjjjbbhDasc:Cefasyd;8egecdtfaDBdbasaecefBd;8ealcbyd1:jjjbHjjjjbbh9pasc:Cefasyd;8egecdtfa9pBdbasaecefBd;8eaxaxNa8RJbbjZamclGEgnanN:vh88Jbbbbh86dnadak9nmbdna9nci6mbasyd:yeh9qa8Lclth9ra8Pcwfh9sJbbbbh87Jbbbbh86inascNefabadalaCz:cjjjbabh8Kcbh8Mcbh3inaba3cdtfhgcbheindnaCa8KaefydbgOcdtgXfydbgAaCagaec:W1jjbfydbcdtfydbgHcdtghfydbgQSmba5aHfRbbgKcv2a5aOfRbbgLfc;a1jjbfRbbg8JaLcv2aKfgEc;a1jjbfRbbg8AVcFeGTmbdnaQaA9nmbaEc;G1jjbfRbbcFeGmekdnaLcufcFeGce0mbaKTmba8EaXfydbaH9hmekdnaLTmbaKcufcFeGce0mba8FahfydbaO9hmeka8Pa8Mcx2fgAaHaOa8AcFeGgQEBdlaAaOaHaQEBdbaAaQa8JGcb9hBdwa8Mcefh8Mkaeclfgecx9hmbkdna3cifg3ad9pmba8Kcxfh8Ka8Mcifa9n9nmekka8MTmdcbhhinayaCa8Pahcx2fgKydbgQcdtgAfydbc8S2fgeIdwaaaKydlgLcx2fgHIdwg8XNaeIdzaHIdbg80NaeIdaMg8Ua8UMMa8XNaeIdlaHIdlg8ZNaeIdCa8XNaeId3Mg8Ua8UMMa8ZNaeIdba80NaeIdxa8ZNaeIdKMg8Ua8UMMa80NaeId8KMMM:lh8UJbbbbJbbjZaeIdyg8W:va8WJbbbb9BEh8WdndnaKydwg8KmbJFFuuh81xekJbbbbJbbjZayaCaLcdtfydbc8S2fgeIdygU:vaUJbbbb9BEaeIdwaaaQcx2fgHIdwgUNaeIdzaHIdbg8YNaeIdaMgBaBMMaUNaeIdlaHIdlgBNaeIdCaUNaeId3MgUaUMMaBNaeIdba8YNaeIdxaBNaeIdKMgUaUMMa8YNaeId8KMMM:lNh81ka8Wa8UNh8Vdna8LTmba8NaQc8S2fgHIdwa8XNaHIdza80NaHIdaMg8Ua8UMMa8XNaHIdla8ZNaHIdCa8XNaHId3Mg8Ua8UMMa8ZNaHIdba80NaHIdxa8ZNaHIdKMg8Ua8UMMa80NaHId8KMMMh8UaqaQa8L2ggcltfheaHIdyhUa8SaLa8L2gEcdtfgXhHa8LhOinaHIdbg8Wa8WaUNaecxfIdba8XaecwfIdbNa80aeIdbNa8ZaeclfIdbNMMMg8Wa8WM:tNa8UMh8UaHclfhHaeczfheaOcufgOmbkdndna8KmbJbbbbh8Wxeka8NaLc8S2fgOIdwaaaQcx2fgeIdwg8YNaOIdzaeIdbgBNaOIdaMg8Wa8WMMa8YNaOIdlaeIdlg83NaOIdCa8YNaOId3Mg8Wa8WMMa83NaOIdbaBNaOIdxa83NaOIdKMg8Wa8WMMaBNaOId8KMMMh8Wa8SagcdtfhHaqaEcltfheaOIdyhRa8LhOinaHIdbgUaUaRNaecxfIdba8YaecwfIdbNaBaeIdbNa83aeclfIdbNMMMgUaUM:tNa8WMh8WaHclfhHaeczfheaOcufgOmbka8W:lh8Wka8Va8U:lMh8Va81a8WMh81dndndna5aQfRbbc9:fPdbedkdna8Fa8Ea8EaAfydbaLSEaYaAfydbgXcdtfydbgAcu9hmbaYaLcdtfydbhAka8NaXc8S2fgOIdwaaaAcx2fgeIdwg8XNaOIdzaeIdbg80NaOIdaMg8Ua8UMMa8XNaOIdlaeIdlg8ZNaOIdCa8XNaOId3Mg8Ua8UMMa8ZNaOIdba80NaOIdxa8ZNaOIdKMg8Ua8UMMa80NaOId8KMMMh8Ua8SaAa8L2ggcdtfhHaqaXa8L2gEcltfheaOIdyhUa8LhOinaHIdbg8Wa8WaUNaecxfIdba8XaecwfIdbNa80aeIdbNa8ZaeclfIdbNMMMg8Wa8WM:tNa8UMh8UaHclfhHaeczfheaOcufgOmbkdndna8KmbJbbbbh8Wxeka8NaAc8S2fgOIdwaaaXcx2fgeIdwg80NaOIdzaeIdbg8ZNaOIdaMg8Wa8WMMa80NaOIdlaeIdlgUNaOIdCa80NaOId3Mg8Wa8WMMaUNaOIdba8ZNaOIdxaUNaOIdKMg8Wa8WMMa8ZNaOId8KMMMh8Wa8SaEcdtfhHaqagcltfheaOIdyh8Ya8LhOinaHIdbg8Xa8Xa8YNaecxfIdba80aecwfIdbNa8ZaeIdbNaUaeclfIdbNMMMg8Xa8XM:tNa8WMh8WaHclfhHaeczfheaOcufgOmbka8W:lh8Wka8Va8U:lMh8Va81a8WMh81xdkaYaAfydbgAaQSmbina8NaAc8S2fgHIdwa8XNaHIdza80NaHIdaMg8Ua8UMMa8XNaHIdla8ZNaHIdCa8XNaHId3Mg8Ua8UMMa8ZNaHIdba80NaHIdxa8ZNaHIdKMg8Ua8UMMa80NaHId8KMMMh8UaqaAa8L2cltfheaHIdyhUaXhHa8LhOinaHIdbg8Wa8WaUNaecxfIdba8XaecwfIdbNa80aeIdbNa8ZaeclfIdbNMMMg8Wa8WM:tNa8UMh8UaHclfhHaeczfheaOcufgOmbka8Va8U:lMh8VaYaAcdtfydbgAaQ9hmbkka5aLfRbbci9hmba8KTmbaYaLcdtfydbgAaLSmba8SagcdtfhXaaaQcx2fgeIdbh8XaeIdwh80aeIdlh8Zina8NaAc8S2fgHIdwa80NaHIdza8XNaHIdaMg8Ua8UMMa80NaHIdla8ZNaHIdCa80NaHId3Mg8Ua8UMMa8ZNaHIdba8XNaHIdxa8ZNaHIdKMg8Ua8UMMa8XNaHId8KMMMh8UaqaAa8L2cltfheaHIdyhUaXhHa8LhOinaHIdbg8Wa8WaUNaecxfIdba80aecwfIdbNa8XaeIdbNa8ZaeclfIdbNMMMg8Wa8WM:tNa8UMh8UaHclfhHaeczfheaOcufgOmbka81a8U:lMh81aYaAcdtfydbgAaL9hmbkkaKa81a8Va81a8V9DgeEUdwaKaQaLaea8Kcb9hGgeEBdlaKaLaQaeEBdbahcefgha8M9hmbkascjdfcbcj;qbz:rjjjb8Aa9shea8MhHinascjdfaeydbcA4cF8FGgOcFAaOcFA6EcdtfgOaOydbcefBdbaecxfheaHcufgHmbkcbhecbhHinascjdfaefgOydbhAaOaHBdbaAaHfhHaeclfgecj;qb9hmbkcbhea9shHinascjdfaHydbcA4cF8FGgOcFAaOcFA6EcdtfgOaOydbgOcefBdba9oaOcdtfaeBdbaHcxfhHa8Maecefge9hmbkadak9RgOci9Uh9tdnalTmbcbheaDhHinaHaeBdbaHclfhHalaecefge9hmbkkcbh9ua9pcbalz:rjjjbh3aOcO9Uh9va9tce4h9wcbh8Acbh8Jdnina8Pa9oa8Jcdtfydbcx2fgEIdwg8Ua889Emea8Aa9t9pmeJFFuuh8Wdna9wa8M9pmba8Pa9oa9wcdtfydbcx2fIdwJbb;aZNh8Wkdna8Ua8W9ETmba8Ua869ETmba8Aa9v0mdkdna3aCaEydlghcdtg9xfydbgAfg9yRbba3aCaEydbg8Kcdtg9zfydbgefg9ARbbVmba5a8KfRbbh9Bdna9maecdtfgHclfydbgOaHydbgHSmbaOaH9RhQaaaAcx2fhKaaaecx2fhXa9qaHcitfhecbhHcehgdnindnaDaeydbcdtfydbgOaASmbaDaeclfydbcdtfydbgLaASmbaOaLSmbaaaLcx2fgLIdbaaaOcx2fgOIdbg8X:tg8UaXIdlaOIdlg80:tg8YNaXIdba8X:tgBaLIdla80:tg8WN:tg8Za8UaKIdla80:tg83NaKIdba8X:tgRa8WN:tg80Na8WaXIdwaOIdwgU:tg8VNa8YaLIdwaU:tg8XN:tg8Ya8WaKIdwaU:tg81Na83a8XN:tg8WNa8XaBNa8Va8UN:tgUa8XaRNa81a8UN:tg8UNMMa8Za8ZNa8Ya8YNaUaUNMMa80a80Na8Wa8WNa8Ua8UNMMN:rJbbj8:N9FmdkaecwfheaHcefgHaQ6hgaQaH9hmbkkagceGTmba9wcefh9wxekdndndndna9Bc9:fPdebdka8KheinaDaecdtgefahBdbaYaefydbgea8K9hmbxikkdna8Fa8Ea8Ea9zfydbahSEaYa9zfydbg8Kcdtfydbgecu9hmbaYa9xfydbhekaDa9zfahBdbaehhkaDa8KcdtfahBdbka9Ace86bba9yce86bbaEIdwg8Ua86a86a8U9DEh86a9ucefh9ucecda9BceSEa8Afh8Aka8Jcefg8Ja8M9hmbkka9uTmddnalTmbcbhLcbhXindnaDaXcdtgefydbgOaXSmbaCaOcdtfydbh8KdnaXaCaefydb9hghmbaya8Kc8S2fgeayaXc8S2fgHIdbaeIdbMUdbaeaHIdlaeIdlMUdlaeaHIdwaeIdwMUdwaeaHIdxaeIdxMUdxaeaHIdzaeIdzMUdzaeaHIdCaeIdCMUdCaeaHIdKaeIdKMUdKaeaHId3aeId3MUd3aeaHIdaaeIdaMUdaaeaHId8KaeId8KMUd8KaeaHIdyaeIdyMUdyaITmbaIa8KcltfgeaIaXcltfgHIdbaeIdbMUdbaeaHIdlaeIdlMUdlaeaHIdwaeIdwMUdwaeaHIdxaeIdxMUdxka8LTmba8NaOc8S2fgea8NaXc8S2ggfgHIdbaeIdbMUdbaeaHIdlaeIdlMUdlaeaHIdwaeIdwMUdwaeaHIdxaeIdxMUdxaeaHIdzaeIdzMUdzaeaHIdCaeIdCMUdCaeaHIdKaeIdKMUdKaeaHId3aeId3MUd3aeaHIdaaeIdaMUdaaeaHId8KaeId8KMUd8KaeaHIdyaeIdyMUdya9raO2hKaqhHa8LhAinaHaKfgeaHaLfgOIdbaeIdbMUdbaeclfgQaOclfIdbaQIdbMUdbaecwfgQaOcwfIdbaQIdbMUdbaecxfgeaOcxfIdbaeIdbMUdbaHczfhHaAcufgAmbkahmbJbbbbJbbjZayagfgeIdyg8U:va8UJbbbb9BEaeIdwaaa8Kcx2fgHIdwg8UNaeIdzaHIdbg8WNaeIdaMg8Xa8XMMa8UNaeIdlaHIdlg8XNaeIdCa8UNaeId3Mg8Ua8UMMa8XNaeIdba8WNaeIdxa8XNaeIdKMg8Ua8UMMa8WNaeId8KMMM:lNg8Ua87a87a8U9DEh87kaLa9rfhLaXcefgXal9hmbkcbhHa8EheindnaeydbgOcuSmbdnaHaDaOcdtgAfydbgO9hmbcuhOa8EaAfydbgAcuSmbaDaAcdtfydbhOkaeaOBdbkaeclfhealaHcefgH9hmbkcbhHa8FheindnaeydbgOcuSmbdnaHaDaOcdtgAfydbgO9hmbcuhOa8FaAfydbgAcuSmbaDaAcdtfydbhOkaeaOBdbkaeclfhealaHcefgH9hmbkka87a86a8LEh87cbhHabhecbhOindnaCaDaeydbcdtfydbgLcdtfydbgAaCaDaeclfydbcdtfydbgKcdtfydbgQSmbaAaCaDaecwfydbcdtfydbg8KcdtfydbgXSmbaQaXSmbabaHcdtfgAaLBdbaAcwfa8KBdbaAclfaKBdbaHcifhHkaecxfheaOcifgOad6mbkdndna9imbaHhdxekdnaHak0mbaHhdxekdna85a879FmbaHhdxekJFFuuh85cbhdabhecbhOindna9ka0aeydbgAcdtfydbcdtfIdbg8Ua879ETmbaeclf8Pdbh9CabadcdtfgQaABdbaQclfa9C83dba8Ua85a85a8U9EEh85adcifhdkaecxfheaOcifgOaH6mbkkadak0mbxdkkascNefabadalaCz:cjjjbkdndnadak0mbadhOxekdna9imbadhOxekdna85a889FmbadhOxekcehLina85Jbb;aZNg8Ua88a8Ua889DEh8XJbbbbh8Udna6Tmba9khea6hHinaeIdbg8Wa8Ua8Wa8X9FEa8Ua8Wa8U9EEh8UaeclfheaHcufgHmbkkJFFuuh85cbhOabhecbhHindna9ka0aeydbgAcdtfydbcdtfIdbg8Wa8X9ETmbaeclf8Pdbh9CabaOcdtfgQaABdbaQclfa9C83dba8Wa85a85a8W9EEh85aOcifhOkaecxfheaHcifgHad6mbkdnaLaOad9hVceGmbadhOxdka8Ua86a86a8U9DEh86aOak9nmecbhLaOhda85a889FmbkkdnamcjjjjdGTmba9pcbalz:rjjjbhLdnaOTmbabheaOhHinaLaeydbgAfa5aAfRbbcl9h86bbaeclfheaHcufgHmbkkascNefabaOalaCz:cjjjbalTmbcbhQasyd:yehgindnaLaQfRbbTmbdna5aQfRbbgecl0mbceaetcQGmekdnaCaQcdtgKfydbgeaQSmbaaaQcx2fgHaaaecx2fge8Pdb83dbaHcwfaecwfydbBdbxekayaQc8S2fgeIdyg8Ua8UJL:3;rUNg8UMh88aeIdwa8UMhRaeIdla8UMh8VaeIdba8UMhUaeIdaa8UaaaQcx2fg8KIdwg89N:th81aeId3a8Ua8KIdlg8:N:th85aeIdKa8KIdbgZa8UN:th8YJbbbbhcaeIdCJbbbbMh87aeIdzJbbbbMhBaeIdxJbbbbMh83dndna8LTmbaQhAinJbbbba88a8NaAc8S2fgHIdyg8U:va8UJbbbb9BEh8UaqaAa8L2cltfheaHIdaa88Na81Mh81aHId3a88Na85Mh85aHIdKa88Na8YMh8YaHIdCa88Na87Mh87aHIdza88NaBMhBaHIdxa88Na83Mh83aHIdwa88NaRMhRaHIdla88Na8VMh8VaHIdba88NaUMhUa8LhHina81aecxfIdbg8ZaecwfIdbg8WNa8UN:th81a85a8ZaeclfIdbg8XNa8UN:th85a87a8Wa8XNa8UN:th87aUaeIdbg80a80Na8UN:thUa8Ya8Za80Na8UN:th8YaBa8Wa80Na8UN:thBa83a8Xa80Na8UN:th83aRa8Wa8WNa8UN:thRa8Va8Xa8XNa8UN:th8VaeczfheaHcufgHmbkaYaAcdtfydbgAaQ9hmbkaITmbaIaQcltfgeIdxhTaeIdwh9caeIdlhJaeIdbh8UxekJbbbbhTJbbbbh9cJbbbbhJJbbbbh8UkaBaU:vg8Xa8YNa81:ta87aBa83aU:vg8WN:tg81a8Va83a8WN:tg8Z:vg80a8Wa8YNa85:tg8VN:th85a9ca8Ua8XN:taJa8Ua8WN:tg83a80N:tg87aRaBa8XN:ta81a80N:tgB:vgR:mh81a83a8Z:vg9c:mhJdnJbbbba8Ua8UaU:vg9eN:ta83a9cN:ta87aRN:tg83:la88J:983:g81Ng8U9ETmba81a85NaJa8VNa9ea8YNaT:tMMa83:vhckaU:la8U9ETmba8Z:la8U9ETmbaB:la8U9ETmba9e:macNa8X:ma81acNa85aB:vMg85Na8W:maJacNa80:ma85Na8Va8Z:vMMg87Na8Y:maU:vMMMh88a9maKfgeclfydbgHaeydbge9RhXagaecitfhKJbbbbh8UdnaHaeSghmbJbbbbh8UaKheaXhAinaaaeclfydbcx2fgHIdwa89:tg8Wa8WNaHIdbaZ:tg8Wa8WNaHIdla8::tg8Wa8WNMMg8Waaaeydbcx2fgHIdwa89:tg8Xa8XNaHIdbaZ:tg8Xa8XNaHIdla8::tg8Xa8XNMMg8Xa8Ua8Ua8X9DEg8Ua8Ua8W9DEh8UaecwfheaAcufgAmbkka85a89:tg8Wa8WNa88aZ:tg8Wa8WNa87a8::tg8Wa8WNMMa8U:rg8Ua8UN9EmbdnahmbcbhAcehhdninaaaKclfydbcx2fgeIdbaaaKydbcx2fgHIdbg8X:tg8Ua8:aHIdlg80:tg8YNaZa8X:tgBaeIdla80:tg8WN:tg8Za8Ua87a80:tg83Na88a8X:tgRa8WN:tg80Na8Wa89aHIdwgU:tg8VNa8YaeIdwaU:tg8XN:tg8Ya8Wa85aU:tg81Na83a8XN:tg8WNa8XaBNa8Va8UN:tgUa8XaRNa81a8UN:tg8UNMMa8Za8ZNa8Ya8YNaUaUNMMa80a80Na8Wa8WNa8Ua8UNMMN:rJbbj8:N9FmeaKcwfhKaAcefgAaX6hhaXaA9hmbkkahceGmeka8Ka85Udwa8Ka87Udla8Ka88UdbkaQcefgQal9hmbkdndna8LTmba8LclthYa8Lcdth8KcbhKa8ShXindnaLaKfRbbTmba5aKfRbbclSmbJbbbbJbbjZa8NaKc8S2fIdyg8U:va8UJbbbb9BEh8UaaaCaKcdtfydbcx2fhHaqheaXhAa8LhQinaAa8UaecwfIdbaHIdwNaeIdbaHIdbNaeclfIdbaHIdlNMMaecxfIdbMNUdbaeczfheaAclfhAaQcufgQmbkkaqaYfhqaXa8KfhXaKcefgKal9hmbkarcd4hXavcd4hYasId:qeh8UasId:meh8WasId1eh8XazTmea8Lcdth8KcbhKindnaLaKfRbbTmbaiazaKcdtfydbgCaY2cdtfgeaaaKcx2fgHIdba8RNa8XMUdbaeaHIdla8RNa8WMUdlaeaHIdwa8RNa8UMUdwaoaCaX2cdtfhQashea8ShHa8LhCinaQaeydbcdtgAfaHIdbawaAfIdb:vUdbaeclfheaHclfhHaCcufgCmbkka8Sa8Kfh8SaKcefgKal9hmbxikkavcd4hCasId:qeh8UasId:meh8WasId1eh8XdnazTmbazheindna9pRbbTmbaiaeydbaC2cdtfgHaaIdba8RNa8XMUdbaHaaclfIdba8RNa8WMUdlaHaacwfIdba8RNa8UMUdwka9pcefh9paeclfheaacxfhaalcufglmbxikkaCcdtheindna9pRbbTmbaiaaIdba8RNa8XMUdbaiclfaaclfIdba8RNa8WMUdbaicwfaacwfIdba8RNa8UMUdbka9pcefh9paacxfhaaiaefhialcufglmbxdkka8Lcdth8KcbhKindnaLaKfRbbTmbaiaKaY2cdtfgeaaaKcx2fgHIdba8RNa8XMUdbaeaHIdla8RNa8WMUdlaeaHIdwa8RNa8UMUdwaoaKaX2cdtfhQashea8ShHa8LhCinaQaeydbcdtgAfaHIdbawaAfIdb:vUdbaeclfheaHclfhHaCcufgCmbkka8Sa8Kfh8SaKcefgKal9hmbkkdnamcjjjjlGTmbazmbaOTmbcbhLabheina5aeydbgAfRbbc3thKaecwfgXydbhHdndna8EaAcdtg8KfydbaeclfgYydbgCSmbcbhQa8FaCcdtfydbaA9hmekcjjjj94hQkaeaKaQVaAVBdba5aCfRbbc3thKdndna8EaCcdtfydbaHSmbcbhQa8FaHcdtfydbaC9hmekcjjjj94hQkaYaKaQVaCVBdba5aHfRbbc3thQdndna8EaHcdtfydbaASmbcbhCa8Fa8KfydbaH9hmekcjjjj94hCkaXaQaCVaHVBdbaecxfheaLcifgLaO6mbkkdnazTmbaOTmbaOheinabazabydbcdtfydbBdbabclfhbaecufgembkkdnaPTmbaPana86:rNUdbkasyd;8egecdtasc:Ceffc98fhHdninaeTmeaHydbcbyd:m:jjjbH:bjjjbbaHc98fhHaecufhexbkkascj;sbf8KjjjjbaOk;Yieouabydlhvabydbclfcbaicdtz:rjjjbhoadci9UhrdnadTmbdnalTmbaehwadhDinaoalawydbcdtfydbcdtfgqaqydbcefBdbawclfhwaDcufgDmbxdkkaehwadhDinaoawydbcdtfgqaqydbcefBdbawclfhwaDcufgDmbkkdnaiTmbcbhDaohwinawydbhqawaDBdbawclfhwaqaDfhDaicufgimbkkdnadci6mbinaecwfydbhwaeclfydbhDaeydbhidnalTmbalawcdtfydbhwalaDcdtfydbhDalaicdtfydbhikavaoaicdtfgqydbcitfaDBdbavaqydbcitfawBdlaqaqydbcefBdbavaoaDcdtfgqydbcitfawBdbavaqydbcitfaiBdlaqaqydbcefBdbavaoawcdtfgwydbcitfaiBdbavawydbcitfaDBdlawawydbcefBdbaecxfhearcufgrmbkkabydbcbBdbk:todDue99aicd4aifhrcehwinawgDcethwaDar6mbkcuaDcdtgraDcFFFFi0Ecbyd1:jjjbHjjjjbbhwaoaoyd9GgqcefBd9GaoaqcdtfawBdbawcFearz:rjjjbhkdnaiTmbalcd4hlaDcufhxcbhminamhDdnavTmbavamcdtfydbhDkcbadaDal2cdtfgDydlgwawcjjjj94SEgwcH4aw7c:F:b:DD2cbaDydbgwawcjjjj94SEgwcH4aw7c;D;O:B8J27cbaDydwgDaDcjjjj94SEgDcH4aD7c:3F;N8N27axGhwamcdthPdndndnavTmbakawcdtfgrydbgDcuSmeadavaPfydbal2cdtfgsIdbhzcehqinaqhrdnadavaDcdtfydbal2cdtfgqIdbaz9CmbaqIdlasIdl9CmbaqIdwasIdw9BmlkarcefhqakawarfaxGgwcdtfgrydbgDcu9hmbxdkkakawcdtfgrydbgDcuSmbadamal2cdtfgsIdbhzcehqinaqhrdnadaDal2cdtfgqIdbaz9CmbaqIdlasIdl9CmbaqIdwasIdw9BmikarcefhqakawarfaxGgwcdtfgrydbgDcu9hmbkkaramBdbamhDkabaPfaDBdbamcefgmai9hmbkkakcbyd:m:jjjbH:bjjjbbaoaoyd9GcufBd9GdnaeTmbaiTmbcbhDaehwinawaDBdbawclfhwaiaDcefgD9hmbkcbhDaehwindnaDabydbgrSmbawaearcdtfgrydbBdbaraDBdbkawclfhwabclfhbaiaDcefgD9hmbkkk:hrdvuv998Jjjjjbca9Rgoczfcwfcbyd11jjbBdbaocb8Pdj1jjb83izaocwfcbydN1jjbBdbaocb8Pd:m1jjb83ibdnadTmbaicd4hrdnabmbdnalTmbcbhwinaealawcdtfydbar2cdtfhDcbhiinaoczfaifgqaDaifIdbgkaqIdbgxaxak9EEUdbaoaifgqakaqIdbgxaxak9DEUdbaiclfgicx9hmbkawcefgwad9hmbxikkarcdthwcbhDincbhiinaoczfaifgqaeaifIdbgkaqIdbgxaxak9EEUdbaoaifgqakaqIdbgxaxak9DEUdbaiclfgicx9hmbkaeawfheaDcefgDad9hmbxdkkdnalTmbcbhwinabawcx2fgiaealawcdtfydbar2cdtfgDIdbUdbaiaDIdlUdlaiaDIdwUdwcbhiinaoczfaifgqaDaifIdbgkaqIdbgxaxak9EEUdbaoaifgqakaqIdbgxaxak9DEUdbaiclfgicx9hmbkawcefgwad9hmbxdkkarcdthlcbhwaehDinabawcx2fgiaeawar2cdtfgqIdbUdbaiaqIdlUdlaiaqIdwUdwcbhiinaoczfaifgqaDaifIdbgkaqIdbgxaxak9EEUdbaoaifgqakaqIdbgxaxak9DEUdbaiclfgicx9hmbkaDalfhDawcefgwad9hmbkkJbbbbaoIdbaoIdzgx:tgkakJbbbb9DEgkaoIdlaoIdCgm:tgPaPak9DEgkaoIdwaoIdKgP:tgsasak9DEhsdnabTmbadTmbJbbbbJbbjZas:vasJbbbb9BEhkinabakabIdbax:tNUdbabclfgoakaoIdbam:tNUdbabcwfgoakaoIdbaP:tNUdbabcxfhbadcufgdmbkkdnavTmbavaPUdwavamUdlavaxUdbkask:ZlewudnaeTmbcbhvabhoinaoavBdbaoclfhoaeavcefgv9hmbkkdnaiTmbcbhrinadarcdtfhwcbhDinalawaDcdtgvc:G1jjbfydbcdtfydbcdtfydbhodnabalawavfydbcdtfydbgqcdtfgkydbgvaqSmbinakabavgqcdtfgxydbgvBdbaxhkaqav9hmbkkdnabaocdtfgkydbgvaoSmbinakabavgocdtfgxydbgvBdbaxhkaoav9hmbkkdnaqaoSmbabaqaoaqao0Ecdtfaqaoaqao6EBdbkaDcefgDci9hmbkarcifgrai6mbkkdnaembcbskcbhxindnalaxcdtgvfydbax9hmbaxhodnabavfgDydbgvaxSmbaDhqinaqabavgocdtfgkydbgvBdbakhqaoav9hmbkkaDaoBdbkaxcefgxae9hmbkcbhvabhocbhkindndnavalydbgq9hmbdnavaoydbgq9hmbaoakBdbakcefhkxdkaoabaqcdtfydbBdbxekaoabaqcdtfydbBdbkaoclfhoalclfhlaeavcefgv9hmbkakk;Jiilud99duabcbaecltz:rjjjbhvdnalTmbadhoaihralhwinarcwfIdbhDarclfIdbhqavaoydbcltfgkarIdbakIdbMUdbakclfgxaqaxIdbMUdbakcwfgxaDaxIdbMUdbakcxfgkakIdbJbbjZMUdbaoclfhoarcxfhrawcufgwmbkkdnaeTmbavhraehkinarcxfgoIdbhDaocbBdbararIdbJbbbbJbbjZaD:vaDJbbbb9BEgDNUdbarclfgoaDaoIdbNUdbarcwfgoaDaoIdbNUdbarczfhrakcufgkmbkkdnalTmbinavadydbcltfgrcxfgkaicwfIdbarcwfIdb:tgDaDNaiIdbarIdb:tgDaDNaiclfIdbarclfIdb:tgDaDNMMgDakIdbgqaqaD9DEUdbadclfhdaicxfhialcufglmbkkdnaeTmbavcxfhrinabarIdbUdbarczfhrabclfhbaecufgembkkk8MbabaeadaialavcbcbcbcbcbaoarawaDz:bjjjbk8MbabaeadaialavaoarawaDaqakaxamaPz:bjjjbkRbababaeadaialavaoarawaDaqakaxcjjjjdVamz:bjjjbk:p8Koque99due99iuq998Jjjjjbc;Wb9Rgq8Kjjjjbcbhkaqcxfcbc;Kbz:rjjjb8Aaqcualcx2alc;v:Q;v:Qe0Ecbyd1:jjjbHjjjjbbgxBdxaqceBd2axaialavcbcbz:ejjjb8AaqcualcdtalcFFFFi0Egmcbyd1:jjjbHjjjjbbgiBdzaqcdBd2dndnJFF959eJbbjZawJbbjZawJbbjZ9DE:vawJ9VO:d869DEgw:lJbbb9p9DTmbaw:OhPxekcjjjj94hPkadci9Uhsarco9UhzdndnaombaPcd9imekdnalTmbaPcuf:YhwdnaoTmbcbhvaihHaxhOindndnaoavfRbbceGTmbavcjjjjlVhAxekdndnaOclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkaAcqthAdndnaOcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhXxekcjjjj94hXkaAaXVhAdndnaOIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhXxekcjjjj94hXkaAaXcCtVhAkaHaABdbaHclfhHaOcxfhOalavcefgv9hmbxdkkaxhvaihOalhHindndnavIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkaAcCthAdndnavclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhXxekcjjjj94hXkaXcqtaAVhAdndnavcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhXxekcjjjj94hXkaOaAaXVBdbavcxfhvaOclfhOaHcufgHmbkkadTmbcbhkaehvcbhOinakaiavclfydbcdtfydbgHaiavcwfydbcdtfydbgA9haiavydbcdtfydbgXaH9haXaA9hGGfhkavcxfhvaOcifgOad6mbkkarci9UhQdndnaz:Z:rJbbbZMgw:lJbbb9p9DTmbaw:Ohvxekcjjjj94hvkaQ:ZhLcbhKc:bwhHdndninashYaHhXaPhrakg8AaQ9pmeaXar9Rcd9imeavaXcufavaX9iEarcefavar9kEhzdnalTmbazcuf:YhwdnaoTmbcbhOaihPaxhvindndnaoaOfRbbceGTmbaOcjjjjlVhHxekdndnavclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhHxekcjjjj94hHkaHcqthHdndnavcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskaHasVhHdndnavIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskaHascCtVhHkaPaHBdbaPclfhPavcxfhvalaOcefgO9hmbxdkkaxhvaihOalhPindndnavIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhHxekcjjjj94hHkaHcCthHdndnavclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskascqtaHVhHdndnavcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskaOaHasVBdbavcxfhvaOclfhOaPcufgPmbkkcbhOdnadTmbaehvcbhPinaOaiavclfydbcdtfydbgHaiavcwfydbcdtfydbgs9haiavydbcdtfydbgAaH9haAas9hGGfhOavcxfhvaPcifgPad6mbkkaYhsaOhkaXhHazhPdnaOaQ9nmbaOhsa8AhkazhHarhPkdndnaKcl0mbdnaY:Zgwa8A:ZgC:taz:YgEar:Y:tg3aEaX:Y:tg5aO:Zg8EaL:tNNNawaL:ta5NaCa8E:tNaCaL:ta3Na8Eaw:tNM:vaEMJbbbZMgw:lJbbb9p9DTmbaw:Ohvxdkcjjjj94hvxekaPaHfcd9ThvkaKcefgKcs9hmbxdkka8AhkarhPkdndndnakmbJbbjZhwcbhicdhvaDmexdkalcd4alfhHcehOinaOgvcethOavaH6mbkcbhOaqcuavcdtgravcFFFFi0Ecbyd1:jjjbHjjjjbbgzBdCaqciBd2aqamcbyd1:jjjbHjjjjbbgXBdKaqclBd2dndndndnalTmbaPcuf:YhwaoTmecbhOaihHaxhPindndnaoaOfRbbceGTmbaOcjjjjlVhsxekdndnaPclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskascqthsdndnaPcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkasaAVhsdndnaPIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkasaAcCtVhskaHasBdbaHclfhHaPcxfhPalaOcefgO9hmbxikkazcFearz:rjjjb8AcbhrcbhvxdkaxhOaihPalhHindndnaOIdbawNJbbbZMgC:lJbbb9p9DTmbaC:Ohsxekcjjjj94hskascCthsdndnaOclfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkaAcqtasVhsdndnaOcwfIdbawNJbbbZMgC:lJbbb9p9DTmbaC:OhAxekcjjjj94hAkaPasaAVBdbaOcxfhOaPclfhPaHcufgHmbkkazcFearz:rjjjbhAavcufhocbhrcbhzindndndnaAaiazcdtgKfydbgHcm4aH7c:v;t;h;Ev2gvcs4av7aoGgPcdtfgsydbgOcuSmbcehvinaiaOcdtgOfydbaHSmdaPavfhOavcefhvaAaOaoGgPcdtfgsydbgOcu9hmbkkasazBdbarhvarcefhrxekaXaOfydbhvkaXaKfavBdbazcefgzal9hmbkcuarc8S2gOarc;D;O;f8U0EhvkcbhAaqavcbyd1:jjjbHjjjjbbgvBd3aqcvBd2avcbaOz:rjjjbhOdnadTmbaehiinJbbnnJbbjZaXaiydbgHcdtfydbgvaXaiclfydbgPcdtfydbgzSavaXaicwfydbgscdtfydbgKSGgoEh8FdnaxaPcx2fgPIdbaxaHcx2fgHIdbg8E:tgCaxascx2fgsIdlaHIdlg3:tgwNasIdba8E:tgEaPIdla3:tgaN:tgLaLNaaasIdwaHIdwg5:tghNawaPIdwa5:tgaN:tgwawNaaaENahaCN:tgCaCNMM:rgEJbbbb9ETmbaLaE:vhLaCaE:vhCawaE:vhwkaOavc8S2fgvavIdbawa8FaE:rNgEawNNgaMUdbavaCaEaCNghNggavIdlMUdlavaLaEaLNg8FNg8JavIdwMUdwavahawNghavIdxMUdxava8FawNg8KavIdzMUdzava8FaCNg8FavIdCMUdCavawaEaLa5Nawa8ENa3aCNMM:mg3Ng8ENgwavIdKMUdKavaCa8ENgCavId3MUd3avaLa8ENgLavIdaMUdaava8Ea3Ng8EavId8KMUd8KavaEavIdyMUdydnaombaOazc8S2fgvaaavIdbMUdbavagavIdlMUdlava8JavIdwMUdwavahavIdxMUdxava8KavIdzMUdzava8FavIdCMUdCavawavIdKMUdKavaCavId3MUd3avaLavIdaMUdaava8EavId8KMUd8KavaEavIdyMUdyaOaKc8S2fgvaaavIdbMUdbavagavIdlMUdlava8JavIdwMUdwavahavIdxMUdxava8KavIdzMUdzava8FavIdCMUdCavawavIdKMUdKavaCavId3MUd3avaLavIdaMUdaava8EavId8KMUd8KavaEavIdyMUdykaicxfhiaAcifgAad6mbkkcbhHaqcuarcdtgvarcFFFFi0Egicbyd1:jjjbHjjjjbbgPBdaaqcoBd2aqaicbyd1:jjjbHjjjjbbgiBd8KaqcrBd2aPcFeavz:rjjjbhzdnalTmbaXhPinJbbbbJbbjZaOaPydbgsc8S2fgvIdygw:vawJbbbb9BEavIdwaxcwfIdbgwNavIdzaxIdbgCNavIdaMgLaLMMawNavIdlaxclfIdbgLNavIdCawNavId3MgwawMMaLNavIdbaCNavIdxaLNavIdKMgwawMMaCNavId8KMMM:lNhwdndnazascdtgvfgsydbcuSmbaiavfIdbaw9ETmekasaHBdbaiavfawUdbkaPclfhPaxcxfhxalaHcefgH9hmbkkJbbbbhwdnarTmbinaiIdbgCawawaC9DEhwaiclfhiarcufgrmbkkakcd4akfhOcehiinaigvcethiavaO6mbkcbhiaqcuavcdtgOavcFFFFi0Ecbyd1:jjjbHjjjjbbgPBdyaPcFeaOz:rjjjbhsdnadTmbavcufhAcbhrcbhxindnaXaeaxcdtfgvydbcdtfydbgiaXavclfydbcdtfydbgOSmbaiaXavcwfydbcdtfydbgvSmbaOavSmbazavcdtfydbhHdndnazaOcdtfydbgvazaicdtfydbgi9pmbavaH9pmbaHhlaihoavhHxekdnaHai9pmbaHav9pmbaihlavhoxekavhlaHhoaihHkabarcx2fgvaHBdbavcwfaoBdbavclfalBdbdnasaoc:3F;N8N2alc:F:b:DD27aHc;D;O:B8J27aAGgOcdtfgvydbgicuSmbcehPinaPhvdnabaicx2fgiydbaH9hmbaiydlal9hmbaiydwaoSmikavcefhPasaOavfaAGgOcdtfgvydbgicu9hmbkkavarBdbarcefhrkaxcifgxad6mbkarci2hikdnaDmbcwhvxdkaw:rhwcwhvkaDawUdbkavcdthvdninavTmeavc98fgvaqcxffydbcbyd:m:jjjbH:bjjjbbxbkkaqc;Wbf8Kjjjjbaik:2ldwue9:8Jjjjjbc;Wb9Rgr8Kjjjjbcbhwarcxfcbc;Kbz:rjjjb8AdnabaeSmbabaeadcdtz:qjjjb8AkarcualcdtalcFFFFi0EgDcbyd1:jjjbHjjjjbbgqBdxarceBd2aqcbaialavcbarcxfz:djjjbcualcx2alc;v:Q;v:Qe0Ecbyd1:jjjbHjjjjbbhkarcxfaryd2gxcdtgmfakBdbaraxcefgPBd2akaialavcbcbz:ejjjb8AarcxfaPcdtfaDcbyd1:jjjbHjjjjbbgvBdbaraxcdfgiBd2arcxfaicdtfcuavalaeadaqz:fjjjbgecltaecjjjjiGEcbyd1:jjjbHjjjjbbgiBdbaiaeavakalz:gjjjbdnadTmbaoaoNhocbhwabhlcbhkindnaiavalydbgecdtfydbcdtfIdbao9ETmbalclf8PdbhsabawcdtfgqaeBdbaqclfas83dbawcifhwkalcxfhlakcifgkad6mbkkaxcifhlamarcxffcwfhkdninalTmeakydbcbyd:m:jjjbH:bjjjbbakc98fhkalcufhlxbkkarc;Wbf8Kjjjjbawk:FCoDud99rue99iul998Jjjjjbc;Wb9Rgw8KjjjjbdndnarmbcbhDxekawcxfcbc;Kbz:rjjjb8Aawcuadcx2adc;v:Q;v:Qe0Ecbyd1:jjjbHjjjjbbgqBdxawceBd2aqaeadaicbcbz:ejjjb8AawcuadcdtadcFFFFi0Egkcbyd1:jjjbHjjjjbbgxBdzawcdBd2adcd4adfhmceheinaegicetheaiam6mbkcbhPawcuaicdtgsaicFFFFi0Ecbyd1:jjjbHjjjjbbgzBdCawciBd2dndnar:ZgH:rJbbbZMgO:lJbbb9p9DTmbaO:Ohexekcjjjj94hekaicufhAc:bwhmcbhCadhXcbhQinaChLaeamgKcufaeaK9iEaPgDcefaeaD9kEhYdndnadTmbaYcuf:YhOaqhiaxheadhmindndnaiIdbaONJbbbZMg8A:lJbbb9p9DTmba8A:OhCxekcjjjj94hCkaCcCthCdndnaiclfIdbaONJbbbZMg8A:lJbbb9p9DTmba8A:OhExekcjjjj94hEkaEcqtaCVhCdndnaicwfIdbaONJbbbZMg8A:lJbbb9p9DTmba8A:OhExekcjjjj94hEkaeaCaEVBdbaicxfhiaeclfheamcufgmmbkazcFeasz:rjjjbh3cbh5cbhPindna3axaPcdtfydbgCcm4aC7c:v;t;h;Ev2gics4ai7aAGgmcdtfgEydbgecuSmbaeaCSmbcehiina3amaifaAGgmcdtfgEydbgecuSmeaicefhiaeaC9hmbkkaEaCBdba5aecuSfh5aPcefgPad9hmbxdkkazcFeasz:rjjjb8Acbh5kaDaYa5ar0giEhPaLa5aiEhCdna5arSmbaYaKaiEgmaP9Rcd9imbdndnaQcl0mbdnaX:ZgOaL:Zg8A:taY:Yg8EaD:Y:tg8Fa8EaK:Y:tgaa5:ZghaH:tNNNaOaH:taaNa8Aah:tNa8AaH:ta8FNahaO:tNM:va8EMJbbbZMgO:lJbbb9p9DTmbaO:Ohexdkcjjjj94hexekaPamfcd9Theka5aXaiEhXaQcefgQcs9hmekkdndnaCmbcihicbhDxekcbhiawakcbyd1:jjjbHjjjjbbg5BdKawclBd2aPcuf:Yh8AdndnadTmbaqhiaxheadhmindndnaiIdba8ANJbbbZMgO:lJbbb9p9DTmbaO:OhCxekcjjjj94hCkaCcCthCdndnaiclfIdba8ANJbbbZMgO:lJbbb9p9DTmbaO:OhExekcjjjj94hEkaEcqtaCVhCdndnaicwfIdba8ANJbbbZMgO:lJbbb9p9DTmbaO:OhExekcjjjj94hEkaeaCaEVBdbaicxfhiaeclfheamcufgmmbkazcFeasz:rjjjbh3cbhDcbhYindndndna3axaYcdtgKfydbgCcm4aC7c:v;t;h;Ev2gics4ai7aAGgmcdtfgEydbgecuSmbcehiinaxaecdtgefydbaCSmdamaifheaicefhia3aeaAGgmcdtfgEydbgecu9hmbkkaEaYBdbaDhiaDcefhDxeka5aefydbhika5aKfaiBdbaYcefgYad9hmbkcuaDc32giaDc;j:KM;jb0EhexekazcFeasz:rjjjb8AcbhDcbhekawaecbyd1:jjjbHjjjjbbgeBd3awcvBd2aecbaiz:rjjjbhEavcd4hKdnadTmbdnalTmbaKcdth3a5hCaqhealhmadhAinaEaCydbc32fgiaeIdbaiIdbMUdbaiaeclfIdbaiIdlMUdlaiaecwfIdbaiIdwMUdwaiamIdbaiIdxMUdxaiamclfIdbaiIdzMUdzaiamcwfIdbaiIdCMUdCaiaiIdKJbbjZMUdKaCclfhCaecxfheama3fhmaAcufgAmbxdkka5hmaqheadhCinaEamydbc32fgiaeIdbaiIdbMUdbaiaeclfIdbaiIdlMUdlaiaecwfIdbaiIdwMUdwaiaiIdxJbbbbMUdxaiaiIdzJbbbbMUdzaiaiIdCJbbbbMUdCaiaiIdKJbbjZMUdKamclfhmaecxfheaCcufgCmbkkdnaDTmbaEhiaDheinaiaiIdbJbbbbJbbjZaicKfIdbgO:vaOJbbbb9BEgONUdbaiclfgmaOamIdbNUdbaicwfgmaOamIdbNUdbaicxfgmaOamIdbNUdbaiczfgmaOamIdbNUdbaicCfgmaOamIdbNUdbaic3fhiaecufgembkkcbhCawcuaDcdtgYaDcFFFFi0Egicbyd1:jjjbHjjjjbbgeBdaawcoBd2awaicbyd1:jjjbHjjjjbbg3Bd8KaecFeaYz:rjjjbhxdnadTmbJbbjZJbbjZa8A:vaPceSEaoNgOaONh8AaKcdthPalheina8Aaec;81jjbalEgmIdwaEa5ydbgAc32fgiIdC:tgOaONamIdbaiIdx:tgOaONamIdlaiIdz:tgOaONMMNaqcwfIdbaiIdw:tgOaONaqIdbaiIdb:tgOaONaqclfIdbaiIdl:tgOaONMMMhOdndnaxaAcdtgifgmydbcuSmba3aifIdbaO9ETmekamaCBdba3aifaOUdbka5clfh5aqcxfhqaeaPfheadaCcefgC9hmbkkabaxaYz:qjjjb8AcrhikaicdthiinaiTmeaic98fgiawcxffydbcbyd:m:jjjbH:bjjjbbxbkkawc;Wbf8KjjjjbaDk:Ydidui99ducbhi8Jjjjjbca9Rglczfcwfcbyd11jjbBdbalcb8Pdj1jjb83izalcwfcbydN1jjbBdbalcb8Pd:m1jjb83ibdndnaembJbbjFhvJbbjFhoJbbjFhrxekadcd4cdthwincbhdinalczfadfgDabadfIdbgvaDIdbgoaoav9EEUdbaladfgDavaDIdbgoaoav9DEUdbadclfgdcx9hmbkabawfhbaicefgiae9hmbkalIdwalIdK:thralIdlalIdC:thoalIdbalIdz:thvkJbbbbavavJbbbb9DEgvaoaoav9DEgvararav9DEk9DeeuabcFeaicdtz:rjjjbhlcbhbdnadTmbindnalaeydbcdtfgiydbcu9hmbaiabBdbabcefhbkaeclfheadcufgdmbkkabk9teiucbcbyd:q:jjjbgeabcifc98GfgbBd:q:jjjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik;teeeudndnaeabVciGTmbabhixekdndnadcz9pmbabhixekabhiinaiaeydbBdbaiaeydlBdlaiaeydwBdwaiaeydxBdxaeczfheaiczfhiadc9Wfgdcs0mbkkadcl6mbinaiaeydbBdbaeclfheaiclfhiadc98fgdci0mbkkdnadTmbinaiaeRbb86bbaicefhiaecefheadcufgdmbkkabk:3eedudndnabciGTmbabhixekaecFeGc:b:c:ew2hldndnadcz9pmbabhixekabhiinaialBdxaialBdwaialBdlaialBdbaiczfhiadc9Wfgdcs0mbkkadcl6mbinaialBdbaiclfhiadc98fgdci0mbkkdnadTmbinaiae86bbaicefhiadcufgdmbkkabk9teiucbcbyd:q:jjjbgeabcrfc94GfgbBd:q:jjjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik9:eiuZbhedndncbyd:q:jjjbgdaecztgi9nmbcuheadai9RcFFifcz4nbcuSmekadhekcbabae9Rcifc98Gcbyd:q:jjjbfgdBd:q:jjjbdnadZbcztge9nmbadae9RcFFifcz4nb8Akkk:Iedbcjwk1eFFuuFFuuFFuuFFuFFFuFFFuFbbbbbbbbebbbdbbbbbbbebbbebbbdbbbbbbbbbbbeeeeebebbebbebebbbeebbbbbbbbbbbbeeeeeebebbeeebeebbbbebebbbbbbbbbbbbbbbbbbc1Dkxebbbdbbb:GNbb'; // embed! wasm\n\n\tvar wasmpack = new Uint8Array([\n\t\t32, 0, 65, 2, 1, 106, 34, 33, 3, 128, 11, 4, 13, 64, 6, 253, 10, 7, 15, 116, 127, 5, 8, 12, 40, 16, 19, 54, 20, 9, 27, 255, 113, 17, 42, 67,\n\t\t24, 23, 146, 148, 18, 14, 22, 45, 70, 69, 56, 114, 101, 21, 25, 63, 75, 136, 108, 28, 118, 29, 73, 115,\n\t]);\n\n\tif (typeof WebAssembly !== 'object') {\n\t\treturn {\n\t\t\tsupported: false,\n\t\t};\n\t}\n\n\tvar instance;\n\n\tvar ready = WebAssembly.instantiate(unpack(wasm), {}).then(function (result) {\n\t\tinstance = result.instance;\n\t\tinstance.exports.__wasm_call_ctors();\n\t});\n\n\tfunction unpack(data) {\n\t\tvar result = new Uint8Array(data.length);\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tvar ch = data.charCodeAt(i);\n\t\t\tresult[i] = ch > 96 ? ch - 97 : ch > 64 ? ch - 39 : ch + 4;\n\t\t}\n\t\tvar write = 0;\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tresult[write++] = result[i] < 60 ? wasmpack[result[i]] : (result[i] - 60) * 64 + result[++i];\n\t\t}\n\t\treturn result.buffer.slice(0, write);\n\t}\n\n\tfunction assert(cond) {\n\t\tif (!cond) {\n\t\t\tthrow new Error('Assertion failed');\n\t\t}\n\t}\n\n\tfunction bytes(view) {\n\t\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t}\n\n\tfunction reorder(fun, indices, vertices) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar ip = sbrk(indices.length * 4);\n\t\tvar rp = sbrk(vertices * 4);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar indices8 = bytes(indices);\n\t\theap.set(indices8, ip);\n\t\tvar unique = fun(rp, ip, indices.length, vertices);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar remap = new Uint32Array(vertices);\n\t\tnew Uint8Array(remap.buffer).set(heap.subarray(rp, rp + vertices * 4));\n\t\tindices8.set(heap.subarray(ip, ip + indices.length * 4));\n\t\tsbrk(ip - sbrk(0));\n\n\t\tfor (var i = 0; i < indices.length; ++i) indices[i] = remap[indices[i]];\n\n\t\treturn [remap, unique];\n\t}\n\n\tfunction maxindex(source) {\n\t\tvar result = 0;\n\t\tfor (var i = 0; i < source.length; ++i) {\n\t\t\tvar index = source[i];\n\t\t\tresult = result < index ? index : result;\n\t\t}\n\t\treturn result;\n\t}\n\n\tfunction simplify(fun, indices, index_count, vertex_positions, vertex_count, vertex_positions_stride, target_index_count, target_error, options) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar te = sbrk(4);\n\t\tvar ti = sbrk(index_count * 4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar si = sbrk(index_count * 4);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\theap.set(bytes(indices), si);\n\t\tvar result = fun(ti, si, index_count, sp, vertex_count, vertex_positions_stride, target_index_count, target_error, options, te);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar target = new Uint32Array(result);\n\t\tbytes(target).set(heap.subarray(ti, ti + result * 4));\n\t\tvar error = new Float32Array(1);\n\t\tbytes(error).set(heap.subarray(te, te + 4));\n\t\tsbrk(te - sbrk(0));\n\t\treturn [target, error[0]];\n\t}\n\n\tfunction simplifyAttr(\n\t\tfun,\n\t\tindices,\n\t\tindex_count,\n\t\tvertex_positions,\n\t\tvertex_count,\n\t\tvertex_positions_stride,\n\t\tvertex_attributes,\n\t\tvertex_attributes_stride,\n\t\tattribute_weights,\n\t\tvertex_lock,\n\t\ttarget_index_count,\n\t\ttarget_error,\n\t\toptions\n\t) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar te = sbrk(4);\n\t\tvar ti = sbrk(index_count * 4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar sa = sbrk(vertex_count * vertex_attributes_stride);\n\t\tvar sw = sbrk(attribute_weights.length * 4);\n\t\tvar si = sbrk(index_count * 4);\n\t\tvar vl = vertex_lock ? sbrk(vertex_count) : 0;\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\theap.set(bytes(vertex_attributes), sa);\n\t\theap.set(bytes(attribute_weights), sw);\n\t\theap.set(bytes(indices), si);\n\t\tif (vertex_lock) {\n\t\t\theap.set(bytes(vertex_lock), vl);\n\t\t}\n\t\tvar result = fun(\n\t\t\tti,\n\t\t\tsi,\n\t\t\tindex_count,\n\t\t\tsp,\n\t\t\tvertex_count,\n\t\t\tvertex_positions_stride,\n\t\t\tsa,\n\t\t\tvertex_attributes_stride,\n\t\t\tsw,\n\t\t\tattribute_weights.length,\n\t\t\tvl,\n\t\t\ttarget_index_count,\n\t\t\ttarget_error,\n\t\t\toptions,\n\t\t\tte\n\t\t);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar target = new Uint32Array(result);\n\t\tbytes(target).set(heap.subarray(ti, ti + result * 4));\n\t\tvar error = new Float32Array(1);\n\t\tbytes(error).set(heap.subarray(te, te + 4));\n\t\tsbrk(te - sbrk(0));\n\t\treturn [target, error[0]];\n\t}\n\n\tfunction simplifyUpdate(\n\t\tfun,\n\t\tindices,\n\t\tindex_count,\n\t\tvertex_positions,\n\t\tvertex_count,\n\t\tvertex_positions_stride,\n\t\tvertex_attributes,\n\t\tvertex_attributes_stride,\n\t\tattribute_weights,\n\t\tvertex_lock,\n\t\ttarget_index_count,\n\t\ttarget_error,\n\t\toptions\n\t) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar te = sbrk(4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar sa = sbrk(vertex_count * vertex_attributes_stride);\n\t\tvar sw = sbrk(attribute_weights.length * 4);\n\t\tvar si = sbrk(index_count * 4);\n\t\tvar vl = vertex_lock ? sbrk(vertex_count) : 0;\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\theap.set(bytes(vertex_attributes), sa);\n\t\theap.set(bytes(attribute_weights), sw);\n\t\theap.set(bytes(indices), si);\n\t\tif (vertex_lock) {\n\t\t\theap.set(bytes(vertex_lock), vl);\n\t\t}\n\t\tvar result = fun(\n\t\t\tsi,\n\t\t\tindex_count,\n\t\t\tsp,\n\t\t\tvertex_count,\n\t\t\tvertex_positions_stride,\n\t\t\tsa,\n\t\t\tvertex_attributes_stride,\n\t\t\tsw,\n\t\t\tattribute_weights.length,\n\t\t\tvl,\n\t\t\ttarget_index_count,\n\t\t\ttarget_error,\n\t\t\toptions,\n\t\t\tte\n\t\t);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tbytes(indices).set(heap.subarray(si, si + result * 4));\n\t\tbytes(vertex_positions).set(heap.subarray(sp, sp + vertex_count * vertex_positions_stride));\n\t\tbytes(vertex_attributes).set(heap.subarray(sa, sa + vertex_count * vertex_attributes_stride));\n\t\tvar error = new Float32Array(1);\n\t\tbytes(error).set(heap.subarray(te, te + 4));\n\t\tsbrk(te - sbrk(0));\n\t\treturn [result, error[0]];\n\t}\n\n\tfunction simplifyScale(fun, vertex_positions, vertex_count, vertex_positions_stride) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\tvar result = fun(sp, vertex_count, vertex_positions_stride);\n\t\tsbrk(sp - sbrk(0));\n\t\treturn result;\n\t}\n\n\tfunction simplifyPoints(\n\t\tfun,\n\t\tvertex_positions,\n\t\tvertex_count,\n\t\tvertex_positions_stride,\n\t\tvertex_colors,\n\t\tvertex_colors_stride,\n\t\tcolor_weight,\n\t\ttarget_vertex_count\n\t) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar ti = sbrk(target_vertex_count * 4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar sc = sbrk(vertex_count * vertex_colors_stride);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\tif (vertex_colors) {\n\t\t\theap.set(bytes(vertex_colors), sc);\n\t\t}\n\t\tvar result = fun(ti, sp, vertex_count, vertex_positions_stride, sc, vertex_colors_stride, color_weight, target_vertex_count);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar target = new Uint32Array(result);\n\t\tbytes(target).set(heap.subarray(ti, ti + result * 4));\n\t\tsbrk(ti - sbrk(0));\n\t\treturn target;\n\t}\n\n\tfunction simplifySloppy(\n\t\tfun,\n\t\tindices,\n\t\tindex_count,\n\t\tvertex_positions,\n\t\tvertex_count,\n\t\tvertex_positions_stride,\n\t\tvertex_lock,\n\t\ttarget_index_count,\n\t\ttarget_error\n\t) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar te = sbrk(4);\n\t\tvar ti = sbrk(index_count * 4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar si = sbrk(index_count * 4);\n\t\tvar vl = vertex_lock ? sbrk(vertex_count) : 0;\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\theap.set(bytes(indices), si);\n\t\tif (vertex_lock) {\n\t\t\theap.set(bytes(vertex_lock), vl);\n\t\t}\n\t\tvar result = fun(ti, si, index_count, sp, vertex_count, vertex_positions_stride, vl, target_index_count, target_error, te);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar target = new Uint32Array(result);\n\t\tbytes(target).set(heap.subarray(ti, ti + result * 4));\n\t\tvar error = new Float32Array(1);\n\t\tbytes(error).set(heap.subarray(te, te + 4));\n\t\tsbrk(te - sbrk(0));\n\t\treturn [target, error[0]];\n\t}\n\n\tfunction simplifyPrune(fun, indices, index_count, vertex_positions, vertex_count, vertex_positions_stride, target_error) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar ti = sbrk(index_count * 4);\n\t\tvar sp = sbrk(vertex_count * vertex_positions_stride);\n\t\tvar si = sbrk(index_count * 4);\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), sp);\n\t\theap.set(bytes(indices), si);\n\t\tvar result = fun(ti, si, index_count, sp, vertex_count, vertex_positions_stride, target_error);\n\t\t// heap may have grown\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\t\tvar target = new Uint32Array(result);\n\t\tbytes(target).set(heap.subarray(ti, ti + result * 4));\n\t\tsbrk(ti - sbrk(0));\n\t\treturn target;\n\t}\n\n\tvar simplifyOptions = {\n\t\tLockBorder: 1,\n\t\tSparse: 2,\n\t\tErrorAbsolute: 4,\n\t\tPrune: 8,\n\t\tRegularize: 16,\n\t\tPermissive: 32,\n\t\t_InternalDebug: 1 << 30, // internal, don't use!\n\t};\n\n\treturn {\n\t\tready: ready,\n\t\tsupported: true,\n\n\t\tcompactMesh: function (indices) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\treturn reorder(instance.exports.meshopt_optimizeVertexFetchRemap, indices32, maxindex(indices) + 1);\n\t\t},\n\n\t\tsimplify: function (indices, vertex_positions, vertex_positions_stride, target_index_count, target_error, flags) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(target_index_count >= 0 && target_index_count <= indices.length);\n\t\t\tassert(target_index_count % 3 == 0);\n\t\t\tassert(target_error >= 0);\n\n\t\t\tvar options = 0;\n\t\t\tfor (var i = 0; i < (flags ? flags.length : 0); ++i) {\n\t\t\t\tassert(flags[i] in simplifyOptions);\n\t\t\t\toptions |= simplifyOptions[flags[i]];\n\t\t\t}\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\tvar result = simplify(\n\t\t\t\tinstance.exports.meshopt_simplify,\n\t\t\t\tindices32,\n\t\t\t\tindices.length,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\ttarget_index_count,\n\t\t\t\ttarget_error,\n\t\t\t\toptions\n\t\t\t);\n\t\t\tresult[0] = indices instanceof Uint32Array ? result[0] : new indices.constructor(result[0]);\n\n\t\t\treturn result;\n\t\t},\n\n\t\tsimplifyWithAttributes: function (\n\t\t\tindices,\n\t\t\tvertex_positions,\n\t\t\tvertex_positions_stride,\n\t\t\tvertex_attributes,\n\t\t\tvertex_attributes_stride,\n\t\t\tattribute_weights,\n\t\t\tvertex_lock,\n\t\t\ttarget_index_count,\n\t\t\ttarget_error,\n\t\t\tflags\n\t\t) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(vertex_attributes instanceof Float32Array);\n\t\t\tassert(vertex_attributes.length == vertex_attributes_stride * (vertex_positions.length / vertex_positions_stride));\n\t\t\tassert(vertex_attributes_stride >= 0);\n\t\t\tassert(vertex_lock == null || vertex_lock instanceof Uint8Array);\n\t\t\tassert(vertex_lock == null || vertex_lock.length == vertex_positions.length / vertex_positions_stride);\n\t\t\tassert(target_index_count >= 0 && target_index_count <= indices.length);\n\t\t\tassert(target_index_count % 3 == 0);\n\t\t\tassert(target_error >= 0);\n\t\t\tassert(Array.isArray(attribute_weights));\n\t\t\tassert(vertex_attributes_stride >= attribute_weights.length);\n\t\t\tassert(attribute_weights.length <= 32);\n\t\t\tfor (var i = 0; i < attribute_weights.length; ++i) {\n\t\t\t\tassert(attribute_weights[i] >= 0);\n\t\t\t}\n\n\t\t\tvar options = 0;\n\t\t\tfor (var i = 0; i < (flags ? flags.length : 0); ++i) {\n\t\t\t\tassert(flags[i] in simplifyOptions);\n\t\t\t\toptions |= simplifyOptions[flags[i]];\n\t\t\t}\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\tvar result = simplifyAttr(\n\t\t\t\tinstance.exports.meshopt_simplifyWithAttributes,\n\t\t\t\tindices32,\n\t\t\t\tindices.length,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\tvertex_attributes,\n\t\t\t\tvertex_attributes_stride * 4,\n\t\t\t\tnew Float32Array(attribute_weights),\n\t\t\t\tvertex_lock,\n\t\t\t\ttarget_index_count,\n\t\t\t\ttarget_error,\n\t\t\t\toptions\n\t\t\t);\n\t\t\tresult[0] = indices instanceof Uint32Array ? result[0] : new indices.constructor(result[0]);\n\n\t\t\treturn result;\n\t\t},\n\n\t\tsimplifyWithUpdate: function (\n\t\t\tindices,\n\t\t\tvertex_positions,\n\t\t\tvertex_positions_stride,\n\t\t\tvertex_attributes,\n\t\t\tvertex_attributes_stride,\n\t\t\tattribute_weights,\n\t\t\tvertex_lock,\n\t\t\ttarget_index_count,\n\t\t\ttarget_error,\n\t\t\tflags\n\t\t) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(vertex_attributes instanceof Float32Array);\n\t\t\tassert(vertex_attributes.length == vertex_attributes_stride * (vertex_positions.length / vertex_positions_stride));\n\t\t\tassert(vertex_attributes_stride >= 0);\n\t\t\tassert(vertex_lock == null || vertex_lock instanceof Uint8Array);\n\t\t\tassert(vertex_lock == null || vertex_lock.length == vertex_positions.length / vertex_positions_stride);\n\t\t\tassert(target_index_count >= 0 && target_index_count <= indices.length);\n\t\t\tassert(target_index_count % 3 == 0);\n\t\t\tassert(target_error >= 0);\n\t\t\tassert(Array.isArray(attribute_weights));\n\t\t\tassert(vertex_attributes_stride >= attribute_weights.length);\n\t\t\tassert(attribute_weights.length <= 32);\n\t\t\tfor (var i = 0; i < attribute_weights.length; ++i) {\n\t\t\t\tassert(attribute_weights[i] >= 0);\n\t\t\t}\n\n\t\t\tvar options = 0;\n\t\t\tfor (var i = 0; i < (flags ? flags.length : 0); ++i) {\n\t\t\t\tassert(flags[i] in simplifyOptions);\n\t\t\t\toptions |= simplifyOptions[flags[i]];\n\t\t\t}\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\tvar result = simplifyUpdate(\n\t\t\t\tinstance.exports.meshopt_simplifyWithUpdate,\n\t\t\t\tindices32,\n\t\t\t\tindices.length,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\tvertex_attributes,\n\t\t\t\tvertex_attributes_stride * 4,\n\t\t\t\tnew Float32Array(attribute_weights),\n\t\t\t\tvertex_lock,\n\t\t\t\ttarget_index_count,\n\t\t\t\ttarget_error,\n\t\t\t\toptions\n\t\t\t);\n\t\t\tif (indices !== indices32) {\n\t\t\t\t// copy back indices if they were converted to Uint32Array\n\t\t\t\tfor (var i = 0; i < result[0]; ++i) {\n\t\t\t\t\tindices[i] = indices32[i];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn result;\n\t\t},\n\n\t\tgetScale: function (vertex_positions, vertex_positions_stride) {\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\treturn simplifyScale(\n\t\t\t\tinstance.exports.meshopt_simplifyScale,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4\n\t\t\t);\n\t\t},\n\n\t\tsimplifyPoints: function (vertex_positions, vertex_positions_stride, target_vertex_count, vertex_colors, vertex_colors_stride, color_weight) {\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(target_vertex_count >= 0 && target_vertex_count <= vertex_positions.length / vertex_positions_stride);\n\t\t\tif (vertex_colors) {\n\t\t\t\tassert(vertex_colors instanceof Float32Array);\n\t\t\t\tassert(vertex_colors.length % vertex_colors_stride == 0);\n\t\t\t\tassert(vertex_colors_stride >= 3);\n\t\t\t\tassert(vertex_positions.length / vertex_positions_stride == vertex_colors.length / vertex_colors_stride);\n\t\t\t\treturn simplifyPoints(\n\t\t\t\t\tinstance.exports.meshopt_simplifyPoints,\n\t\t\t\t\tvertex_positions,\n\t\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\t\tvertex_colors,\n\t\t\t\t\tvertex_colors_stride * 4,\n\t\t\t\t\tcolor_weight,\n\t\t\t\t\ttarget_vertex_count\n\t\t\t\t);\n\t\t\t} else {\n\t\t\t\treturn simplifyPoints(\n\t\t\t\t\tinstance.exports.meshopt_simplifyPoints,\n\t\t\t\t\tvertex_positions,\n\t\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\t\tundefined,\n\t\t\t\t\t0,\n\t\t\t\t\t0,\n\t\t\t\t\ttarget_vertex_count\n\t\t\t\t);\n\t\t\t}\n\t\t},\n\n\t\tsimplifySloppy: function (indices, vertex_positions, vertex_positions_stride, vertex_lock, target_index_count, target_error) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(vertex_lock == null || vertex_lock instanceof Uint8Array);\n\t\t\tassert(vertex_lock == null || vertex_lock.length == vertex_positions.length / vertex_positions_stride);\n\t\t\tassert(target_index_count >= 0 && target_index_count <= indices.length);\n\t\t\tassert(target_index_count % 3 == 0);\n\t\t\tassert(target_error >= 0);\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\tvar result = simplifySloppy(\n\t\t\t\tinstance.exports.meshopt_simplifySloppy,\n\t\t\t\tindices32,\n\t\t\t\tindices.length,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\tvertex_lock,\n\t\t\t\ttarget_index_count,\n\t\t\t\ttarget_error\n\t\t\t);\n\t\t\tresult[0] = indices instanceof Uint32Array ? result[0] : new indices.constructor(result[0]);\n\n\t\t\treturn result;\n\t\t},\n\n\t\tsimplifyPrune: function (indices, vertex_positions, vertex_positions_stride, target_error) {\n\t\t\tassert(\n\t\t\t\tindices instanceof Uint32Array || indices instanceof Int32Array || indices instanceof Uint16Array || indices instanceof Int16Array\n\t\t\t);\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(target_error >= 0);\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\t\t\tvar result = simplifyPrune(\n\t\t\t\tinstance.exports.meshopt_simplifyPrune,\n\t\t\t\tindices32,\n\t\t\t\tindices.length,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\ttarget_error\n\t\t\t);\n\t\t\tresult = indices instanceof Uint32Array ? result : new indices.constructor(result);\n\n\t\t\treturn result;\n\t\t},\n\t};\n})();\n\nexport { MeshoptSimplifier };\n","// This file is part of meshoptimizer library and is distributed under the terms of MIT License.\n// Copyright (C) 2016-2025, by Arseny Kapoulkine (arseny.kapoulkine@gmail.com)\nvar MeshoptClusterizer = (function () {\n\t// Built with clang version 19.1.5-wasi-sdk\n\t// Built from meshoptimizer 0.25\n\tvar wasm =\n\t\t'b9H79TebbbeVx9Geueu9Geub9Gbb9Giuuueu9Gmuuuuuuuuuuu9999eu9Gvuuuuueu9Gwuuuuuuuub9Gxuuuuuuuuuuuueu9Gkuuuuuuuuuu99eu9Gouuuuuub9Gruuuuuuub9GluuuubiAOdilvorwDqqDkbiibeilve9Weiiviebeoweuec;G:Odkr;qeDo9TW9T9VV95dbH9F9F939H79T9F9J9H229F9Jt9VV7bb8A9TW79O9V9Wt9F9I919P29K9nW79O2Wt79c9V919U9KbeX9TW79O9V9Wt9F9I919P29K9nW79O2Wt7bo39TW79O9V9Wt9F9J9V9T9W91tWJ2917tWV9c9V919U9K7br39TW79O9V9Wt9F9J9V9T9W91tW9nW79O2Wt9c9V919U9K7bDE9TW79O9V9Wt9F9J9V9T9W91tW9t9W9OWVW9c9V919U9K7bqL9TW79O9V9Wt9F9V9Wt9P9T9P96W9nW79O2Wtbkl79IV9RbxDwebcekdszq:x9DOdbkIbabaec9:fgefcufae9Ugeabci9Uadfcufad9Ugbaeab0Ek:w8KDPue99eux99dui99euo99iu8Jjjjjbc:WD9Rgm8KjjjjbdndnalmbcbhPxekamc:Cwfcbc;Kbz:ojjjb8Adndnalcb9imbaoal9nmbamcuaocdtaocFFFFi0Egscbyd;u1jjbHjjjjbbgzBd:CwamceBd;8wamascbyd;u1jjbHjjjjbbgHBd:GwamcdBd;8wamcualcdtalcFFFFi0Ecbyd;u1jjbHjjjjbbgOBd:KwamciBd;8waihsalhAinazasydbcdtfcbBdbasclfhsaAcufgAmbkaihsalhAinazasydbcdtfgCaCydbcefBdbasclfhsaAcufgAmbkaihsalhCcbhXindnazasydbcdtgQfgAydbcb9imbaHaQfaXBdbaAaAydbgQcjjjj94VBdbaQaXfhXkasclfhsaCcufgCmbkalci9UhLdnalci6mbcbhsaihAinaAcwfydbhCaAclfydbhXaHaAydbcdtfgQaQydbgQcefBdbaOaQcdtfasBdbaHaXcdtfgXaXydbgXcefBdbaOaXcdtfasBdbaHaCcdtfgCaCydbgCcefBdbaOaCcdtfasBdbaAcxfhAaLascefgs9hmbkkaihsalhAindnazasydbcdtgCfgXydbgQcu9kmbaXaQcFFFFrGgQBdbaHaCfgCaCydbaQ9RBdbkasclfhsaAcufgAmbxdkkamcuaocdtgsaocFFFFi0EgAcbyd;u1jjbHjjjjbbgzBd:CwamceBd;8wamaAcbyd;u1jjbHjjjjbbgHBd:GwamcdBd;8wamcualcdtalcFFFFi0Ecbyd;u1jjbHjjjjbbgOBd:KwamciBd;8wazcbasz:ojjjbhXalci9UhLaihsalhAinaXasydbcdtfgCaCydbcefBdbasclfhsaAcufgAmbkdnaoTmbcbhsaHhAaXhCaohQinaAasBdbaAclfhAaCydbasfhsaCclfhCaQcufgQmbkkdnalci6mbcbhsaihAinaAcwfydbhCaAclfydbhQaHaAydbcdtfgKaKydbgKcefBdbaOaKcdtfasBdbaHaQcdtfgQaQydbgQcefBdbaOaQcdtfasBdbaHaCcdtfgCaCydbgCcefBdbaOaCcdtfasBdbaAcxfhAaLascefgs9hmbkkaoTmbcbhsaohAinaHasfgCaCydbaXasfydb9RBdbasclfhsaAcufgAmbkkamaLcbyd;u1jjbHjjjjbbgsBd:OwamclBd;8wascbaLz:ojjjbhYamcuaLcK2alcjjjjd0Ecbyd;u1jjbHjjjjbbg8ABd:SwamcvBd;8wJbbbbhEdnalci6g3mbarcd4hKaihAa8AhsaLhrJbbbbh5inavaAclfydbaK2cdtfgCIdlh8EavaAydbaK2cdtfgXIdlhEavaAcwfydbaK2cdtfgQIdlh8FaCIdwhaaXIdwhhaQIdwhgasaCIdbg8JaXIdbg8KMaQIdbg8LMJbbnn:vUdbasclfaXIdlaCIdlMaQIdlMJbbnn:vUdbaQIdwh8MaCIdwh8NaXIdwhyascxfa8EaE:tg8Eagah:tggNa8FaE:tg8Faaah:tgaN:tgEJbbbbJbbjZa8Ja8K:tg8Ja8FNa8La8K:tg8Ka8EN:tghahNaEaENaaa8KNaga8JN:tgEaENMM:rg8K:va8KJbbbb9BEg8ENUdbasczfaEa8ENUdbascCfaha8ENUdbascwfa8Maya8NMMJbbnn:vUdba5a8KMh5aAcxfhAascKfhsarcufgrmbka5aL:Z:vJbbbZNhEkamcuaLcdtalcFFFF970Ecbyd;u1jjbHjjjjbbgCBd:WwamcoBd;8waEaq:ZNhEdna3mbcbhsaChAinaAasBdbaAclfhAaLascefgs9hmbkkaE:rhhcuh8PamcuaLcltalcFFFFd0Ecbyd;u1jjbHjjjjbbgIBd:0wamcrBd;8wcbaIa8AaCaLz:djjjb8AJFFuuhyJFFuuh8RJFFuuh8Sdnalci6gXmbJFFuuh8Sa8AhsaLhAJFFuuh8RJFFuuhyinascwfIdbgEayayaE9EEhyasclfIdbgEa8Ra8RaE9EEh8RasIdbgEa8Sa8SaE9EEh8SascKfhsaAcufgAmbkkahJbbbZNhgamaocetgscuaocu9kEcbyd;u1jjbHjjjjbbgABd:4waAcFeasz:ojjjbhCdnaXmbcbhAJFFuuhEa8Ahscuh8PinascwfIdbay:tghahNasIdba8S:tghahNasclfIdba8R:tghahNMM:rghaEa8PcuSahaE9DVgXEhEaAa8PaXEh8PascKfhsaLaAcefgA9hmbkkamczfcbcjwz:ojjjb8Aamcwf9cb83ibam9cb83ibagaxNhRJbbjZak:th8Ncbh8UJbbbbh8VJbbbbh8WJbbbbh8XJbbbbh8YJbbbbh8ZJbbbbh80cbh81cbhPinJbbbbhEdna8UTmbJbbjZa8U:Z:vhEkJbbbbhhdna80a80Na8Ya8YNa8Za8ZNMMg8KJbbbb9BmbJbbjZa8K:r:vhhka8XaENh5a8WaENh8Fa8VaENhaa8PhQdndndndndna8UaPVTmbamydwgBTmea80ahNh8Ja8ZahNh8La8YahNh8Maeamydbcdtfh83cbh3JFFuuhEcvhXcuhQindnaza83a3cdtfydbcdtgsfydbgvTmbaOaHasfydbcdtfhAindndnaCaiaAydbgKcx2fgsclfydbgrcetf8Vebcs4aCasydbgLcetf8Vebcs4faCascwfydbglcetf8Vebcs4fgombcbhsxekcehsazaLcdtfydbgLceSmbcehsazarcdtfydbgrceSmbcehsazalcdtfydbglceSmbdnarcdSaLcdSfalcdSfcd6mbaocefhsxekaocdfhskdnasaX9kmba8AaKcK2fgLIdwa5:thhaLIdla8F:th8KaLIdbaa:th8EdndnakJbbbb9DTmba8E:lg8Ea8K:lg8Ka8Ea8K9EEg8Kah:lgha8Kah9EEag:vJbbjZMhhxekahahNa8Ea8ENa8Ka8KNMM:rag:va8NNJbbjZMJ9VO:d86JbbjZaLIdCa8JNaLIdxa8MNa8LaLIdzNMMakN:tghahJ9VO:d869DENhhkaKaQasaX6ahaE9DVgLEhQasaXaLEhXahaEaLEhEkaAclfhAavcufgvmbkka3cefg3aB9hmbkkaQcu9hmekama5Ud:ODama8FUd:KDamaaUd:GDamcuBd:qDamcFFF;7rBdjDaIcba8AaYamc:GDfakJbbbb9Damc:qDfamcjDfz:ejjjbamyd:qDhQdndnaxJbbbb9ETmba8UaD6mbaQcuSmeceh3amIdjDaR9EmixdkaQcu9hmekdna8UTmbdnamydlgza8Uci2fgsciGTmbadasfcba8Uazcu7fciGcefz:ojjjb8AkabaPcltfgzam8Pib83dbazcwfamcwf8Pib83dbaPcefhPkc3hzinazc98Smvamc:Cwfazfydbcbyd;y1jjbH:bjjjbbazc98fhzxbkkcbh3a8Uaq9pmbamydwaCaiaQcx2fgsydbcetf8Vebcs4aCascwfydbcetf8Vebcs4faCasclfydbcetf8Vebcs4ffaw9nmekcbhscbhAdna81TmbcbhAamczfhXinamczfaAcdtfaXydbgLBdbaXclfhXaAaYaLfRbbTfhAa81cufg81mbkkamydwhlamydbhXam9cu83i:GDam9cu83i:ODam9cu83i:qDam9cu83i:yDaAc;8eaAclfc:bd6Eh81inamcjDfasfcFFF;7rBdbasclfgscz9hmbka81cdthBdnalTmbaeaXcdtfhocbhrindnazaoarcdtfydbcdtgsfydbgvTmbaOaHasfydbcdtfhAcuhLcuhsinazaiaAydbgKcx2fgXclfydbcdtfydbazaXydbcdtfydbfazaXcwfydbcdtfydbfgXasaXas6gXEhsaKaLaXEhLaAclfhAavcufgvmbkaLcuSmba8AaLcK2fgAIdway:tgEaENaAIdba8S:tgEaENaAIdla8R:tgEaENMM:rhEcbhAindndnasamc:qDfaAfgvydbgX6mbasaX9hmeaEamcjDfaAfIdb9FTmekavasBdbamc:GDfaAfaLBdbamcjDfaAfaEUdbxdkaAclfgAcz9hmbkkarcefgral9hmbkkamczfaBfhLcbhscbhAindnamc:GDfasfydbgXcuSmbaLaAcdtfaXBdbaAcefhAkasclfgscz9hmbkaAa81fg81TmbJFFuuhhcuhKamczfhsa81hvcuhLina8AasydbgXcK2fgAIdway:tgEaENaAIdba8S:tgEaENaAIdla8R:tgEaENMM:rhEdndnazaiaXcx2fgAclfydbcdtfydbazaAydbcdtfydbfazaAcwfydbcdtfydbfgAaL6mbaAaL9hmeaEah9DTmekaEhhaAhLaXhKkasclfhsavcufgvmbkaKcuSmbaKhQkdnamaiaQcx2fgrydbarclfydbarcwfydbaCabaeadaPawaqa3z:fjjjbTmbaPcefhPJbbbbh8VJbbbbh8WJbbbbh8XJbbbbh8YJbbbbh8ZJbbbbh80kcbhXinaOaHaraXcdtfydbcdtgAfydbcdtfgKhsazaAfgvydbgLhAdnaLTmbdninasydbaQSmeasclfhsaAcufgATmdxbkkasaKaLcdtfc98fydbBdbavavydbcufBdbkaXcefgXci9hmbka8AaQcK2fgsIdbhEasIdlhhasIdwh8KasIdxh8EasIdzh5asIdCh8FaYaQfce86bba80a8FMh80a8Za5Mh8Za8Ya8EMh8Ya8Xa8KMh8Xa8WahMh8Wa8VaEMh8Vamydxh8Uxbkkamc:WDf8KjjjjbaPk;Vvivuv99lu8Jjjjjbca9Rgv8Kjjjjbdndnalcw0mbaiydbhoaeabcitfgralcdtcufBdlaraoBdbdnalcd6mbaiclfhoalcufhwarcxfhrinaoydbhDarcuBdbarc98faDBdbarcwfhraoclfhoawcufgwmbkkalabfhrxekcbhDavczfcwfcbBdbav9cb83izavcwfcbBdbav9cb83ibJbbjZhqJbbjZhkinadaiaDcdtfydbcK2fhwcbhrinavczfarfgoawarfIdbgxaoIdbgm:tgPakNamMgmUdbavarfgoaPaxam:tNaoIdbMUdbarclfgrcx9hmbkJbbjZaqJbbjZMgq:vhkaDcefgDal9hmbkcbhoadcbcecdavIdlgxavIdwgm9GEgravIdbgPam9GEaraPax9GEgscdtgrfhzavczfarfIdbhxaihralhwinaiaocdtfgDydbhHaDarydbgOBdbaraHBdbarclfhraoazaOcK2fIdbax9Dfhoawcufgwmbkaeabcitfhrdndnaocv6mbaoalc98f6mekaraiydbBdbaralcdtcufBdlaiclfhoalcufhwarcxfhrinaoydbhDarcuBdbarc98faDBdbarcwfhraoclfhoawcufgwmbkalabfhrxekaraxUdbararydlc98GasVBdlabcefaeadaiaoz:djjjbhwararydlciGawabcu7fcdtVBdlawaeadaiaocdtfalao9Rz:djjjbhrkavcaf8Kjjjjbark:;idiud99dndnabaecitfgwydlgDciGgqciSmbinabcbaDcd4gDalaqcdtfIdbawIdb:tgkJbbbb9FEgwaecefgefadaialavaoarz:ejjjbak:larIdb9FTmdabawaD7aefgecitfgwydlgDciGgqci9hmbkkabaecitfgeclfhbdnavmbcuhwindnaiaeydbgDfRbbmbadaDcK2fgqIdwalIdw:tgkakNaqIdbalIdb:tgkakNaqIdlalIdl:tgkakNMM:rgkarIdb9DTmbarakUdbaoaDBdbkaecwfheawcefgwabydbcd46mbxdkkcuhwindnaiaeydbgDfRbbmbadaDcK2fgqIdbalIdb:t:lgkaqIdlalIdl:t:lgxakax9EEgkaqIdwalIdw:t:lgxakax9EEgkarIdb9DTmbarakUdbaoaDBdbkaecwfheawcefgwabydbcd46mbkkk;llevudnabydwgxaladcetfgm8Vebcs4alaecetfgP8Vebgscs4falaicetfgz8Vebcs4ffaD0abydxaq9pVakVgDce9hmbavawcltfgxab8Pdb83dbaxcwfabcwfgx8Pdb83dbdnaxydbgqTmbaoabydbcdtfhxaqhsinalaxydbcetfcFFi87ebaxclfhxascufgsmbkkdnabydxglci2gsabydlgxfgkciGTmbarakfcbalaxcu7fciGcefz:ojjjb8Aabydxci2hsabydlhxabydwhqkab9cb83dwababydbaqfBdbabascifc98GaxfBdlaP8Vebhscbhxkdnascztcz91cu9kmbabaxcefBdwaPax87ebaoabydbcdtfaxcdtfaeBdbkdnam8Uebcu9kmbababydwgxcefBdwamax87ebaoabydbcdtfaxcdtfadBdbkdnaz8Uebcu9kmbababydwgxcefBdwazax87ebaoabydbcdtfaxcdtfaiBdbkarabydlfabydxci2faPRbb86bbarabydlfabydxci2fcefamRbb86bbarabydlfabydxci2fcdfazRbb86bbababydxcefBdxaDk8LbabaeadaialavaoarawaDaDaqJbbbbz:cjjjbk;Nkovud99euv99eul998Jjjjjbc:W;ae9Rgo8KjjjjbdndnadTmbavcd4hrcbhwcbhDindnaiaeclfydbar2cdtfgvIdbaiaeydbar2cdtfgqIdbgk:tgxaiaecwfydbar2cdtfgmIdlaqIdlgP:tgsNamIdbak:tgzavIdlaP:tgPN:tgkakNaPamIdwaqIdwgH:tgONasavIdwaH:tgHN:tgPaPNaHazNaOaxN:tgxaxNMM:rgsJbbbb9Bmbaoc:W:qefawcx2fgAakas:vUdwaAaxas:vUdlaAaPas:vUdbaoc8Wfawc8K2fgAaq8Pdb83dbaAav8Pdb83dxaAam8Pdb83dKaAcwfaqcwfydbBdbaAcCfavcwfydbBdbaAcafamcwfydbBdbawcefhwkaecxfheaDcifgDad6mbkab9cb83dbabcyf9cb83dbabcaf9cb83dbabcKf9cb83dbabczf9cb83dbabcwf9cb83dbawTmeaocbBd8Sao9cb83iKao9cb83izaoczfaoc8Wfawci2cxaoc8Sfcbcrz1jjjbaoIdKhCaoIdChXaoIdzhQao9cb83iwao9cb83ibaoaoc:W:qefawcxaoc8Sfcbciz1jjjbJbbjZhkaoIdwgPJbbbbJbbjZaPaPNaoIdbgPaPNaoIdlgsasNMM:rgx:vaxJbbbb9BEgzNhxasazNhsaPazNhzaoc:W:qefheawhvinaecwfIdbaxNaeIdbazNasaeclfIdbNMMgPakaPak9DEhkaecxfheavcufgvmbkabaCUdwabaXUdlabaQUdbabaoId3UdxdndnakJ;n;m;m899FmbJbbbbhPaoc:W:qefheaoc8WfhvinaCavcwfIdb:taecwfIdbgHNaQavIdb:taeIdbgONaXavclfIdb:taeclfIdbgLNMMaxaHNazaONasaLNMM:vgHaPaHaP9EEhPavc8KfhvaecxfheawcufgwmbkabaxUd8KabasUdaabazUd3abaCaxaPN:tUdKabaXasaPN:tUdCabaQazaPN:tUdzabJbbjZakakN:t:rgkUdydndnaxJbbj:;axJbbj:;9GEgPJbbjZaPJbbjZ9FEJbb;:9cNJbbbZJbbb:;axJbbbb9GEMgP:lJbbb9p9DTmbaP:Ohexekcjjjj94hekabae86b8UdndnasJbbj:;asJbbj:;9GEgPJbbjZaPJbbjZ9FEJbb;:9cNJbbbZJbbb:;asJbbbb9GEMgP:lJbbb9p9DTmbaP:Ohvxekcjjjj94hvkabav86bRdndnazJbbj:;azJbbj:;9GEgPJbbjZaPJbbjZ9FEJbb;:9cNJbbbZJbbb:;azJbbbb9GEMgP:lJbbb9p9DTmbaP:Ohqxekcjjjj94hqkabaq86b8SdndnaecKtcK91:YJbb;:9c:vax:t:lavcKtcK91:YJbb;:9c:vas:t:laqcKtcK91:YJbb;:9c:vaz:t:lakMMMJbb;:9cNJbbjZMgk:lJbbb9p9DTmbak:Ohexekcjjjj94hekaecFbaecFb9iEhexekabcjjj;8iBdycFbhekabae86b8Vxekab9cb83dbabcyf9cb83dbabcaf9cb83dbabcKf9cb83dbabczf9cb83dbabcwf9cb83dbkaoc:W;aef8Kjjjjbk;Iwwvul99iud99eue99eul998Jjjjjbcje9Rgr8Kjjjjbavcd4hwaicd4hDdndnaoTmbarc;abfcbaocdtgvz:ojjjb8Aarc;Gbfcbavz:ojjjb8AarhvarcafhiaohqinavcFFF97BdbaicFFF;7rBdbaiclfhiavclfhvaqcufgqmbkdnadTmbcbhkinaeakaD2cdtfgvIdwhxavIdlhmavIdbhPalakaw2cdtfIdbhsarc;abfhzarhiarc;GbfhHarcafhqcj1jjbhvaohOinasavcwfIdbaxNavIdbaPNavclfIdbamNMMgAMhCakhXdnaAas:tgAaqIdbgQ9DgLmbaHydbhXkaHaXBdbakhXdnaCaiIdbgK9EmbazydbhXaKhCkazaXBdbaiaCUdbaqaAaQaLEUdbavcxfhvaqclfhqaHclfhHaiclfhiazclfhzaOcufgOmbkakcefgkad9hmbkkadThkJbbbbhCcbhXarc;abfhvarc;Gbfhicbhqinalavydbgzaw2cdtfIdbalaiydbgHaw2cdtfIdbaeazaD2cdtfgzIdwaeaHaD2cdtfgHIdw:tgsasNazIdbaHIdb:tgsasNazIdlaHIdl:tgsasNMM:rMMgsaCasaC9EgzEhCaqaXazEhXaiclfhiavclfhvaoaqcefgq9hmbkaCJbbbZNhKxekadThkcbhXJbbbbhKkJbbbbhCdnaearc;abfaXcdtgifydbgqaD2cdtfgvIdwaearc;GbfaifydbgzaD2cdtfgiIdwgm:tgsasNavIdbaiIdbgY:tgAaANavIdlaiIdlgP:tgQaQNMM:rgxJbbbb9ETmbaxalaqaw2cdtfIdbMalazaw2cdtfIdb:taxaxM:vhCkasaCNamMhmaQaCNaPMhPaAaCNaYMhYdnakmbaDcdthvawcdthiindnalIdbg8AaecwfIdbam:tgCaCNaeIdbaY:tgsasNaeclfIdbaP:tgAaANMM:rgQMgEaK9ETmbJbbbbhxdnaQJbbbb9ETmbaEaK:taQaQM:vhxkaxaCNamMhmaxaANaPMhPaxasNaYMhYa8AaKaQMMJbbbZNhKkaeavfhealaifhladcufgdmbkkabaKUdxabamUdwabaPUdlabaYUdbarcjef8Kjjjjbkjeeiu8Jjjjjbcj8W9Rgr8Kjjjjbaici2hwdnaiTmbawceawce0EhDarhiinaiaeadRbbcdtfydbBdbadcefhdaiclfhiaDcufgDmbkkabarawaladaoz:hjjjbarcj8Wf8Kjjjjbk:Reeeu8Jjjjjbca9Rgo8Kjjjjbab9cb83dbabcyf9cb83dbabcaf9cb83dbabcKf9cb83dbabczf9cb83dbabcwf9cb83dbdnadTmbaocbBd3ao9cb83iwao9cb83ibaoaeadaialaoc3falEavcbalEcrz1jjjbabao8Pib83dbabao8Piw83dwkaocaf8Kjjjjbk:3lequ8JjjjjbcjP9Rgl8Kjjjjbcbhvalcjxfcbaiz:ojjjb8AdndnadTmbcjehoaehrincuhwarhDcuhqavhkdninawakaoalcjxfaDcefRbbfRbb9RcFeGci6aoalcjxfaDRbbfRbb9RcFeGci6faoalcjxfaDcdfRbbfRbb9RcFeGci6fgxaq9mgmEhwdnammbaxce0mdkaxaqaxaq9kEhqaDcifhDadakcefgk9hmbkkaeawci2fgDcdfRbbhqaDcefRbbhxaDRbbhkaeavci2fgDcifaDawav9Rci2z:rjjjb8Aakalcjxffaocefgo86bbaxalcjxffao86bbaDcdfaq86bbaDcefax86bbaDak86bbaqalcjxffao86bbarcifhravcefgvad9hmbkalcFeaicetz:ojjjbhoadci2gDceaDce0EhqcbhxindnaoaeRbbgkcetfgw8UebgDcu9kmbawax87ebaocjlfaxcdtfabakcdtfydbBdbaxhDaxcefhxkaeaD86bbaecefheaqcufgqmbkaxcdthDxekcbhDkabalcjlfaDz:njjjb8AalcjPf8Kjjjjbk9teiucbcbyd;C1jjbgeabcifc98GfgbBd;C1jjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik;teeeudndnaeabVciGTmbabhixekdndnadcz9pmbabhixekabhiinaiaeydbBdbaiaeydlBdlaiaeydwBdwaiaeydxBdxaeczfheaiczfhiadc9Wfgdcs0mbkkadcl6mbinaiaeydbBdbaeclfheaiclfhiadc98fgdci0mbkkdnadTmbinaiaeRbb86bbaicefhiaecefheadcufgdmbkkabk:3eedudndnabciGTmbabhixekaecFeGc:b:c:ew2hldndnadcz9pmbabhixekabhiinaialBdxaialBdwaialBdlaialBdbaiczfhiadc9Wfgdcs0mbkkadcl6mbinaialBdbaiclfhiadc98fgdci0mbkkdnadTmbinaiae86bbaicefhiadcufgdmbkkabk9teiucbcbyd;C1jjbgeabcrfc94GfgbBd;C1jjbdndnabZbcztgd9nmbcuhiabad9RcFFifcz4nbcuSmekaehikaik9:eiuZbhedndncbyd;C1jjbgdaecztgi9nmbcuheadai9RcFFifcz4nbcuSmekadhekcbabae9Rcifc98Gcbyd;C1jjbfgdBd;C1jjbdnadZbcztge9nmbadae9RcFFifcz4nb8Akk:;Deludndndnadch9pmbabaeSmdaeabadfgi9Rcbadcet9R0mekabaead;8qbbxekaeab7ciGhldndndnabae9pmbdnalTmbadhvabhixikdnabciGmbadhvabhixdkadTmiabaeRbb86bbadcufhvdnabcefgiciGmbaecefhexdkavTmiabaeRbe86beadc9:fhvdnabcdfgiciGmbaecdfhexdkavTmiabaeRbd86bdadc99fhvdnabcifgiciGmbaecifhexdkavTmiabaeRbi86biabclfhiaeclfheadc98fhvxekdnalmbdnaiciGTmbadTmlabadcufgifglaeaifRbb86bbdnalciGmbaihdxekaiTmlabadc9:fgifglaeaifRbb86bbdnalciGmbaihdxekaiTmlabadc99fgifglaeaifRbb86bbdnalciGmbaihdxekaiTmlabadc98fgdfaeadfRbb86bbkadcl6mbdnadc98fgocd4cefciGgiTmbaec98fhlabc98fhvinavadfaladfydbBdbadc98fhdaicufgimbkkaocx6mbaec9Wfhvabc9WfhoinaoadfgicxfavadfglcxfydbBdbaicwfalcwfydbBdbaiclfalclfydbBdbaialydbBdbadc9Wfgdci0mbkkadTmdadhidnadciGglTmbaecufhvabcufhoadhiinaoaifavaifRbb86bbaicufhialcufglmbkkadcl6mdaec98fhlabc98fhvinavaifgecifalaifgdcifRbb86bbaecdfadcdfRbb86bbaecefadcefRbb86bbaeadRbb86bbaic98fgimbxikkavcl6mbdnavc98fglcd4cefcrGgdTmbavadcdt9RhvinaiaeydbBdbaeclfheaiclfhiadcufgdmbkkalc36mbinaiaeydbBdbaiaeydlBdlaiaeydwBdwaiaeydxBdxaiaeydzBdzaiaeydCBdCaiaeydKBdKaiaeyd3Bd3aecafheaicafhiavc9Gfgvci0mbkkavTmbdndnavcrGgdmbavhlxekavc94GhlinaiaeRbb86bbaicefhiaecefheadcufgdmbkkavcw6mbinaiaeRbb86bbaiaeRbe86beaiaeRbd86bdaiaeRbi86biaiaeRbl86blaiaeRbv86bvaiaeRbo86boaiaeRbr86braicwfhiaecwfhealc94fglmbkkabkk9Tdbcjwk9ubbjZbbbbbbbbbbbbbbjZbbbbbbbbbbbbbbjZ86;nAZ86;nAZ86;nAZ86;nA:;86;nAZ86;nAZ86;nAZ86;nA:;86;nAZ86;nAZ86;nAZ86;nA:;bc;uwkxebbbdbbb9GNbb'; // embed! wasm\n\n\tvar wasmpack = new Uint8Array([\n\t\t32, 0, 65, 2, 1, 106, 34, 33, 3, 128, 11, 4, 13, 64, 6, 253, 10, 7, 15, 116, 127, 5, 8, 12, 40, 16, 19, 54, 20, 9, 27, 255, 113, 17, 42, 67,\n\t\t24, 23, 146, 148, 18, 14, 22, 45, 70, 69, 56, 114, 101, 21, 25, 63, 75, 136, 108, 28, 118, 29, 73, 115,\n\t]);\n\n\tif (typeof WebAssembly !== 'object') {\n\t\treturn {\n\t\t\tsupported: false,\n\t\t};\n\t}\n\n\tvar instance;\n\n\tvar ready = WebAssembly.instantiate(unpack(wasm), {}).then(function (result) {\n\t\tinstance = result.instance;\n\t\tinstance.exports.__wasm_call_ctors();\n\t});\n\n\tfunction unpack(data) {\n\t\tvar result = new Uint8Array(data.length);\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tvar ch = data.charCodeAt(i);\n\t\t\tresult[i] = ch > 96 ? ch - 97 : ch > 64 ? ch - 39 : ch + 4;\n\t\t}\n\t\tvar write = 0;\n\t\tfor (var i = 0; i < data.length; ++i) {\n\t\t\tresult[write++] = result[i] < 60 ? wasmpack[result[i]] : (result[i] - 60) * 64 + result[++i];\n\t\t}\n\t\treturn result.buffer.slice(0, write);\n\t}\n\n\tfunction assert(cond) {\n\t\tif (!cond) {\n\t\t\tthrow new Error('Assertion failed');\n\t\t}\n\t}\n\n\tfunction bytes(view) {\n\t\treturn new Uint8Array(view.buffer, view.byteOffset, view.byteLength);\n\t}\n\n\tvar BOUNDS_SIZE = 48;\n\tvar MESHLET_SIZE = 16;\n\n\tfunction extractMeshlet(buffers, index) {\n\t\tvar vertex_offset = buffers.meshlets[index * 4 + 0];\n\t\tvar triangle_offset = buffers.meshlets[index * 4 + 1];\n\t\tvar vertex_count = buffers.meshlets[index * 4 + 2];\n\t\tvar triangle_count = buffers.meshlets[index * 4 + 3];\n\n\t\treturn {\n\t\t\tvertices: buffers.vertices.subarray(vertex_offset, vertex_offset + vertex_count),\n\t\t\ttriangles: buffers.triangles.subarray(triangle_offset, triangle_offset + triangle_count * 3),\n\t\t};\n\t}\n\n\tfunction buildMeshlets(indices, vertex_positions, vertex_count, vertex_positions_stride, max_vertices, max_triangles, cone_weight) {\n\t\tvar sbrk = instance.exports.sbrk;\n\t\tvar max_meshlets = instance.exports.meshopt_buildMeshletsBound(indices.length, max_vertices, max_triangles);\n\n\t\t// allocate memory\n\t\tvar meshletsp = sbrk(max_meshlets * MESHLET_SIZE);\n\t\tvar meshlet_verticesp = sbrk(max_meshlets * max_vertices * 4);\n\t\tvar meshlet_trianglesp = sbrk(max_meshlets * max_triangles * 3);\n\n\t\tvar indicesp = sbrk(indices.byteLength);\n\t\tvar verticesp = sbrk(vertex_positions.byteLength);\n\n\t\t// copy input data to wasm memory\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(indices), indicesp);\n\t\theap.set(bytes(vertex_positions), verticesp);\n\n\t\tvar count = instance.exports.meshopt_buildMeshlets(\n\t\t\tmeshletsp,\n\t\t\tmeshlet_verticesp,\n\t\t\tmeshlet_trianglesp,\n\t\t\tindicesp,\n\t\t\tindices.length,\n\t\t\tverticesp,\n\t\t\tvertex_count,\n\t\t\tvertex_positions_stride,\n\t\t\tmax_vertices,\n\t\t\tmax_triangles,\n\t\t\tcone_weight\n\t\t);\n\n\t\t// heap might (will?) have grown -> re-acquire\n\t\theap = new Uint8Array(instance.exports.memory.buffer);\n\n\t\tvar meshletBytes = heap.subarray(meshletsp, meshletsp + count * MESHLET_SIZE);\n\t\tvar meshlets = new Uint32Array(meshletBytes.buffer, meshletBytes.byteOffset, meshletBytes.byteLength / 4).slice();\n\n\t\tfor (var i = 0; i < count; ++i) {\n\t\t\tvar vertex_offset = meshlets[i * 4 + 0];\n\t\t\tvar triangle_offset = meshlets[i * 4 + 1];\n\t\t\tvar vertex_count = meshlets[i * 4 + 2];\n\t\t\tvar triangle_count = meshlets[i * 4 + 3];\n\n\t\t\tinstance.exports.meshopt_optimizeMeshlet(\n\t\t\t\tmeshlet_verticesp + vertex_offset * 4,\n\t\t\t\tmeshlet_trianglesp + triangle_offset,\n\t\t\t\ttriangle_count,\n\t\t\t\tvertex_count\n\t\t\t);\n\t\t}\n\n\t\tvar last_vertex_offset = meshlets[(count - 1) * 4 + 0];\n\t\tvar last_triangle_offset = meshlets[(count - 1) * 4 + 1];\n\t\tvar last_vertex_count = meshlets[(count - 1) * 4 + 2];\n\t\tvar last_triangle_count = meshlets[(count - 1) * 4 + 3];\n\n\t\tvar used_vertices = last_vertex_offset + last_vertex_count;\n\t\tvar used_triangles = last_triangle_offset + ((last_triangle_count * 3 + 3) & ~3);\n\n\t\tvar result = {\n\t\t\tmeshlets: meshlets,\n\t\t\tvertices: new Uint32Array(heap.buffer, meshlet_verticesp, used_vertices).slice(),\n\t\t\ttriangles: new Uint8Array(heap.buffer, meshlet_trianglesp, used_triangles * 3).slice(),\n\t\t\tmeshletCount: count,\n\t\t};\n\n\t\t// reset memory\n\t\tsbrk(meshletsp - sbrk(0));\n\n\t\treturn result;\n\t}\n\n\tfunction extractBounds(boundsp) {\n\t\tvar bounds_floats = new Float32Array(instance.exports.memory.buffer, boundsp, BOUNDS_SIZE / 4);\n\n\t\t// see meshopt_Bounds in meshoptimizer.h for layout\n\t\treturn {\n\t\t\tcenterX: bounds_floats[0],\n\t\t\tcenterY: bounds_floats[1],\n\t\t\tcenterZ: bounds_floats[2],\n\t\t\tradius: bounds_floats[3],\n\t\t\tconeApexX: bounds_floats[4],\n\t\t\tconeApexY: bounds_floats[5],\n\t\t\tconeApexZ: bounds_floats[6],\n\t\t\tconeAxisX: bounds_floats[7],\n\t\t\tconeAxisY: bounds_floats[8],\n\t\t\tconeAxisZ: bounds_floats[9],\n\t\t\tconeCutoff: bounds_floats[10],\n\t\t};\n\t}\n\n\tfunction computeMeshletBounds(buffers, vertex_positions, vertex_count, vertex_positions_stride) {\n\t\tvar sbrk = instance.exports.sbrk;\n\n\t\tvar results = [];\n\n\t\t// allocate memory that's constant for all meshlets\n\t\tvar verticesp = sbrk(vertex_positions.byteLength);\n\t\tvar meshlet_verticesp = sbrk(buffers.vertices.byteLength);\n\t\tvar meshlet_trianglesp = sbrk(buffers.triangles.byteLength);\n\t\tvar resultp = sbrk(BOUNDS_SIZE);\n\n\t\t// copy vertices to wasm memory\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(vertex_positions), verticesp);\n\t\theap.set(bytes(buffers.vertices), meshlet_verticesp);\n\t\theap.set(bytes(buffers.triangles), meshlet_trianglesp);\n\n\t\tfor (var i = 0; i < buffers.meshletCount; ++i) {\n\t\t\tvar vertex_offset = buffers.meshlets[i * 4 + 0];\n\t\t\tvar triangle_offset = buffers.meshlets[i * 4 + 0 + 1];\n\t\t\tvar triangle_count = buffers.meshlets[i * 4 + 0 + 3];\n\n\t\t\tinstance.exports.meshopt_computeMeshletBounds(\n\t\t\t\tresultp,\n\t\t\t\tmeshlet_verticesp + vertex_offset * 4,\n\t\t\t\tmeshlet_trianglesp + triangle_offset,\n\t\t\t\ttriangle_count,\n\t\t\t\tverticesp,\n\t\t\t\tvertex_count,\n\t\t\t\tvertex_positions_stride\n\t\t\t);\n\n\t\t\tresults.push(extractBounds(resultp));\n\t\t}\n\n\t\t// reset memory\n\t\tsbrk(verticesp - sbrk(0));\n\n\t\treturn results;\n\t}\n\n\tfunction computeClusterBounds(indices, vertex_positions, vertex_count, vertex_positions_stride) {\n\t\tvar sbrk = instance.exports.sbrk;\n\n\t\t// allocate memory\n\t\tvar resultp = sbrk(BOUNDS_SIZE);\n\t\tvar indicesp = sbrk(indices.byteLength);\n\t\tvar verticesp = sbrk(vertex_positions.byteLength);\n\n\t\t// copy input data to wasm memory\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(indices), indicesp);\n\t\theap.set(bytes(vertex_positions), verticesp);\n\n\t\tinstance.exports.meshopt_computeClusterBounds(resultp, indicesp, indices.length, verticesp, vertex_count, vertex_positions_stride);\n\n\t\tvar result = extractBounds(resultp);\n\n\t\t// reset memory\n\t\tsbrk(resultp - sbrk(0));\n\n\t\treturn result;\n\t}\n\n\tfunction computeSphereBounds(positions, count, positions_stride, radii, radii_stride) {\n\t\tvar sbrk = instance.exports.sbrk;\n\n\t\t// allocate memory\n\t\tvar resultp = sbrk(BOUNDS_SIZE);\n\t\tvar positionsp = sbrk(positions.byteLength);\n\t\tvar radiip = radii ? sbrk(radii.byteLength) : 0;\n\n\t\t// copy input data to wasm memory\n\t\tvar heap = new Uint8Array(instance.exports.memory.buffer);\n\t\theap.set(bytes(positions), positionsp);\n\t\tif (radii) {\n\t\t\theap.set(bytes(radii), radiip);\n\t\t}\n\n\t\tinstance.exports.meshopt_computeSphereBounds(resultp, positionsp, count, positions_stride, radiip, radii ? radii_stride : 0);\n\n\t\tvar result = extractBounds(resultp);\n\n\t\t// reset memory\n\t\tsbrk(resultp - sbrk(0));\n\n\t\treturn result;\n\t}\n\n\treturn {\n\t\tready: ready,\n\t\tsupported: true,\n\t\tbuildMeshlets: function (indices, vertex_positions, vertex_positions_stride, max_vertices, max_triangles, cone_weight) {\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\t\t\tassert(max_vertices <= 256 || max_vertices > 0);\n\t\t\tassert(max_triangles <= 512);\n\t\t\tassert(max_triangles % 4 == 0);\n\n\t\t\tcone_weight = cone_weight || 0.0;\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\n\t\t\treturn buildMeshlets(\n\t\t\t\tindices32,\n\t\t\t\tvertex_positions,\n\t\t\t\tvertex_positions.length / vertex_positions_stride,\n\t\t\t\tvertex_positions_stride * 4,\n\t\t\t\tmax_vertices,\n\t\t\t\tmax_triangles,\n\t\t\t\tcone_weight\n\t\t\t);\n\t\t},\n\t\textractMeshlet: function (buffers, index) {\n\t\t\tassert(index >= 0 && index < buffers.meshletCount);\n\n\t\t\treturn extractMeshlet(buffers, index);\n\t\t},\n\t\tcomputeClusterBounds: function (indices, vertex_positions, vertex_positions_stride) {\n\t\t\tassert(indices.length % 3 == 0);\n\t\t\tassert(indices.length / 3 <= 512);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\n\t\t\tvar indices32 = indices.BYTES_PER_ELEMENT == 4 ? indices : new Uint32Array(indices);\n\n\t\t\treturn computeClusterBounds(indices32, vertex_positions, vertex_positions.length / vertex_positions_stride, vertex_positions_stride * 4);\n\t\t},\n\t\tcomputeMeshletBounds: function (buffers, vertex_positions, vertex_positions_stride) {\n\t\t\tassert(buffers.meshletCount != 0);\n\t\t\tassert(vertex_positions instanceof Float32Array);\n\t\t\tassert(vertex_positions.length % vertex_positions_stride == 0);\n\t\t\tassert(vertex_positions_stride >= 3);\n\n\t\t\treturn computeMeshletBounds(buffers, vertex_positions, vertex_positions.length / vertex_positions_stride, vertex_positions_stride * 4);\n\t\t},\n\t\tcomputeSphereBounds: function (positions, positions_stride, radii, radii_stride) {\n\t\t\tassert(positions instanceof Float32Array);\n\t\t\tassert(positions.length % positions_stride == 0);\n\t\t\tassert(positions_stride >= 3);\n\t\t\tassert(!radii || radii instanceof Float32Array);\n\t\t\tassert(!radii || radii.length % radii_stride == 0);\n\t\t\tassert(!radii || radii_stride >= 1);\n\t\t\tassert(!radii || positions.length / positions_stride == radii.length / radii_stride);\n\n\t\t\tradii_stride = radii_stride || 0;\n\n\t\t\treturn computeSphereBounds(positions, positions.length / positions_stride, positions_stride * 4, radii, radii_stride * 4);\n\t\t},\n\t};\n})();\n\nexport { MeshoptClusterizer };\n","import * as THREE from 'three';\r\nimport { LinkedHashMap } from '../utils/LinkedHashMap';\r\nimport { B3DMDecoder } from \"../decoder/B3DMDecoder\";\r\nimport { GLTFTileDecoder } from \"../decoder/GLTFTileDecoder\";\r\nimport { GLTFLoader } from 'three/addons/loaders/GLTFLoader.js';\r\nimport { DRACOLoader } from 'three/addons/loaders/DRACOLoader.js';\r\nimport { KTX2Loader } from \"three/addons/loaders/KTX2Loader\";\r\nimport { resolveImplicite } from './implicit/ImplicitTileResolver.js';\r\nimport { MeshoptDecoder } from 'meshoptimizer';\r\n\r\nlet concurrentDownloads = 0;\r\n\r\n\r\n/**\r\n * A Tile loader that manages caching and load order.\r\n * The cache is an LRU cache and is defined by the number of items it can hold.\r\n * The actual number of cached items might grow beyond max if all items are in use.\r\n * \r\n * The load order is designed for optimal perceived loading speed (nearby tiles are refined first).\r\n * @class\r\n */\r\nclass TileLoader {\r\n    /**\r\n     * Creates a tile loader with a maximum number of cached items and callbacks.\r\n     * The only required property is a renderer that will be used to visualize the tiles.\r\n     * The maxCachedItems property is the size of the cache in number of objects, mesh tile and tileset.json files.\r\n     * The mesh and point callbacks will be called for every incoming mesh or points.\r\n     * \r\n     *\r\n     * \r\n     * @param {Object} [options] - Optional configuration object.\r\n     * @param {renderer} [options.renderer] - the WebGL renderer\r\n     * @param {number} [options.maxCachedItems=100] - the cache size.\r\n     * @param {function} [options.meshCallback = undefined] - A callback to call on newly decoded meshes.\r\n     * @param {function} [options.pointsCallback = undefined] - A callback to call on newly decoded points.\r\n     * @param {sring} [options.proxy = undefined] - An optional proxy that tile requests will be directed too as POST requests with the actual tile url in the body of the request.\r\n     * @param {KTX2Loader} [options.ktx2Loader = undefined] - A KTX2Loader (three/addons)\r\n     * @param {DRACOLoader} [options.dracoLoader = undefined] - A DRACOLoader (three/addons)\r\n     * @param {number} [options.downloadParallelism = 8] - Maximum number of parallel downloads\r\n     * @param {number} [options.timeout = 5000] - number of milliseconds to keep tiles in cache before clearing\r\n     */\r\n    constructor(options) {\r\n        this.downloadParallelism = options.downloadParallelism == undefined ? 8 : options.downloadParallelism;\r\n        this.timeout = (options.timeout != undefined) ? options.timeout : 5000;\r\n        this.renderer = options.renderer;\r\n        this.zUpToYUpMatrix = new THREE.Matrix4();\r\n        this.zUpToYUpMatrix.set(1, 0, 0, 0,\r\n            0, 0, -1, 0,\r\n            0, 1, 0, 0,\r\n            0, 0, 0, 1);\r\n        this.maxCachedItems = 100;\r\n        this.proxy = options.proxy;\r\n        if (!!options) {\r\n            this.meshCallback = options.meshCallback;\r\n            this.pointsCallback = options.pointsCallback;\r\n            if (options.maxCachedItems != undefined) this.maxCachedItems = options.maxCachedItems;\r\n        }\r\n\r\n\r\n        this.gltfLoader = new GLTFLoader();\r\n        this.gltfLoader.register(parser => ({ name: 'KHR_spz_gaussian_splats_compression' }));\r\n        if (!!options && !!options.dracoLoader) {\r\n            this.gltfLoader.setDRACOLoader(options.dracoLoader);\r\n            this.hasDracoLoader = true;\r\n        } else {\r\n            const dracoLoader = new DRACOLoader();\r\n            dracoLoader.setDecoderPath('https://storage.googleapis.com/ogc-3d-tiles/draco/');\r\n            this.dracoLoader = dracoLoader;\r\n            this.gltfLoader.setDRACOLoader(dracoLoader);\r\n            this.gltfLoader.hasDracoLoader = true;\r\n        }\r\n\r\n        if (!!options && !!options.ktx2Loader) {\r\n            this.gltfLoader.setKTX2Loader(options.ktx2Loader);\r\n            this.hasKTX2Loader = true;\r\n        } else if (!!options && !!options.renderer) {\r\n            const ktx2Loader = new KTX2Loader();\r\n            ktx2Loader.setTranscoderPath('https://storage.googleapis.com/ogc-3d-tiles/basis/').detectSupport(options.renderer);\r\n            this.ktx2loader = ktx2Loader;\r\n            this.gltfLoader.setKTX2Loader(ktx2Loader);\r\n            this.gltfLoader.hasKTX2Loader = true;\r\n        }\r\n\r\n        this.gltfLoader.setMeshoptDecoder(MeshoptDecoder);\r\n        this.hasMeshOptDecoder = true;\r\n\r\n        this.b3dmDecoder = new B3DMDecoder(this.gltfLoader);\r\n        this.GLTFTileDecoder = new GLTFTileDecoder(this.gltfLoader, this.renderer);\r\n\r\n        this.cache = new LinkedHashMap();\r\n        this.register = {};\r\n\r\n\r\n        this.ready = [];\r\n        this.downloads = [];\r\n        this.nextReady = [];\r\n        this.nextDownloads = [];\r\n\r\n    }\r\n\r\n\r\n    /**\r\n     * To be called in the render loop or at regular intervals.\r\n     * launches tile downloading and loading in an orderly fashion.\r\n     */\r\n    update() {\r\n\r\n        const self = this;\r\n        if (concurrentDownloads < self.downloadParallelism) {\r\n            self._download();\r\n        }\r\n\r\n        self._loadBatch();\r\n\r\n    }\r\n\r\n\r\n    _scheduleDownload(f) {\r\n        this.downloads.unshift(f);\r\n    }\r\n    _download() {\r\n\r\n        do {\r\n            if (this.nextDownloads.length == 0) {\r\n                this._getNextDownloads();\r\n                if (this.nextDownloads.length == 0) return;\r\n            }\r\n            while (this.nextDownloads.length > 0) {\r\n                const nextDownload = this.nextDownloads.shift();\r\n                if (!!nextDownload && nextDownload.shouldDoDownload()) {\r\n                    nextDownload.doDownload();\r\n                }\r\n            }\r\n        } while (concurrentDownloads < this.downloadParallelism);\r\n\r\n        return;\r\n    }\r\n    _meshReceived(cache, register, key, distanceFunction, getSiblings, level, uuid) {\r\n        this.ready.unshift([cache, register, key, distanceFunction, getSiblings, level, uuid]);\r\n    }\r\n\r\n    _loadBatch() {\r\n        if (this.nextReady.length == 0) {\r\n            this._getNextReady();\r\n        }\r\n        while (this.nextReady.length > 0) {\r\n            const data = this.nextReady.shift();\r\n            if (!data) return;\r\n            const cache = data[0];\r\n            const register = data[1];\r\n            const key = data[2];\r\n            const mesh = cache.get(key);\r\n\r\n            if (!!mesh && !!register[key]) {\r\n                Object.keys(register[key]).forEach(tile => {\r\n                    const callback = register[key][tile];\r\n                    if (!!callback) {\r\n                        cache.put(key, callback(mesh));\r\n\r\n                        register[key][tile] = null;\r\n                    }\r\n                });\r\n            }\r\n            /* if (this.nextReady.length == 0) {\r\n                this._getNextReady();\r\n            } */\r\n        }\r\n\r\n        return;\r\n\r\n        /* while (this.ready.length > 0) {\r\n            const data = this.ready.shift();\r\n            if (!data) return 0;\r\n            const cache = data[0];\r\n            const register = data[1];\r\n            const key = data[2];\r\n            const mesh = cache.get(key);\r\n\r\n            if (!!mesh && !!register[key]) {\r\n                Object.keys(register[key]).forEach(tile => {\r\n                    const callback = register[key][tile];\r\n                    if (!!callback) {\r\n                        callback(mesh);\r\n                        register[key][tile] = null;\r\n                    }\r\n                });\r\n            }\r\n            return;\r\n        } */\r\n    }\r\n\r\n    _getNextDownloads() {\r\n        let smallestDistance = Number.POSITIVE_INFINITY;\r\n        let closest = -1;\r\n        for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n            if (!this.downloads[i].shouldDoDownload()) {\r\n                this.downloads.splice(i, 1);\r\n                continue;\r\n            }\r\n            if (!this.downloads[i].distanceFunction) { // if no distance function, must be a json, give absolute priority!\r\n                this.nextDownloads.push(this.downloads.splice(i, 1)[0]);\r\n            }\r\n        }\r\n        if (this.nextDownloads.length > 0) return;\r\n        let highestLevel = 0;\r\n        let lowestLevel = Number.MAX_SAFE_INTEGER;\r\n        let lowestIndex = -1;\r\n        for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n\r\n            const dist = this.downloads[i].distanceFunction();\r\n            if (dist <= smallestDistance) {\r\n                smallestDistance = dist;\r\n                closest = i;\r\n            }\r\n            highestLevel = Math.max(this.downloads[i].level);\r\n            if (this.downloads[i].loadingStrategy != \"IMMEDIATE\" && this.downloads[i].level < lowestLevel) {\r\n                lowestLevel = this.downloads[i].level;\r\n                lowestIndex = i;\r\n            }\r\n\r\n        }\r\n        let closestItem;\r\n        if (highestLevel > lowestLevel + 4) {\r\n            closestItem = this.downloads.splice(lowestIndex, 1).pop();\r\n        } else if (closest >= 0) {\r\n            closestItem = this.downloads.splice(closest, 1).pop();\r\n        }\r\n        if (!!closestItem) {\r\n            this.nextDownloads.push(closestItem);\r\n            const siblings = closestItem.getSiblings();\r\n            for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n                if (siblings.map(s => s.uuid).includes(this.downloads[i].uuid)) {\r\n                    this.nextDownloads.push(this.downloads.splice(i, 1).pop());\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    _getNextReady() {\r\n        let smallestDistance = Number.POSITIVE_INFINITY;\r\n        let closest = -1;\r\n        for (let i = this.ready.length - 1; i >= 0; i--) {\r\n\r\n            if (!this.ready[i][3]) {// if no distance function, must be a json, give absolute priority!\r\n                this.nextReady.push(this.ready.splice(i, 1)[0]);\r\n            }\r\n        }\r\n        if (this.nextReady.length > 0) return;\r\n        for (let i = this.ready.length - 1; i >= 0; i--) {\r\n            const dist = this.ready[i][3]() * this.ready[i][5];\r\n            if (dist <= smallestDistance) {\r\n                smallestDistance = dist;\r\n                closest = i\r\n            }\r\n        }\r\n        if (closest >= 0) {\r\n            const closestItem = this.ready.splice(closest, 1).pop();\r\n            this.nextReady.push(closestItem);\r\n            const siblings = closestItem[4]();\r\n            for (let i = this.ready.length - 1; i >= 0; i--) {\r\n                if (siblings.map(s => s.uuid).includes(this.ready[i][6])) {\r\n                    this.nextReady.push(this.ready.splice(i, 1).pop());\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n\r\n    /**\r\n     * Schedules a tile content to be downloaded\r\n     * \r\n     * @param {AbortController} abortController \r\n     * @param {string|Number} tileIdentifier \r\n     * @param {string} path \r\n     * @param {Function} callback \r\n     * @param {Function} distanceFunction \r\n     * @param {Function} getSiblings \r\n     * @param {Number} level \r\n     * @param {Boolean} sceneZupToYup \r\n     * @param {Boolean} meshZupToYup \r\n     * @param {Number} geometricError \r\n     */\r\n    get(abortController, tileIdentifier, path, callback, distanceFunction, getSiblings, level, loadingStrategy, sceneZupToYup, meshZupToYup, geometricError, splatsMesh) {\r\n        const self = this;\r\n        const key = _simplifyPath(path);\r\n\r\n        const realAbortController = new AbortController();\r\n        abortController.signal.addEventListener(\"abort\", () => {\r\n            if (!self.register[key] || Object.keys(self.register[key]).length == 0) {\r\n                realAbortController.abort(\"user abort\");\r\n            }\r\n        })\r\n\r\n        if (!path.includes(\".b3dm\") && !path.includes(\".json\") && !path.includes(\".gltf\") && !path.includes(\".glb\")) {\r\n            console.error(\"the 3DTiles cache can only be used to load B3DM, gltf and json data\");\r\n            return;\r\n        }\r\n        if (!self.register[key]) {\r\n            self.register[key] = {};\r\n        }\r\n        if (!!self.register[key][tileIdentifier]) {\r\n            console.error(\" a tile should only be loaded once\");\r\n        }\r\n        self.register[key][tileIdentifier] = callback;\r\n\r\n        const cachedObject = self.cache.get(key);\r\n        if (!!cachedObject) {\r\n            this._meshReceived(self.cache, self.register, key, distanceFunction, getSiblings, level, tileIdentifier);\r\n        } else /* if (Object.keys(self.register[key]).length == 1) */ {\r\n            let downloadFunction;\r\n            if (path.includes(\".b3dm\")) {\r\n                downloadFunction = () => {\r\n\r\n\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(path, { signal: realAbortController.signal });\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: path,\r\n                                    signal: realAbortController.signal\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            console.error(\"could not load tile with path : \" + path)\r\n                            throw new Error(`couldn't load \"${path}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                        }\r\n                        return result.arrayBuffer();\r\n\r\n                    }).then(resultArrayBuffer => {\r\n\r\n                        return this.b3dmDecoder.parseB3DM(resultArrayBuffer, (mesh) => { self.meshCallback(mesh, geometricError) }, sceneZupToYup, meshZupToYup);\r\n                    }).then(mesh => {\r\n                        self.cache.put(key, mesh);\r\n                        this._meshReceived(self.cache, self.register, key, distanceFunction, getSiblings, level, tileIdentifier);\r\n                        self._checkSize();\r\n                    }).catch((e) => {\r\n                        //console.error(e)\r\n                    }).finally(() => {\r\n                        concurrentDownloads--;\r\n                    });\r\n\r\n                }\r\n            } else if (path.includes(\".glb\") || path.includes(\".gltf\")) {\r\n                downloadFunction = () => {\r\n\r\n\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(path, { signal: realAbortController.signal });\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: path,\r\n                                    signal: realAbortController.signal\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            console.error(\"could not load tile with path : \" + path)\r\n                            throw new Error(`couldn't load \"${path}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                        }\r\n                        return result.arrayBuffer();\r\n\r\n                    }).then(resultArrayBuffer => {\r\n\r\n                        return this.GLTFTileDecoder.parseSplats(resultArrayBuffer, sceneZupToYup, meshZupToYup, splatsMesh);\r\n                    }).then(mesh => {\r\n                        if (!mesh.isSplatsData) {\r\n                            if (sceneZupToYup) {\r\n                                mesh.applyMatrix4(this.zUpToYUpMatrix);\r\n                            }\r\n                            mesh.traverse((o) => {\r\n\r\n                                if (o.isMesh) {\r\n                                    if (meshZupToYup) {\r\n                                        o.applyMatrix4(this.zUpToYUpMatrix);\r\n                                    }\r\n                                    if (!!self.meshCallback) {\r\n                                        self.meshCallback(o, geometricError);\r\n                                    }\r\n                                }\r\n                                if (o.isPoints) {\r\n\r\n                                    if (!!self.pointsCallback) {\r\n                                        self.pointsCallback(o, geometricError);\r\n                                    }\r\n                                }\r\n                            });\r\n                        }\r\n\r\n                        self.cache.put(key, mesh);\r\n                        self._meshReceived(self.cache, self.register, key, distanceFunction, getSiblings, level, tileIdentifier);\r\n                        self._checkSize();\r\n                    }).catch((e) => {\r\n                        //console.error(e)\r\n                    }).finally(() => {\r\n                        concurrentDownloads--;\r\n                    });\r\n\r\n                }\r\n\r\n            } else if (path.includes(\".json\")) {\r\n                downloadFunction = () => {\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(path, { signal: realAbortController.signal });\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: path,\r\n                                    signal: realAbortController.signal\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            console.error(\"could not load tile with path : \" + path)\r\n                            throw new Error(`couldn't load \"${path}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                        }\r\n                        return result.json();\r\n\r\n                    }).then(json => {\r\n                        return resolveImplicite(json, path)\r\n                    }).then(json => {\r\n                        self.cache.put(key, json);\r\n                        self._meshReceived(self.cache, self.register, key);\r\n                        self._checkSize();\r\n                    }).catch((e) => {\r\n                        console.error(e)\r\n                    }).finally(() => {\r\n                        concurrentDownloads--;\r\n                    });\r\n                }\r\n            }\r\n            this._scheduleDownload({\r\n                \"shouldDoDownload\": () => {\r\n                    return !abortController.signal.aborted && !!self.register[key] && Object.keys(self.register[key]).length > 0 && !self.cache.get(key);\r\n                },\r\n                \"doDownload\": downloadFunction,\r\n                \"distanceFunction\": distanceFunction,\r\n                \"getSiblings\": getSiblings,\r\n                \"level\": level,\r\n                \"loadingStrategy\": loadingStrategy,\r\n                \"uuid\": tileIdentifier\r\n            })\r\n        }\r\n    }\r\n\r\n\r\n    /**\r\n     * Invalidates all the unused cached tiles.\r\n     */\r\n    clear() {\r\n        const temp = this.maxCachedItems;\r\n        this.maxCachedItems = 0;\r\n        this._checkSize();\r\n        this.maxCachedItems = temp;\r\n    }\r\n\r\n    /**\r\n     *  unregisters a tile content for a specific tile, removing it from the cache if no other tile is using the same content.\r\n     * @param {string} path the content path/url\r\n     * @param {string|Number} tileIdentifier the tile ID\r\n     */\r\n    invalidate(path, tileIdentifier) {\r\n        const key = _simplifyPath(path);\r\n        const self = this;\r\n        if (!!self.register[key]) {\r\n            setTimeout(() => {\r\n                if (self.register && self.register[key]) {\r\n                    delete self.register[key][tileIdentifier];\r\n                    self._checkSize();\r\n                }\r\n            }, self.timeout);\r\n\r\n        }\r\n    }\r\n\r\n    dispose() {\r\n        let entry = this.cache.head();\r\n        this._disposeEntryContent(entry);\r\n        while ((entry = entry.next()).key != undefined) {\r\n            this._disposeEntryContent(entry);\r\n        }\r\n        this.cache.reset();\r\n        this.cache = undefined;\r\n        this.register = undefined;\r\n        if (this.dracoLoader) this.dracoLoader.dispose();\r\n        if (this.ktx2loader) this.ktx2loader.dispose();\r\n    }\r\n    _checkSize() {\r\n        const self = this;\r\n\r\n        let i = 0;\r\n\r\n        while (self.cache.size() > self.maxCachedItems && i < self.cache.size()) {\r\n            i++;\r\n            const entry = self.cache.head();\r\n            const reg = self.register[entry.key];\r\n            if (!!reg) {\r\n                if (Object.keys(reg).length > 0) {\r\n                    self.cache.remove(entry.key);\r\n                    self.cache.put(entry.key, entry.value);\r\n                } else {\r\n                    self.cache.remove(entry.key);\r\n                    delete self.register[entry.key];\r\n                    //self.register[entry.key] = undefined;\r\n                    self._disposeEntryContent(entry);\r\n\r\n                }\r\n            }\r\n\r\n        }\r\n    }\r\n    _disposeEntryContent(entry) {\r\n        if (!entry.value) return;\r\n        if (entry.value.isSplatsBatch) {\r\n            entry.value.remove();\r\n        } else if (!!entry.value.traverse) {\r\n            entry.value.traverse((o) => {\r\n\r\n                if (o.material) {\r\n                    // dispose materials\r\n                    if (o.material.length) {\r\n                        for (let i = 0; i < o.material.length; ++i) {\r\n                            o.material[i].dispose();\r\n                        }\r\n                    }\r\n                    else {\r\n                        o.material.dispose()\r\n                    }\r\n                }\r\n                if (o.geometry) {\r\n                    // dispose geometry\r\n                    o.geometry.dispose();\r\n\r\n                }\r\n            });\r\n        }\r\n    }\r\n}\r\n\r\n\r\n\r\nasync function _checkLoaderInitialized(loader) {\r\n    const self = this;\r\n    return new Promise((resolve) => {\r\n        const interval = setInterval(() => {\r\n            if ((!loader.hasDracoLoader || loader.dracoLoader) && (!loader.hasKTX2Loader || loader.ktx2Loader)) {\r\n                clearInterval(interval);\r\n                resolve();\r\n            }\r\n        }, 10); // check every 100ms\r\n    });\r\n};\r\n\r\nfunction _simplifyPath(main_path) {\r\n\r\n    var parts = main_path.split('/'),\r\n        new_path = [],\r\n        length = 0;\r\n    for (var i = 0; i < parts.length; i++) {\r\n        var part = parts[i];\r\n        if (part === '.' || part === '' || part === '..') {\r\n            if (part === '..' && length > 0) {\r\n                length--;\r\n            }\r\n            continue;\r\n        }\r\n        new_path[length++] = part;\r\n    }\r\n\r\n    if (length === 0) {\r\n        return '/';\r\n    }\r\n\r\n    var result = '';\r\n    for (var i = 0; i < length; i++) {\r\n        result += '/' + new_path[i];\r\n    }\r\n\r\n    return result;\r\n}\r\n\r\nexport { TileLoader };","import validate from './validate.js';\nconst byteToHex = [];\nfor (let i = 0; i < 256; ++i) {\n    byteToHex.push((i + 0x100).toString(16).slice(1));\n}\nexport function unsafeStringify(arr, offset = 0) {\n    return (byteToHex[arr[offset + 0]] +\n        byteToHex[arr[offset + 1]] +\n        byteToHex[arr[offset + 2]] +\n        byteToHex[arr[offset + 3]] +\n        '-' +\n        byteToHex[arr[offset + 4]] +\n        byteToHex[arr[offset + 5]] +\n        '-' +\n        byteToHex[arr[offset + 6]] +\n        byteToHex[arr[offset + 7]] +\n        '-' +\n        byteToHex[arr[offset + 8]] +\n        byteToHex[arr[offset + 9]] +\n        '-' +\n        byteToHex[arr[offset + 10]] +\n        byteToHex[arr[offset + 11]] +\n        byteToHex[arr[offset + 12]] +\n        byteToHex[arr[offset + 13]] +\n        byteToHex[arr[offset + 14]] +\n        byteToHex[arr[offset + 15]]).toLowerCase();\n}\nfunction stringify(arr, offset = 0) {\n    const uuid = unsafeStringify(arr, offset);\n    if (!validate(uuid)) {\n        throw TypeError('Stringified UUID is invalid');\n    }\n    return uuid;\n}\nexport default stringify;\n","let getRandomValues;\nconst rnds8 = new Uint8Array(16);\nexport default function rng() {\n    if (!getRandomValues) {\n        if (typeof crypto === 'undefined' || !crypto.getRandomValues) {\n            throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n        }\n        getRandomValues = crypto.getRandomValues.bind(crypto);\n    }\n    return getRandomValues(rnds8);\n}\n","const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);\nexport default { randomUUID };\n","import native from './native.js';\nimport rng from './rng.js';\nimport { unsafeStringify } from './stringify.js';\nfunction _v4(options, buf, offset) {\n    options = options || {};\n    const rnds = options.random ?? options.rng?.() ?? rng();\n    if (rnds.length < 16) {\n        throw new Error('Random bytes length must be >= 16');\n    }\n    rnds[6] = (rnds[6] & 0x0f) | 0x40;\n    rnds[8] = (rnds[8] & 0x3f) | 0x80;\n    if (buf) {\n        offset = offset || 0;\n        if (offset < 0 || offset + 16 > buf.length) {\n            throw new RangeError(`UUID byte range ${offset}:${offset + 15} is out of buffer bounds`);\n        }\n        for (let i = 0; i < 16; ++i) {\n            buf[offset + i] = rnds[i];\n        }\n        return buf;\n    }\n    return unsafeStringify(rnds);\n}\nfunction v4(options, buf, offset) {\n    if (native.randomUUID && !buf && !options) {\n        return native.randomUUID();\n    }\n    return _v4(options, buf, offset);\n}\nexport default v4;\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\n// Copyright Joyent, Inc. and other Node contributors.\n//\n// Permission is hereby granted, free of charge, to any person obtaining a\n// copy of this software and associated documentation files (the\n// \"Software\"), to deal in the Software without restriction, including\n// without limitation the rights to use, copy, modify, merge, publish,\n// distribute, sublicense, and/or sell copies of the Software, and to permit\n// persons to whom the Software is furnished to do so, subject to the\n// following conditions:\n//\n// The above copyright notice and this permission notice shall be included\n// in all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS\n// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\n// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN\n// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,\n// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR\n// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE\n// USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n'use strict';\n\nfunction assertPath(path) {\n  if (typeof path !== 'string') {\n    throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n  }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n  var res = '';\n  var lastSegmentLength = 0;\n  var lastSlash = -1;\n  var dots = 0;\n  var code;\n  for (var i = 0; i <= path.length; ++i) {\n    if (i < path.length)\n      code = path.charCodeAt(i);\n    else if (code === 47 /*/*/)\n      break;\n    else\n      code = 47 /*/*/;\n    if (code === 47 /*/*/) {\n      if (lastSlash === i - 1 || dots === 1) {\n        // NOOP\n      } else if (lastSlash !== i - 1 && dots === 2) {\n        if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n          if (res.length > 2) {\n            var lastSlashIndex = res.lastIndexOf('/');\n            if (lastSlashIndex !== res.length - 1) {\n              if (lastSlashIndex === -1) {\n                res = '';\n                lastSegmentLength = 0;\n              } else {\n                res = res.slice(0, lastSlashIndex);\n                lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n              }\n              lastSlash = i;\n              dots = 0;\n              continue;\n            }\n          } else if (res.length === 2 || res.length === 1) {\n            res = '';\n            lastSegmentLength = 0;\n            lastSlash = i;\n            dots = 0;\n            continue;\n          }\n        }\n        if (allowAboveRoot) {\n          if (res.length > 0)\n            res += '/..';\n          else\n            res = '..';\n          lastSegmentLength = 2;\n        }\n      } else {\n        if (res.length > 0)\n          res += '/' + path.slice(lastSlash + 1, i);\n        else\n          res = path.slice(lastSlash + 1, i);\n        lastSegmentLength = i - lastSlash - 1;\n      }\n      lastSlash = i;\n      dots = 0;\n    } else if (code === 46 /*.*/ && dots !== -1) {\n      ++dots;\n    } else {\n      dots = -1;\n    }\n  }\n  return res;\n}\n\nfunction _format(sep, pathObject) {\n  var dir = pathObject.dir || pathObject.root;\n  var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n  if (!dir) {\n    return base;\n  }\n  if (dir === pathObject.root) {\n    return dir + base;\n  }\n  return dir + sep + base;\n}\n\nvar posix = {\n  // path.resolve([from ...], to)\n  resolve: function resolve() {\n    var resolvedPath = '';\n    var resolvedAbsolute = false;\n    var cwd;\n\n    for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n      var path;\n      if (i >= 0)\n        path = arguments[i];\n      else {\n        if (cwd === undefined)\n          cwd = process.cwd();\n        path = cwd;\n      }\n\n      assertPath(path);\n\n      // Skip empty entries\n      if (path.length === 0) {\n        continue;\n      }\n\n      resolvedPath = path + '/' + resolvedPath;\n      resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    }\n\n    // At this point the path should be resolved to a full absolute path, but\n    // handle relative paths to be safe (might happen when process.cwd() fails)\n\n    // Normalize the path\n    resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n    if (resolvedAbsolute) {\n      if (resolvedPath.length > 0)\n        return '/' + resolvedPath;\n      else\n        return '/';\n    } else if (resolvedPath.length > 0) {\n      return resolvedPath;\n    } else {\n      return '.';\n    }\n  },\n\n  normalize: function normalize(path) {\n    assertPath(path);\n\n    if (path.length === 0) return '.';\n\n    var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n    var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n    // Normalize the path\n    path = normalizeStringPosix(path, !isAbsolute);\n\n    if (path.length === 0 && !isAbsolute) path = '.';\n    if (path.length > 0 && trailingSeparator) path += '/';\n\n    if (isAbsolute) return '/' + path;\n    return path;\n  },\n\n  isAbsolute: function isAbsolute(path) {\n    assertPath(path);\n    return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n  },\n\n  join: function join() {\n    if (arguments.length === 0)\n      return '.';\n    var joined;\n    for (var i = 0; i < arguments.length; ++i) {\n      var arg = arguments[i];\n      assertPath(arg);\n      if (arg.length > 0) {\n        if (joined === undefined)\n          joined = arg;\n        else\n          joined += '/' + arg;\n      }\n    }\n    if (joined === undefined)\n      return '.';\n    return posix.normalize(joined);\n  },\n\n  relative: function relative(from, to) {\n    assertPath(from);\n    assertPath(to);\n\n    if (from === to) return '';\n\n    from = posix.resolve(from);\n    to = posix.resolve(to);\n\n    if (from === to) return '';\n\n    // Trim any leading backslashes\n    var fromStart = 1;\n    for (; fromStart < from.length; ++fromStart) {\n      if (from.charCodeAt(fromStart) !== 47 /*/*/)\n        break;\n    }\n    var fromEnd = from.length;\n    var fromLen = fromEnd - fromStart;\n\n    // Trim any leading backslashes\n    var toStart = 1;\n    for (; toStart < to.length; ++toStart) {\n      if (to.charCodeAt(toStart) !== 47 /*/*/)\n        break;\n    }\n    var toEnd = to.length;\n    var toLen = toEnd - toStart;\n\n    // Compare paths to find the longest common path from root\n    var length = fromLen < toLen ? fromLen : toLen;\n    var lastCommonSep = -1;\n    var i = 0;\n    for (; i <= length; ++i) {\n      if (i === length) {\n        if (toLen > length) {\n          if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n            // We get here if `from` is the exact base path for `to`.\n            // For example: from='/foo/bar'; to='/foo/bar/baz'\n            return to.slice(toStart + i + 1);\n          } else if (i === 0) {\n            // We get here if `from` is the root\n            // For example: from='/'; to='/foo'\n            return to.slice(toStart + i);\n          }\n        } else if (fromLen > length) {\n          if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n            // We get here if `to` is the exact base path for `from`.\n            // For example: from='/foo/bar/baz'; to='/foo/bar'\n            lastCommonSep = i;\n          } else if (i === 0) {\n            // We get here if `to` is the root.\n            // For example: from='/foo'; to='/'\n            lastCommonSep = 0;\n          }\n        }\n        break;\n      }\n      var fromCode = from.charCodeAt(fromStart + i);\n      var toCode = to.charCodeAt(toStart + i);\n      if (fromCode !== toCode)\n        break;\n      else if (fromCode === 47 /*/*/)\n        lastCommonSep = i;\n    }\n\n    var out = '';\n    // Generate the relative path based on the path difference between `to`\n    // and `from`\n    for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n      if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n        if (out.length === 0)\n          out += '..';\n        else\n          out += '/..';\n      }\n    }\n\n    // Lastly, append the rest of the destination (`to`) path that comes after\n    // the common path parts\n    if (out.length > 0)\n      return out + to.slice(toStart + lastCommonSep);\n    else {\n      toStart += lastCommonSep;\n      if (to.charCodeAt(toStart) === 47 /*/*/)\n        ++toStart;\n      return to.slice(toStart);\n    }\n  },\n\n  _makeLong: function _makeLong(path) {\n    return path;\n  },\n\n  dirname: function dirname(path) {\n    assertPath(path);\n    if (path.length === 0) return '.';\n    var code = path.charCodeAt(0);\n    var hasRoot = code === 47 /*/*/;\n    var end = -1;\n    var matchedSlash = true;\n    for (var i = path.length - 1; i >= 1; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          if (!matchedSlash) {\n            end = i;\n            break;\n          }\n        } else {\n        // We saw the first non-path separator\n        matchedSlash = false;\n      }\n    }\n\n    if (end === -1) return hasRoot ? '/' : '.';\n    if (hasRoot && end === 1) return '//';\n    return path.slice(0, end);\n  },\n\n  basename: function basename(path, ext) {\n    if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n    assertPath(path);\n\n    var start = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i;\n\n    if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n      if (ext.length === path.length && ext === path) return '';\n      var extIdx = ext.length - 1;\n      var firstNonSlashEnd = -1;\n      for (i = path.length - 1; i >= 0; --i) {\n        var code = path.charCodeAt(i);\n        if (code === 47 /*/*/) {\n            // If we reached a path separator that was not part of a set of path\n            // separators at the end of the string, stop now\n            if (!matchedSlash) {\n              start = i + 1;\n              break;\n            }\n          } else {\n          if (firstNonSlashEnd === -1) {\n            // We saw the first non-path separator, remember this index in case\n            // we need it if the extension ends up not matching\n            matchedSlash = false;\n            firstNonSlashEnd = i + 1;\n          }\n          if (extIdx >= 0) {\n            // Try to match the explicit extension\n            if (code === ext.charCodeAt(extIdx)) {\n              if (--extIdx === -1) {\n                // We matched the extension, so mark this as the end of our path\n                // component\n                end = i;\n              }\n            } else {\n              // Extension does not match, so our result is the entire path\n              // component\n              extIdx = -1;\n              end = firstNonSlashEnd;\n            }\n          }\n        }\n      }\n\n      if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n      return path.slice(start, end);\n    } else {\n      for (i = path.length - 1; i >= 0; --i) {\n        if (path.charCodeAt(i) === 47 /*/*/) {\n            // If we reached a path separator that was not part of a set of path\n            // separators at the end of the string, stop now\n            if (!matchedSlash) {\n              start = i + 1;\n              break;\n            }\n          } else if (end === -1) {\n          // We saw the first non-path separator, mark this as the end of our\n          // path component\n          matchedSlash = false;\n          end = i + 1;\n        }\n      }\n\n      if (end === -1) return '';\n      return path.slice(start, end);\n    }\n  },\n\n  extname: function extname(path) {\n    assertPath(path);\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n    for (var i = path.length - 1; i >= 0; --i) {\n      var code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            startPart = i + 1;\n            break;\n          }\n          continue;\n        }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1)\n            startDot = i;\n          else if (preDotState !== 1)\n            preDotState = 1;\n      } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 || end === -1 ||\n        // We saw a non-dot character immediately before the dot\n        preDotState === 0 ||\n        // The (right-most) trimmed path component is exactly '..'\n        preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n      return '';\n    }\n    return path.slice(startDot, end);\n  },\n\n  format: function format(pathObject) {\n    if (pathObject === null || typeof pathObject !== 'object') {\n      throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n    }\n    return _format('/', pathObject);\n  },\n\n  parse: function parse(path) {\n    assertPath(path);\n\n    var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n    if (path.length === 0) return ret;\n    var code = path.charCodeAt(0);\n    var isAbsolute = code === 47 /*/*/;\n    var start;\n    if (isAbsolute) {\n      ret.root = '/';\n      start = 1;\n    } else {\n      start = 0;\n    }\n    var startDot = -1;\n    var startPart = 0;\n    var end = -1;\n    var matchedSlash = true;\n    var i = path.length - 1;\n\n    // Track the state of characters (if any) we see before our first dot and\n    // after any path separator we find\n    var preDotState = 0;\n\n    // Get non-dir info\n    for (; i >= start; --i) {\n      code = path.charCodeAt(i);\n      if (code === 47 /*/*/) {\n          // If we reached a path separator that was not part of a set of path\n          // separators at the end of the string, stop now\n          if (!matchedSlash) {\n            startPart = i + 1;\n            break;\n          }\n          continue;\n        }\n      if (end === -1) {\n        // We saw the first non-path separator, mark this as the end of our\n        // extension\n        matchedSlash = false;\n        end = i + 1;\n      }\n      if (code === 46 /*.*/) {\n          // If this is our first dot, mark it as the start of our extension\n          if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n        } else if (startDot !== -1) {\n        // We saw a non-dot and non-path separator before our dot, so we should\n        // have a good chance at having a non-empty extension\n        preDotState = -1;\n      }\n    }\n\n    if (startDot === -1 || end === -1 ||\n    // We saw a non-dot character immediately before the dot\n    preDotState === 0 ||\n    // The (right-most) trimmed path component is exactly '..'\n    preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n      if (end !== -1) {\n        if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n      }\n    } else {\n      if (startPart === 0 && isAbsolute) {\n        ret.name = path.slice(1, startDot);\n        ret.base = path.slice(1, end);\n      } else {\n        ret.name = path.slice(startPart, startDot);\n        ret.base = path.slice(startPart, end);\n      }\n      ret.ext = path.slice(startDot, end);\n    }\n\n    if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n    return ret;\n  },\n\n  sep: '/',\n  delimiter: ':',\n  win32: null,\n  posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\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};","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', '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      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});","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 exact types of a parameter (no conversions)\n   * @param {Param} param\n   * @return {number} Returns the index of the lowest type in typed.types\n   */\n  function getLowestTypeIndex(param) {\n    let min = typeList.length + 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].typeIndex);\n      }\n    }\n    return min;\n  }\n\n  /**\n   * Find the lowest index of the conversion of all types of the parameter\n   * having a conversion\n   * @param {Param} param\n   * @return {number} Returns the lowest index of the conversions of this type\n   */\n  function getLowestConversionIndex(param) {\n    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\n   * @param {Param} param1\n   * @param {Param} param2\n   * @return {number} returns -1 when param1 must get a lower\n   *                  index than param2, 1 when the opposite,\n   *                  or zero when both are equal\n   */\n  function compareParams(param1, param2) {\n    // We compare a number of metrics on a param in turn:\n    // 1) 'any' parameters are the least preferred\n    if (param1.hasAny) {\n      if (!param2.hasAny) {\n        return 1;\n      }\n    } else if (param2.hasAny) {\n      return -1;\n    }\n\n    // 2) Prefer non-rest to rest parameters\n    if (param1.restParam) {\n      if (!param2.restParam) {\n        return 1;\n      }\n    } else if (param2.restParam) {\n      return -1;\n    }\n\n    // 3) Prefer exact type match to conversions\n    if (param1.hasConversion) {\n      if (!param2.hasConversion) {\n        return 1;\n      }\n    } else if (param2.hasConversion) {\n      return -1;\n    }\n\n    // 4) Prefer lower type index:\n    const typeDiff = getLowestTypeIndex(param1) - getLowestTypeIndex(param2);\n    if (typeDiff < 0) {\n      return -1;\n    }\n    if (typeDiff > 0) {\n      return 1;\n    }\n\n    // 5) Prefer lower conversion index\n    const convDiff = getLowestConversionIndex(param1) - getLowestConversionIndex(param2);\n    if (convDiff < 0) {\n      return -1;\n    }\n    if (convDiff > 0) {\n      return 1;\n    }\n\n    // Don't have a basis for preference\n    return 0;\n  }\n\n  /**\n   * Compare two signatures\n   * @param {Signature} signature1\n   * @param {Signature} signature2\n   * @return {number} returns a negative number when param1 must get a lower\n   *                  index than param2, a positive number when the opposite,\n   *                  or zero when both are equal\n   */\n  function compareSignatures(signature1, signature2) {\n    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 1;\n      }\n    } else if (hasRest2 && last2.hasAny) {\n      return -1;\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;\n    }\n\n    // 3) A conversion rest param is less preferred\n    if (hasRest1 && last1.hasConversion) {\n      if (!hasRest2 || !last2.hasConversion) {\n        return 1;\n      }\n    } else if (hasRest2 && last2.hasConversion) {\n      return -1;\n    }\n\n    // 4) Minimize the number of conversions\n    if (conv1 !== conv2) {\n      return conv1 - conv2;\n    }\n\n    // 5) Prefer no rest param\n    if (hasRest1) {\n      if (!hasRest2) {\n        return 1;\n      }\n    } else if (hasRest2) {\n      return -1;\n    }\n\n    // 6) Prefer shorter with rest param, longer without\n    const lengthCriterion = (pars1.length - pars2.length) * (hasRest1 ? -1 : 1);\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;\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    for (c of comparisons) {\n      if (c !== 0) {\n        return c;\n      }\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) {\n      types.sort((t1, t2) => t1.index - t2.index);\n    }\n    let matches = types[0].conversionsTo;\n    if (typeNames.length === 1) {\n      return matches;\n    }\n    matches = matches.concat([]); // shallow copy the matches\n    // Since the types are now in index order, we just want the first\n    // occurrence of any from type:\n    const knownTypes = new Set(typeNames);\n    for (let i = 1; i < types.length; ++i) {\n      let newMatch;\n      for (newMatch of types[i].conversionsTo) {\n        if (!knownTypes.has(newMatch.from)) {\n          matches.push(newMatch);\n          knownTypes.add(newMatch.from);\n        }\n      }\n    }\n    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 a wrapped function\n   */\n  function compileArgsPreprocessing(params, fn) {\n    let fnConvert = fn;\n\n    // TODO: can we make this wrapper function smarter/simpler?\n\n    if (params.some(p => p.hasConversion)) {\n      const restParam = hasRestParam(params);\n      const compiledConversions = params.map(compileArgConversion);\n      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    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    param.types.forEach(function (type) {\n      if (type.conversion) {\n        tests.push(findType(type.conversion.from).test);\n        conversions.push(type.conversion.convert);\n      }\n    });\n\n    // create optimized conversion functions depending on the number of conversions\n    switch (conversions.length) {\n      case 0:\n        return function convertArg(arg) {\n          return arg;\n        };\n      case 1:\n        test0 = tests[0];\n        conversion0 = conversions[0];\n        return function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          return arg;\n        };\n      case 2:\n        test0 = tests[0];\n        test1 = tests[1];\n        conversion0 = conversions[0];\n        conversion1 = conversions[1];\n        return function convertArg(arg) {\n          if (test0(arg)) {\n            return conversion0(arg);\n          }\n          if (test1(arg)) {\n            return conversion1(arg);\n          }\n          return arg;\n        };\n      default:\n        return function convertArg(arg) {\n          for (let i = 0; i < conversions.length; i++) {\n            if (tests[i](arg)) {\n              return conversions[i](arg);\n            }\n          }\n          return arg;\n        };\n    }\n  }\n\n  /**\n   * Split params with union types in to separate params.\n   *\n   * For example:\n   *\n   *     splitParams([['Array', 'Object'], ['string', 'RegExp'])\n   *     // returns:\n   *     // [\n   *     //   ['Array', 'string'],\n   *     //   ['Array', 'RegExp'],\n   *     //   ['Object', 'string'],\n   *     //   ['Object', 'RegExp']\n   *     // ]\n   *\n   * @param {Param[]} params\n   * @return {Param[]}\n   */\n  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      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","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 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 (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) || !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) || !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) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // round if needed, else create a clone\n  var split = splitNumber(value);\n  var rounded = precision ? roundDigits(split, precision) : split;\n  var c = rounded.coefficients;\n  var e = rounded.exponent;\n\n  // append zeros if needed\n  if (c.length < precision) {\n    c = c.concat(zeros(precision - c.length));\n  }\n\n  // format as `C.CCCe+EEE` or `C.CCCe-EEE`\n  var first = c.shift();\n  return rounded.sign + first + (c.length > 0 ? '.' + c.join('') : '') + 'e' + (e >= 0 ? '+' : '') + e;\n}\n\n/**\n * Format a number with a certain precision\n * @param {number | string} value\n * @param {number} [precision=undefined] Optional number of digits.\n * @param {{lowerExp: number | undefined, upperExp: number | undefined}} [options]\n *                                       By default:\n *                                         lowerExp = -3 (incl)\n *                                         upper = +5 (excl)\n * @return {string}\n */\nexport function toPrecision(value, precision, options) {\n  if (isNaN(value) || !isFinite(value)) {\n    return String(value);\n  }\n\n  // determine lower and upper bound for exponential notation.\n  var lowerExp = _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 (!isFinite(a) || !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}","/**\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-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\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-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\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\\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-\\uDEC4\\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\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\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\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\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\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])(?:[0-9A-Za-z\\xAA\\xB5\\xBA\\xC0-\\xD6\\xD8-\\xF6\\xF8-\\u02C1\\u02C6-\\u02D1\\u02E0-\\u02E4\\u02EC\\u02EE\\u0370-\\u0374\\u0376\\u0377\\u037A-\\u037D\\u037F\\u0386\\u0388-\\u038A\\u038C\\u038E-\\u03A1\\u03A3-\\u03F5\\u03F7-\\u0481\\u048A-\\u052F\\u0531-\\u0556\\u0559\\u0560-\\u0588\\u05D0-\\u05EA\\u05EF-\\u05F2\\u0620-\\u064A\\u066E\\u066F\\u0671-\\u06D3\\u06D5\\u06E5\\u06E6\\u06EE\\u06EF\\u06FA-\\u06FC\\u06FF\\u0710\\u0712-\\u072F\\u074D-\\u07A5\\u07B1\\u07CA-\\u07EA\\u07F4\\u07F5\\u07FA\\u0800-\\u0815\\u081A\\u0824\\u0828\\u0840-\\u0858\\u0860-\\u086A\\u0870-\\u0887\\u0889-\\u088E\\u08A0-\\u08C9\\u0904-\\u0939\\u093D\\u0950\\u0958-\\u0961\\u0971-\\u0980\\u0985-\\u098C\\u098F\\u0990\\u0993-\\u09A8\\u09AA-\\u09B0\\u09B2\\u09B6-\\u09B9\\u09BD\\u09CE\\u09DC\\u09DD\\u09DF-\\u09E1\\u09F0\\u09F1\\u09FC\\u0A05-\\u0A0A\\u0A0F\\u0A10\\u0A13-\\u0A28\\u0A2A-\\u0A30\\u0A32\\u0A33\\u0A35\\u0A36\\u0A38\\u0A39\\u0A59-\\u0A5C\\u0A5E\\u0A72-\\u0A74\\u0A85-\\u0A8D\\u0A8F-\\u0A91\\u0A93-\\u0AA8\\u0AAA-\\u0AB0\\u0AB2\\u0AB3\\u0AB5-\\u0AB9\\u0ABD\\u0AD0\\u0AE0\\u0AE1\\u0AF9\\u0B05-\\u0B0C\\u0B0F\\u0B10\\u0B13-\\u0B28\\u0B2A-\\u0B30\\u0B32\\u0B33\\u0B35-\\u0B39\\u0B3D\\u0B5C\\u0B5D\\u0B5F-\\u0B61\\u0B71\\u0B83\\u0B85-\\u0B8A\\u0B8E-\\u0B90\\u0B92-\\u0B95\\u0B99\\u0B9A\\u0B9C\\u0B9E\\u0B9F\\u0BA3\\u0BA4\\u0BA8-\\u0BAA\\u0BAE-\\u0BB9\\u0BD0\\u0C05-\\u0C0C\\u0C0E-\\u0C10\\u0C12-\\u0C28\\u0C2A-\\u0C39\\u0C3D\\u0C58-\\u0C5A\\u0C5D\\u0C60\\u0C61\\u0C80\\u0C85-\\u0C8C\\u0C8E-\\u0C90\\u0C92-\\u0CA8\\u0CAA-\\u0CB3\\u0CB5-\\u0CB9\\u0CBD\\u0CDD\\u0CDE\\u0CE0\\u0CE1\\u0CF1\\u0CF2\\u0D04-\\u0D0C\\u0D0E-\\u0D10\\u0D12-\\u0D3A\\u0D3D\\u0D4E\\u0D54-\\u0D56\\u0D5F-\\u0D61\\u0D7A-\\u0D7F\\u0D85-\\u0D96\\u0D9A-\\u0DB1\\u0DB3-\\u0DBB\\u0DBD\\u0DC0-\\u0DC6\\u0E01-\\u0E30\\u0E32\\u0E33\\u0E40-\\u0E46\\u0E81\\u0E82\\u0E84\\u0E86-\\u0E8A\\u0E8C-\\u0EA3\\u0EA5\\u0EA7-\\u0EB0\\u0EB2\\u0EB3\\u0EBD\\u0EC0-\\u0EC4\\u0EC6\\u0EDC-\\u0EDF\\u0F00\\u0F40-\\u0F47\\u0F49-\\u0F6C\\u0F88-\\u0F8C\\u1000-\\u102A\\u103F\\u1050-\\u1055\\u105A-\\u105D\\u1061\\u1065\\u1066\\u106E-\\u1070\\u1075-\\u1081\\u108E\\u10A0-\\u10C5\\u10C7\\u10CD\\u10D0-\\u10FA\\u10FC-\\u1248\\u124A-\\u124D\\u1250-\\u1256\\u1258\\u125A-\\u125D\\u1260-\\u1288\\u128A-\\u128D\\u1290-\\u12B0\\u12B2-\\u12B5\\u12B8-\\u12BE\\u12C0\\u12C2-\\u12C5\\u12C8-\\u12D6\\u12D8-\\u1310\\u1312-\\u1315\\u1318-\\u135A\\u1380-\\u138F\\u13A0-\\u13F5\\u13F8-\\u13FD\\u1401-\\u166C\\u166F-\\u167F\\u1681-\\u169A\\u16A0-\\u16EA\\u16F1-\\u16F8\\u1700-\\u1711\\u171F-\\u1731\\u1740-\\u1751\\u1760-\\u176C\\u176E-\\u1770\\u1780-\\u17B3\\u17D7\\u17DC\\u1820-\\u1878\\u1880-\\u1884\\u1887-\\u18A8\\u18AA\\u18B0-\\u18F5\\u1900-\\u191E\\u1950-\\u196D\\u1970-\\u1974\\u1980-\\u19AB\\u19B0-\\u19C9\\u1A00-\\u1A16\\u1A20-\\u1A54\\u1AA7\\u1B05-\\u1B33\\u1B45-\\u1B4C\\u1B83-\\u1BA0\\u1BAE\\u1BAF\\u1BBA-\\u1BE5\\u1C00-\\u1C23\\u1C4D-\\u1C4F\\u1C5A-\\u1C7D\\u1C80-\\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-\\uA7CD\\uA7D0\\uA7D1\\uA7D3\\uA7D5-\\uA7DC\\uA7F2-\\uA801\\uA803-\\uA805\\uA807-\\uA80A\\uA80C-\\uA822\\uA840-\\uA873\\uA882-\\uA8B3\\uA8F2-\\uA8F7\\uA8FB\\uA8FD\\uA8FE\\uA90A-\\uA925\\uA930-\\uA946\\uA960-\\uA97C\\uA984-\\uA9B2\\uA9CF\\uA9E0-\\uA9E4\\uA9E6-\\uA9EF\\uA9FA-\\uA9FE\\uAA00-\\uAA28\\uAA40-\\uAA42\\uAA44-\\uAA4B\\uAA60-\\uAA76\\uAA7A\\uAA7E-\\uAAAF\\uAAB1\\uAAB5\\uAAB6\\uAAB9-\\uAABD\\uAAC0\\uAAC2\\uAADB-\\uAADD\\uAAE0-\\uAAEA\\uAAF2-\\uAAF4\\uAB01-\\uAB06\\uAB09-\\uAB0E\\uAB11-\\uAB16\\uAB20-\\uAB26\\uAB28-\\uAB2E\\uAB30-\\uAB5A\\uAB5C-\\uAB69\\uAB70-\\uABE2\\uAC00-\\uD7A3\\uD7B0-\\uD7C6\\uD7CB-\\uD7FB\\uF900-\\uFA6D\\uFA70-\\uFAD9\\uFB00-\\uFB06\\uFB13-\\uFB17\\uFB1D\\uFB1F-\\uFB28\\uFB2A-\\uFB36\\uFB38-\\uFB3C\\uFB3E\\uFB40\\uFB41\\uFB43\\uFB44\\uFB46-\\uFBB1\\uFBD3-\\uFD3D\\uFD50-\\uFD8F\\uFD92-\\uFDC7\\uFDF0-\\uFDFB\\uFE70-\\uFE74\\uFE76-\\uFEFC\\uFF21-\\uFF3A\\uFF41-\\uFF5A\\uFF66-\\uFFBE\\uFFC2-\\uFFC7\\uFFCA-\\uFFCF\\uFFD2-\\uFFD7\\uFFDA-\\uFFDC]|\\uD800[\\uDC00-\\uDC0B\\uDC0D-\\uDC26\\uDC28-\\uDC3A\\uDC3C\\uDC3D\\uDC3F-\\uDC4D\\uDC50-\\uDC5D\\uDC80-\\uDCFA\\uDE80-\\uDE9C\\uDEA0-\\uDED0\\uDF00-\\uDF1F\\uDF2D-\\uDF40\\uDF42-\\uDF49\\uDF50-\\uDF75\\uDF80-\\uDF9D\\uDFA0-\\uDFC3\\uDFC8-\\uDFCF]|\\uD801[\\uDC00-\\uDC9D\\uDCB0-\\uDCD3\\uDCD8-\\uDCFB\\uDD00-\\uDD27\\uDD30-\\uDD63\\uDD70-\\uDD7A\\uDD7C-\\uDD8A\\uDD8C-\\uDD92\\uDD94\\uDD95\\uDD97-\\uDDA1\\uDDA3-\\uDDB1\\uDDB3-\\uDDB9\\uDDBB\\uDDBC\\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\\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-\\uDEC4\\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\\uDEE0-\\uDEF2\\uDF02\\uDF04-\\uDF10\\uDF12-\\uDF33\\uDFB0]|\\uD808[\\uDC00-\\uDF99]|\\uD809[\\uDC80-\\uDD43]|\\uD80B[\\uDF90-\\uDFF0]|[\\uD80C\\uD80E\\uD80F\\uD81C-\\uD820\\uD822\\uD840-\\uD868\\uD86A-\\uD86C\\uD86F-\\uD872\\uD874-\\uD879\\uD880-\\uD883\\uD885-\\uD887][\\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\\uDF00-\\uDF4A\\uDF50\\uDF93-\\uDF9F\\uDFE0\\uDFE1\\uDFE3]|\\uD821[\\uDC00-\\uDFF7]|\\uD823[\\uDC00-\\uDCD5\\uDCFF-\\uDD08]|\\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\\uDFE0-\\uDFE6\\uDFE8-\\uDFEB\\uDFED\\uDFEE\\uDFF0-\\uDFFE]|\\uD83A[\\uDC00-\\uDCC4\\uDD00-\\uDD43\\uDD4B]|\\uD83B[\\uDE00-\\uDE03\\uDE05-\\uDE1F\\uDE21\\uDE22\\uDE24\\uDE27\\uDE29-\\uDE32\\uDE34-\\uDE37\\uDE39\\uDE3B\\uDE42\\uDE47\\uDE49\\uDE4B\\uDE4D-\\uDE4F\\uDE51\\uDE52\\uDE54\\uDE57\\uDE59\\uDE5B\\uDE5D\\uDE5F\\uDE61\\uDE62\\uDE64\\uDE67-\\uDE6A\\uDE6C-\\uDE72\\uDE74-\\uDE77\\uDE79-\\uDE7C\\uDE7E\\uDE80-\\uDE89\\uDE8B-\\uDE9B\\uDEA1-\\uDEA3\\uDEA5-\\uDEA9\\uDEAB-\\uDEBB]|\\uD869[\\uDC00-\\uDEDF\\uDF00-\\uDFFF]|\\uD86D[\\uDC00-\\uDF39\\uDF40-\\uDFFF]|\\uD86E[\\uDC00-\\uDC1D\\uDC20-\\uDFFF]|\\uD873[\\uDC00-\\uDEA1\\uDEB0-\\uDFFF]|\\uD87A[\\uDC00-\\uDFE0\\uDFF0-\\uDFFF]|\\uD87B[\\uDC00-\\uDE5D]|\\uD87E[\\uDC00-\\uDE1D]|\\uD884[\\uDC00-\\uDF4A\\uDF50-\\uDFFF]|\\uD888[\\uDC00-\\uDFAF])*$/.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}","/*!\r\n *  decimal.js v10.5.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 ±Infinity?\r\n  if (!xd || !yd) {\r\n    return !xs || !ys ? NaN : xs !== ys ? xs : xd === yd ? 0 : !xd ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Either zero?\r\n  if (!xd[0] || !yd[0]) return xd[0] ? xs : yd[0] ? -ys : 0;\r\n\r\n  // Signs differ?\r\n  if (xs !== ys) return xs;\r\n\r\n  // Compare exponents.\r\n  if (x.e !== y.e) return x.e > y.e ^ xs < 0 ? 1 : -1;\r\n\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Compare digit by digit.\r\n  for (i = 0, j = xdL < ydL ? xdL : ydL; i < j; ++i) {\r\n    if (xd[i] !== yd[i]) return xd[i] > yd[i] ^ xs < 0 ? 1 : -1;\r\n  }\r\n\r\n  // Compare lengths.\r\n  return xdL === ydL ? 0 : xdL > ydL ^ xs < 0 ? 1 : -1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cosine of the value in radians of this Decimal.\r\n *\r\n * Domain: [-Infinity, Infinity]\r\n * Range: [-1, 1]\r\n *\r\n * cos(0)         = 1\r\n * cos(-0)        = 1\r\n * cos(Infinity)  = NaN\r\n * cos(-Infinity) = NaN\r\n * cos(NaN)       = NaN\r\n *\r\n */\r\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 ±Infinity.\r\n    else if (x.d) y.s = -y.s;\r\n\r\n    // Return x if y is finite and x is ±Infinity.\r\n    // Return x if both are ±Infinity with different signs.\r\n    // Return NaN if both are ±Infinity with the same sign.\r\n    else y = new Ctor(y.d || x.s !== y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n  // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.plus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return y negated if x is zero and y is non-zero.\r\n    if (yd[0]) y.s = -y.s;\r\n\r\n    // Return x if y is zero and x is non-zero.\r\n    else if (xd[0]) y = new Ctor(x);\r\n\r\n    // Return zero if both are zero.\r\n    // From IEEE 754 (2008) 6.3: 0 - 0 = -0 - -0 = -0 when rounding to -Infinity.\r\n    else return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  e = mathfloor(y.e / LOG_BASE);\r\n  xe = mathfloor(x.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  k = xe - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (k) {\r\n    xLTy = k < 0;\r\n\r\n    if (xLTy) {\r\n      d = xd;\r\n      k = -k;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = xe;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Numbers with massively different exponents would result in a very high number of\r\n    // zeros needing to be prepended, but this can be avoided while still ensuring correct\r\n    // rounding by limiting the number of zeros to `Math.ceil(pr / LOG_BASE) + 2`.\r\n    i = Math.max(Math.ceil(pr / LOG_BASE), len) + 2;\r\n\r\n    if (k > i) {\r\n      k = i;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents.\r\n    d.reverse();\r\n    for (i = k; i--;) d.push(0);\r\n    d.reverse();\r\n\r\n  // Base 1e7 exponents equal.\r\n  } else {\r\n\r\n    // Check digits to determine which is the bigger number.\r\n\r\n    i = xd.length;\r\n    len = yd.length;\r\n    xLTy = i < len;\r\n    if (xLTy) len = i;\r\n\r\n    for (i = 0; i < len; i++) {\r\n      if (xd[i] != yd[i]) {\r\n        xLTy = xd[i] < yd[i];\r\n        break;\r\n      }\r\n    }\r\n\r\n    k = 0;\r\n  }\r\n\r\n  if (xLTy) {\r\n    d = xd;\r\n    xd = yd;\r\n    yd = d;\r\n    y.s = -y.s;\r\n  }\r\n\r\n  len = xd.length;\r\n\r\n  // Append zeros to `xd` if shorter.\r\n  // Don't add zeros to `yd` if shorter as subtraction only needs to start at `yd` length.\r\n  for (i = yd.length - len; i > 0; --i) xd[len++] = 0;\r\n\r\n  // Subtract yd from xd.\r\n  for (i = yd.length; i > k;) {\r\n\r\n    if (xd[--i] < yd[i]) {\r\n      for (j = i; j && xd[--j] === 0;) xd[j] = BASE - 1;\r\n      --xd[j];\r\n      xd[i] += BASE;\r\n    }\r\n\r\n    xd[i] -= yd[i];\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; xd[--len] === 0;) xd.pop();\r\n\r\n  // Remove leading zeros and adjust exponent accordingly.\r\n  for (; xd[0] === 0; xd.shift()) --e;\r\n\r\n  // Zero?\r\n  if (!xd[0]) return new Ctor(rm === 3 ? -0 : 0);\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n *   n % 0 =  N\r\n *   n % N =  N\r\n *   n % I =  n\r\n *   0 % n =  0\r\n *  -0 % n = -0\r\n *   0 % 0 =  N\r\n *   0 % N =  N\r\n *   0 % I =  0\r\n *   N % n =  N\r\n *   N % 0 =  N\r\n *   N % N =  N\r\n *   N % I =  N\r\n *   I % n =  N\r\n *   I % 0 =  N\r\n *   I % N =  N\r\n *   I % I =  N\r\n *\r\n * Return a new Decimal whose value is the value of this Decimal modulo `y`, rounded to\r\n * `precision` significant digits using rounding mode `rounding`.\r\n *\r\n * The result depends on the modulo mode.\r\n *\r\n */\r\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 ±Infinity or NaN, or y is NaN or ±0.\r\n  if (!x.d || !y.s || y.d && !y.d[0]) return new Ctor(NaN);\r\n\r\n  // Return x if y is ±Infinity or x is ±0.\r\n  if (!y.d || x.d && !x.d[0]) {\r\n    return finalise(new Ctor(x), Ctor.precision, Ctor.rounding);\r\n  }\r\n\r\n  // Prevent rounding of intermediate calculations.\r\n  external = false;\r\n\r\n  if (Ctor.modulo == 9) {\r\n\r\n    // Euclidian division: q = sign(y) * floor(x / abs(y))\r\n    // result = x - q * y    where  0 <= result < abs(y)\r\n    q = divide(x, y.abs(), 0, 3, 1);\r\n    q.s *= y.s;\r\n  } else {\r\n    q = divide(x, y, 0, Ctor.modulo, 1);\r\n  }\r\n\r\n  q = q.times(y);\r\n\r\n  external = true;\r\n\r\n  return x.minus(q);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the natural exponential of the value of this Decimal,\r\n * i.e. the base e raised to the power the value of this Decimal, rounded to `precision`\r\n * significant digits using rounding mode `rounding`.\r\n *\r\n */\r\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 ±Infinity.\r\n    // Return x if both are ±Infinity with the same sign.\r\n    // Return NaN if both are ±Infinity with different signs.\r\n    // Return y if x is finite and y is ±Infinity.\r\n    else if (!x.d) y = new Ctor(y.d || x.s === y.s ? x : NaN);\r\n\r\n    return y;\r\n  }\r\n\r\n   // If signs differ...\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.minus(y);\r\n  }\r\n\r\n  xd = x.d;\r\n  yd = y.d;\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  // If either is zero...\r\n  if (!xd[0] || !yd[0]) {\r\n\r\n    // Return x if y is zero.\r\n    // Return y if y is non-zero.\r\n    if (!yd[0]) y = new Ctor(x);\r\n\r\n    return external ? finalise(y, pr, rm) : y;\r\n  }\r\n\r\n  // x and y are finite, non-zero numbers with the same sign.\r\n\r\n  // Calculate base 1e7 exponents.\r\n  k = mathfloor(x.e / LOG_BASE);\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  xd = xd.slice();\r\n  i = k - e;\r\n\r\n  // If base 1e7 exponents differ...\r\n  if (i) {\r\n\r\n    if (i < 0) {\r\n      d = xd;\r\n      i = -i;\r\n      len = yd.length;\r\n    } else {\r\n      d = yd;\r\n      e = k;\r\n      len = xd.length;\r\n    }\r\n\r\n    // Limit number of zeros prepended to max(ceil(pr / LOG_BASE), len) + 1.\r\n    k = Math.ceil(pr / LOG_BASE);\r\n    len = k > len ? k + 1 : len + 1;\r\n\r\n    if (i > len) {\r\n      i = len;\r\n      d.length = 1;\r\n    }\r\n\r\n    // Prepend zeros to equalise exponents. Note: Faster to use reverse then do unshifts.\r\n    d.reverse();\r\n    for (; i--;) d.push(0);\r\n    d.reverse();\r\n  }\r\n\r\n  len = xd.length;\r\n  i = yd.length;\r\n\r\n  // If yd is longer than xd, swap xd and yd so xd points to the longer array.\r\n  if (len - i < 0) {\r\n    i = len;\r\n    d = yd;\r\n    yd = xd;\r\n    xd = d;\r\n  }\r\n\r\n  // Only start adding at yd.length - 1 as the further digits of xd can be left as they are.\r\n  for (carry = 0; i;) {\r\n    carry = (xd[--i] = xd[i] + yd[i] + carry) / BASE | 0;\r\n    xd[i] %= BASE;\r\n  }\r\n\r\n  if (carry) {\r\n    xd.unshift(carry);\r\n    ++e;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n  for (len = xd.length; xd[--len] == 0;) xd.pop();\r\n\r\n  y.d = xd;\r\n  y.e = getBase10Exponent(xd, e);\r\n\r\n  return external ? finalise(y, pr, rm) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return the number of significant digits of the value of this Decimal.\r\n *\r\n * [z] {boolean|number} Whether to count integer-part trailing zeros: true, false, 1 or 0.\r\n *\r\n */\r\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, ±Infinity or ±0...\r\n  if (!xd || !xd[0] || !yd || !yd[0]) {\r\n\r\n    return new Ctor(!y.s || xd && !xd[0] && !yd || yd && !yd[0] && !xd\r\n\r\n      // Return NaN if either is NaN.\r\n      // Return NaN if x is ±0 and y is ±Infinity, or y is ±0 and x is ±Infinity.\r\n      ? NaN\r\n\r\n      // Return ±Infinity if either is ±Infinity.\r\n      // Return ±0 if either is ±0.\r\n      : !xd || !yd ? y.s / 0 : y.s * 0);\r\n  }\r\n\r\n  e = mathfloor(x.e / LOG_BASE) + mathfloor(y.e / LOG_BASE);\r\n  xdL = xd.length;\r\n  ydL = yd.length;\r\n\r\n  // Ensure xd points to the longer array.\r\n  if (xdL < ydL) {\r\n    r = xd;\r\n    xd = yd;\r\n    yd = r;\r\n    rL = xdL;\r\n    xdL = ydL;\r\n    ydL = rL;\r\n  }\r\n\r\n  // Initialise the result array with zeros.\r\n  r = [];\r\n  rL = xdL + ydL;\r\n  for (i = rL; i--;) r.push(0);\r\n\r\n  // Multiply!\r\n  for (i = ydL; --i >= 0;) {\r\n    carry = 0;\r\n    for (k = xdL + i; k > i;) {\r\n      t = r[k] + yd[i] * xd[k - i - 1] + carry;\r\n      r[k--] = t % BASE | 0;\r\n      carry = t / BASE | 0;\r\n    }\r\n\r\n    r[k] = (r[k] + carry) % BASE | 0;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; !r[--rL];) r.pop();\r\n\r\n  if (carry) ++e;\r\n  else r.shift();\r\n\r\n  y.d = r;\r\n  y.e = getBase10Exponent(r, e);\r\n\r\n  return external ? finalise(y, Ctor.precision, Ctor.rounding) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal in base 2, round to `sd` significant\r\n * digits using rounding mode `rm`.\r\n *\r\n * If the optional `sd` argument is present then return binary exponential notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\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, ±0)                            = 1\r\n\r\n *   pow(NaN, non-zero)                    = NaN\r\n *   pow(abs(x) > 1, +Infinity)            = +Infinity\r\n *   pow(abs(x) > 1, -Infinity)            = +0\r\n *   pow(abs(x) == 1, ±Infinity)           = NaN\r\n *   pow(abs(x) < 1, +Infinity)            = +0\r\n *   pow(abs(x) < 1, -Infinity)            = +Infinity\r\n *   pow(+Infinity, y > 0)                 = +Infinity\r\n *   pow(+Infinity, y < 0)                 = +0\r\n *   pow(-Infinity, odd integer > 0)       = -Infinity\r\n *   pow(-Infinity, even integer > 0)      = +Infinity\r\n *   pow(-Infinity, odd integer < 0)       = -0\r\n *   pow(-Infinity, even integer < 0)      = +0\r\n *   pow(+0, y > 0)                        = +0\r\n *   pow(+0, y < 0)                        = +Infinity\r\n *   pow(-0, odd integer > 0)              = -0\r\n *   pow(-0, even integer > 0)             = +0\r\n *   pow(-0, odd integer < 0)              = -Infinity\r\n *   pow(-0, even integer < 0)             = +Infinity\r\n *   pow(finite x < 0, finite non-integer) = NaN\r\n *\r\n * For non-integer or very large exponents pow(x, y) is calculated using\r\n *\r\n *   x^y = exp(y*ln(x))\r\n *\r\n * Assuming the first 15 rounding digits are each equally likely to be any digit 0-9, the\r\n * probability of an incorrectly rounded result\r\n * P([49]9{14} | [50]0{14}) = 2 * 0.2 * 10^-14 = 4e-15 = 1/2.5e+14\r\n * i.e. 1 in 250,000,000,000,000\r\n *\r\n * If a result is incorrectly rounded the maximum error will be 1 ulp (unit in last place).\r\n *\r\n * y {number|string|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 ±Infinity, NaN or ±0?\r\n  if (!x.d || !y.d || !x.d[0] || !y.d[0]) return new Ctor(mathpow(+x, yn));\r\n\r\n  x = new Ctor(x);\r\n\r\n  if (x.eq(1)) return x;\r\n\r\n  pr = Ctor.precision;\r\n  rm = Ctor.rounding;\r\n\r\n  if (y.eq(1)) return finalise(x, pr, rm);\r\n\r\n  // y exponent\r\n  e = mathfloor(y.e / LOG_BASE);\r\n\r\n  // If y is a small integer use the 'exponentiation by squaring' algorithm.\r\n  if (e >= y.d.length - 1 && (k = yn < 0 ? -yn : yn) <= MAX_SAFE_INTEGER) {\r\n    r = intPow(Ctor, x, k, pr);\r\n    return y.s < 0 ? new Ctor(1).div(r) : finalise(r, pr, rm);\r\n  }\r\n\r\n  s = x.s;\r\n\r\n  // if x is negative\r\n  if (s < 0) {\r\n\r\n    // if y is not an integer\r\n    if (e < y.d.length - 1) return new Ctor(NaN);\r\n\r\n    // Result is positive if x is negative and the last digit of integer y is even.\r\n    if ((y.d[e] & 1) == 0) s = 1;\r\n\r\n    // if x.eq(-1)\r\n    if (x.e == 0 && x.d[0] == 1 && x.d.length == 1) {\r\n      x.s = s;\r\n      return x;\r\n    }\r\n  }\r\n\r\n  // Estimate result exponent.\r\n  // x^y = 10^e,  where e = y * log10(x)\r\n  // log10(x) = log10(x_significand) + x_exponent\r\n  // log10(x_significand) = ln(x_significand) / ln(10)\r\n  k = mathpow(+x, yn);\r\n  e = k == 0 || !isFinite(k)\r\n    ? mathfloor(yn * (Math.log('0.' + digitsToString(x.d)) / Math.LN10 + x.e + 1))\r\n    : new Ctor(k + '').e;\r\n\r\n  // Exponent estimate may be incorrect e.g. x: 0.999999999999999999, y: 2.29, e: 0, r.e: -1.\r\n\r\n  // Overflow/underflow?\r\n  if (e > Ctor.maxE + 1 || e < Ctor.minE - 1) return new Ctor(e > 0 ? s / 0 : 0);\r\n\r\n  external = false;\r\n  Ctor.rounding = x.s = 1;\r\n\r\n  // Estimate the extra guard digits needed to ensure five correct rounding digits from\r\n  // naturalLogarithm(x). Example of failure without these extra digits (precision: 10):\r\n  // new Decimal(2.32456).pow('2087987436534566.46411')\r\n  // should be 1.162377823e+764914905173815, but is 1.162355823e+764914905173815\r\n  k = Math.min(12, (e + '').length);\r\n\r\n  // r = x^y = exp(y*ln(x))\r\n  r = naturalExponential(y.times(naturalLogarithm(x, pr + k)), pr);\r\n\r\n  // r may be Infinity, e.g. (0.9999999999999999).pow(-1e+40)\r\n  if (r.d) {\r\n\r\n    // Truncate to the required precision plus five rounding digits.\r\n    r = finalise(r, pr + 5, 1);\r\n\r\n    // If the rounding digits are [49]9999 or [50]0000 increase the precision by 10 and recalculate\r\n    // the result.\r\n    if (checkRoundingDigits(r.d, pr, rm)) {\r\n      e = pr + 10;\r\n\r\n      // Truncate to the increased precision plus five rounding digits.\r\n      r = finalise(naturalExponential(y.times(naturalLogarithm(x, e + k)), e), e + 5, 1);\r\n\r\n      // Check for 14 nines from the 2nd rounding digit (the first rounding digit may be 4 or 9).\r\n      if (+digitsToString(r.d).slice(pr + 1, pr + 15) + 1 == 1e14) {\r\n        r = finalise(r, pr + 1, 0);\r\n      }\r\n    }\r\n  }\r\n\r\n  r.s = s;\r\n  external = true;\r\n  Ctor.rounding = rm;\r\n\r\n  return finalise(r, pr, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Decimal rounded to `sd` significant digits\r\n * using rounding mode `rounding`.\r\n *\r\n * Return exponential notation if `sd` is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * [sd] {number} Significant digits. Integer, 1 to MAX_DIGITS inclusive.\r\n * [rm] {number} Rounding mode. Integer, 0 to 8 inclusive.\r\n *\r\n */\r\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 ±0 if x is 0 or y is ±Infinity, or return ±Infinity as y is 0.\r\n        xd && xd[0] == 0 || !yd ? sign * 0 : sign / 0);\r\n    }\r\n\r\n    if (base) {\r\n      logBase = 1;\r\n      e = x.e - y.e;\r\n    } else {\r\n      base = BASE;\r\n      logBase = LOG_BASE;\r\n      e = mathfloor(x.e / logBase) - mathfloor(y.e / logBase);\r\n    }\r\n\r\n    yL = yd.length;\r\n    xL = xd.length;\r\n    q = new Ctor(sign);\r\n    qd = q.d = [];\r\n\r\n    // Result exponent may be one less than e.\r\n    // The digit array of a Decimal from toStringBinary may have trailing zeros.\r\n    for (i = 0; yd[i] == (xd[i] || 0); i++);\r\n\r\n    if (yd[i] > (xd[i] || 0)) e--;\r\n\r\n    if (pr == null) {\r\n      sd = pr = Ctor.precision;\r\n      rm = Ctor.rounding;\r\n    } else if (dp) {\r\n      sd = pr + (x.e - y.e) + 1;\r\n    } else {\r\n      sd = pr;\r\n    }\r\n\r\n    if (sd < 0) {\r\n      qd.push(1);\r\n      more = true;\r\n    } else {\r\n\r\n      // Convert precision in number of base 10 digits to base 1e7 digits.\r\n      sd = sd / logBase + 2 | 0;\r\n      i = 0;\r\n\r\n      // divisor < 1e7\r\n      if (yL == 1) {\r\n        k = 0;\r\n        yd = yd[0];\r\n        sd++;\r\n\r\n        // k is the carry.\r\n        for (; (i < xL || k) && sd--; i++) {\r\n          t = k * base + (xd[i] || 0);\r\n          qd[i] = t / yd | 0;\r\n          k = t % yd | 0;\r\n        }\r\n\r\n        more = k || i < xL;\r\n\r\n      // divisor >= 1e7\r\n      } else {\r\n\r\n        // Normalise xd and yd so highest order digit of yd is >= base/2\r\n        k = base / (yd[0] + 1) | 0;\r\n\r\n        if (k > 1) {\r\n          yd = multiplyInteger(yd, k, base);\r\n          xd = multiplyInteger(xd, k, base);\r\n          yL = yd.length;\r\n          xL = xd.length;\r\n        }\r\n\r\n        xi = yL;\r\n        rem = xd.slice(0, yL);\r\n        remL = rem.length;\r\n\r\n        // Add zeros to make remainder as long as divisor.\r\n        for (; remL < yL;) rem[remL++] = 0;\r\n\r\n        yz = yd.slice();\r\n        yz.unshift(0);\r\n        yd0 = yd[0];\r\n\r\n        if (yd[1] >= base / 2) ++yd0;\r\n\r\n        do {\r\n          k = 0;\r\n\r\n          // Compare divisor and remainder.\r\n          cmp = compare(yd, rem, yL, remL);\r\n\r\n          // If divisor < remainder.\r\n          if (cmp < 0) {\r\n\r\n            // Calculate trial digit, k.\r\n            rem0 = rem[0];\r\n            if (yL != remL) rem0 = rem0 * base + (rem[1] || 0);\r\n\r\n            // k will be how many times the divisor goes into the current remainder.\r\n            k = rem0 / yd0 | 0;\r\n\r\n            //  Algorithm:\r\n            //  1. product = divisor * trial digit (k)\r\n            //  2. if product > remainder: product -= divisor, k--\r\n            //  3. remainder -= product\r\n            //  4. if product was < remainder at 2:\r\n            //    5. compare new remainder and divisor\r\n            //    6. If remainder > divisor: remainder -= divisor, k++\r\n\r\n            if (k > 1) {\r\n              if (k >= base) k = base - 1;\r\n\r\n              // product = divisor * trial digit.\r\n              prod = multiplyInteger(yd, k, base);\r\n              prodL = prod.length;\r\n              remL = rem.length;\r\n\r\n              // Compare product and remainder.\r\n              cmp = compare(prod, rem, prodL, remL);\r\n\r\n              // product > remainder.\r\n              if (cmp == 1) {\r\n                k--;\r\n\r\n                // Subtract divisor from product.\r\n                subtract(prod, yL < prodL ? yz : yd, prodL, base);\r\n              }\r\n            } else {\r\n\r\n              // cmp is -1.\r\n              // If k is 0, there is no need to compare yd and rem again below, so change cmp to 1\r\n              // to avoid it. If k is 1 there is a need to compare yd and rem again below.\r\n              if (k == 0) cmp = k = 1;\r\n              prod = yd.slice();\r\n            }\r\n\r\n            prodL = prod.length;\r\n            if (prodL < remL) prod.unshift(0);\r\n\r\n            // Subtract product from remainder.\r\n            subtract(rem, prod, remL, base);\r\n\r\n            // If product was < previous remainder.\r\n            if (cmp == -1) {\r\n              remL = rem.length;\r\n\r\n              // Compare divisor and new remainder.\r\n              cmp = compare(yd, rem, yL, remL);\r\n\r\n              // If divisor < new remainder, subtract divisor from remainder.\r\n              if (cmp < 1) {\r\n                k++;\r\n\r\n                // Subtract divisor from remainder.\r\n                subtract(rem, yL < remL ? yz : yd, remL, base);\r\n              }\r\n            }\r\n\r\n            remL = rem.length;\r\n          } else if (cmp === 0) {\r\n            k++;\r\n            rem = [0];\r\n          }    // if cmp === 1, k will be 0\r\n\r\n          // Add the next digit, k, to the result array.\r\n          qd[i++] = k;\r\n\r\n          // Update the remainder.\r\n          if (cmp && rem[0]) {\r\n            rem[remL++] = xd[xi] || 0;\r\n          } else {\r\n            rem = [xd[xi]];\r\n            remL = 1;\r\n          }\r\n\r\n        } while ((xi++ < xL || rem[0] !== void 0) && sd--);\r\n\r\n        more = rem[0] !== void 0;\r\n      }\r\n\r\n      // Leading zero?\r\n      if (!qd[0]) qd.shift();\r\n    }\r\n\r\n    // logBase is 1 when divide is being used for base conversion.\r\n    if (logBase == 1) {\r\n      q.e = e;\r\n      inexact = more;\r\n    } else {\r\n\r\n      // To calculate q.e, first get the number of digits of qd[0].\r\n      for (i = 1, k = qd[0]; k >= 10; k /= 10) i++;\r\n      q.e = i + e * logBase - 1;\r\n\r\n      finalise(q, dp ? pr + q.e + 1 : pr, rm, more);\r\n    }\r\n\r\n    return q;\r\n  };\r\n})();\r\n\r\n\r\n/*\r\n * Round `x` to `sd` significant digits using rounding mode `rm`.\r\n * Check for over/under-flow.\r\n */\r\n function finalise(x, sd, rm, isTruncated) {\r\n  var digits, i, j, k, rd, roundUp, w, xd, xdi,\r\n    Ctor = x.constructor;\r\n\r\n  // Don't round if sd is null or undefined.\r\n  out: if (sd != null) {\r\n    xd = x.d;\r\n\r\n    // Infinity/NaN.\r\n    if (!xd) return x;\r\n\r\n    // rd: the rounding digit, i.e. the digit after the digit that may be rounded up.\r\n    // w: the word of xd containing rd, a base 1e7 number.\r\n    // xdi: the index of w within xd.\r\n    // digits: the number of digits of w.\r\n    // i: what would be the index of rd within w if all the numbers were 7 digits long (i.e. if\r\n    // they had leading zeros)\r\n    // j: if > 0, the actual index of rd within w (if < 0, rd is a leading zero).\r\n\r\n    // Get the length of the first word of the digits array xd.\r\n    for (digits = 1, k = xd[0]; k >= 10; k /= 10) digits++;\r\n    i = sd - digits;\r\n\r\n    // Is the rounding digit in the first word of xd?\r\n    if (i < 0) {\r\n      i += LOG_BASE;\r\n      j = sd;\r\n      w = xd[xdi = 0];\r\n\r\n      // Get the rounding digit at index j of w.\r\n      rd = w / mathpow(10, digits - j - 1) % 10 | 0;\r\n    } else {\r\n      xdi = Math.ceil((i + 1) / LOG_BASE);\r\n      k = xd.length;\r\n      if (xdi >= k) {\r\n        if (isTruncated) {\r\n\r\n          // Needed by `naturalExponential`, `naturalLogarithm` and `squareRoot`.\r\n          for (; k++ <= xdi;) xd.push(0);\r\n          w = rd = 0;\r\n          digits = 1;\r\n          i %= LOG_BASE;\r\n          j = i - LOG_BASE + 1;\r\n        } else {\r\n          break out;\r\n        }\r\n      } else {\r\n        w = k = xd[xdi];\r\n\r\n        // Get the number of digits of w.\r\n        for (digits = 1; k >= 10; k /= 10) digits++;\r\n\r\n        // Get the index of rd within w.\r\n        i %= LOG_BASE;\r\n\r\n        // Get the index of rd within w, adjusted for leading zeros.\r\n        // The number of leading zeros of w is given by LOG_BASE - digits.\r\n        j = i - LOG_BASE + digits;\r\n\r\n        // Get the rounding digit at index j of w.\r\n        rd = j < 0 ? 0 : w / mathpow(10, digits - j - 1) % 10 | 0;\r\n      }\r\n    }\r\n\r\n    // Are there any non-zero digits after the rounding digit?\r\n    isTruncated = isTruncated || sd < 0 ||\r\n      xd[xdi + 1] !== void 0 || (j < 0 ? w : w % mathpow(10, digits - j - 1));\r\n\r\n    // The expression `w % mathpow(10, digits - j - 1)` returns all the digits of w to the right\r\n    // of the digit at (left-to-right) index j, e.g. if w is 908714 and j is 2, the expression\r\n    // will give 714.\r\n\r\n    roundUp = rm < 4\r\n      ? (rd || isTruncated) && (rm == 0 || rm == (x.s < 0 ? 3 : 2))\r\n      : rd > 5 || rd == 5 && (rm == 4 || isTruncated || rm == 6 &&\r\n\r\n        // Check whether the digit to the left of the rounding digit is odd.\r\n        ((i > 0 ? j > 0 ? w / mathpow(10, digits - j) : 0 : xd[xdi - 1]) % 10) & 1 ||\r\n          rm == (x.s < 0 ? 8 : 7));\r\n\r\n    if (sd < 1 || !xd[0]) {\r\n      xd.length = 0;\r\n      if (roundUp) {\r\n\r\n        // Convert sd to decimal places.\r\n        sd -= x.e + 1;\r\n\r\n        // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n        xd[0] = mathpow(10, (LOG_BASE - sd % LOG_BASE) % LOG_BASE);\r\n        x.e = -sd || 0;\r\n      } else {\r\n\r\n        // Zero.\r\n        xd[0] = x.e = 0;\r\n      }\r\n\r\n      return x;\r\n    }\r\n\r\n    // Remove excess digits.\r\n    if (i == 0) {\r\n      xd.length = xdi;\r\n      k = 1;\r\n      xdi--;\r\n    } else {\r\n      xd.length = xdi + 1;\r\n      k = mathpow(10, LOG_BASE - i);\r\n\r\n      // E.g. 56700 becomes 56000 if 7 is the rounding digit.\r\n      // j > 0 means i > number of leading zeros of w.\r\n      xd[xdi] = j > 0 ? (w / mathpow(10, digits - j) % mathpow(10, j) | 0) * k : 0;\r\n    }\r\n\r\n    if (roundUp) {\r\n      for (;;) {\r\n\r\n        // Is the digit to be rounded up in the first word of xd?\r\n        if (xdi == 0) {\r\n\r\n          // i will be the length of xd[0] before k is added.\r\n          for (i = 1, j = xd[0]; j >= 10; j /= 10) i++;\r\n          j = xd[0] += k;\r\n          for (k = 1; j >= 10; j /= 10) k++;\r\n\r\n          // if i != k the length has increased.\r\n          if (i != k) {\r\n            x.e++;\r\n            if (xd[0] == BASE) xd[0] = 1;\r\n          }\r\n\r\n          break;\r\n        } else {\r\n          xd[xdi] += k;\r\n          if (xd[xdi] != BASE) break;\r\n          xd[xdi--] = 0;\r\n          k = 1;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (i = xd.length; xd[--i] === 0;) xd.pop();\r\n  }\r\n\r\n  if (external) {\r\n\r\n    // Overflow?\r\n    if (x.e > Ctor.maxE) {\r\n\r\n      // Infinity.\r\n      x.d = null;\r\n      x.e = NaN;\r\n\r\n    // Underflow?\r\n    } else if (x.e < Ctor.minE) {\r\n\r\n      // Zero.\r\n      x.e = 0;\r\n      x.d = [0];\r\n      // Ctor.underflow = true;\r\n    } // else Ctor.underflow = false;\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\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(±0)        = 1\r\n *\r\n *  exp(x) is non-terminating for any finite, non-zero x.\r\n *\r\n *  The result will always be correctly rounded.\r\n *\r\n */\r\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// ±Infinity, 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(±0, -0)               = ±pi\r\n * atan2(±0, +0)               = ±0\r\n * atan2(±0, -x)               = ±pi for x > 0\r\n * atan2(±0, x)                = ±0 for x > 0\r\n * atan2(-y, ±0)               = -pi/2 for y > 0\r\n * atan2(y, ±0)                = pi/2 for y > 0\r\n * atan2(±y, -Infinity)        = ±pi for finite y > 0\r\n * atan2(±y, +Infinity)        = ±0 for finite y > 0\r\n * atan2(±Infinity, x)         = ±pi/2 for finite x\r\n * atan2(±Infinity, -Infinity) = ±3*pi/4\r\n * atan2(±Infinity, +Infinity) = ±pi/4\r\n * atan2(NaN, x) = NaN\r\n * atan2(y, NaN) = NaN\r\n *\r\n */\r\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 ±Infinity\r\n  } else if (!y.d && !x.d) {\r\n    r = getPi(this, wpr, 1).times(x.s > 0 ? 0.25 : 0.75);\r\n    r.s = y.s;\r\n\r\n  // x is ±Infinity or y is ±0\r\n  } else if (!x.d || y.isZero()) {\r\n    r = x.s < 0 ? getPi(this, pr, rm) : new this(0);\r\n    r.s = y.s;\r\n\r\n  // y is ±Infinity or x is ±0\r\n  } else if (!y.d || x.isZero()) {\r\n    r = getPi(this, wpr, 1).times(0.5);\r\n    r.s = y.s;\r\n\r\n  // Both non-zero and finite\r\n  } else if (x.s < 0) {\r\n    this.precision = wpr;\r\n    this.rounding = 1;\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n    x = getPi(this, wpr, 1);\r\n    this.precision = pr;\r\n    this.rounding = rm;\r\n    r = y.s < 0 ? r.minus(x) : r.plus(x);\r\n  } else {\r\n    r = this.atan(divide(y, x, wpr, 1));\r\n  }\r\n\r\n  return r;\r\n}\r\n\r\n\r\n/*\r\n * Return a new Decimal whose value is the cube root of `x`, rounded to `precision` significant\r\n * digits using rounding mode `rounding`.\r\n *\r\n * x {number|string|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 (-¼π ≤ x ≤ ¼π).\n *\n * @param {number} x\n * @returns {number} cos(x) - 1\n */\nconst cosm1 = function (x) {\n\n  const b = Math.PI / 4;\n  if (-b > x || x > b) {\n    return Math.cos(x) - 1.0;\n  }\n\n  /* Calculate horner form of polynomial of taylor series in Q\n  let fac = 1, alt = 1, pol = {};\n  for (let i = 0; i <= 16; i++) {\n    fac*= i || 1;\n    if (i % 2 == 0) {\n      pol[i] = new Fraction(1, alt * fac);\n      alt = -alt;\n    }\n  }\n  console.log(new Polynomial(pol).toHorner()); // (((((((1/20922789888000x^2-1/87178291200)x^2+1/479001600)x^2-1/3628800)x^2+1/40320)x^2-1/720)x^2+1/24)x^2-1/2)x^2+1\n  */\n\n  const xx = x * x;\n  return xx * (\n    xx * (\n      xx * (\n        xx * (\n          xx * (\n            xx * (\n              xx * (\n                xx / 20922789888000\n                - 1 / 87178291200)\n              + 1 / 479001600)\n            - 1 / 3628800)\n          + 1 / 40320)\n        - 1 / 720)\n      + 1 / 24)\n    - 1 / 2);\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 ∈ [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 coth\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(c) = log(c + sqrt(c^2 + 1))\n\n    let tmp = this['im'];\n    this['im'] = -this['re'];\n    this['re'] = tmp;\n    const res = this['asin']();\n\n    this['re'] = -this['im'];\n    this['im'] = tmp;\n    tmp = res['re'];\n\n    res['re'] = -res['im'];\n    res['im'] = tmp;\n    return res;\n  },\n\n  /**\n   * Calculate the complex acosh\n   *\n   * @returns {Complex}\n   */\n  'acosh': function () {\n\n    // acosh(c) = log(c + sqrt(c^2 - 1))\n\n    const res = this['acos']();\n    if (res['im'] <= 0) {\n      const tmp = res['re'];\n      res['re'] = -res['im'];\n      res['im'] = tmp;\n    } else {\n      const tmp = res['im'];\n      res['im'] = -res['re'];\n      res['re'] = tmp;\n    }\n    return res;\n  },\n\n  /**\n   * Calculate the complex atanh\n   *\n   * @returns {Complex}\n   */\n  'atanh': function () {\n\n    // atanh(c) = log((1+c) / (1-c)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    const noIM = a > 1 && b === 0;\n    const oneMinus = 1 - a;\n    const onePlus = 1 + a;\n    const d = oneMinus * oneMinus + b * b;\n\n    const x = (d !== 0)\n      ? new Complex(\n        (onePlus * oneMinus - b * b) / d,\n        (b * oneMinus + onePlus * b) / d)\n      : new Complex(\n        (a !== -1) ? (a / 0) : 0,\n        (b !== 0) ? (b / 0) : 0);\n\n    const temp = x['re'];\n    x['re'] = logHypot(x['re'], x['im']) / 2;\n    x['im'] = Math.atan2(x['im'], temp) / 2;\n    if (noIM) {\n      x['im'] = -x['im'];\n    }\n    return x;\n  },\n\n  /**\n   * Calculate the complex acoth\n   *\n   * @returns {Complex}\n   */\n  'acoth': function () {\n\n    // acoth(c) = log((c+1) / (c-1)) / 2\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (a === 0 && b === 0) {\n      return new Complex(0, Math.PI / 2);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).atanh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).atanh();\n  },\n\n  /**\n   * Calculate the complex acsch\n   *\n   * @returns {Complex}\n   */\n  'acsch': function () {\n\n    // acsch(c) = log((1+sqrt(1+c^2))/c)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (b === 0) {\n\n      return new Complex(\n        (a !== 0)\n          ? Math.log(a + Math.sqrt(a * a + 1))\n          : Infinity, 0);\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).asinh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).asinh();\n  },\n\n  /**\n   * Calculate the complex asech\n   *\n   * @returns {Complex}\n   */\n  'asech': function () {\n\n    // asech(c) = log((1+sqrt(1-c^2))/c)\n\n    const a = this['re'];\n    const b = this['im'];\n\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    const d = a * a + b * b;\n    return (d !== 0)\n      ? new Complex(\n        a / d,\n        -b / d).acosh()\n      : new Complex(\n        (a !== 0) ? a / 0 : 0,\n        (b !== 0) ? -b / 0 : 0).acosh();\n  },\n\n  /**\n   * Calculate the complex inverse 1/z\n   *\n   * @returns {Complex}\n   */\n  'inverse': function () {\n\n    // 1 / 0 = Infinity and 1 / Infinity = 0\n    if (this['isZero']()) {\n      return Complex['INFINITY'];\n    }\n\n    if (this['isInfinite']()) {\n      return Complex['ZERO'];\n    }\n\n    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_FIVE = BigInt(5);\nconst C_TEN = BigInt(10);\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 trunc(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\nfunction factorize(num) {\n\n  const factors = {};\n\n  let n = num;\n  let i = C_TWO;\n  let s = C_FIVE - C_ONE;\n\n  while (s <= n) {\n\n    while (n % i === C_ZERO) {\n      n /= i;\n      factors[i] = (factors[i] || C_ZERO) + C_ONE;\n    }\n    s += C_ONE + C_TWO * i++;\n  }\n\n  if (n !== num) {\n    if (n > 1)\n      factors[n] = (factors[n] || C_ZERO) + C_ONE;\n  } else {\n    factors[num] = (factors[num] || C_ZERO) + C_ONE;\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\nvar DivisionByZero = function () { return new Error(\"Division by Zero\"); };\nvar InvalidParameter = function () { return new Error(\"Invalid argument\"); };\nvar 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 ≤ 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    // ⇔ (-1)^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (cos(pi) + i*sin(pi))^(c/d) * (a/b)^(c/d) = x\n    // ⇔ (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 = {};\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(trunc(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(trunc(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) = trunc(n / d) + (n % d) / d >= 0.5 ? 1 : 0\n                   = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    s < 0:\n      round(n / d) =-trunc(n / d) - (n % d) / d > 0.5 ? 1 : 0\n                   =-trunc(n / d) - 2(n % d) > d ? 1 : 0\n\n    =>:\n\n    round(s * n / d) = s * trunc(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(trunc(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 ≤ a/b < (k+1) * x/y\n    ⇔ k ≤ a/b / (x/y) < (k+1)\n    ⇔ k = floor(a/b * y/x)\n    ⇔ 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) = trunc(n / d) + 2(n % d) >= d ? 1 : 0\n    let k = trunc(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    return !(!(P[\"n\"] * this[\"d\"]) || ((this[\"n\"] * P[\"d\"]) % (P[\"n\"] * this[\"d\"])));\n  },\n\n  /**\n   * Returns a decimal representation of the fraction\n   *\n   * Ex: new Fraction(\"100.'91823'\").valueOf() => 100.91823918239183\n   **/\n  'valueOf': function () {\n    // Best we can do so far\n    return Number(this[\"s\"] * this[\"n\"]) / Number(this[\"d\"]);\n  },\n\n  /**\n   * Creates a string representation of a fraction with all digits\n   *\n   * Ex: new Fraction(\"100.'91823'\").toString() => \"100.(91823)\"\n   **/\n  'toString': function (dec) {\n\n    let N = this[\"n\"];\n    let D = this[\"d\"];\n\n    dec = dec || 15; // 15 = decimal places when no repetition\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 += trunc(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 += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \"(\";\n      for (let i = cycLen; i--;) {\n        str += trunc(N / D);\n        N %= D;\n        N *= C_TEN;\n      }\n      str += \")\";\n    } else {\n      for (let i = dec; N && i--;) {\n        str += trunc(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) {\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      let whole = trunc(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) {\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      let whole = trunc(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    let res = [];\n\n    do {\n      res.push(trunc(a / b));\n      let t = a % b;\n      a = b;\n      b = t;\n    } while (a !== C_ONE);\n\n    return res;\n  },\n\n  \"simplify\": function (eps) {\n\n    const ieps = BigInt(1 / (eps || 0.001) | 0);\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 { 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=false] 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) {\n  var isUnary = arguments.length > 3 && arguments[3] !== undefined ? arguments[3] : false;\n  if (typed.isTypedFunction(callback)) {\n    var numberOfArguments;\n    if (isUnary) {\n      numberOfArguments = 1;\n    } else {\n      var firstIndex = (array.isMatrix ? array.size() : arraySize(array)).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'];\nexport var createDenseMatrixClass = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    Matrix\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 = 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 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\n    };\n    function getSubmatrixRecursive(data) {\n      var depth = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : 0;\n      var ranges = index.dimension(depth);\n      size[depth] = ranges.size()[0];\n      if (depth < maxDepth) {\n        return ranges.map(rangeIndex => {\n          validateIndex(rangeIndex, data.length);\n          return getSubmatrixRecursive(data[rangeIndex], depth + 1);\n        }).valueOf();\n      } else {\n        return ranges.map(rangeIndex => {\n          validateIndex(rangeIndex, data.length);\n          return data[rangeIndex];\n        }).valueOf();\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 sSize;\n    if (isMatrix(submatrix)) {\n      sSize = submatrix.size();\n      submatrix = submatrix.valueOf();\n    } else {\n      sSize = arraySize(submatrix);\n    }\n    if (isScalar) {\n      // set a scalar\n\n      // check whether submatrix is a scalar\n      if (sSize.length !== 0) {\n        throw new TypeError('Scalar expected');\n      }\n      matrix.set(index.min(), submatrix, defaultValue);\n    } else {\n      // set a submatrix\n\n      // broadcast submatrix\n      if (!deepStrictEqual(sSize, iSize)) {\n        try {\n          if (sSize.length === 0) {\n            submatrix = broadcastTo([submatrix], iSize);\n          } else {\n            submatrix = broadcastTo(submatrix, iSize);\n          }\n          sSize = arraySize(submatrix);\n        } catch (_unused) {}\n      }\n\n      // validate dimensions\n      if (iSize.length < matrix._size.length) {\n        throw new DimensionError(iSize.length, matrix._size.length, '<');\n      }\n      if (sSize.length < iSize.length) {\n        // calculate number of missing outer dimensions\n        var i = 0;\n        var outer = 0;\n        while (iSize[i] === 1 && sSize[i] === 1) {\n          i++;\n        }\n        while (iSize[i] === 1) {\n          outer++;\n          i++;\n        }\n\n        // unsqueeze both outer and inner dimensions\n        submatrix = 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      // 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      if (depth < maxDepth) {\n        range.forEach((rangeIndex, i) => {\n          validateIndex(rangeIndex, data.length);\n          setSubmatrixRecursive(data[rangeIndex], submatrix[i[0]], depth + 1);\n        });\n      } else {\n        range.forEach((rangeIndex, i) => {\n          validateIndex(rangeIndex, data.length);\n          data[rangeIndex] = submatrix[i[0]];\n        });\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 { 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 { 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;","/** @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}","/* 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 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 (!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 { 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 { 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});","/**\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 { 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 { 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 implements\n   * a [Compressed Column Storage](https://en.wikipedia.org/wiki/Sparse_matrix#Compressed_sparse_column_(CSC_or_CCS))\n   * format for two-dimensional sparse matrices.\n   * @class SparseMatrix\n   */\n  function SparseMatrix(data, datatype) {\n    if (!(this instanceof SparseMatrix)) {\n      throw new SyntaxError('Constructor must be called with the new operator');\n    }\n    if (datatype && !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    matrix._ptr.push(matrix._index.length);\n    // size\n    matrix._size = [rows, columns];\n  }\n  SparseMatrix.prototype = new Matrix();\n\n  /**\n   * Create a new SparseMatrix\n   */\n  SparseMatrix.prototype.createSparseMatrix = function (data, datatype) {\n    return new SparseMatrix(data, datatype);\n  };\n\n  /**\n   * Attach type information\n   */\n  Object.defineProperty(SparseMatrix, 'name', {\n    value: 'SparseMatrix'\n  });\n  SparseMatrix.prototype.constructor = SparseMatrix;\n  SparseMatrix.prototype.type = 'SparseMatrix';\n  SparseMatrix.prototype.isSparseMatrix = true;\n\n  /**\n   * Get the matrix type\n   *\n   * Usage:\n   *    const matrixType = matrix.getDataType()  // retrieves the matrix type\n   *\n   * @memberOf SparseMatrix\n   * @return {string}   type information; if multiple types are found from the Matrix, it will return \"mixed\"\n   */\n  SparseMatrix.prototype.getDataType = function () {\n    return 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    rows.forEach(function (i, r) {\n      // update permutation vector\n      pv[i] = r[0];\n      // mark i in workspace\n      w[i] = true;\n    });\n\n    // result matrix arrays\n    var values = mvalues ? [] : undefined;\n    var index = [];\n    var ptr = [];\n\n    // loop columns in result matrix\n    columns.forEach(function (j) {\n      // update ptr\n      ptr.push(index.length);\n      // loop values in column j\n      for (k = mptr[j], kk = mptr[j + 1]; k < kk; k++) {\n        // row\n        i = mindex[k];\n        // check row is in result matrix\n        if (w[i] === true) {\n          // push index\n          index.push(pv[i]);\n          // check we need to process values\n          if (values) {\n            values.push(mvalues[k]);\n          }\n        }\n      }\n    });\n    // update ptr\n    ptr.push(index.length);\n\n    // return matrix\n    return new SparseMatrix({\n      values,\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        range.forEach(function (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        firstDimensionRange.forEach(function (firstDataIndex, firstSubIndex) {\n          validateIndex(firstDataIndex);\n          secondDimensionRange.forEach(function (secondDataIndex, secondSubIndex) {\n            validateIndex(secondDataIndex);\n            matrix.set([firstDataIndex, secondDataIndex], submatrix[firstSubIndex[0]][secondSubIndex[0]], defaultValue);\n          });\n        });\n      }\n    }\n    return matrix;\n  }\n\n  /**\n   * Get a single element from the matrix.\n   * @memberof SparseMatrix\n   * @param {number[]} index   Zero-based index\n   * @return {*} value\n   */\n  SparseMatrix.prototype.get = function (index) {\n    if (!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 = '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 = '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   * @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 (!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   * @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';\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 { 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 { 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';\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   *          ┌  f(Sij, b)  ; S(i,j) !== 0\n   * C(i,j) = ┤\n   *          └  0          ; otherwise\n   *\n   *\n   * @param {Matrix}   s                 The SparseMatrix instance (S)\n   * @param {Scalar}   b                 The Scalar value\n   * @param {Function} callback          The f(Aij,b) operation to invoke\n   * @param {boolean}  inverse           A true value indicates callback should be invoked f(b,Sij)\n   *\n   * @return {Matrix}                    SparseMatrix (C)\n   *\n   * https://github.com/josdejong/mathjs/pull/346#issuecomment-97626813\n   */\n  return function matAlgo11xS0s(s, b, callback, inverse) {\n    // sparse matrix arrays\n    var avalues = s._values;\n    var aindex = s._index;\n    var aptr = s._ptr;\n    var asize = s._size;\n    var adt = s._datatype;\n\n    // sparse matrix cannot be a Pattern matrix\n    if (!avalues) {\n      throw new Error('Cannot perform operation on Pattern Sparse Matrix and Scalar value');\n    }\n\n    // rows & columns\n    var rows = asize[0];\n    var columns = asize[1];\n\n    // datatype\n    var dt;\n    // equal signature to use\n    var eq = equalScalar;\n    // zero value\n    var zero = 0;\n    // callback signature to use\n    var cf = callback;\n\n    // process data types\n    if (typeof adt === 'string') {\n      // datatype\n      dt = adt;\n      // find signature that matches (dt, dt)\n      eq = typed.find(equalScalar, [dt, dt]);\n      // convert 0 to the same datatype\n      zero = typed.convert(0, dt);\n      // convert b to the same datatype\n      b = typed.convert(b, dt);\n      // callback\n      cf = typed.find(callback, [dt, dt]);\n    }\n\n    // result arrays\n    var cvalues = [];\n    var cindex = [];\n    var cptr = [];\n\n    // loop columns\n    for (var j = 0; j < columns; j++) {\n      // initialize ptr\n      cptr[j] = cindex.length;\n      // values in j\n      for (var k0 = aptr[j], k1 = aptr[j + 1], k = k0; k < k1; k++) {\n        // row\n        var i = aindex[k];\n        // invoke callback\n        var v = inverse ? cf(b, avalues[k]) : cf(avalues[k], b);\n        // check value is zero\n        if (!eq(v, zero)) {\n          // push index & value\n          cindex.push(i);\n          cvalues.push(v);\n        }\n      }\n    }\n    // update ptr\n    cptr[columns] = cindex.length;\n\n    // return sparse matrix\n    return s.createSparseMatrix({\n      values: cvalues,\n      index: cindex,\n      ptr: cptr,\n      size: [rows, columns],\n      datatype: dt\n    });\n  };\n});","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 { 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 { 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 { 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});","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 { arraySize } from '../../utils/array.js';\nimport { factory } from '../../utils/factory.js';\nimport { noMatrix } from '../../utils/noop.js';\nvar name = 'size';\nvar dependencies = ['typed', 'config', '?matrix'];\nexport var createSize = /* #__PURE__ */factory(name, dependencies, _ref => {\n  var {\n    typed,\n    config,\n    matrix\n  } = _ref;\n  /**\n   * Calculate the size of a matrix or scalar.\n   *\n   * Syntax:\n   *\n   *     math.size(x)\n   *\n   * Examples:\n   *\n   *     math.size(2.3)                       // returns []\n   *     math.size('hello world')             // returns [11]\n   *\n   *     const A = [[1, 2, 3], [4, 5, 6]]\n   *     math.size(A)                         // returns [2, 3]\n   *     math.size(math.range(1,6).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 | Matrix} A vector with size of `x`.\n   */\n  return typed(name, {\n    Matrix: function Matrix(x) {\n      return x.create(x.size(), 'number');\n    },\n    Array: arraySize,\n    string: function string(x) {\n      return config.matrix === 'Array' ? [x.length] : matrix([x.length], 'dense', 'number');\n    },\n    'number | Complex | BigNumber | Unit | boolean | null': function number__Complex__BigNumber__Unit__boolean__null(x) {\n      // scalar\n      return config.matrix === 'Array' ? [] : matrix ? matrix([], 'dense', 'number') : noMatrix();\n    }\n  });\n});","import { isComparable } from '../utils';\nexport var DFSOperation;\n(function (DFSOperation) {\n    DFSOperation[DFSOperation[\"VISIT\"] = 0] = \"VISIT\";\n    DFSOperation[DFSOperation[\"PROCESS\"] = 1] = \"PROCESS\";\n})(DFSOperation || (DFSOperation = {}));\nexport class Range {\n    low;\n    high;\n    includeLow;\n    includeHigh;\n    constructor(low, high, includeLow = true, includeHigh = true) {\n        this.low = low;\n        this.high = high;\n        this.includeLow = includeLow;\n        this.includeHigh = includeHigh;\n        if (!(isComparable(low) && isComparable(high)))\n            throw new RangeError('low or high is not comparable');\n        if (low > high)\n            throw new RangeError('low must be less than or equal to high');\n    }\n    // Determine whether a key is within the range\n    isInRange(key, comparator) {\n        const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;\n        const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;\n        return lowCheck && highCheck;\n    }\n}\n//# sourceMappingURL=index.js.map","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   * @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 { 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\n  // TODO remove this once #1771 is fixed\n  function _size(x) {\n    return isMatrix(x) ? x.size() : size(x);\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 { 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});","/**\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, createIsInteger, createIsNegative, createIsPositive, createIsZero, createLOG2E, createLgamma, createLog10, createLog2, createMap, createMultiplyScalar, createNot, createNumber, createOct, createPickRandom, createPrint, createRandom, createRe, createSec, createSign, createSin, createSparseMatrixClass, createSplitUnit, createSquare, createString, createSubtractScalar, createTan, createToBest, createTypeOf, createAcosh, createAcsch, createAsec, createBignumber, createCombinationsWithRep, createCosh, createCsch, createIsNaN, createIsPrime, createMapSlices, createMatrix, createMatrixFromFunction, createOnes, createRandomInt, createReshape, createSech, createSinh, createSparse, createSqrt, createSqueeze, createTanh, createTranspose, createXgcd, createZeros, createAcoth, createAsin, createBin, createConcat, createCoth, createCtranspose, createDiag, createDotMultiply, createEqual, createFraction, createIdentity, createIsNumeric, createKron, createLargerEq, createLeftShift, createMode, createNthRoot, createNumeric, createProd, createResize, createRightArithShift, createRound, createSize, createSmaller, createTo, createUnaryMinus, createUnequal, createXor, createAdd, createAtan2, createBitAnd, createBitOr, createBitXor, createCbrt, createCompare, createCompareText, createCount, createDeepEqual, createDivideScalar, createDotDivide, createEqualText, createFloor, createGcd, createHasNumericValue, createHypot, createImmutableDenseMatrixClass, createIndexClass, createLarger, createLog, createLsolve, createMatrixFromColumns, createMax, createMin, createMod, createNthRoots, createOr, createPartitionSelect, createQr, createRightLogShift, createSmallerEq, createSubset, createSubtract, createTrace, createUsolve, createCatalan, createCompareNatural, createComposition, createDiff, createDistance, createDot, createFibonacciHeapClass, createIndex, createInvmod, createLcm, createLog1p, createLsolveAll, createMatrixFromRows, createMultiply, createRange, createRow, createSetCartesian, createSetDistinct, createSetIsSubset, createSetPowerset, createSlu, createSort, createUnaryPlus, createUsolveAll, createZpk2tf, createAnd, createCeil, createColumn, createCross, createDet, createFix, createInv, createPinv, createPow, createSetDifference, createSetMultiplicity, createSetSymDifference, createSpaClass, createSqrtm, createSum, createUnitClass, createVacuumImpedance, createWienDisplacement, createAtomicMass, createBohrMagneton, createBoltzmann, createConductanceQuantum, createCoulomb, createCreateUnit, createDeuteronMass, createDotPow, createElectricConstant, createElementaryCharge, createExpm, createFaraday, createFft, createGamma, createGravitationConstant, createHartreeEnergy, createIfft, createInverseConductanceQuantum, createKlitzing, createLoschmidt, createMagneticConstant, createMolarMass, createMolarPlanckConstant, createNeutronMass, createNuclearMagneton, createPlanckCharge, createPlanckLength, createPlanckTemperature, createProtonMass, createQuantumOfCirculation, createReducedPlanckConstant, createRydberg, createSecondRadiation, createSetSize, createSpeedOfLight, createStefanBoltzmann, createThomsonCrossSection, createAvogadro, createBohrRadius, createCoulombConstant, createDivide, createElectronMass, createFactorial, createFirstRadiation, createGravity, createIntersect, createLup, createMagneticFluxQuantum, createMolarMassC12, createMultinomial, createPermutations, createPlanckMass, createPolynomialRoot, createSetIntersect, createSolveODE, createStirlingS2, createUnitFunction, createBellNumbers, createCumSum, createEigs, createFermiCoupling, createGasConstant, createKldivergence, createLusolve, createMean, createMolarVolume, createPlanckConstant, createQuantileSeq, createSetUnion, createVariance, createClassicalElectronRadius, createMedian, createCorr, createFreqz, createMad, createStd, createZeta, createNorm, createRotationMatrix, createPlanckTime, createSchur, createRotate, 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});\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 isInteger = /* #__PURE__ */createIsInteger({\n  typed\n});\nexport var isNegative = /* #__PURE__ */createIsNegative({\n  config,\n  typed\n});\nexport var isPositive = /* #__PURE__ */createIsPositive({\n  config,\n  typed\n});\nexport var isZero = /* #__PURE__ */createIsZero({\n  equalScalar,\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 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 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 isNaN = /* #__PURE__ */createIsNaN({\n  typed\n});\nexport var isPrime = /* #__PURE__ */createIsPrime({\n  typed\n});\nexport var mapSlices = /* #__PURE__ */createMapSlices({\n  isInteger,\n  typed\n});\nexport var apply = mapSlices;\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 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 reshape = /* #__PURE__ */createReshape({\n  isInteger,\n  matrix,\n  typed\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 concat = /* #__PURE__ */createConcat({\n  isInteger,\n  matrix,\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 dotMultiply = /* #__PURE__ */createDotMultiply({\n  concat,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var equal = /* #__PURE__ */createEqual({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\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 isNumeric = /* #__PURE__ */createIsNumeric({\n  typed\n});\nexport var kron = /* #__PURE__ */createKron({\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var largerEq = /* #__PURE__ */createLargerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\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 mode = /* #__PURE__ */createMode({\n  isNaN,\n  isNumeric,\n  typed\n});\nexport var nthRoot = /* #__PURE__ */createNthRoot({\n  BigNumber,\n  concat,\n  equalScalar,\n  matrix,\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 resize = /* #__PURE__ */createResize({\n  config,\n  matrix\n});\nexport var rightArithShift = /* #__PURE__ */createRightArithShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var round = /* #__PURE__ */createRound({\n  BigNumber,\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var size = /* #__PURE__ */createSize({\n  matrix,\n  config,\n  typed\n});\nexport var smaller = /* #__PURE__ */createSmaller({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var to = /* #__PURE__ */createTo({\n  concat,\n  matrix,\n  typed\n});\nexport var unaryMinus = /* #__PURE__ */createUnaryMinus({\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 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 cbrt = /* #__PURE__ */createCbrt({\n  BigNumber,\n  Complex,\n  Fraction,\n  config,\n  isNegative,\n  matrix,\n  typed,\n  unaryMinus\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 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 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 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 hasNumericValue = /* #__PURE__ */createHasNumericValue({\n  isNumeric,\n  typed\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 larger = /* #__PURE__ */createLarger({\n  DenseMatrix,\n  SparseMatrix,\n  bignumber,\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 lsolve = /* #__PURE__ */createLsolve({\n  DenseMatrix,\n  divideScalar,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  subtractScalar,\n  typed\n});\nexport var matrixFromColumns = /* #__PURE__ */createMatrixFromColumns({\n  flatten,\n  matrix,\n  size,\n  typed\n});\nexport var max = /* #__PURE__ */createMax({\n  config,\n  isNaN,\n  larger,\n  numeric,\n  typed\n});\nexport var min = /* #__PURE__ */createMin({\n  config,\n  isNaN,\n  numeric,\n  smaller,\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 nthRoots = /* #__PURE__ */createNthRoots({\n  Complex,\n  config,\n  divideScalar,\n  typed\n});\nexport var or = /* #__PURE__ */createOr({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var partitionSelect = /* #__PURE__ */createPartitionSelect({\n  compare,\n  isNaN,\n  isNumeric,\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 rightLogShift = /* #__PURE__ */createRightLogShift({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  typed,\n  zeros\n});\nexport var smallerEq = /* #__PURE__ */createSmallerEq({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  config,\n  matrix,\n  typed\n});\nexport var subset = /* #__PURE__ */createSubset({\n  add,\n  matrix,\n  typed,\n  zeros\n});\nexport var subtract = /* #__PURE__ */createSubtract({\n  DenseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  subtractScalar,\n  typed,\n  unaryMinus\n});\nexport var trace = /* #__PURE__ */createTrace({\n  add,\n  matrix,\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 catalan = /* #__PURE__ */createCatalan({\n  addScalar,\n  combinations,\n  divideScalar,\n  isInteger,\n  isNegative,\n  multiplyScalar,\n  typed\n});\nexport var compareNatural = /* #__PURE__ */createCompareNatural({\n  compare,\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 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 dot = /* #__PURE__ */createDot({\n  addScalar,\n  conj,\n  multiplyScalar,\n  size,\n  typed\n});\nexport var FibonacciHeap = /* #__PURE__ */createFibonacciHeapClass({\n  larger,\n  smaller\n});\nexport var index = /* #__PURE__ */createIndex({\n  Index,\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 lcm = /* #__PURE__ */createLcm({\n  concat,\n  equalScalar,\n  matrix,\n  typed\n});\nexport var log1p = /* #__PURE__ */createLog1p({\n  Complex,\n  config,\n  divideScalar,\n  log,\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 multiply = /* #__PURE__ */createMultiply({\n  addScalar,\n  dot,\n  equalScalar,\n  matrix,\n  multiplyScalar,\n  typed\n});\nexport var range = /* #__PURE__ */createRange({\n  bignumber,\n  matrix,\n  add,\n  config,\n  isPositive,\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 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 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 sort = /* #__PURE__ */createSort({\n  compare,\n  compareNatural,\n  matrix,\n  typed\n});\nexport var unaryPlus = /* #__PURE__ */createUnaryPlus({\n  config,\n  numeric,\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 and = /* #__PURE__ */createAnd({\n  concat,\n  equalScalar,\n  matrix,\n  not,\n  typed,\n  zeros\n});\nexport var ceil = /* #__PURE__ */createCeil({\n  DenseMatrix,\n  config,\n  equalScalar,\n  matrix,\n  round,\n  typed,\n  zeros\n});\nexport var column = /* #__PURE__ */createColumn({\n  Index,\n  matrix,\n  range,\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 fix = /* #__PURE__ */createFix({\n  Complex,\n  DenseMatrix,\n  ceil,\n  equalScalar,\n  floor,\n  matrix,\n  typed,\n  zeros\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 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 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 Spa = /* #__PURE__ */createSpaClass({\n  FibonacciHeap,\n  addScalar,\n  equalScalar\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 sum = /* #__PURE__ */createSum({\n  add,\n  config,\n  numeric,\n  typed\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  toBest\n});\nexport var vacuumImpedance = /* #__PURE__ */createVacuumImpedance({\n  BigNumber,\n  Unit,\n  config\n});\nexport var wienDisplacement = /* #__PURE__ */createWienDisplacement({\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 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 dotPow = /* #__PURE__ */createDotPow({\n  DenseMatrix,\n  SparseMatrix,\n  concat,\n  equalScalar,\n  matrix,\n  pow,\n  typed\n});\nexport var electricConstant = /* #__PURE__ */createElectricConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var elementaryCharge = /* #__PURE__ */createElementaryCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var expm = /* #__PURE__ */createExpm({\n  abs,\n  add,\n  identity,\n  inv,\n  multiply,\n  typed\n});\nexport var faraday = /* #__PURE__ */createFaraday({\n  BigNumber,\n  Unit,\n  config\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 gamma = /* #__PURE__ */createGamma({\n  BigNumber,\n  Complex,\n  config,\n  multiplyScalar,\n  pow,\n  typed\n});\nexport var gravitationConstant = /* #__PURE__ */createGravitationConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var hartreeEnergy = /* #__PURE__ */createHartreeEnergy({\n  BigNumber,\n  Unit,\n  config\n});\nexport var ifft = /* #__PURE__ */createIfft({\n  conj,\n  dotDivide,\n  fft,\n  typed\n});\nexport var inverseConductanceQuantum = /* #__PURE__ */createInverseConductanceQuantum({\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 magneticConstant = /* #__PURE__ */createMagneticConstant({\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 neutronMass = /* #__PURE__ */createNeutronMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var nuclearMagneton = /* #__PURE__ */createNuclearMagneton({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckCharge = /* #__PURE__ */createPlanckCharge({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckLength = /* #__PURE__ */createPlanckLength({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckTemperature = /* #__PURE__ */createPlanckTemperature({\n  BigNumber,\n  Unit,\n  config\n});\nexport var protonMass = /* #__PURE__ */createProtonMass({\n  BigNumber,\n  Unit,\n  config\n});\nexport var quantumOfCirculation = /* #__PURE__ */createQuantumOfCirculation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var reducedPlanckConstant = /* #__PURE__ */createReducedPlanckConstant({\n  BigNumber,\n  Unit,\n  config\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 avogadro = /* #__PURE__ */createAvogadro({\n  BigNumber,\n  Unit,\n  config\n});\nexport var bohrRadius = /* #__PURE__ */createBohrRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var coulombConstant = /* #__PURE__ */createCoulombConstant({\n  BigNumber,\n  Unit,\n  config\n});\nexport var divide = /* #__PURE__ */createDivide({\n  divideScalar,\n  equalScalar,\n  inv,\n  matrix,\n  multiply,\n  typed\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 firstRadiation = /* #__PURE__ */createFirstRadiation({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gravity = /* #__PURE__ */createGravity({\n  BigNumber,\n  Unit,\n  config\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 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 magneticFluxQuantum = /* #__PURE__ */createMagneticFluxQuantum({\n  BigNumber,\n  Unit,\n  config\n});\nexport var molarMassC12 = /* #__PURE__ */createMolarMassC12({\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 permutations = /* #__PURE__ */createPermutations({\n  factorial,\n  typed\n});\nexport var planckMass = /* #__PURE__ */createPlanckMass({\n  BigNumber,\n  Unit,\n  config\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 setIntersect = /* #__PURE__ */createSetIntersect({\n  DenseMatrix,\n  Index,\n  compareNatural,\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 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 cumsum = /* #__PURE__ */createCumSum({\n  add,\n  typed,\n  unaryPlus\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 fermiCoupling = /* #__PURE__ */createFermiCoupling({\n  BigNumber,\n  Unit,\n  config\n});\nexport var gasConstant = /* #__PURE__ */createGasConstant({\n  BigNumber,\n  Unit,\n  config\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 molarVolume = /* #__PURE__ */createMolarVolume({\n  BigNumber,\n  Unit,\n  config\n});\nexport var planckConstant = /* #__PURE__ */createPlanckConstant({\n  BigNumber,\n  Unit,\n  config\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 setUnion = /* #__PURE__ */createSetUnion({\n  Index,\n  concat,\n  setIntersect,\n  setSymDifference,\n  size,\n  subset,\n  typed\n});\nexport var variance = /* #__PURE__ */createVariance({\n  add,\n  divide,\n  isNaN,\n  mapSlices,\n  multiply,\n  subtract,\n  typed\n});\nexport var classicalElectronRadius = /* #__PURE__ */createClassicalElectronRadius({\n  BigNumber,\n  Unit,\n  config\n});\nexport var median = /* #__PURE__ */createMedian({\n  add,\n  compare,\n  divide,\n  partitionSelect,\n  typed\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 freqz = /* #__PURE__ */createFreqz({\n  Complex,\n  add,\n  divide,\n  matrix,\n  multiply,\n  typed\n});\nexport var mad = /* #__PURE__ */createMad({\n  abs,\n  map,\n  median,\n  subtract,\n  typed\n});\nexport var std = /* #__PURE__ */createStd({\n  map,\n  sqrt,\n  typed,\n  variance\n});\nexport var zeta = /* #__PURE__ */createZeta({\n  BigNumber,\n  Complex,\n  add,\n  config,\n  divide,\n  equal,\n  factorial,\n  gamma,\n  isNegative,\n  multiply,\n  pi,\n  pow,\n  sin,\n  smallerEq,\n  subtract,\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 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 planckTime = /* #__PURE__ */createPlanckTime({\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 rotate = /* #__PURE__ */createRotate({\n  multiply,\n  rotationMatrix,\n  typed\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});","export class IterableElementBase {\n    /**\n     * The protected constructor initializes the options for the IterableElementBase class, including the\n     * toElementFn function.\n     * @param [options] - An optional object that contains the following properties:\n     */\n    constructor(options) {\n        if (options) {\n            const { toElementFn } = options;\n            if (typeof toElementFn === 'function')\n                this._toElementFn = toElementFn;\n            else if (toElementFn)\n                throw new TypeError('toElementFn must be a function type');\n        }\n    }\n    _toElementFn;\n    get toElementFn() {\n        return this._toElementFn;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The function is an implementation of the Symbol.iterator method that returns an IterableIterator.\n     * @param {any[]} args - The `args` parameter in the code snippet represents a rest parameter. It\n     * allows the function to accept any number of arguments as an array. In this case, the `args`\n     * parameter is used to pass any number of arguments to the `_getIterator` method.\n     */\n    *[Symbol.iterator](...args) {\n        yield* this._getIterator(...args);\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The function returns an iterator that yields all the values in the object.\n     */\n    *values() {\n        for (const item of this) {\n            yield item;\n        }\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The `every` function checks if every element in the array satisfies a given predicate.\n     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:\n     * the current element being processed, its index, and the array it belongs to. It should return a\n     * boolean value indicating whether the element satisfies a certain condition or not.\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `predicate` function. If `thisArg` is provided, it will be\n     * passed as the `this` value to the `predicate` function. If `thisArg` is\n     * @returns The `every` method is returning a boolean value. It returns `true` if every element in\n     * the array satisfies the provided predicate function, and `false` otherwise.\n     */\n    every(predicate, thisArg) {\n        let index = 0;\n        for (const item of this) {\n            if (!predicate.call(thisArg, item, index++, this)) {\n                return false;\n            }\n        }\n        return true;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The \"some\" function checks if at least one element in a collection satisfies a given predicate.\n     * @param predicate - The `predicate` parameter is a callback function that takes three arguments:\n     * `value`, `index`, and `array`. It should return a boolean value indicating whether the current\n     * element satisfies the condition.\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as the `this` value when executing the `predicate` function. If `thisArg` is provided,\n     * it will be passed as the `this` value to the `predicate` function. If `thisArg\n     * @returns a boolean value. It returns true if the predicate function returns true for any element\n     * in the collection, and false otherwise.\n     */\n    some(predicate, thisArg) {\n        let index = 0;\n        for (const item of this) {\n            if (predicate.call(thisArg, item, index++, this)) {\n                return true;\n            }\n        }\n        return false;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The `forEach` function iterates over each element in an array-like object and calls a callback\n     * function for each element.\n     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in\n     * the array. It takes three arguments: the current element being processed, the index of the current\n     * element, and the array that forEach was called upon.\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will\n     * be passed as the `this` value to the `callbackfn` function. If `thisArg\n     */\n    forEach(callbackfn, thisArg) {\n        let index = 0;\n        for (const item of this) {\n            callbackfn.call(thisArg, item, index++, this);\n        }\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The `find` function iterates over the elements of an array-like object and returns the first\n     * element that satisfies the provided callback function.\n     * @param predicate - The predicate parameter is a function that will be called for each element in\n     * the array. It takes three arguments: the current element being processed, the index of the current\n     * element, and the array itself. The function should return a boolean value indicating whether the\n     * current element matches the desired condition.\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `callbackfn` function. If `thisArg` is provided, it will\n     * be passed as the `this` value to the `callbackfn` function. If `thisArg\n     * @returns The `find` method returns the first element in the array that satisfies the provided\n     * callback function. If no element satisfies the callback function, `undefined` is returned.\n     */\n    find(predicate, thisArg) {\n        let index = 0;\n        for (const item of this) {\n            if (predicate.call(thisArg, item, index++, this))\n                return item;\n        }\n        return;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The function checks if a given element exists in a collection.\n     * @param {E} element - The parameter \"element\" is of type E, which means it can be any type. It\n     * represents the element that we want to check for existence in the collection.\n     * @returns a boolean value. It returns true if the element is found in the collection, and false\n     * otherwise.\n     */\n    has(element) {\n        for (const ele of this) {\n            if (ele === element)\n                return true;\n        }\n        return false;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The `reduce` function iterates over the elements of an array-like object and applies a callback\n     * function to reduce them into a single value.\n     * @param callbackfn - The callbackfn parameter is a function that will be called for each element in\n     * the array. It takes four arguments:\n     * @param {U} initialValue - The initialValue parameter is the initial value of the accumulator. It\n     * is the value that the accumulator starts with before the reduction operation begins.\n     * @returns The `reduce` method is returning the final value of the accumulator after iterating over\n     * all the elements in the array and applying the callback function to each element.\n     */\n    reduce(callbackfn, initialValue) {\n        let accumulator = initialValue ?? 0;\n        let index = 0;\n        for (const item of this) {\n            accumulator = callbackfn(accumulator, item, index++, this);\n        }\n        return accumulator;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The `toArray` function converts a linked list into an array.\n     * @returns The `toArray()` method is returning an array of type `E[]`.\n     */\n    toArray() {\n        return [...this];\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The print function logs the elements of an array to the console.\n     */\n    toVisual() {\n        return [...this];\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The print function logs the elements of an array to the console.\n     */\n    print() {\n        console.log(this.toVisual());\n    }\n}\n//# sourceMappingURL=iterable-element-base.js.map","/**\n * data-structure-typed\n * @author Kirk Qi\n * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>\n * @license MIT License\n */\nimport { IterableElementBase } from '../base';\n/**\n * 1. Complete Binary Tree: Heaps are typically complete binary trees, meaning every level is fully filled except possibly for the last level, which has nodes as far left as possible.\n * 2. Heap Properties: Each node in a heap follows a specific order property, which varies depending on the type of heap:\n * Max Heap: The value of each parent node is greater than or equal to the value of its children.\n * Min Heap: The value of each parent node is less than or equal to the value of its children.\n * 3. Root Node Access: In a heap, the largest element (in a max heap) or the smallest element (in a min heap) is always at the root of the tree.\n * 4. Efficient Insertion and Deletion: Due to its structure, a heap allows for insertion and deletion operations in logarithmic time (O(log n)).\n * 5. Managing Dynamic Data Sets: Heaps effectively manage dynamic data sets, especially when frequent access to the largest or smallest elements is required.\n * 6. Non-linear Search: While a heap allows rapid access to its largest or smallest element, it is less efficient for other operations, such as searching for a specific element, as it is not designed for these tasks.\n * 7. Efficient Sorting Algorithms: For example, heap sort. Heap sort uses the properties of a heap to sort elements.\n * 8. Graph Algorithms: Such as Dijkstra's shortest path algorithm and Prime's minimum-spanning tree algorithm, which use heaps to improve performance.\n * @example\n * // Use Heap to sort an array\n *     function heapSort(arr: number[]): number[] {\n *       const heap = new Heap<number>(arr, { comparator: (a, b) => a - b });\n *       const sorted: number[] = [];\n *       while (!heap.isEmpty()) {\n *         sorted.push(heap.poll()!); // Poll minimum element\n *       }\n *       return sorted;\n *     }\n *\n *     const array = [5, 3, 8, 4, 1, 2];\n *     console.log(heapSort(array)); // [1, 2, 3, 4, 5, 8]\n * @example\n * // Use Heap to solve top k problems\n *     function topKElements(arr: number[], k: number): number[] {\n *       const heap = new Heap<number>([], { comparator: (a, b) => b - a }); // Max heap\n *       arr.forEach(num => {\n *         heap.add(num);\n *         if (heap.size > k) heap.poll(); // Keep the heap size at K\n *       });\n *       return heap.toArray();\n *     }\n *\n *     const numbers = [10, 30, 20, 5, 15, 25];\n *     console.log(topKElements(numbers, 3)); // [15, 10, 5]\n * @example\n * // Use Heap to merge sorted sequences\n *     function mergeSortedSequences(sequences: number[][]): number[] {\n *       const heap = new Heap<{ value: number; seqIndex: number; itemIndex: number }>([], {\n *         comparator: (a, b) => a.value - b.value // Min heap\n *       });\n *\n *       // Initialize heap\n *       sequences.forEach((seq, seqIndex) => {\n *         if (seq.length) {\n *           heap.add({ value: seq[0], seqIndex, itemIndex: 0 });\n *         }\n *       });\n *\n *       const merged: number[] = [];\n *       while (!heap.isEmpty()) {\n *         const { value, seqIndex, itemIndex } = heap.poll()!;\n *         merged.push(value);\n *\n *         if (itemIndex + 1 < sequences[seqIndex].length) {\n *           heap.add({\n *             value: sequences[seqIndex][itemIndex + 1],\n *             seqIndex,\n *             itemIndex: itemIndex + 1\n *           });\n *         }\n *       }\n *\n *       return merged;\n *     }\n *\n *     const sequences = [\n *       [1, 4, 7],\n *       [2, 5, 8],\n *       [3, 6, 9]\n *     ];\n *     console.log(mergeSortedSequences(sequences)); // [1, 2, 3, 4, 5, 6, 7, 8, 9]\n * @example\n * // Use Heap to dynamically maintain the median\n *     class MedianFinder {\n *       private low: MaxHeap<number>; // Max heap, stores the smaller half\n *       private high: MinHeap<number>; // Min heap, stores the larger half\n *\n *       constructor() {\n *         this.low = new MaxHeap<number>([]);\n *         this.high = new MinHeap<number>([]);\n *       }\n *\n *       addNum(num: number): void {\n *         if (this.low.isEmpty() || num <= this.low.peek()!) this.low.add(num);\n *         else this.high.add(num);\n *\n *         // Balance heaps\n *         if (this.low.size > this.high.size + 1) this.high.add(this.low.poll()!);\n *         else if (this.high.size > this.low.size) this.low.add(this.high.poll()!);\n *       }\n *\n *       findMedian(): number {\n *         if (this.low.size === this.high.size) return (this.low.peek()! + this.high.peek()!) / 2;\n *         return this.low.peek()!;\n *       }\n *     }\n *\n *     const medianFinder = new MedianFinder();\n *     medianFinder.addNum(10);\n *     console.log(medianFinder.findMedian()); // 10\n *     medianFinder.addNum(20);\n *     console.log(medianFinder.findMedian()); // 15\n *     medianFinder.addNum(30);\n *     console.log(medianFinder.findMedian()); // 20\n *     medianFinder.addNum(40);\n *     console.log(medianFinder.findMedian()); // 25\n *     medianFinder.addNum(50);\n *     console.log(medianFinder.findMedian()); // 30\n * @example\n * // Use Heap for load balancing\n *     function loadBalance(requests: number[], servers: number): number[] {\n *       const serverHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // min heap\n *       const serverLoads = new Array(servers).fill(0);\n *\n *       for (let i = 0; i < servers; i++) {\n *         serverHeap.add({ id: i, load: 0 });\n *       }\n *\n *       requests.forEach(req => {\n *         const server = serverHeap.poll()!;\n *         serverLoads[server.id] += req;\n *         server.load += req;\n *         serverHeap.add(server); // The server after updating the load is re-entered into the heap\n *       });\n *\n *       return serverLoads;\n *     }\n *\n *     const requests = [5, 2, 8, 3, 7];\n *     console.log(loadBalance(requests, 3)); // [12, 8, 5]\n * @example\n * // Use Heap to schedule tasks\n *     type Task = [string, number];\n *\n *     function scheduleTasks(tasks: Task[], machines: number): Map<number, Task[]> {\n *       const machineHeap = new Heap<{ id: number; load: number }>([], { comparator: (a, b) => a.load - b.load }); // Min heap\n *       const allocation = new Map<number, Task[]>();\n *\n *       // Initialize the load on each machine\n *       for (let i = 0; i < machines; i++) {\n *         machineHeap.add({ id: i, load: 0 });\n *         allocation.set(i, []);\n *       }\n *\n *       // Assign tasks\n *       tasks.forEach(([task, load]) => {\n *         const machine = machineHeap.poll()!;\n *         allocation.get(machine.id)!.push([task, load]);\n *         machine.load += load;\n *         machineHeap.add(machine); // The machine after updating the load is re-entered into the heap\n *       });\n *\n *       return allocation;\n *     }\n *\n *     const tasks: Task[] = [\n *       ['Task1', 3],\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task4', 5],\n *       ['Task5', 4]\n *     ];\n *     const expectedMap = new Map<number, Task[]>();\n *     expectedMap.set(0, [\n *       ['Task1', 3],\n *       ['Task4', 5]\n *     ]);\n *     expectedMap.set(1, [\n *       ['Task2', 1],\n *       ['Task3', 2],\n *       ['Task5', 4]\n *     ]);\n *     console.log(scheduleTasks(tasks, 2)); // expectedMap\n */\nexport class Heap extends IterableElementBase {\n    /**\n     * The constructor initializes a heap data structure with optional elements and options.\n     * @param elements - The `elements` parameter is an iterable object that contains the initial\n     * elements to be added to the heap.\n     * It is an optional parameter, and if not provided, the heap will\n     * be initialized as empty.\n     * @param [options] - The `options` parameter is an optional object that can contain additional\n     * configuration options for the heap.\n     * In this case, it is used to specify a custom comparator\n     * function for comparing elements in the heap.\n     * The comparator function is used to determine the\n     * order of elements in the heap.\n     */\n    constructor(elements = [], options) {\n        super(options);\n        if (options) {\n            const { comparator } = options;\n            if (comparator)\n                this._comparator = comparator;\n        }\n        this.addMany(elements);\n    }\n    _elements = [];\n    /**\n     * The function returns an array of elements.\n     * @returns The element array is being returned.\n     */\n    get elements() {\n        return this._elements;\n    }\n    /**\n     * Get the size (number of elements) of the heap.\n     */\n    get size() {\n        return this.elements.length;\n    }\n    /**\n     * Get the last element in the heap, which is not necessarily a leaf node.\n     * @returns The last element or undefined if the heap is empty.\n     */\n    get leaf() {\n        return this.elements[this.size - 1] ?? undefined;\n    }\n    /**\n     * Static method that creates a binary heap from an array of elements and a comparison function.\n     * @returns A new Heap instance.\n     * @param elements\n     * @param options\n     */\n    static heapify(elements, options) {\n        return new Heap(elements, options);\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * The add function pushes an element into an array and then triggers a bubble-up operation.\n     * @param {E} element - The `element` parameter represents the element that you want to add to the\n     * data structure.\n     * @returns The `add` method is returning a boolean value, which is the result of calling the\n     * `_bubbleUp` method with the index `this.elements.length - 1` as an argument.\n     */\n    add(element) {\n        this._elements.push(element);\n        return this._bubbleUp(this.elements.length - 1);\n    }\n    /**\n     * Time Complexity: O(k log n)\n     * Space Complexity: O(1)\n     *\n     * The `addMany` function iterates over elements and adds them to a collection, returning an array of\n     * boolean values indicating success or failure.\n     * @param {Iterable<E> | Iterable<R>} elements - The `elements` parameter in the `addMany` method is\n     * an iterable containing elements of type `E` or `R`. The method iterates over each element in the\n     * iterable and adds them to the data structure. If a transformation function `_toElementFn` is\n     * provided, it transforms the element\n     * @returns The `addMany` method returns an array of boolean values indicating whether each element\n     * in the input iterable was successfully added to the data structure.\n     */\n    addMany(elements) {\n        const ans = [];\n        for (const el of elements) {\n            if (this._toElementFn) {\n                ans.push(this.add(this._toElementFn(el)));\n                continue;\n            }\n            ans.push(this.add(el));\n        }\n        return ans;\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @returns The top element or undefined if the heap is empty.\n     */\n    poll() {\n        if (this.elements.length === 0)\n            return;\n        const value = this.elements[0];\n        const last = this.elements.pop();\n        if (this.elements.length) {\n            this.elements[0] = last;\n            this._sinkDown(0, this.elements.length >> 1);\n        }\n        return value;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Peek at the top element of the heap without removing it.\n     * @returns The top element or undefined if the heap is empty.\n     */\n    peek() {\n        return this.elements[0];\n    }\n    /**\n     * Check if the heap is empty.\n     * @returns True if the heap is empty, otherwise false.\n     */\n    isEmpty() {\n        return this.size === 0;\n    }\n    /**\n     * Reset the elements of the heap. Make the elements empty.\n     */\n    clear() {\n        this._elements = [];\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * Clear and add elements of the heap\n     * @param elements\n     */\n    refill(elements) {\n        this._elements = elements;\n        return this.fix();\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * Use a comparison function to check whether a binary heap contains a specific element.\n     * @param element - the element to check.\n     * @returns Returns true if the specified element is contained; otherwise, returns false.\n     */\n    has(element) {\n        return this.elements.includes(element);\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(1)\n     *\n     * The `delete` function removes an element from an array-like data structure, maintaining the order\n     * and structure of the remaining elements.\n     * @param {E} element - The `element` parameter represents the element that you want to delete from\n     * the array `this.elements`.\n     * @returns The `delete` function is returning a boolean value. It returns `true` if the element was\n     * successfully deleted from the array, and `false` if the element was not found in the array.\n     */\n    delete(element) {\n        const index = this.elements.indexOf(element);\n        if (index < 0)\n            return false;\n        if (index === 0) {\n            this.poll();\n        }\n        else if (index === this.elements.length - 1) {\n            this.elements.pop();\n        }\n        else {\n            this.elements.splice(index, 1, this.elements.pop());\n            this._bubbleUp(index);\n            this._sinkDown(index, this.elements.length >> 1);\n        }\n        return true;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(log n)\n     *\n     * Depth-first search (DFS) method, different traversal orders can be selected。\n     * @param order - Traverse order parameter: 'IN' (in-order), 'PRE' (pre-order) or 'POST' (post-order).\n     * @returns An array containing elements traversed in the specified order.\n     */\n    dfs(order = 'PRE') {\n        const result = [];\n        // Auxiliary recursive function, traverses the binary heap according to the traversal order\n        const _dfs = (index) => {\n            const left = 2 * index + 1, right = left + 1;\n            if (index < this.size) {\n                if (order === 'IN') {\n                    _dfs(left);\n                    result.push(this.elements[index]);\n                    _dfs(right);\n                }\n                else if (order === 'PRE') {\n                    result.push(this.elements[index]);\n                    _dfs(left);\n                    _dfs(right);\n                }\n                else if (order === 'POST') {\n                    _dfs(left);\n                    _dfs(right);\n                    result.push(this.elements[index]);\n                }\n            }\n        };\n        _dfs(0); // Traverse starting from the root node\n        return result;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * Clone the heap, creating a new heap with the same elements.\n     * @returns A new Heap instance containing the same elements.\n     */\n    clone() {\n        return new Heap(this, { comparator: this.comparator, toElementFn: this.toElementFn });\n    }\n    /**\n     * Time Complexity: O(n log n)\n     * Space Complexity: O(n)\n     *\n     * Sort the elements in the heap and return them as an array.\n     * @returns An array containing the elements sorted in ascending order.\n     */\n    sort() {\n        const visitedNode = [];\n        const cloned = new Heap(this, { comparator: this.comparator });\n        while (cloned.size !== 0) {\n            const top = cloned.poll();\n            if (top !== undefined)\n                visitedNode.push(top);\n        }\n        return visitedNode;\n    }\n    /**\n     * Time Complexity: O(n log n)\n     * Space Complexity: O(n)\n     *\n     * Fix the entire heap to maintain heap properties.\n     */\n    fix() {\n        const results = [];\n        for (let i = Math.floor(this.size / 2); i >= 0; i--)\n            results.push(this._sinkDown(i, this.elements.length >> 1));\n        return results;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The `filter` function creates a new Heap object containing elements that pass a given callback\n     * function.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: the current element, the index of the current element, and the\n     * heap itself. The callback function should return a boolean value indicating whether the current\n     * element should be included in the filtered list\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be\n     * passed as the `this` value to the `callback` function. If `thisArg` is\n     * @returns The `filter` method is returning a new `Heap` object that contains the elements that pass\n     * the filter condition specified by the `callback` function.\n     */\n    filter(callback, thisArg) {\n        const filteredList = new Heap([], { toElementFn: this.toElementFn, comparator: this.comparator });\n        let index = 0;\n        for (const current of this) {\n            if (callback.call(thisArg, current, index, this)) {\n                filteredList.add(current);\n            }\n            index++;\n        }\n        return filteredList;\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The `map` function creates a new heap by applying a callback function to each element of the\n     * original heap.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current\n     * element), and `this` (the heap itself). The callback function should return a value of\n     * @param comparator - The `comparator` parameter is a function that defines the order of the\n     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number\n     * if `a` should be placed before `b`, a positive number if `a` should be placed after\n     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw\n     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and\n     * returns a value of type `T`. This function is used to transform the elements of the original\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to\n     * specify the value of `this` within the callback function. It is used to set the context or scope\n     * in which the callback function will be executed. If `thisArg` is provided, it will be used as the\n     * value of\n     * @returns a new instance of the `Heap` class with the mapped elements.\n     */\n    map(callback, comparator, toElementFn, thisArg) {\n        const mappedHeap = new Heap([], { comparator, toElementFn });\n        let index = 0;\n        for (const el of this) {\n            mappedHeap.add(callback.call(thisArg, el, index, this));\n            index++;\n        }\n        return mappedHeap;\n    }\n    _DEFAULT_COMPARATOR = (a, b) => {\n        if (typeof a === 'object' || typeof b === 'object') {\n            throw TypeError(`When comparing object types, a custom comparator must be defined in the constructor's options parameter.`);\n        }\n        if (a > b)\n            return 1;\n        if (a < b)\n            return -1;\n        return 0;\n    };\n    _comparator = this._DEFAULT_COMPARATOR;\n    /**\n     * The function returns the value of the _comparator property.\n     * @returns The `_comparator` property is being returned.\n     */\n    get comparator() {\n        return this._comparator;\n    }\n    /**\n     * The function `_getIterator` returns an iterable iterator for the elements in the class.\n     */\n    *_getIterator() {\n        for (const element of this.elements) {\n            yield element;\n        }\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * Float operation to maintain heap properties after adding an element.\n     * @param index - The index of the newly added element.\n     */\n    _bubbleUp(index) {\n        const element = this.elements[index];\n        while (index > 0) {\n            const parent = (index - 1) >> 1;\n            const parentItem = this.elements[parent];\n            if (this.comparator(parentItem, element) <= 0)\n                break;\n            this.elements[index] = parentItem;\n            index = parent;\n        }\n        this.elements[index] = element;\n        return true;\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * Sinking operation to maintain heap properties after removing the top element.\n     * @param index - The index from which to start sinking.\n     * @param halfLength\n     */\n    _sinkDown(index, halfLength) {\n        const element = this.elements[index];\n        while (index < halfLength) {\n            let left = (index << 1) | 1;\n            const right = left + 1;\n            let minItem = this.elements[left];\n            if (right < this.elements.length && this.comparator(minItem, this.elements[right]) > 0) {\n                left = right;\n                minItem = this.elements[right];\n            }\n            if (this.comparator(minItem, element) >= 0)\n                break;\n            this.elements[index] = minItem;\n            index = left;\n        }\n        this.elements[index] = element;\n        return true;\n    }\n}\nexport class FibonacciHeapNode {\n    element;\n    degree;\n    left;\n    right;\n    child;\n    parent;\n    marked;\n    /**\n     * The constructor function initializes an object with an element and a degree, and sets the marked\n     * property to false.\n     * @param {E} element - The \"element\" parameter represents the value or data that will be stored in\n     * the node of a data structure. It can be any type of data, such as a number, string, object, or\n     * even another data structure.\n     * @param [degree=0] - The degree parameter represents the degree of the element in a data structure\n     * called a Fibonacci heap. The degree of a node is the number of children it has. By default, the\n     * degree is set to 0 when a new node is created.\n     */\n    constructor(element, degree = 0) {\n        this.element = element;\n        this.degree = degree;\n        this.marked = false;\n    }\n}\nexport class FibonacciHeap {\n    /**\n     * The constructor function initializes a FibonacciHeap object with an optional comparator function.\n     * @param [comparator] - The `comparator` parameter is an optional argument that represents a\n     * function used to compare elements in the FibonacciHeap. If a comparator function is provided, it\n     * will be used to determine the order of elements in the heap. If no comparator function is\n     * provided, a default comparator function will be used.\n     */\n    constructor(comparator) {\n        this.clear();\n        this._comparator = comparator || this._defaultComparator;\n        if (typeof this.comparator !== 'function') {\n            throw new Error('FibonacciHeap constructor: given comparator should be a function.');\n        }\n    }\n    _root;\n    /**\n     * The function returns the root node of a Fibonacci heap.\n     * @returns The method is returning either a FibonacciHeapNode object or undefined.\n     */\n    get root() {\n        return this._root;\n    }\n    _size = 0;\n    /**\n     * The function returns the size of an object.\n     * @returns The size of the object, which is a number.\n     */\n    get size() {\n        return this._size;\n    }\n    _min;\n    /**\n     * The function returns the minimum node in a Fibonacci heap.\n     * @returns The method is returning the minimum node of the Fibonacci heap, which is of type\n     * `FibonacciHeapNode<E>`. If there is no minimum node, it will return `undefined`.\n     */\n    get min() {\n        return this._min;\n    }\n    _comparator;\n    /**\n     * The function returns the comparator used for comparing elements.\n     * @returns The `_comparator` property of the object.\n     */\n    get comparator() {\n        return this._comparator;\n    }\n    /**\n     * Get the size (number of elements) of the heap.\n     * @returns {number} The size of the heap.  Returns 0 if the heap is empty. Returns -1 if the heap is invalid.\n     */\n    clear() {\n        this._root = undefined;\n        this._min = undefined;\n        this._size = 0;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Insert an element into the heap and maintain the heap properties.\n     * @param element\n     * @returns {FibonacciHeap<E>} FibonacciHeap<E> - The heap itself.\n     */\n    add(element) {\n        return this.push(element);\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Insert an element into the heap and maintain the heap properties.\n     * @param element\n     * @returns {FibonacciHeap<E>} FibonacciHeap<E> - The heap itself.\n     */\n    push(element) {\n        const node = this.createNode(element);\n        node.left = node;\n        node.right = node;\n        this.mergeWithRoot(node);\n        if (!this.min || this.comparator(node.element, this.min.element) <= 0) {\n            this._min = node;\n        }\n        this._size++;\n        return this;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Peek at the top element of the heap without removing it.\n     * @returns The top element or undefined if the heap is empty.\n     * @protected\n     */\n    peek() {\n        return this.min ? this.min.element : undefined;\n    }\n    /**\n     * Time Complexity: O(n), where n is the number of elements in the linked list.\n     * Space Complexity: O(1)\n     *\n     * Get the size (number of elements) of the heap.\n     * @param {FibonacciHeapNode<E>} head - The head of the linked list.\n     * @protected\n     * @returns FibonacciHeapNode<E>[] - An array containing the elements of the linked list.\n     */\n    consumeLinkedList(head) {\n        const elements = [];\n        if (!head)\n            return elements;\n        let node = head;\n        let flag = false;\n        while (true) {\n            if (node === head && flag)\n                break;\n            else if (node === head)\n                flag = true;\n            if (node) {\n                elements.push(node);\n                node = node.right;\n            }\n        }\n        return elements;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * @param parent\n     * @param node\n     */\n    mergeWithChild(parent, node) {\n        if (!parent.child) {\n            parent.child = node;\n        }\n        else {\n            node.right = parent.child.right;\n            node.left = parent.child;\n            parent.child.right.left = node;\n            parent.child.right = node;\n        }\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @returns The top element or undefined if the heap is empty.\n     */\n    poll() {\n        return this.pop();\n    }\n    /**\n     * Time Complexity: O(log n)\n     * Space Complexity: O(1)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @returns The top element or undefined if the heap is empty.\n     */\n    pop() {\n        if (this._size === 0)\n            return undefined;\n        const z = this.min;\n        if (z.child) {\n            const elements = this.consumeLinkedList(z.child);\n            for (const node of elements) {\n                this.mergeWithRoot(node);\n                node.parent = undefined;\n            }\n        }\n        this.removeFromRoot(z);\n        if (z === z.right) {\n            this._min = undefined;\n            this._root = undefined;\n        }\n        else {\n            this._min = z.right;\n            this._consolidate();\n        }\n        this._size--;\n        return z.element;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * merge two heaps. The heap that is merged will be cleared. The heap that is merged into will remain.\n     * @param heapToMerge\n     */\n    merge(heapToMerge) {\n        if (heapToMerge.size === 0) {\n            return; // Nothing to merge\n        }\n        // Merge the root lists of the two heaps\n        if (this.root && heapToMerge.root) {\n            const thisRoot = this.root;\n            const otherRoot = heapToMerge.root;\n            const thisRootRight = thisRoot.right;\n            const otherRootLeft = otherRoot.left;\n            thisRoot.right = otherRoot;\n            otherRoot.left = thisRoot;\n            thisRootRight.left = otherRootLeft;\n            otherRootLeft.right = thisRootRight;\n        }\n        // Update the minimum node\n        if (!this.min || (heapToMerge.min && this.comparator(heapToMerge.min.element, this.min.element) < 0)) {\n            this._min = heapToMerge.min;\n        }\n        // Update the size\n        this._size += heapToMerge.size;\n        // Clear the heap that was merged\n        heapToMerge.clear();\n    }\n    /**\n     * Create a new node.\n     * @param element\n     * @protected\n     */\n    createNode(element) {\n        return new FibonacciHeapNode(element);\n    }\n    /**\n     * Default comparator function used by the heap.\n     * @param {E} a\n     * @param {E} b\n     * @protected\n     */\n    _defaultComparator(a, b) {\n        if (a < b)\n            return -1;\n        if (a > b)\n            return 1;\n        return 0;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Merge the given node with the root list.\n     * @param node - The node to be merged.\n     */\n    mergeWithRoot(node) {\n        if (!this.root) {\n            this._root = node;\n        }\n        else {\n            node.right = this.root.right;\n            node.left = this.root;\n            this.root.right.left = node;\n            this.root.right = node;\n        }\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @param node - The node to be removed.\n     * @protected\n     */\n    removeFromRoot(node) {\n        if (this.root === node)\n            this._root = node.right;\n        if (node.left)\n            node.left.right = node.right;\n        if (node.right)\n            node.right.left = node.left;\n    }\n    /**\n     * Time Complexity: O(1)\n     * Space Complexity: O(1)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @param y\n     * @param x\n     * @protected\n     */\n    _link(y, x) {\n        this.removeFromRoot(y);\n        y.left = y;\n        y.right = y;\n        this.mergeWithChild(x, y);\n        x.degree++;\n        y.parent = x;\n    }\n    /**\n     * Time Complexity: O(n log n)\n     * Space Complexity: O(n)\n     *\n     * Remove and return the top element (the smallest or largest element) from the heap.\n     * @protected\n     */\n    _consolidate() {\n        const A = new Array(this._size);\n        const elements = this.consumeLinkedList(this.root);\n        let x, y, d, t;\n        for (const node of elements) {\n            x = node;\n            d = x.degree;\n            while (A[d]) {\n                y = A[d];\n                if (this.comparator(x.element, y.element) > 0) {\n                    t = x;\n                    x = y;\n                    y = t;\n                }\n                this._link(y, x);\n                A[d] = undefined;\n                d++;\n            }\n            A[d] = x;\n        }\n        for (let i = 0; i < this._size; i++) {\n            if (A[i] && this.comparator(A[i].element, this.min.element) <= 0) {\n                this._min = A[i];\n            }\n        }\n    }\n}\n//# sourceMappingURL=heap.js.map","import { Heap } from '../heap';\n/**\n * 1. Element Priority: In a PriorityQueue, elements are sorted according to their priority. Each dequeue (element removal) operation removes the element with the highest priority. The priority can be determined based on the natural ordering of the elements or through a provided comparator (Comparator).\n * 2. Heap-Based Implementation: PriorityQueue is typically implemented using a binary heap, allowing both insertion and removal operations to be completed in O(log n) time, where n is the number of elements in the queue.\n * 3. Task Scheduling: In systems where tasks need to be processed based on the urgency of tasks rather than the order of arrival.\n * 4. Dijkstra's Algorithm: In shortest path algorithms for graphs, used to select the next shortest edge to visit.\n * 5. Huffman Coding: Used to select the smallest node combination when constructing a Huffman tree.\n * 6. Kth Largest Element in a Data Stream: Used to maintain a min-heap of size K for quickly finding the Kth largest element in stream data\n */\nexport class PriorityQueue extends Heap {\n    /**\n     * The constructor initializes a priority queue with optional elements and options.\n     * @param elements - The `elements` parameter is an iterable object that contains the initial\n     * elements to be added to the priority queue. It is an optional parameter, and if not provided, the\n     * priority queue will be initialized as empty.\n     * @param [options] - The `options` parameter is an optional object that can be used to customize the\n     * behavior of the priority queue. It can contain the following properties:\n     */\n    constructor(elements = [], options) {\n        super(elements, options);\n    }\n    /**\n     * The `clone` function returns a new instance of the `PriorityQueue` class with the same comparator\n     * and toElementFn as the original instance.\n     * @returns The method is returning a new instance of the `PriorityQueue` class with the same\n     * elements and properties as the current instance.\n     */\n    clone() {\n        return new PriorityQueue(this, { comparator: this.comparator, toElementFn: this.toElementFn });\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The `filter` function creates a new PriorityQueue object containing elements that pass a given callback\n     * function.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: the current element, the index of the current element, and the\n     * heap itself. The callback function should return a boolean value indicating whether the current\n     * element should be included in the filtered list\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be\n     * passed as the `this` value to the `callback` function. If `thisArg` is\n     * @returns The `filter` method is returning a new `PriorityQueue` object that contains the elements that pass\n     * the filter condition specified by the `callback` function.\n     */\n    filter(callback, thisArg) {\n        const filteredPriorityQueue = new PriorityQueue([], {\n            toElementFn: this.toElementFn,\n            comparator: this.comparator\n        });\n        let index = 0;\n        for (const current of this) {\n            if (callback.call(thisArg, current, index, this)) {\n                filteredPriorityQueue.add(current);\n            }\n            index++;\n        }\n        return filteredPriorityQueue;\n    }\n    /**\n     * Time Complexity: O(n log n)\n     * Space Complexity: O(n)\n     *\n     * The `map` function creates a new heap by applying a callback function to each element of the\n     * original heap.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current\n     * element), and `this` (the heap itself). The callback function should return a value of\n     * @param comparator - The `comparator` parameter is a function that defines the order of the\n     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number\n     * if `a` should be placed before `b`, a positive number if `a` should be placed after\n     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw\n     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and\n     * returns a value of type `T`. This function is used to transform the elements of the original\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to\n     * specify the value of `this` within the callback function. It is used to set the context or scope\n     * in which the callback function will be executed. If `thisArg` is provided, it will be used as the\n     * value of\n     * @returns a new instance of the `PriorityQueue` class with the mapped elements.\n     */\n    map(callback, comparator, toElementFn, thisArg) {\n        const mappedPriorityQueue = new PriorityQueue([], { comparator, toElementFn });\n        let index = 0;\n        for (const el of this) {\n            mappedPriorityQueue.add(callback.call(thisArg, el, index, this));\n            index++;\n        }\n        return mappedPriorityQueue;\n    }\n}\n//# sourceMappingURL=priority-queue.js.map","import { PriorityQueue } from './priority-queue';\n/**\n *\n */\nexport class MinPriorityQueue extends PriorityQueue {\n    /**\n     * The constructor initializes a PriorityQueue with optional elements and options, including a\n     * comparator function.\n     * @param elements - The `elements` parameter is an iterable object that contains the initial\n     * elements to be added to the priority queue. It is optional and defaults to an empty array if not\n     * provided.\n     * @param options - The `options` parameter is an object that contains additional configuration\n     * options for the priority queue. In this case, it has a property called `comparator,` which is a\n     * function used to compare elements in the priority queue. The `comparator` function takes two\n     * parameters `a` and `b`\n     */\n    constructor(elements = [], options) {\n        super(elements, options);\n    }\n    /**\n     * The `clone` function returns a new instance of the `MinPriorityQueue` class with the same\n     * comparator and toElementFn as the original instance.\n     * @returns The method is returning a new instance of the `MinPriorityQueue` class with the same\n     * properties as the current instance.\n     */\n    clone() {\n        return new MinPriorityQueue(this, { comparator: this.comparator, toElementFn: this.toElementFn });\n    }\n    /**\n     * Time Complexity: O(n)\n     * Space Complexity: O(n)\n     *\n     * The `filter` function creates a new MinPriorityQueue object containing elements that pass a given callback\n     * function.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: the current element, the index of the current element, and the\n     * heap itself. The callback function should return a boolean value indicating whether the current\n     * element should be included in the filtered list\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that specifies the value\n     * to be used as `this` when executing the `callback` function. If `thisArg` is provided, it will be\n     * passed as the `this` value to the `callback` function. If `thisArg` is\n     * @returns The `filter` method is returning a new `MinPriorityQueue` object that contains the elements that pass\n     * the filter condition specified by the `callback` function.\n     */\n    filter(callback, thisArg) {\n        const filteredPriorityQueue = new MinPriorityQueue([], {\n            toElementFn: this.toElementFn,\n            comparator: this.comparator\n        });\n        let index = 0;\n        for (const current of this) {\n            if (callback.call(thisArg, current, index, this)) {\n                filteredPriorityQueue.add(current);\n            }\n            index++;\n        }\n        return filteredPriorityQueue;\n    }\n    /**\n     * Time Complexity: O(n log n)\n     * Space Complexity: O(n)\n     *\n     * The `map` function creates a new heap by applying a callback function to each element of the\n     * original heap.\n     * @param callback - The `callback` parameter is a function that will be called for each element in\n     * the heap. It takes three arguments: `el` (the current element), `index` (the index of the current\n     * element), and `this` (the heap itself). The callback function should return a value of\n     * @param comparator - The `comparator` parameter is a function that defines the order of the\n     * elements in the heap. It takes two elements `a` and `b` as arguments and returns a negative number\n     * if `a` should be placed before `b`, a positive number if `a` should be placed after\n     * @param [toElementFn] - The `toElementFn` parameter is an optional function that converts the raw\n     * element `RR` to the desired type `T`. It takes a single argument `rawElement` of type `RR` and\n     * returns a value of type `T`. This function is used to transform the elements of the original\n     * @param {any} [thisArg] - The `thisArg` parameter is an optional argument that allows you to\n     * specify the value of `this` within the callback function. It is used to set the context or scope\n     * in which the callback function will be executed. If `thisArg` is provided, it will be used as the\n     * value of\n     * @returns a new instance of the `MinPriorityQueue` class with the mapped elements.\n     */\n    map(callback, comparator, toElementFn, thisArg) {\n        const mappedPriorityQueue = new MinPriorityQueue([], { comparator, toElementFn });\n        let index = 0;\n        for (const el of this) {\n            mappedPriorityQueue.add(callback.call(thisArg, el, index, this));\n            index++;\n        }\n        return mappedPriorityQueue;\n    }\n}\n//# sourceMappingURL=min-priority-queue.js.map","// Import necessary classes from three.js\r\nimport { Box3, Vector3, Ray } from 'three';\r\n\r\n\r\nconst tmpBox3 = new Box3();\r\nconst tmpVector1 = new Vector3();\r\nconst tmpVector2 = new Vector3();\r\nconst tmpVector3 = new Vector3();\r\nconst tmpVector4 = new Vector3();\r\n\r\n\r\n/**\r\n * Octree class for splats raycast.\r\n */\r\nclass SplatsCollider {\r\n    /**\r\n     * @param {Box3} bounds - The bounding box of the octree node.\r\n     * @param {number} maxPoints - Maximum number of points per node before subdivision.\r\n     * @param {number} [threshold] - Optional threshold. If not provided, it defaults to bounds diagonal / 100000.\r\n     */\r\n    constructor(bounds, maxPoints, threshold = undefined) {\r\n        this.bounds = new Box3();\r\n        this.bounds.copy(bounds);\r\n        this.maxPointsPerNode = maxPoints;\r\n        this.points = [];\r\n        this.children = null;\r\n\r\n        if (threshold !== undefined) {\r\n            this.threshold = threshold;\r\n        } else {\r\n            tmpVector1.subVectors(bounds.max, bounds.min);\r\n            this.threshold = tmpVector1.length() / 100000;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Inserts a splat object into the Octree.\r\n     * @param {Object} splat - The splat object with a Vector3 'center' property.\r\n     */\r\n    insert(splat) {\r\n        const center = splat.center;\r\n\r\n        if (!this.bounds.containsPoint(center)) return;\r\n\r\n        if (this.children === null) {\r\n            if (this.points.length < this.maxPointsPerNode) {\r\n                this.points.push(splat);\r\n            } else {\r\n                this.subdivide();\r\n                this.insert(splat);\r\n            }\r\n        } else {\r\n            const index = this.getChildIndex(center);\r\n            this.children[index].insert(splat);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Queries the Octree with a Ray to find all splats within a threshold.\r\n     * Returns the splats ordered front to back relative to the ray origin.\r\n     * @param {Ray} ray - The three.js Ray object.\r\n     * @param {number} [threshold=this.threshold] - The maximum allowed distance from the ray.\r\n     * @returns {Array<{ t: number, splat: Object }>} - Array of splats within the threshold, sorted by t ascending.\r\n     */\r\n    query(ray, queryResults, threshold = this.threshold) {\r\n        this.queryRecursive(ray, queryResults, threshold);\r\n    }\r\n\r\n    /**\r\n     * Recursively queries the Octree to find all splats within a threshold.\r\n     * @private\r\n     * @param {Ray} ray - The three.js Ray object.\r\n     * @param {number} threshold - The maximum allowed distance from the ray.\r\n     */\r\n    queryRecursive(ray, queryResults, threshold) {\r\n        // Expand the bounds by the threshold\r\n        tmpBox3.copy(this.bounds).expandByScalar(threshold);\r\n\r\n        // Check if the ray intersects the expanded bounds\r\n        if (!ray.intersectBox(tmpBox3, tmpVector1)) return;\r\n\r\n        if (this.children === null) {\r\n            for (let splat of this.points) {\r\n                const center = splat.center;\r\n\r\n                // Find the closest point on the ray to the splat center\r\n                ray.closestPointToPoint(center, tmpVector1);\r\n\r\n                // Vector from ray origin to the closest point\r\n                tmpVector2.copy(tmpVector1).sub(ray.origin);\r\n\r\n                // Calculate t parameter along the ray\r\n                const t = tmpVector2.dot(ray.direction);\r\n\r\n                // Ignore splats behind the ray origin\r\n                if (t < 0) continue;\r\n\r\n                // Calculate the distance from the splat center to the closest point on the ray\r\n                const distance = center.distanceTo(tmpVector1);\r\n\r\n                if (distance <= threshold) {\r\n                    // Add the splat and its t to the query results\r\n                    queryResults.push({ distance: t, point: center });\r\n                }\r\n            }\r\n        } else {\r\n            for (let child of this.children) {\r\n                child.queryRecursive(ray, queryResults, threshold);\r\n            }\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Determines which child Octree node the point belongs to.\r\n     * @private\r\n     * @param {Vector3} point - The point to determine the child index for.\r\n     * @returns {number} - The index of the child node (0-7).\r\n     */\r\n    getChildIndex(point) {\r\n        let index = 0;\r\n        this.bounds.getCenter(tmpVector1);\r\n\r\n        if (point.x >= tmpVector1.x) index |= 1;\r\n        if (point.y >= tmpVector1.y) index |= 2;\r\n        if (point.z >= tmpVector1.z) index |= 4;\r\n\r\n        return index;\r\n    }\r\n\r\n    /**\r\n * Subdivides the current Octree node into eight children.\r\n * @private\r\n */\r\n    subdivide() {\r\n        this.children = new Array(8);\r\n\r\n        // Calculate half the size of the current node's bounds\r\n        tmpVector1.copy(this.bounds.max).sub(this.bounds.min).multiplyScalar(0.5); // size / 2\r\n\r\n        // Copy the minimum bounds of the current node\r\n        const parentMin = tmpVector2.copy(this.bounds.min);\r\n\r\n        for (let i = 0; i < 8; i++) {\r\n            // Start with the parent minimum bounds\r\n            tmpVector3.copy(parentMin);\r\n\r\n            // Adjust the child min based on the index bits\r\n            if (i & 1) tmpVector3.x += tmpVector1.x;\r\n            if (i & 2) tmpVector3.y += tmpVector1.y;\r\n            if (i & 4) tmpVector3.z += tmpVector1.z;\r\n\r\n            // Calculate child max by adding the half size to child min\r\n            tmpVector4.copy(tmpVector3).add(tmpVector1); // childMax = childMin + halfSize\r\n\r\n            // Set up child bounds using pre-defined temporary Box3\r\n            tmpBox3.set(tmpVector3, tmpVector4);\r\n\r\n            // Create a new child Octree node with the calculated bounds\r\n            this.children[i] = new SplatsCollider(tmpBox3, this.maxPointsPerNode, this.threshold);\r\n        }\r\n\r\n        // Re-insert existing splats into the appropriate children\r\n        for (let splat of this.points) {\r\n            const index = this.getChildIndex(splat.center);\r\n            this.children[index].insert(splat);\r\n        }\r\n\r\n        // Clear points from the current node\r\n        this.points = null;\r\n    }\r\n}\r\n\r\nexport { SplatsCollider };\r\n","import {\r\n    Mesh, InstancedMesh, ShaderMaterial, Vector2, Vector3, Vector4, Box2, Box3, DataArrayTexture,\r\n    FloatType, HalfFloatType, RGBAFormat, FrontSide, AlwaysDepth, PlaneGeometry, Matrix3,\r\n    NearestFilter, Data3DTexture, DataTexture, UnsignedByteType, BufferAttribute, InstancedBufferAttribute, DynamicDrawUsage,\r\n    LinearSRGBColorSpace, InstancedBufferGeometry,\r\n    WebGL3DRenderTarget, OrthographicCamera, Scene,\r\n    NeverDepth, MathUtils, GLSL3, DataUtils, CustomBlending, OneMinusSrcAlphaFactor, OneFactor, Matrix4,\r\n    NormalBlending\r\n} from \"three\";\r\nimport { gamma } from 'mathjs';\r\nimport {\r\n    MinPriorityQueue\r\n} from 'data-structure-typed';\r\nimport { SplatsCollider } from \"./SplatsColider\";\r\nimport WorkerConstructor from './PointsManager.worker.js?worker&inline';\r\n\r\nconst tmpVector = new Vector3();\r\nconst tmpVector2 = new Vector3();\r\nconst zUpToYUpMatrix3x3 = new Matrix3();\r\nzUpToYUpMatrix3x3.set(\r\n    1, 0, 0,\r\n    0, 0, 1,\r\n    0, -1, 0);\r\n    const inverseZUpToYUpMatrix4x4 = new Matrix4().set(\r\n        1, 0,  0, 0, \r\n        0, 0, -1, 0, \r\n        0, 1,  0, 0, \r\n        0, 0,  0, 1\r\n    );\r\n\r\nfunction packHalf2x16(x, y) {\r\n    return (DataUtils.toHalfFloat(x) | (DataUtils.toHalfFloat(y) << 16)) >>> 0;\r\n}\r\nclass SplatsMesh extends Mesh {\r\n    constructor(renderer, isStatic, fragShader, scaleMultiplier) {\r\n\r\n        const textureSize = 1024;\r\n\r\n        const numTextures = 1;\r\n        const batchSize = Math.min(Math.ceil(4096 / textureSize) * textureSize, Math.pow(textureSize, 2));\r\n        let maxSplats = numTextures * Math.pow(textureSize, 2);\r\n        maxSplats = Math.floor(maxSplats / batchSize) * batchSize;\r\n\r\n\r\n        const positionColorRenderTarget = new WebGL3DRenderTarget(textureSize, textureSize, numTextures, {\r\n            magFilter: NearestFilter,\r\n            minFilter: NearestFilter,\r\n            type: FloatType,\r\n            format: RGBAFormat,\r\n            anisotropy: 0,\r\n            depthBuffer: false,\r\n            resolveDepthBuffer: false,\r\n        })\r\n        positionColorRenderTarget.texture.type = FloatType;\r\n        positionColorRenderTarget.texture.format = RGBAFormat;\r\n        positionColorRenderTarget.texture.internalFormat = 'RGBA32F';\r\n        renderer.initRenderTarget(positionColorRenderTarget);\r\n\r\n\r\n        const covarianceRenderTarget = new WebGL3DRenderTarget(textureSize, textureSize, numTextures, {\r\n            magFilter: NearestFilter,\r\n            minFilter: NearestFilter,\r\n            anisotropy: 0,\r\n            type: FloatType,\r\n            format: RGBAFormat,\r\n            depthBuffer: false,\r\n            resolveDepthBuffer: false,\r\n        })\r\n        covarianceRenderTarget.texture.type = FloatType;\r\n        covarianceRenderTarget.texture.format = RGBAFormat;\r\n        covarianceRenderTarget.texture.internalFormat = 'RGBA32F';\r\n        renderer.initRenderTarget(covarianceRenderTarget);\r\n\r\n\r\n\r\n        const material = new ShaderMaterial(\r\n            {\r\n                glslVersion: GLSL3,\r\n                uniforms: {\r\n                    textureSize: { value: textureSize },\r\n                    numSlices: { value: numTextures },\r\n                    covarianceTexture: { value: covarianceRenderTarget.texture },\r\n                    positionColorTexture: { value: positionColorRenderTarget.texture },\r\n                    zUpToYUpMatrix3x3: { value: zUpToYUpMatrix3x3 },\r\n                    sizeMultiplier: { value: 1*(scaleMultiplier||1) },\r\n                    cropRadius: { value: Number.MAX_VALUE },\r\n                    //cameraNear: { value: 0.01 },\r\n                    //cameraFar: { value: 10 },\r\n                    //computeLinearDepth: { value: true },\r\n                    viewportPixelSize: { value: new Vector2() },\r\n                    k: { value: 2 },\r\n                    beta_k: { value: 2 },\r\n                    minSplatPixelSize: { value: 0 },\r\n                    minOpacity: { value: 0.01 },\r\n                    culling: {value: false},\r\n                    antialiasingFactor: {value: 2.0},\r\n                    depthBias: {value: 0.0},\r\n\r\n                    // Visual tuning uniforms\r\n                    exposureEV: { value: 0.0 },            // stops, pow(2,exposureEV)\r\n                    saturation: { value: 1.0 },            // linear saturation multiplier\r\n                    contrast: { value: 1.0 },              // linear contrast multiplier\r\n                    tempTint: { value: new Vector2(0.0, 0.0) } // temperature, tint -> small RGB gain approximation\r\n                },\r\n                vertexShader: splatsVertexShader(),\r\n                fragmentShader: fragShader ? fragShader : splatsFragmentShader(),\r\n                transparent: true,\r\n                side: FrontSide,\r\n                depthTest: true,\r\n                depthWrite: false,\r\n                blending: NormalBlending,\r\n            }\r\n        );\r\n\r\n        \r\n        const geometry = new InstancedBufferGeometry();\r\n        const vertices = new Float32Array([-0.5, 0.5, 0, 0.5, 0.5, 0, -0.5, -0.5, 0, 0.5, -0.5, 0]);\r\n        const indices = [0, 2, 1, 2, 3, 1];\r\n\r\n        geometry.setIndex(indices);\r\n        geometry.setAttribute('position', new BufferAttribute(vertices, 3));\r\n        const order = new Uint32Array(maxSplats);\r\n\r\n        const orderAttribute = new InstancedBufferAttribute(order, 1, false);\r\n        orderAttribute.needsUpdate = true\r\n        orderAttribute.setUsage(DynamicDrawUsage);\r\n        geometry.setAttribute('order', orderAttribute);\r\n        geometry.instanceCount = 0;\r\n\r\n\r\n        super(geometry, material);\r\n        this.scaleMultiplier = scaleMultiplier;\r\n        this.matrixAutoUpdate = false;\r\n        this.numBatches = 0;\r\n        this.numVisibleBatches = 0;\r\n        this.orderAttribute = orderAttribute;\r\n        this.textureSize = textureSize;\r\n        this.numTextures = numTextures;\r\n        this.batchSize = batchSize;\r\n        this.maxSplats = maxSplats;\r\n        this.numSplatsRendered = 0;\r\n\r\n        this.positionColorRenderTarget = positionColorRenderTarget;\r\n        this.covarianceRenderTarget = covarianceRenderTarget;\r\n\r\n        this.renderer = renderer;\r\n\r\n        this.sortID = 0;\r\n\r\n        this.freeAddresses = new MinPriorityQueue();\r\n        for (let i = 0; i < this.maxSplats; i += batchSize) {\r\n            this.freeAddresses.add(i);\r\n        }\r\n\r\n        this.worker = new WorkerConstructor();\r\n\r\n        this.sortListeners = [];\r\n        // Pending updates coming from the worker are stored here and applied\r\n        // later by calling update() from the render loop. This avoids mutating\r\n        // three.js geometry/attributes from arbitrary message timing.\r\n        this._pendingOrder = null;\r\n        this._pendingInstanceCount = 0;\r\n        this._pendingSortIDs = [];\r\n        // Pending texture copy tasks (both 2D per-batch uploads and 3D grow ops).\r\n        // Each entry is applied by update() in the render loop before geometry updates.\r\n        this._pendingTextureCopies = []; // items: { array, textureSize, srcHeight, scissor, destTextureLayer, kind: 'position'|'covariance' }\r\n        this._pendingGrowOperations = []; // items: { newPositionColorRenderTarget, newCovarianceRenderTarget, oldPositionColorRenderTarget, oldCovarianceRenderTarget, oldNumTextures, newNumTextures }\r\n        this.worker.onmessage = message => {\r\n            // Only stage the incoming data here. The render loop will call update()\r\n            // to apply these changes at a deterministic point.\r\n            try {\r\n                this._pendingOrder = new Uint32Array(message.data.order);\r\n            } catch (e) {\r\n                // fallback: if message.data.order is already a typed array\r\n                this._pendingOrder = message.data.order;\r\n            }\r\n            this._pendingInstanceCount = message.data.count || 0;\r\n            if (typeof message.data.id !== \"undefined\") {\r\n                this._pendingSortIDs.push(message.data.id);\r\n            }\r\n        }\r\n        this.cameraPosition = new Vector3(0, 0, 0);\r\n        this.viewProjModel;\r\n        this.rotateOnAxis(new Vector3(1, 0, 0), Math.PI * 0.5);\r\n        this.frustumCulled = false;\r\n\r\n\r\n        /// Copy setup ///\r\n        this.copyMaterial2D = new ShaderMaterial(\r\n            {\r\n                glslVersion: GLSL3,\r\n                uniforms: {\r\n                    sourceTexture: {},\r\n                },\r\n                vertexShader: vertexCopyShader(),\r\n                fragmentShader: fragmentCopyShader2D(),\r\n                transparent: false,\r\n                side: FrontSide,\r\n                depthTest: false,\r\n                depthWrite: false\r\n            }\r\n        );\r\n        this.copyMaterial3D = new ShaderMaterial(\r\n            {\r\n                glslVersion: GLSL3,\r\n                uniforms: {\r\n                    sourceTexture: {},\r\n                    w: { value: 0.0 }\r\n                },\r\n                vertexShader: vertexCopyShader(),\r\n                fragmentShader: fragmentCopyShader3D(),\r\n                transparent: false,\r\n                side: FrontSide,\r\n                depthTest: false,\r\n                depthWrite: false\r\n            }\r\n        );\r\n        this.copyCamera = new OrthographicCamera(-0.5, 0.5, 0.5, -0.5, 0.1, 10);\r\n        this.copyCamera.position.z = 1;\r\n        this.copyScene = new Scene();\r\n        const copyGeometry = new PlaneGeometry(1, 1);\r\n        this.copyQuad = new Mesh(copyGeometry, this.copyMaterial2D);\r\n        this.copyScene.add(this.copyQuad);\r\n        this.copyScene.matrixAutoUpdate = false;\r\n        this.copyQuad.matrixAutoUpdate = false;\r\n        this.splatsCPUCuling = false;\r\n\r\n    }\r\n    /**\r\n     * Sets the splats visualization quality where 1 is the maximum quality and 0 is the fastest\r\n     * @param {number} quality value between 0 and 1 (1 highest quality) \r\n     */\r\n    setQuality(quality) {\r\n        quality = Math.max(0, Math.min(1, (1 - quality)));\r\n        const k = 2 + quality * 2;\r\n        this.material.uniforms.k.value = k;\r\n        this.material.uniforms.beta_k.value = Math.pow((4.0 * gamma(2.0 / k)) / k, k / 2);\r\n        this.material.uniforms.minSplatPixelSize.value = quality * 5;\r\n        this.material.uniforms.minOpacity.value = 0.01;// + quality * 0.09;\r\n    }\r\n    setSplatsCPUCulling(splatsCPUCuling){\r\n        this.splatsCPUCuling = splatsCPUCuling;\r\n        this.material.uniforms.culling.value = splatsCPUCuling;\r\n    }\r\n    setDepthBias(depthBias){\r\n        this.depthBias = depthBias;\r\n        this.material.uniforms.depthBias.value = this.depthBias;\r\n    }\r\n\r\n    /**\r\n     * Set exposure in EV (stops). Positive values brighten, negative darken.\r\n     * @param {number} exposureEV\r\n     */\r\n    setExposureEV(exposureEV){\r\n        if(this.material && this.material.uniforms && typeof this.material.uniforms.exposureEV !== \"undefined\"){\r\n            this.material.uniforms.exposureEV.value = exposureEV;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set saturation multiplier (1.0 = unchanged).\r\n     * @param {number} saturation\r\n     */\r\n    setSaturation(saturation){\r\n        if(this.material && this.material.uniforms && typeof this.material.uniforms.saturation !== \"undefined\"){\r\n            this.material.uniforms.saturation.value = saturation;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set contrast multiplier (1.0 = unchanged).\r\n     * @param {number} contrast\r\n     */\r\n    setContrast(contrast){\r\n        if(this.material && this.material.uniforms && typeof this.material.uniforms.contrast !== \"undefined\"){\r\n            this.material.uniforms.contrast.value = contrast;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set temperature and tint. temperature in -100..100 (warm/cool), tint in -100..100 (green/magenta).\r\n     * @param {number} temperature\r\n     * @param {number} tint\r\n     */\r\n    setTempTint(temperature, tint){\r\n        if(this.material && this.material.uniforms && typeof this.material.uniforms.tempTint !== \"undefined\"){\r\n            this.material.uniforms.tempTint.value.set(temperature, tint);\r\n        }\r\n    }\r\n    updateShaderParams(camera) {\r\n        const proj = camera.projectionMatrix.elements;\r\n\r\n        this.renderer.getSize(this.material.uniforms.viewportPixelSize.value);\r\n        const pixelRatio = this.renderer.getPixelRatio();\r\n        this.material.uniforms.viewportPixelSize.value.multiplyScalar(pixelRatio)\r\n        if(pixelRatio<1){\r\n            this.material.uniforms.antialiasingFactor.value = 2;//pixelRatio;\r\n        }else{\r\n            this.material.uniforms.antialiasingFactor.value = 2;\r\n        }\r\n        \r\n    }\r\n    dispose() {\r\n        this.material.dispose();\r\n        this.copyMaterial2D.dispose();\r\n        this.copyMaterial3D.dispose();\r\n        this.covarianceRenderTarget.dispose();\r\n        this.positionColorRenderTarget.dispose();\r\n        this.worker.terminate();\r\n        this.worker = null;\r\n        this.orderAttribute.array = undefined;\r\n        this.geometry.dispose();\r\n    }\r\n\r\n    copyTex2D(src, dst, scissorBox, layer) {\r\n        this.copyMaterial2D.uniforms.sourceTexture.value = src;\r\n        const prevAutoClear = this.renderer.autoClear;\r\n        const prevRenderTarget = this.renderer.getRenderTarget();\r\n        this.renderer.autoClear = false;\r\n        const scissorWidth = scissorBox[2] - scissorBox[0];\r\n        const scissorHeight = scissorBox[3] - scissorBox[1];\r\n        dst.viewport.set(scissorBox[0], scissorBox[1], scissorWidth, scissorHeight);\r\n\r\n        this.renderer.setRenderTarget(dst, layer);\r\n        this.renderer.render(this.copyScene, this.copyCamera);\r\n\r\n        this.renderer.setRenderTarget(prevRenderTarget);\r\n\r\n        this.renderer.autoClear = prevAutoClear;\r\n\r\n    }\r\n\r\n    copyTex3D(src, dst, numLayers) {\r\n        this.copyMaterial3D.uniforms.sourceTexture.value = src;\r\n\r\n        const prevAutoClear = this.renderer.autoClear;\r\n        const prevRenderTarget = this.renderer.getRenderTarget();\r\n        this.renderer.autoClear = false;\r\n\r\n        this.copyQuad.material = this.copyMaterial3D;\r\n\r\n        for (let layer = 0; layer < numLayers; layer++) {\r\n            this.renderer.setRenderTarget(dst, layer);\r\n            this.copyMaterial3D.uniforms.w.value = (layer + 0.5) / (numLayers);\r\n            this.renderer.render(this.copyScene, this.copyCamera);\r\n        }\r\n\r\n        this.copyQuad.material = this.copyMaterial2D;\r\n\r\n        this.renderer.setRenderTarget(prevRenderTarget);\r\n        this.renderer.autoClear = prevAutoClear;\r\n\r\n    }\r\n\r\n    /**\r\n     * Specify a size multiplier for splats\r\n     * @param {number} sizeMultiplier \r\n     */\r\n    setSplatsSizeMultiplier(sizeMultiplier) {\r\n        this.material.uniforms.sizeMultiplier.value = sizeMultiplier*(this.scaleMultiplier || 1);\r\n    }\r\n    /**\r\n     * specify a crop radius for splats\r\n     * @param {number} cropRadius \r\n     */\r\n    setSplatsCropRadius(cropRadius) {\r\n        this.material.uniforms.cropRadius.value = cropRadius;\r\n    }\r\n\r\n    sort(cameraPosition, viewProjModel) {\r\n        if (!this.worker) return;\r\n        if (!cameraPosition) {\r\n            this.worker.postMessage({\r\n                method: \"sort\",\r\n                xyz: [this.cameraPosition.x, this.cameraPosition.z, -this.cameraPosition.y],\r\n                vpm: this.viewProjModel && this.splatsCPUCuling?this.viewProjModel.toArray():undefined,\r\n                id: this.sortID++\r\n            })\r\n        }\r\n        else if (!this.cameraPosition || !cameraPosition.equals(this.cameraPosition)) {\r\n            this.cameraPosition.copy(cameraPosition);\r\n            if(!!viewProjModel){\r\n                if (!this.viewProjModel) this.viewProjModel = new Matrix4();\r\n                this.viewProjModel.copy(viewProjModel);\r\n                this.viewProjModel.multiply(inverseZUpToYUpMatrix4x4);\r\n            }else{\r\n                this.viewProjModel = undefined;\r\n            }\r\n            \r\n            \r\n            this.worker.postMessage({\r\n                method: \"sort\",\r\n                xyz: [this.cameraPosition.x, this.cameraPosition.z, -this.cameraPosition.y],\r\n                vpm: this.viewProjModel && this.splatsCPUCuling?this.viewProjModel.toArray():undefined,\r\n                id: this.sortID++\r\n            })\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Apply any pending updates produced by the worker. This method should be\r\n     * called from the render loop (or just before renderer.render) to ensure all\r\n     * GPU / geometry mutations happen at a deterministic point in the frame.\r\n     */\r\n    update() {\r\n        // If there is nothing staged (textures, grows, or geometry) do nothing.\r\n        if (!this._pendingOrder && this._pendingTextureCopies.length === 0 && this._pendingGrowOperations.length === 0) return;\r\n\r\n        // 1) Process pending grow operations (3D texture array expansion) first.\r\n        while (this._pendingGrowOperations.length > 0) {\r\n            const op = this._pendingGrowOperations.shift();\r\n            const oldNum = op.oldNumTextures;\r\n            // Initialize new render targets on the renderer and copy old content into them.\r\n            this.renderer.initRenderTarget(op.newPositionColorRenderTarget);\r\n            // copy existing slices (oldNum) into the new target\r\n            this.copyTex3D(op.oldPositionColorRenderTarget.texture, op.newPositionColorRenderTarget, oldNum);\r\n            op.oldPositionColorRenderTarget.dispose();\r\n            this.positionColorRenderTarget = op.newPositionColorRenderTarget;\r\n            this.material.uniforms.positionColorTexture.value = this.positionColorRenderTarget.texture;\r\n\r\n            this.renderer.initRenderTarget(op.newCovarianceRenderTarget);\r\n            this.copyTex3D(op.oldCovarianceRenderTarget.texture, op.newCovarianceRenderTarget, oldNum);\r\n            op.oldCovarianceRenderTarget.dispose();\r\n            this.covarianceRenderTarget = op.newCovarianceRenderTarget;\r\n            this.material.uniforms.covarianceTexture.value = this.covarianceRenderTarget.texture;\r\n\r\n            // finalize counts/uniforms\r\n            this.numTextures = op.newNumTextures;\r\n            this.material.uniforms.numSlices.value = this.numTextures;\r\n        }\r\n\r\n        // 2) Process pending 2D batch texture uploads (these write into 3D textures using copyTex2D).\r\n        while (this._pendingTextureCopies.length > 0) {\r\n            const item = this._pendingTextureCopies.shift();\r\n            // Create DataTexture from raw array and perform the existing init+copy+dispose flow.\r\n            const dt = new DataTexture(item.array, item.textureSize, item.srcHeight, RGBAFormat, FloatType);\r\n            dt.internalFormat = 'RGBA32F';\r\n            dt.generateMipmaps = false;\r\n            dt.magFilter = NearestFilter;\r\n            dt.minFilter = NearestFilter;\r\n            dt.anisotropy = 0;\r\n            dt.needsUpdate = true;\r\n            this.renderer.initTexture(dt);\r\n\r\n            // determine destination render target\r\n            const dst = (item.kind === 'positionColor') ? this.positionColorRenderTarget : this.covarianceRenderTarget;\r\n            this.copyTex2D(dt, dst, item.scissor, item.destTextureLayer);\r\n            dt.dispose();\r\n        }\r\n\r\n        // 3) Apply geometry / order updates (if any)\r\n        if (this._pendingOrder) {\r\n            const newOrder = this._pendingOrder;\r\n            this.numSplatsRendered = newOrder.length;\r\n\r\n            if (newOrder.length > this.orderAttribute.count) {\r\n                const geometry = new InstancedBufferGeometry();\r\n                const vertices = new Float32Array([-0.5, 0.5, 0, 0.5, 0.5, 0, -0.5, -0.5, 0, 0.5, -0.5, 0]);\r\n                const indices = [0, 2, 1, 2, 3, 1];\r\n\r\n                geometry.setIndex(indices);\r\n                geometry.setAttribute('position', new BufferAttribute(vertices, 3));\r\n                const order = new Uint32Array(this.maxSplats);\r\n\r\n                const orderAttribute = new InstancedBufferAttribute(order, 1, false);\r\n                orderAttribute.needsUpdate = true\r\n                orderAttribute.setUsage(DynamicDrawUsage);\r\n                geometry.setAttribute('order', orderAttribute);\r\n                geometry.instanceCount = 0;\r\n\r\n                this.geometry.dispose();\r\n                this.geometry = geometry;\r\n                this.orderAttribute = orderAttribute;\r\n            }\r\n\r\n            this.orderAttribute.clearUpdateRanges();\r\n            this.orderAttribute.set(newOrder);\r\n            this.orderAttribute.addUpdateRange(0, newOrder.length);\r\n            this.orderAttribute.needsUpdate = true;\r\n            this.geometry.instanceCount = this._pendingInstanceCount;\r\n            this.geometry.needsUpdate = true;\r\n\r\n            // Notify listeners for all pending sort ids.\r\n            for (const sid of this._pendingSortIDs) {\r\n                for (let i = this.sortListeners.length - 1; i >= 0; i--) {\r\n                    const done = this.sortListeners[i](sid);\r\n                    if (done) {\r\n                        this.sortListeners.splice(i, 1);\r\n                    }\r\n                }\r\n            }\r\n\r\n            // Clear order-related staging buffers\r\n            this._pendingOrder = null;\r\n            this._pendingInstanceCount = 0;\r\n            this._pendingSortIDs.length = 0;\r\n        }\r\n    }\r\n    raycast(raycaster, intersects) {\r\n        // overrides the method because the SplatsMesh itself is not meant to be raycast onto, the tiles should be individualy raycast\r\n    }\r\n\r\n    addSplatsTile(positions, colors, cov1, cov2) {\r\n        if (!this.worker) return;\r\n        const self = this;\r\n\r\n        const positionArray = positions.data ? positions.data.array : positions.array;\r\n        const stride = positions.data && positions.data.isInterleavedBuffer ? positions.data.stride : 3;\r\n        const offset = positions.data && positions.data.isInterleavedBuffer ? positions.offset : 0;\r\n        const numBatches = Math.ceil(positionArray.length / (this.batchSize * stride));\r\n        const textureAddresses = [];\r\n        const pointManagerAddresses = [];\r\n\r\n\r\n        /// raycasting ///\r\n        // const start = performance.now();\r\n        let raycast = () => { }\r\n        const positionsOnly = new Float32Array((positionArray.length / stride) * 3);\r\n        const posU32 = new Uint32Array(\r\n            positionsOnly.buffer,\r\n            positionsOnly.byteOffset,\r\n            positionsOnly.length                                              // same element count\r\n        );\r\n\r\n        for (let i = 0; i < positionArray.length / 3; i++) {\r\n            positionsOnly[i * 3] = positionArray[i * stride + offset];\r\n            positionsOnly[i * 3 + 1] = positionArray[i * stride + offset + 1];\r\n            positionsOnly[i * 3 + 2] = positionArray[i * stride + offset + 2];\r\n        }\r\n\r\n        // console.log(performance.now()-start)\r\n        raycast = (ray, intersects, threshold) => {\r\n            const threshSquared = threshold * threshold;\r\n            const cropRadiusSquared = Math.pow(self.material.uniforms.cropRadius.value,2);\r\n            \r\n            // Pre-allocate temporary objects to avoid memory churn in the loop\r\n            const tempMatrix = new Matrix3();\r\n            const splatCenter = new Vector3();\r\n            const V = new Vector3(); // Re-used for multiple vector operations\r\n            const W = new Vector3();\r\n            const closestPointVec = new Vector3();\r\n\r\n            const numSplats = positionsOnly.length / 3;\r\n            for (let i = 0; i < numSplats; i++) {\r\n                // Set splat center, applying the same Y-up transform as the shader\r\n                splatCenter.set(positionsOnly[i * 3], -positionsOnly[i * 3 + 2], positionsOnly[i * 3 + 1]);\r\n\r\n                if (splatCenter.lengthSq() > cropRadiusSquared || ray.distanceSqToPoint(splatCenter) > threshSquared) {\r\n                    continue;\r\n                }\r\n\r\n                reconstructCovariance(cov1, cov2, i, tempMatrix);\r\n                \r\n                const t = V.copy(splatCenter).sub(ray.origin).dot(ray.direction);\r\n                if (t < 0) continue; // Splat is behind the ray's origin\r\n\r\n                closestPointVec.copy(ray.direction).multiplyScalar(t).add(ray.origin);\r\n\r\n                const vecToClosest = V.copy(closestPointVec).sub(splatCenter);\r\n                solve3x3LinearSystem(tempMatrix, vecToClosest, W);\r\n                \r\n                const mahalanobisSq = vecToClosest.dot(W);\r\n\r\n                const hitOpacity = colors.getW(i) * Math.exp(-0.5 * mahalanobisSq);\r\n\r\n                if (hitOpacity > 0.01) {\r\n                    intersects.push({\r\n                        distance: t,\r\n                        point: closestPointVec.clone(),\r\n                        opacity: hitOpacity,\r\n                        type: \"splat\",\r\n                        object: this // Reference to the batch/tile\r\n                    });\r\n                }\r\n            }\r\n        }\r\n\r\n        if (numBatches > this.freeAddresses.size) {\r\n            this.growTextures();\r\n        }\r\n\r\n        for (let i = 0; i < numBatches; i++) {\r\n            const address = this.freeAddresses.poll();\r\n            if (isNaN(address)) {\r\n                console.log(\"insuficient texture size to store splats info\")\r\n            }\r\n            if (address == 0) {\r\n            }\r\n            textureAddresses.push(address);\r\n            pointManagerAddresses.push(address * 3);\r\n            const startIndex = i * this.batchSize;\r\n            this.addSplatsBatch(startIndex, address, posU32, colors, cov1, cov2);\r\n        }\r\n\r\n\r\n        self.worker.postMessage({\r\n            method: \"addBatches\",\r\n            insertionIndexes: pointManagerAddresses,\r\n            positions: positionArray.buffer,\r\n            offset: offset,\r\n            stride: stride,\r\n            batchSize: self.batchSize,\r\n        }, [positionArray.buffer]);\r\n\r\n        let visible = false;\r\n        const hide = () => {\r\n\r\n            if (visible == true && self.worker) {\r\n                self.numVisibleBatches--;\r\n                visible = false;\r\n                self.worker.postMessage({\r\n                    method: \"hideBatches\",\r\n                    insertionIndexes: pointManagerAddresses,\r\n                    xyz: [self.cameraPosition.x, self.cameraPosition.z, -self.cameraPosition.y],\r\n                    vpm: this.viewProjModel && this.splatsCPUCuling?this.viewProjModel.toArray():undefined,\r\n                    id: self.sortID++\r\n                });\r\n            }\r\n\r\n        }\r\n\r\n\r\n        const show = (callback) => {\r\n            if (visible == false && self.worker) {\r\n                self.numVisibleBatches--;\r\n                visible = true;\r\n                const sortID = self.sortID;\r\n                const listener = (id => {\r\n                    if (id >= sortID) {\r\n                        callback();\r\n                        return true;\r\n                    }\r\n                    return false;\r\n                });\r\n                self.sortListeners.push(listener)\r\n\r\n                self.worker.postMessage({\r\n                    method: \"showBatches\",\r\n                    insertionIndexes: pointManagerAddresses,\r\n                    xyz: [self.cameraPosition.x, self.cameraPosition.z, -self.cameraPosition.y],\r\n                    vpm: this.viewProjModel && this.splatsCPUCuling?this.viewProjModel.toArray():undefined,\r\n                    id: self.sortID++\r\n                });\r\n            }\r\n\r\n\r\n        }\r\n        const remove = () => {\r\n            if (!self.worker) return;\r\n            raycast = undefined;\r\n            self.worker.postMessage({\r\n                method: \"removeBatches\",\r\n                insertionIndexes: pointManagerAddresses,\r\n                xyz: [self.cameraPosition.x, self.cameraPosition.z, -self.cameraPosition.y],\r\n                vpm: this.viewProjModel && this.splatsCPUCuling?this.viewProjModel.toArray():undefined,\r\n                id: self.sortID++\r\n            });\r\n            textureAddresses.forEach(address => self.freeAddresses.add(address));\r\n        }\r\n\r\n\r\n\r\n\r\n\r\n        return {\r\n            hide: hide,\r\n            show: show,\r\n            remove: remove,\r\n            sort: this.sort,\r\n            raycast: raycast,\r\n            isSplatsBatch: true\r\n        }\r\n\r\n    }\r\n\r\n\r\n    addSplatsBatch(positionsStartIndex, address, positions, colors, cov1, cov2) {\r\n\r\n\r\n        // New packing:\r\n        // - covariance RT (Float RGBA):\r\n        //   R=packHalf2(cov1.x,cov1.y), G=packHalf2(cov1.z,cov2.x), B=packHalf2(cov2.y,cov2.z), A=pos.x (float)\r\n        // - positionColor RT (Float RGBA):\r\n        //   R=pos.y, G=pos.z, B=packHalf2(color.r,color.g), A=packHalf2(color.b,color.a)\r\n        const positionColorArray = new Float32Array(this.batchSize * 4);\r\n        const covarianceArray = new Float32Array(this.batchSize * 4);\r\n        \r\n        // views to reinterpret u32->f32 without allocations\r\n        const scratch = new ArrayBuffer(4);\r\n        const u32view = new Uint32Array(scratch);\r\n        const f32view = new Float32Array(scratch);\r\n        const u32ToF32 = (u) => { u32view[0] = u >>> 0; return f32view[0]; };\r\n        \r\n        // positions is a Uint32Array view on a Float32Array buffer. Create a Float32 view.\r\n        const posF32 = new Float32Array(positions.buffer, positions.byteOffset, positions.length);\r\n        \r\n        const totalPositions = positions.length / 3;\r\n        for (let i = address; i < address + this.batchSize; i++) {\r\n            const base = i - address;\r\n            const arrayIndexBase4 = base * 4;\r\n        \r\n            const positionIndex = positionsStartIndex + base;\r\n            const pIndex3 = 3 * (positionsStartIndex + base);\r\n        \r\n            if (positionIndex >= totalPositions) break;\r\n        \r\n            // read positions as float\r\n            const px = posF32[pIndex3];\r\n            const py = posF32[pIndex3 + 1];\r\n            const pz = posF32[pIndex3 + 2];\r\n        \r\n            // colors as 0..1 floats\r\n            const cr = colors.getX(positionIndex);\r\n            const cg = colors.getY(positionIndex);\r\n            const cb = colors.getZ(positionIndex);\r\n            const ca = colors.getW(positionIndex);\r\n        \r\n            // covariance half2 packing packed into 32-bit, then reinterpreted as float\r\n            const covRG = packHalf2x16(cov1.getX(positionIndex), cov1.getY(positionIndex));\r\n            const covGA = packHalf2x16(cov1.getZ(positionIndex), cov2.getX(positionIndex));\r\n            const covBA = packHalf2x16(cov2.getY(positionIndex), cov2.getZ(positionIndex));\r\n        \r\n            covarianceArray[arrayIndexBase4]     = u32ToF32(covRG);\r\n            covarianceArray[arrayIndexBase4 + 1] = u32ToF32(covGA);\r\n            covarianceArray[arrayIndexBase4 + 2] = u32ToF32(covBA);\r\n            covarianceArray[arrayIndexBase4 + 3] = px; // position.x as plain float\r\n        \r\n            // positionColor packing\r\n            positionColorArray[arrayIndexBase4]     = py; // pos.y\r\n            positionColorArray[arrayIndexBase4 + 1] = pz; // pos.z\r\n            const colRG = packHalf2x16(cr, cg);\r\n            const colBA = packHalf2x16(cb, ca);\r\n            positionColorArray[arrayIndexBase4 + 2] = u32ToF32(colRG);\r\n            positionColorArray[arrayIndexBase4 + 3] = u32ToF32(colBA);\r\n        }\r\n        \r\n        const destTextureLayer = Math.floor(address / Math.pow(this.textureSize, 2));\r\n        const srcHeight = Math.ceil(this.batchSize / this.textureSize);\r\n        const scissor = [0, (address / this.textureSize) - (destTextureLayer * this.textureSize), this.textureSize];\r\n        scissor.push(scissor[1] + srcHeight);\r\n        \r\n        // Stage texture uploads for the render loop. We transfer the raw arrays and\r\n        // parameters; actual DataTexture creation, initTexture and GPU copy will be\r\n        // performed in update() (so they happen at a deterministic time).\r\n        this._pendingTextureCopies.push({\r\n            kind: 'positionColor',\r\n            array: positionColorArray,\r\n            textureSize: this.textureSize,\r\n            srcHeight: srcHeight,\r\n            scissor: scissor,\r\n            destTextureLayer: destTextureLayer\r\n        });\r\n        this._pendingTextureCopies.push({\r\n            kind: 'covariance',\r\n            array: covarianceArray,\r\n            textureSize: this.textureSize,\r\n            srcHeight: srcHeight,\r\n            scissor: scissor,\r\n            destTextureLayer: destTextureLayer\r\n        });\r\n\r\n    }\r\n\r\n    growTextures() {\r\n\r\n        //const start = performance.now();\r\n        for (let i = this.maxSplats; i < this.maxSplats + (this.textureSize * this.textureSize); i += this.batchSize) {\r\n            this.freeAddresses.add(i);\r\n        }\r\n        this.maxSplats += (this.textureSize * this.textureSize);\r\n\r\n\r\n\r\n        const newNumTextures = this.numTextures + 1;\r\n\r\n        // Create new render target objects but defer the GPU initialization and\r\n        // the copy operation to the render loop via _pendingGrowOperations.\r\n        const positionColorRenderTarget = new WebGL3DRenderTarget(this.textureSize, this.textureSize, newNumTextures, {\r\n            magFilter: NearestFilter,\r\n            minFilter: NearestFilter,\r\n            type: FloatType,\r\n            format: RGBAFormat,\r\n            anisotropy: 0,\r\n            depthBuffer: false,\r\n            resolveDepthBuffer: false,\r\n        })\r\n        positionColorRenderTarget.texture.type = FloatType;\r\n        positionColorRenderTarget.texture.internalFormat = 'RGBA32F';\r\n        positionColorRenderTarget.texture.format = RGBAFormat;\r\n\r\n        const covarianceRenderTarget = new WebGL3DRenderTarget(this.textureSize, this.textureSize, newNumTextures, {\r\n            magFilter: NearestFilter,\r\n            minFilter: NearestFilter,\r\n            anisotropy: 0,\r\n            type: FloatType,\r\n            format: RGBAFormat,\r\n            depthBuffer: false,\r\n            resolveDepthBuffer: false,\r\n        })\r\n        covarianceRenderTarget.texture.type = FloatType;\r\n        covarianceRenderTarget.texture.internalFormat = 'RGBA32F';\r\n        covarianceRenderTarget.texture.format = RGBAFormat;\r\n\r\n        // Stage a grow operation to be handled in update().\r\n        this._pendingGrowOperations.push({\r\n            newPositionColorRenderTarget: positionColorRenderTarget,\r\n            newCovarianceRenderTarget: covarianceRenderTarget,\r\n            oldPositionColorRenderTarget: this.positionColorRenderTarget,\r\n            oldCovarianceRenderTarget: this.covarianceRenderTarget,\r\n            oldNumTextures: this.numTextures,\r\n            newNumTextures: newNumTextures\r\n        });\r\n\r\n        // freeAddresses and maxSplats already updated above; actual texture swap\r\n        // will be finalized in update(), where uniforms and this.numTextures are set.\r\n\r\n        //console.log(\"grow \" + (performance.now() - start) + \" ms\")\r\n    }\r\n\r\n} export { SplatsMesh }\r\n\r\nfunction saveBuffer(pixelBuffer) {\r\n    const canvas = document.createElement('canvas');\r\n    const width = 512;\r\n    const height = 512;\r\n    canvas.width = width;\r\n    canvas.height = height;\r\n    const context = canvas.getContext('2d');\r\n    const imageData = context.createImageData(width, height);\r\n\r\n    // WebGL's coordinate system is bottom-left, so we need to flip the image vertically\r\n    for (let y = 0; y < height; y++) {\r\n        for (let x = 0; x < width; x++) {\r\n            const srcIndex = (y * width + x) * 4;\r\n            const destIndex = ((height - y - 1) * width + x) * 4;\r\n            imageData.data[destIndex] = pixelBuffer[srcIndex];       // R\r\n            imageData.data[destIndex + 1] = pixelBuffer[srcIndex + 1]; // G\r\n            imageData.data[destIndex + 2] = pixelBuffer[srcIndex + 2]; // B\r\n            imageData.data[destIndex + 3] = pixelBuffer[srcIndex + 3]; // A\r\n        }\r\n    }\r\n    context.putImageData(imageData, 0, 0);\r\n\r\n    // 6. Convert the canvas to a PNG and trigger download\r\n    canvas.toBlob((blob) => {\r\n        const url = URL.createObjectURL(blob);\r\n        const link = document.createElement('a');\r\n        link.href = url;\r\n        link.download = `layer_.png`;\r\n        document.body.appendChild(link);\r\n        link.click();\r\n        document.body.removeChild(link);\r\n        URL.revokeObjectURL(url);\r\n    }, 'image/png');\r\n}\r\nexport function splatsVertexShader() {\r\n    return /*glsl */`\r\nprecision highp float;\r\nprecision highp int;\r\nprecision highp sampler3D;\r\n\r\n#include <common>\r\n#include <packing>\r\n\r\nuniform float textureSize;\r\nuniform float numSlices;\r\nuniform float sizeMultiplier;\r\nin highp uint order;\r\nout vec4 color;\r\nout vec2 vUv;\r\nout vec3 splatPositionWorld;\r\nout vec3 splatPositionModel;\r\nout float splatDepth;\r\nout float splatDepthWithBias;\r\nout float stds;\r\nout vec2 viewZW;\r\nout vec3 adjustedColor;\r\nuniform highp sampler3D positionColorTexture;\r\nuniform highp sampler3D covarianceTexture;\r\nuniform mat3 zUpToYUpMatrix3x3;\r\nuniform float logDepthBufFC;\r\nuniform vec2 viewportPixelSize;        // vec2(width , height)\r\nuniform float k;\r\nuniform float beta_k; // pow((4.0 * gamma(2.0/k)) /k, k/2)\r\nuniform float minSplatPixelSize;\r\nuniform float minOpacity;\r\nuniform bool culling;\r\nuniform float antialiasingFactor;\r\nuniform float cropRadius;\r\nuniform float depthBias; // depth bias in meters\r\n\r\nuniform float exposureEV;    // stops\r\nuniform float saturation;    // linear saturation multiplier\r\nuniform float contrast;      // linear contrast multiplier\r\nuniform vec2 tempTint;       // temperature, tint (approximation)\r\n\r\n\r\nvoid getVertexData(out vec3 position, out mat3 covariance) {\r\n\r\n    highp uint uOrder = order;\r\n\r\n    uint uTextureSize = uint(textureSize);\r\n    uint uPixelsPerSlice = uTextureSize * uTextureSize;\r\n\r\n    uint sliceIndexVal = uOrder / uPixelsPerSlice;\r\n    uint slicePixelIndex = uOrder % uPixelsPerSlice;\r\n\r\n    uint xVal = slicePixelIndex % uTextureSize;\r\n    uint yVal = slicePixelIndex / uTextureSize;\r\n\r\n    // integer texel coords\r\n    ivec3 coord = ivec3(xVal, yVal, sliceIndexVal);\r\n\r\n    // Fetch float RGBA from both textures\r\n    vec4 posCol = texelFetch(positionColorTexture, coord, 0);\r\n    vec4 covTex = texelFetch(covarianceTexture, coord, 0);\r\n\r\n    // Decode covariance from packed half2 stored in float channels (R,G,B)\r\n    uint covR = floatBitsToUint(covTex.r);\r\n    uint covG = floatBitsToUint(covTex.g);\r\n    uint covB = floatBitsToUint(covTex.b);\r\n    vec2 c0 = unpackHalf2x16(covR);\r\n    vec2 c1 = unpackHalf2x16(covG);\r\n    vec2 c2 = unpackHalf2x16(covB);\r\n    covariance = mat3(c0.x, c0.y, c1.x,\r\n                      c0.y, c1.y, c2.x,\r\n                      c1.x, c2.x, c2.y);\r\n\r\n    // Position: x in covariance alpha, y/z in positionColor r/g\r\n    float px = covTex.a;\r\n    float py = posCol.r;\r\n    float pz = posCol.g;\r\n    position = vec3(px, py, pz);\r\n\r\n    // Color packed as two half2 in positionColor b/a\r\n    uint rgPacked = floatBitsToUint(posCol.b);\r\n    uint baPacked = floatBitsToUint(posCol.a);\r\n    vec2 rg = unpackHalf2x16(rgPacked);\r\n    vec2 ba = unpackHalf2x16(baPacked);\r\n    color = vec4(rg.x, rg.y, ba.x, ba.y);\r\n\r\n    // Transform covariance like before (reduce repeated transpose/mul temps)\r\n    mat3 z = zUpToYUpMatrix3x3;\r\n    mat3 zT = transpose(z);\r\n    mat3 modelRotation = z * transpose(mat3(modelMatrix));\r\n    covariance = zT * covariance * z;\r\n    covariance = transpose(modelRotation) * covariance * modelRotation;\r\n}\r\n\r\nbool modelTransform(in vec3 splatWorld, in mat3 covariance, inout vec3 vertexPosition) {\r\n\r\n    /* camera‑space Jacobian rows ----------------------------------------- */\r\n    vec3 posCam = (viewMatrix * vec4(splatWorld, 1.0)).xyz;\r\n    float invZ  = 1.0 / posCam.z;\r\n    float invZ2 = invZ * invZ;\r\n    float fx    = projectionMatrix[0][0];\r\n    float fy    = projectionMatrix[1][1];\r\n\r\n    vec3 j0 = vec3(fx * invZ,            0.0, -fx * posCam.x * invZ2);\r\n    vec3 j1 = vec3(0.0,  fy * invZ, -fy * posCam.y * invZ2);\r\n\r\n    mat3 viewRotT = transpose(mat3(viewMatrix));\r\n    //viewRotT *= 2.0;\r\n    vec3 j0W = viewRotT * j0*4.0;\r\n    vec3 j1W = viewRotT * j1*4.0;\r\n\r\n    vec3 tmp0 = covariance * j0W;\r\n    vec3 tmp1 = covariance * j1W;\r\n    float a = dot(j0W, tmp0);\r\n    float b = dot(j0W, tmp1);\r\n    float c = dot(j1W, tmp1);\r\n    float sigmaNDC = (antialiasingFactor / viewportPixelSize.x) * 2.0;\r\n    float k2 = sigmaNDC * sigmaNDC;\r\n    float detOrig = a * c - b * b;\r\n    a += k2;\r\n    c += k2;\r\n    float detBlur = a * c - b * b;\r\n    color.a *= sqrt(clamp(detOrig / detBlur, 0.0, 1.0-1.0e-6));\r\n    if(color.a < 0.01) return false;\r\n    //color.a = 1.0;\r\n    float halfTrace = 0.5 * (a + c);\r\n    float rootTerm  = sqrt(max(halfTrace * halfTrace - (a * c - b * b), 0.0));\r\n    float lambda1   = halfTrace + rootTerm;\r\n    float lambda2   = halfTrace - rootTerm;\r\n\r\n    if(min(lambda2,lambda1)<=0.0) {\r\n        return false;\r\n    }\r\n    \r\n\r\n\r\n    vec2 eig1 = (abs(b) < 1e-7)\r\n              ? ((a >= c) ? vec2(1.0, 0.0) : vec2(0.0, 1.0))\r\n              : normalize(vec2(b, lambda1 - a));\r\n    vec2 eig2 = vec2(-eig1.y, eig1.x);\r\n\r\n    eig1 *= sqrt(lambda1) * 2.0;\r\n    eig2 *= sqrt(lambda2) * 2.0;\r\n\r\n    float alpha = dot(j0, j0);\r\n    float beta  = dot(j0, j1);\r\n    float gamma = dot(j1, j1);\r\n    float invDet = 1.0 / (alpha * gamma - beta * beta);\r\n\r\n    vec3 deltaCam1 = ( gamma * eig1.x - beta * eig1.y) * j0 +\r\n                     (-beta * eig1.x + alpha * eig1.y) * j1;\r\n    vec3 deltaCam2 = ( gamma * eig2.x - beta * eig2.y) * j0 +\r\n                     (-beta * eig2.x + alpha * eig2.y) * j1;\r\n    deltaCam1 *= invDet*0.5;\r\n    deltaCam2 *= invDet*0.5;\r\n\r\n    vec3 axisW1 = viewRotT * deltaCam1;\r\n    vec3 axisW2 = viewRotT * deltaCam2;\r\n\r\n    vertexPosition = vertexPosition.x * axisW1 + vertexPosition.y * axisW2;\r\n    return true;\r\n}\r\n\r\n\r\nvoid main() {\r\n    vUv = vec2(position);\r\n\r\n    mat3 covariance;\r\n    getVertexData(splatPositionModel, covariance);\r\n\r\n    covariance *=sizeMultiplier*sizeMultiplier;\r\n\r\n    if(length(splatPositionModel) > cropRadius) return;\r\n    \r\n    /* opacity ‑> stds */\r\n    float maxV = min(1.0, max(color.a, 0.0001));\r\n    float thresh = min(minOpacity, maxV);\r\n    if (thresh >= maxV) return;\r\n    float lnRatio = log(thresh / maxV);\r\n    float invK = 1.0 / k;\r\n    stds = pow(-8.0 * lnRatio / beta_k, invK); // sqrt(2.0 * log(maxV / thresh));\r\n    \r\n\r\n    splatPositionWorld = (modelMatrix * vec4(splatPositionModel, 1.0)).xyz;\r\n    vec4 splatProjectionView = viewMatrix * vec4(splatPositionWorld, 1.0);\r\n    vec4 splatPositionProjected = projectionMatrix * splatProjectionView;\r\n    splatProjectionView.z += depthBias;\r\n    vec4 splatPositionProjectedWithBias = projectionMatrix * splatProjectionView;\r\n\r\n    if(culling){\r\n        float clip = 1.2 * splatPositionProjected.w;\r\n        if (splatPositionProjected.z < -splatPositionProjected.w || splatPositionProjected.x < -clip || splatPositionProjected.x > clip || splatPositionProjected.y < -clip || splatPositionProjected.y > clip) {\r\n            gl_Position = vec4(0.0, 0.0, 2.0, 1.0);\r\n            return;\r\n        }\r\n    }\r\n    \r\n\r\n    float halfStds = 0.5 * stds;\r\n    vec3 offsetWorld = vec3(position) * halfStds;\r\n    \r\n    bool valid = modelTransform(splatPositionWorld, covariance, offsetWorld);\r\n    if(!valid) return;\r\n    splatPositionWorld+=offsetWorld;\r\n    vec4 outPosition = projectionMatrix * viewMatrix * vec4(splatPositionWorld,1.0);\r\n    \r\n    \r\n    \r\n    gl_Position = outPosition;\r\n    viewZW = outPosition.zw;\r\n    \r\n    #if defined( USE_LOGARITHMIC_DEPTH_BUFFER )\r\n\t    float isPerspective = float( isPerspectiveMatrix( projectionMatrix ) );\r\n        splatDepthWithBias = isPerspective == 0.0 ? splatPositionProjectedWithBias.z : log2( 1.0 + splatPositionProjectedWithBias.w ) * logDepthBufFC * 0.5;\r\n        splatDepth = isPerspective == 0.0 ? splatPositionProjected.z : log2( 1.0 + splatPositionProjected.w ) * logDepthBufFC * 0.5;\r\n    #else\r\n        splatDepthWithBias = (splatPositionProjectedWithBias.z / splatPositionProjectedWithBias.w)* 0.5 + 0.5;\r\n        splatDepth = (splatPositionProjected.z / splatPositionProjected.w)* 0.5 + 0.5;\r\n    #endif\r\n\r\n    // Work in linear color space\r\n    adjustedColor = color.xyz;\r\n\r\n    // Exposure (stops)\r\n    float exposureMul = exp2(exposureEV);\r\n\r\n    // Temp/Tint -> simple RGB gains approximation\r\n    float t = clamp(tempTint.x / 100.0, -1.0, 1.0); // temperature -100..100\r\n    float ti = clamp(tempTint.y / 100.0, -1.0, 1.0); // tint -100..100\r\n    // approximate mapping: warm -> increase R and B in different amounts, tint adjusts G\r\n    vec3 wbGain = vec3(1.0 + 0.15 * t, 1.0 + 0.05 * ti, 1.0 - 0.25 * t);\r\n\r\n    adjustedColor *= exposureMul * wbGain;\r\n\r\n    // Saturation (linear)\r\n    const vec3 lumaWeights = vec3(0.2126,0.7152,0.0722);\r\n    float L = dot(adjustedColor, lumaWeights);\r\n    adjustedColor = mix(vec3(L), adjustedColor, saturation);\r\n\r\n    // Contrast (linear, pivot around 0.5)\r\n    adjustedColor = (adjustedColor - 0.5) * contrast + 0.5;\r\n}\r\n`};\r\nexport function splatsFragmentShader() {\r\n    return /* glsl */`\r\nprecision highp float;\r\nprecision highp int;\r\n\r\nin float stds;\r\nin vec4 color;\r\nin vec3 adjustedColor; // saturation/contrast/exposure/temperature adjusted\r\nin vec2 vUv;\r\nin vec3 splatPositionModel;\r\nin vec3 splatPositionWorld;\r\nin float splatDepth;\r\nin float splatDepthWithBias;\r\n\r\nlayout(location = 0) out vec4 fragColor;\r\n\r\nuniform float textureSize;\r\n\r\nuniform float k;\r\nuniform float beta_k; // pow((4.0 * gamma(2.0/k)) /k, k/2)\r\n\r\nvoid main() {\r\n    float l = dot(vUv, vUv);\r\n    if (l > 0.25) discard;           // early out unchanged\r\n    vec2  p   = vUv * stds;\r\n    float r2  = dot(p, p);           // r²\r\n    float rk  = pow(r2, 0.5 * k);    // r^{k}\r\n    float alpha = color.w * exp(-beta_k * rk);\r\n\r\n    vec3 display = pow(clamp(adjustedColor, 0.0, 1.0), vec3(1.0/2.2));\r\n\r\n    fragColor = vec4(display, alpha);\r\n    gl_FragDepth = splatDepthWithBias;\r\n    \r\n}`\r\n};\r\n\r\nfunction vertexCopyShader() {\r\n    return /* glsl */`\r\n\r\nprecision highp float;\r\nprecision highp int;\r\n\r\nout vec2 vUv;\r\n\r\nvoid main() {\r\n    vUv = uv;\r\n    gl_Position = projectionMatrix * modelViewMatrix * vec4(position, 1.0);\r\n}`\r\n};\r\n\r\nfunction fragmentCopyShader2D() {\r\n    return /* glsl */`\r\nprecision highp float;\r\nprecision highp int;\r\nprecision highp sampler2D;\r\n\r\nlayout(location = 0) out vec4 fragColor;\r\nuniform sampler2D sourceTexture;\r\n\r\nin vec2 vUv;\r\n\r\nvoid main() {\r\n    fragColor = texture( sourceTexture, vUv );\r\n}`\r\n};\r\n\r\n\r\nfunction fragmentCopyShader3D() {\r\n    return /* glsl */`\r\nprecision highp float;\r\nprecision highp int;\r\nprecision highp sampler3D;\r\n\r\nlayout(location = 0) out vec4 fragColor;\r\nuniform sampler3D sourceTexture;\r\nuniform float w;\r\n\r\nin vec2 vUv;\r\n\r\nvoid main() {\r\n    fragColor = texture( sourceTexture, vec3(vUv, w) );\r\n}`\r\n};\r\n\r\n/**\r\n * Reconstructs the covariance matrix from cov1 and cov2 buffer attributes\r\n * into a target Matrix3 object. This avoids allocating new matrices in a loop.\r\n * @param {import(\"three\").BufferAttribute | import(\"three\").InterleavedBufferAttribute} cov1 - The buffer attribute for the first 3 covariance components.\r\n * @param {import(\"three\").BufferAttribute | import(\"three\").InterleavedBufferAttribute} cov2 - The buffer attribute for the last 3 unique covariance components.\r\n * @param {number} index - The index of the splat.\r\n * @param {import(\"three\").Matrix3} target - The target Matrix3 to store the result.\r\n */\r\nfunction reconstructCovariance(cov1, cov2, index, target) {\r\n    const c1x = cov1.getX(index);\r\n    const c1y = cov1.getY(index);\r\n    const c1z = cov1.getZ(index);\r\n    const c2x = cov2.getX(index);\r\n    const c2y = cov2.getY(index);\r\n    const c2z = cov2.getZ(index);\r\n\r\n    target.set(\r\n        c1x, c1y, c1z, // Row 1\r\n        c1y, c2x, c2y, // Row 2\r\n        c1z, c2y, c2z  // Row 3\r\n    );\r\n}\r\n\r\n/**\r\n * Solves the 3x3 linear system A*x = b for x using Cramer's rule.\r\n * This is faster than computing a full matrix inverse.\r\n * @param {import(\"three\").Matrix3} A - The 3x3 matrix.\r\n * @param {import(\"three\").Vector3} b - The result vector.\r\n * @param {import(\"three\").Vector3} target - The target vector to store the solution x.\r\n */\r\nfunction solve3x3LinearSystem(A, b, target) {\r\n    const det = A.determinant();\r\n    if (Math.abs(det) < 1e-12) { // Check for singularity\r\n        target.set(0, 0, 0);\r\n        return;\r\n    }\r\n    const invDet = 1.0 / det;\r\n\r\n    const t1 = new Matrix3().copy(A);\r\n    t1.elements[0] = b.x; t1.elements[3] = b.y; t1.elements[6] = b.z;\r\n    \r\n    const t2 = new Matrix3().copy(A);\r\n    t2.elements[1] = b.x; t2.elements[4] = b.y; t2.elements[7] = b.z;\r\n\r\n    const t3 = new Matrix3().copy(A);\r\n    t3.elements[2] = b.x; t3.elements[5] = b.y; t3.elements[8] = b.z;\r\n\r\n    target.set(\r\n        t1.determinant() * invDet,\r\n        t2.determinant() * invDet,\r\n        t3.determinant() * invDet\r\n    );\r\n}","// Engine-agnostic collider shape descriptors for primitive colliders.\r\n/**\r\n * Engine-agnostic collider shape descriptors.\r\n * Each function returns a plain object { kind: string, params: object } that can be\r\n * consumed by any worker/engine adapter (Rapier, Jolt, etc.).\r\n *\r\n * Conventions (matching Rapier 3D):\r\n * - Cuboid/Box uses half-extents (hx, hy, hz)\r\n * - RoundCuboid uses half-extents + radius\r\n * - Capsule uses halfHeight and radius\r\n * - Cone uses halfHeight and radius\r\n * - Cylinder uses halfHeight and radius\r\n * - Ball uses radius\r\n * - Segment uses endpoints a,b as [x,y,z]\r\n * - Triangle uses points a,b,c as [x,y,z]\r\n * - Polyline uses vertices (Float32Array|number[]) and optional indices (Uint32Array|number[])\r\n * - ConvexHull uses vertices (Float32Array|number[])\r\n * - Heightfield uses rows, cols, heights (Float32Array|number[]), and scale {x,y,z}\r\n *\r\n * Note: Any scaling should be baked into the params before creating the descriptor.\r\n */\r\n\r\nfunction assertVec3(name, v) {\r\n  if (!v || (Array.isArray(v) && v.length !== 3)) {\r\n    throw new Error(`${name} must be a length-3 array [x,y,z]`);\r\n  }\r\n  return v;\r\n}\r\n\r\nfunction createBall(radius) {\r\n  return { kind: 'ball', params: { radius: Number(radius) } };\r\n}\r\n\r\nfunction createCuboid(hx, hy, hz) {\r\n  return { kind: 'cuboid', params: { hx: Number(hx), hy: Number(hy), hz: Number(hz) } };\r\n}\r\n\r\n// Convenience alias\r\nfunction createBox(hx, hy, hz) {\r\n  return createCuboid(hx, hy, hz);\r\n}\r\n\r\nfunction createRoundCuboid(hx, hy, hz, radius) {\r\n  return { kind: 'roundCuboid', params: { hx: Number(hx), hy: Number(hy), hz: Number(hz), radius: Number(radius) } };\r\n}\r\n\r\nfunction createCapsule(halfHeight, radius) {\r\n  return { kind: 'capsule', params: { halfHeight: Number(halfHeight), radius: Number(radius) } };\r\n}\r\n\r\nfunction createCone(halfHeight, radius) {\r\n  return { kind: 'cone', params: { halfHeight: Number(halfHeight), radius: Number(radius) } };\r\n}\r\n\r\nfunction createCylinder(halfHeight, radius) {\r\n  return { kind: 'cylinder', params: { halfHeight: Number(halfHeight), radius: Number(radius) } };\r\n}\r\n\r\nfunction createSegment(a, b) {\r\n  return { kind: 'segment', params: { a: assertVec3('a', a), b: assertVec3('b', b) } };\r\n}\r\n\r\nfunction createTriangle(a, b, c) {\r\n  return { kind: 'triangle', params: { a: assertVec3('a', a), b: assertVec3('b', b), c: assertVec3('c', c) } };\r\n}\r\n\r\nfunction createPolyline(vertices, indices) {\r\n  return { kind: 'polyline', params: { vertices, indices: indices || null } };\r\n}\r\n\r\nfunction createConvexHull(vertices) {\r\n  return { kind: 'convexHull', params: { vertices } };\r\n}\r\n\r\nfunction createHeightfield(rows, cols, heights, scale = { x: 1, y: 1, z: 1 }) {\r\n  return { kind: 'heightfield', params: { rows: Number(rows), cols: Number(cols), heights, scale } };\r\n}\r\n\r\nexport const ColliderShape = {\r\n  createBall,\r\n  createCuboid,\r\n  createBox,\r\n  createRoundCuboid,\r\n  createCapsule,\r\n  createCone,\r\n  createCylinder,\r\n  createSegment,\r\n  createTriangle,\r\n  createPolyline,\r\n  createConvexHull,\r\n  createHeightfield\r\n};\r\n","import * as THREE from 'three';\r\nimport { OBB } from \"../geometry/obb\";\r\nimport { TileLoader } from \"./TileLoader\";\r\nimport { v4 as uuidv4 } from \"uuid\";\r\nimport * as path from \"path-browserify\"\r\nimport { resolveImplicite } from './implicit/ImplicitTileResolver.js';\r\nimport { SplatsMesh } from '../splats/SplatsMesh';\r\nimport { SplatsMeshWebGPU } from '../splats/SplatsMeshWebGPU';\r\nimport {ColliderShape} from '../simulation/ColliderShape';\r\nvar averageTime = 0;\r\n\r\n\r\nvar copyrightDiv;\r\nconst tempSphere = new THREE.Sphere(new THREE.Vector3(0, 0, 0), 1);\r\nconst tempOBB = new OBB([0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1]);\r\nconst tempBox3 = new THREE.Box3();\r\nconst tempVec1 = new THREE.Vector3(0, 0, 0);\r\nconst tempVec2 = new THREE.Vector3(0, 0, 0);\r\n\r\nconst upVector = new THREE.Vector3(0, 1, 0);\r\nconst tempRay = new THREE.Ray();\r\nconst inverseWorld = new THREE.Matrix4();\r\nconst transformedProjection = new THREE.Matrix4();\r\nconst frustum = new THREE.Frustum();\r\nconst transformedCameraPosition = new THREE.Vector3();\r\nconst tempIntersects = [];\r\n\r\nconst tempQuaternion = new THREE.Quaternion();\r\nconst copyright = {};\r\n\r\n/**\r\n * @returns a list of vendors that are required by copyright to be displayed in the app.\r\n */\r\nfunction getOGC3DTilesCopyrightInfo() {\r\n    var list = [];\r\n    for (let key in copyright) {\r\n        if (copyright.hasOwnProperty(key) && copyright[key] > 0) { // This checks if the key is actually part of the object and not its prototype.\r\n            list.push(key);\r\n        }\r\n    }\r\n    return list;\r\n\r\n}\r\n\r\n\r\n/**\r\n * class representing a tiled and multileveled mesh or point-cloud according to the OGC3DTiles 1.1 spec\r\n * @class\r\n * @extends {THREE.Object3D}\r\n */\r\nclass OGC3DTile extends THREE.Object3D {\r\n\r\n    /**\r\n     * @param {Object} [properties] - the properties for this tileset\r\n     * @param {String} [properties.url] - the url to the parent tileset.json\r\n     * @param {Object} [properties.queryParams = undefined] - optional, path params to add to individual tile urls\r\n     * @param {Number} [properties.geometricErrorMultiplier = 1] - the geometric error of the parent. 1.0 by default corresponds to a maxScreenSpaceError of 16\r\n     * @param {Boolean} [properties.loadOutsideView = false] - if truthy, tiles otside the camera frustum will be loaded with the least possible amount of detail\r\n     * @param {TileLoader} [properties.tileLoader = undefined] - A tile loader that can be shared among tilesets in order to share a common cache.\r\n     * @param {Function} [properties.meshCallback = undefined] - A callback function that will be called on every mesh (if TileLoader is provided, this function will be overridden by the tileLoader's own callback)\r\n     * @param {Function} [properties.pointsCallback = undefined] - A callback function that will be called on every points (if TileLoader is provided, this function will be overridden by the tileLoader's own callback)\r\n     * @param {Function} [properties.onLoadCallback = undefined] - A callback function that will be called when the root tile has been loaded\r\n     * @param {OcclusionCullingService} [properties.occlusionCullingService = undefined] - A service that handles occlusion culling\r\n     * @param {Boolean} [properties.centerModel = false] - If true, the tileset will be centered on 0,0,0 and in the case of georeferenced tilesets that use the \"region\" bounding volume, it will also be rotated so that the up axis matched the world y axis.\r\n     * @param {Boolean} [properties.static = false] - If true, the tileset is considered static which improves performance but the matrices aren't automatically updated\r\n     * @param {String} [properties.rootPath = undefined] - optional the root path for fetching children\r\n     * @param {String} [properties.json = undefined] - optional json object representing the tileset sub-tree\r\n     * @param {Number} [properties.parentGeometricError = undefined] - optional geometric error of the parent\r\n     * @param {Object} [properties.parentBoundingVolume = undefined] - optional bounding volume of the parent\r\n     * @param {String} [properties.parentRefine = undefined] - optional refine strategy of the parent of the parent\r\n     * @param {THREE.Camera} [properties.cameraOnLoad = undefined] - optional the camera used when loading this particular sub-tile\r\n     * @param {THREE.Box3|THREE.Sphere|OBB} [properties.clipShape = undefined] - optional, specify a clip shape object in world space and tiles outside of the shape will not be loaded. The shape is either a THREE.Box3, THREE.Sphere or OBB (import {OBB} from \"threedtiles\")\r\n     * @param {OGC3DTile} [properties.parentTile = undefined] - optional the OGC3DTile object that loaded this tile as a child\r\n     * @param {String} [properties.proxy = undefined] - optional the url to a proxy service. Instead of fetching tiles via a GET request, a POST will be sent to the proxy url with the real tile address in the body of the request.\r\n     * @param {Boolean} [properties.displayErrors = false] - optional value indicating that errors should be shown on screen.\r\n     * @param {THREE.Renderer} [properties.renderer = undefined] - optional the renderer used to display the tileset. Used to infer render resolution at runtime and to instantiate a ktx2loader on the fly if not provided. \r\n     * @param {Number} [properties.domWidth = undefined] - optional the canvas width (used to calculate geometric error). If a renderer is provided, it'll be used instead, else a default value is used.  \r\n     * @param {Number} [properties.domHeight = undefined] - optional the canvas height (used to calculate geometric error). If a renderer is provided, it'll be used instead, else a default value is used.  \r\n     * @param {DracoLoader} [properties.dracoLoader = undefined] - optional a draco loader (three/addons).\r\n     * @param {KTX2Loader} [properties.ktx2Loader = undefined] - optional a ktx2 loader (three/addons).\r\n     * @param {Number} [properties.distanceBias = 1] - optional a bias that allows loading more or less detail closer to the camera relative to far away. The value should be a positive number. A value below 1 loads less detail near the camera and a value above 1 loads more detail near the camera. This needs to be compensated by the geometricErrorMultiplier in order to load a reasonable number of tiles.\r\n     * @param {String} [properties.loadingStrategy = \"INCREMENTAL\"] - optional a strategy for loading tiles \r\n     *      -  \"INCREMENTAL\" loads intermediate LODs and will load nearer tiles first\r\n     *      -  \"PERLEVEL\" loads intermediate LODs and loads nearer tiles first but waits for all tiles of the lowest level to be loaded before loading higher detail tiles\r\n     *      -  \"IMMEDIATE\" skips intermediate LODs. tiles are missing until loaded when moving to a new area\r\n     * @param {String} [properties.drawBoundingVolume = false] - optional draws the bounding volume (may cause flickering)\r\n     * @param {String} [properties.splatsFragmentShader = undefined] - optional pass a custom fragment shader for rendering splats\r\n     * @param {number} [properties.splatsQuality = 0.75] - optional pass a visual quality for splats between 0 and 1. Lower quality improves performance at the cost of visual approximations.\r\n     * @param {boolean} [properties.splatsCPUCulling = false] - optional if true, splats are culled on CPU asynchronously. Better frame-rate and faster sorting but splats are absent when camera moves quickly until sort finishes.\r\n     *\r\n     * @param {number} [properties.splatsExposureEV = 0.0] - optional exposure compensation in EV (stops). Typical useful range: -6 → +6. Positive brightens, negative darkens.\r\n     * @param {number} [properties.splatsSaturation = 1.0] - optional saturation multiplier. Typical useful range: 0.0 → 2.0 (1.0 = unchanged).\r\n     * @param {number} [properties.splatsContrast = 1.0] - optional contrast multiplier. Typical useful range: 0.0 → 2.0 (1.0 = unchanged).\r\n     * @param {Array|Object} [properties.splatsTempTint = [0.0, 0.0]] - optional temperature and tint pair for simple white-balance adjustment. Values: temperature ∈ [-100,100], tint ∈ [-100,100]. Default [0,0].\r\n     * @param {Object} [properties.physics.sim = undefined] - physics sim helper {@link physics.js}\r\n     * @param {String} [properties.physics.type = fixed] - type: 'dynamic' | 'kinematic' | 'fixed' (default 'fixed')\r\n     * @param {String} [properties.physics.shape = none] - LEGACY single collider shape: 'none' | 'mesh' | 'bounds' | 'hull'. Used only when no advanced collider rules are provided.\r\n     * @param {number} [properties.physics.mass = 1] - mass\r\n     * @param {number} [properties.physics.maxLOD = infinity] - LEGACY global max LOD for constructing colliders. Higher is more accurate and more costly. Only the currently loaded LODs are used.\r\n     * @param {Array|Vector3} [properties.physics.velocity = [0,0,0]] - velocity vector\r\n     * @param {Array|Vector3} [properties.physics.angularVelocity = [0,0,0]] - angular velocity\r\n     *\r\n     * @param {Object} [properties.physics.colliders] - ADVANCED rules to mix different collider types by geometricError or by level (LOD).\r\n     * @param {number} [properties.physics.colliders.maxLOD] - Global LOD cap for colliders. If omitted, falls back to properties.physics.maxLOD, else Infinity.\r\n     * @param {string[]} [properties.physics.colliders.priority=[\"mesh\",\"hull\",\"bounds\"]] - Priority when multiple rules match the same tile. First entry wins.\r\n     * @param {Object[]} [properties.physics.colliders.byGeometricError] - Preferred criterion when provided. Inclusive ranges on geometricError.\r\n     * @param {(\"mesh\"|\"hull\"|\"bounds\")} properties.physics.colliders.byGeometricError[].shape - Collider type to use in this range.\r\n     * @param {number} properties.physics.colliders.byGeometricError[].min - Inclusive minimum geometricError for the rule (defaults to -Infinity if omitted).\r\n     * @param {number} properties.physics.colliders.byGeometricError[].max - Exclusive maximum geometricError for the rule (defaults to +Infinity if omitted).\r\n     * @param {Object[]} [properties.physics.colliders.byLevel] - Fallback criterion when byGeometricError is absent/empty. Inclusive ranges on integer level (LOD).\r\n     * @param {(\"mesh\"|\"hull\"|\"bounds\")} properties.physics.colliders.byLevel[].shape - Collider type to use in this LOD interval.\r\n     * @param {number} properties.physics.colliders.byLevel[].min - Inclusive minimum LOD (integer).\r\n     * @param {number} properties.physics.colliders.byLevel[].max - Inclusive maximum LOD (integer).\r\n     * @param {(\"mesh\"|\"hull\"|\"bounds\")} [properties.physics.colliders.defaultShape] - Optional fallback shape when no rule matches. If omitted, legacy properties.physics.shape is used. If neither present, no collider is created.\r\n     *\r\n     * Selection rules:\r\n     *  - If colliders.byGeometricError has entries, it is used exclusively. Otherwise, byLevel is used when present.\r\n     *  - If multiple rules match, the first in colliders.priority is chosen (default priority is [\"mesh\",\"hull\",\"bounds\"]).\r\n     *  - If no rule matches, defaultShape is used; if absent, falls back to legacy properties.physics.shape; otherwise no collider is created.\r\n     *  - The colliders.maxLOD (or legacy maxLOD) acts as a global cap. Tiles with level > maxLOD never get colliders.\r\n     *  - When a tile becomes invisible, existing colliders at level === maxLOD are retained if the tile has children (as a fallback for deeper LODs), identical to legacy behavior.\r\n     * e.g. (physics.colliders):\r\n     * {\r\n     *   \"maxLOD\": 4,\r\n     *   \"priority\": [\"mesh\", \"hull\", \"bounds\"],\r\n     *   \"byLevel\": [\r\n     *     { \"shape\": \"mesh\",   \"min\": 4, \"max\": 4 },\r\n     *     { \"shape\": \"hull\",   \"min\": 3,  \"max\": 3 },\r\n     *     { \"shape\": \"bounds\", \"min\": 0,  \"max\": 2  }\r\n     *   ],\r\n     *   \"defaultShape\": \"bounds\"\r\n     * }\r\n     */\r\n    constructor(properties) {\r\n        super();\r\n        const self = this;\r\n        self.physics = properties.physics || {};\r\n        const p = self.physics;\r\n        if (p && typeof p === 'object') {\r\n            if (!p.type) p.type = 'fixed';\r\n            if (p.shape == null) p.shape = 'none';\r\n            if (p.mass == null) p.mass = 1;\r\n            if (!Array.isArray(p.velocity) && !(p.velocity && p.velocity.isVector3)) p.velocity = [0, 0, 0];\r\n            if (!Array.isArray(p.angularVelocity) && !(p.angularVelocity && p.angularVelocity.isVector3)) p.angularVelocity = [0, 0, 0];\r\n            if (p.maxLOD == null) p.maxLOD = Infinity;\r\n\r\n            // Normalize advanced colliders API if provided\r\n            if (p.colliders && typeof p.colliders === 'object') {\r\n                const c = p.colliders;\r\n                if (c.maxLOD == null) c.maxLOD = (Number.isFinite(p.maxLOD) ? p.maxLOD : Infinity);\r\n                if (!Array.isArray(c.priority)) c.priority = [\"mesh\", \"hull\", \"bounds\"];\r\n                else {\r\n                    c.priority = c.priority.filter(x => x === \"mesh\" || x === \"hull\" || x === \"bounds\");\r\n                    if (c.priority.length === 0) c.priority = [\"mesh\", \"hull\", \"bounds\"];\r\n                }\r\n                if (!Array.isArray(c.byGeometricError)) c.byGeometricError = [];\r\n                if (!Array.isArray(c.byLevel)) c.byLevel = [];\r\n            }\r\n        }\r\n\r\n\r\n        self.splatsMesh = properties.splatsMesh;\r\n        self.oldUltraMeshSplats = properties.oldUltraMeshSplats;\r\n        self.iosCompatibility = properties.iosCompatibility\r\n        self.splatsQuality = properties.splatsQuality != undefined ? properties.splatsQuality : 0.75;\r\n        self.splatsCPUCulling = properties.splatsCPUCulling != undefined ? properties.splatsCPUCulling : false;\r\n        this.contentURL = [];\r\n        if (!!properties.domWidth && !!properties.domHeight) {\r\n            this.rendererSize = new THREE.Vector2(properties.domWidth, properties.domHeight);\r\n        } else {\r\n            this.rendererSize = new THREE.Vector2(1000, 1000);\r\n        }\r\n        this.setClipShape(properties.clipShape);\r\n        this.loadingStrategy = properties.loadingStrategy ? properties.loadingStrategy.toUpperCase() : \"INCREMENTAL\";\r\n        this.distanceBias = Math.max(0.0001, properties.distanceBias ? properties.distanceBias : 1);\r\n        this.proxy = properties.proxy;\r\n        this.drawBoundingVolume = properties.drawBoundingVolume ? properties.drawBoundingVolume : false;\r\n        this.displayErrors = properties.displayErrors;\r\n        this.displayCopyright = properties.displayCopyright;\r\n        if (properties.queryParams) {\r\n            this.queryParams = { ...properties.queryParams };\r\n        }\r\n        this.uuid = uuidv4();\r\n        if (!!properties.tileLoader) {\r\n            this.tileLoader = properties.tileLoader;\r\n        } else {\r\n            const tileLoaderOptions = {};\r\n            tileLoaderOptions.meshCallback = !properties.meshCallback ? (mesh, geometricError) => {\r\n                mesh.material.wireframe = false;\r\n                mesh.material.side = THREE.DoubleSide;\r\n            } : properties.meshCallback;\r\n            tileLoaderOptions.pointsCallback = !properties.pointsCallback ? (points, geometricError) => {\r\n                points.material.size = Math.pow(geometricError, 0.33);\r\n                points.material.sizeAttenuation = true;\r\n            } : properties.pointsCallback;\r\n            tileLoaderOptions.proxy = this.proxy;\r\n            tileLoaderOptions.renderer = properties.renderer;\r\n            tileLoaderOptions.dracoLoader = properties.dracoLoader;\r\n            tileLoaderOptions.ktx2Loader = properties.ktx2Loader;\r\n            self.tileLoader = new TileLoader(tileLoaderOptions);\r\n            const update = this.update\r\n            this.update = (camera) => {\r\n                update.call(self, camera);\r\n                self.tileLoader.update();\r\n            }\r\n        }\r\n        this.displayCopyright = !!properties.displayCopyright;\r\n        // set properties general to the entire tileset\r\n        this.geometricErrorMultiplier = !!properties.geometricErrorMultiplier ? properties.geometricErrorMultiplier : 1.0;\r\n        this.splatsCropRadius = Number.MAX_VALUE;\r\n        this.splatsSizeMultiplier = 1;\r\n\r\n        // Visual tuning defaults for splats (may be overridden by constructor properties)\r\n        /** @type {number} */ this.splatsExposureEV = (properties && typeof properties.splatsExposureEV !== \"undefined\") ? properties.splatsExposureEV : 0.0;\r\n        /** @type {number} */ this.splatsSaturation = (properties && typeof properties.splatsSaturation !== \"undefined\") ? properties.splatsSaturation : 1.0;\r\n        /** @type {number} */ this.splatsContrast = (properties && typeof properties.splatsContrast !== \"undefined\") ? properties.splatsContrast : 1.0;\r\n        // allow passing an array [temp,tint] or an object; normalize to [temp, tint]\r\n        const _tt = (properties && typeof properties.splatsTempTint !== \"undefined\") ? properties.splatsTempTint : [0.0, 0.0];\r\n        this.splatsTempTint = Array.isArray(_tt) ? [Number(_tt[0] || 0.0), Number(_tt[1] || 0.0)] : [Number(_tt.temp || 0.0), Number(_tt.tint || 0.0)];\r\n\r\n        this.renderer = properties.renderer;\r\n        this.meshCallback = properties.meshCallback;\r\n        this.loadOutsideView = properties.loadOutsideView;\r\n        this.cameraOnLoad = properties.cameraOnLoad;\r\n        this.parentTile = properties.parentTile;\r\n        this.occlusionCullingService = properties.occlusionCullingService;\r\n        this.static = properties.static;\r\n        if (this.occlusionCullingService) {\r\n            this.color = new THREE.Color();\r\n            this.color.setHex(Math.random() * 0xffffff);\r\n            this.colorID = THREE.MathUtils.clamp(self.color.r * 255, 0, 255) << 16 ^ THREE.MathUtils.clamp(self.color.g * 255, 0, 255) << 8 ^ THREE.MathUtils.clamp(self.color.b * 255, 0, 255) << 0;\r\n        }\r\n        if (this.static) {\r\n            this.matrixAutoUpdate = false;\r\n            this.matrixWorldAutoUpdate = false;\r\n        }\r\n\r\n        // declare properties specific to the tile for clarity\r\n        this.childrenTiles = [];\r\n        this.meshContent = [];\r\n        this.tileContent;\r\n        this.refine; // defaults to \"REPLACE\"\r\n        this.rootPath;\r\n        this.geometricError;\r\n        this.boundingVolume;\r\n        this.json; // the json corresponding to this tile\r\n        this.materialVisibility = false;\r\n        this.level = properties.level ? properties.level : 0;\r\n        this.hasMeshContent = 0; // true when the provided json has a content field pointing to a B3DM file\r\n        this.hasUnloadedJSONContent = 0; // true when the provided json has a content field pointing to a JSON file that is not yet loaded\r\n        this.centerModel = properties.centerModel;\r\n        this.abortController = new AbortController();\r\n\r\n        this.onLoadCallback = properties.onLoadCallback;\r\n        //this.layers.disable(0);\r\n        //this.octree = new Octree();\r\n\r\n        if (!!properties.json) { // If this tile is created as a child of another tile, properties.json is not null\r\n\r\n            self._setup(properties);\r\n\r\n\r\n        } else if (properties.url) { // If only the url to the tileset.json is provided\r\n            var url = properties.url;\r\n            if (self.queryParams) {\r\n                var props = \"\";\r\n                for (let key in self.queryParams) {\r\n                    if (self.queryParams.hasOwnProperty(key)) {\r\n                        props += \"&\" + key + \"=\" + self.queryParams[key];\r\n                    }\r\n                }\r\n                if (url.includes(\"?\")) {\r\n                    url += props;\r\n                } else {\r\n                    url += \"?\" + props.substring(1);\r\n                }\r\n            }\r\n\r\n\r\n            var fetchFunction;\r\n            if (self.proxy) {\r\n                fetchFunction = () => {\r\n                    return fetch(self.proxy,\r\n                        {\r\n                            method: 'POST',\r\n                            body: url,\r\n                            signal: self.abortController.signal\r\n                        }\r\n                    );\r\n                }\r\n            } else {\r\n                fetchFunction = () => {\r\n                    return fetch(url, { signal: self.abortController.signal });\r\n                }\r\n            }\r\n            fetchFunction().then(result => {\r\n                if (!result.ok) {\r\n                    throw new Error(`couldn't load \"${properties.url}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                }\r\n                result.json().then(json => { return resolveImplicite(json, url) }).then(json => {\r\n                    self._setup({ rootPath: path.dirname(properties.url), json: json });\r\n                });\r\n            }).catch(e => { if (self.displayErrors) _showError(e) });\r\n        }\r\n    }\r\n\r\n\r\n    /**\r\n     * specify a clip shape object in world space and tiles outside of the shape will not be loaded.\r\n     * @param {THREE.Box3|THREE.Sphere|OBB} [clipShape = undefined] The shape is either a THREE.Box3, THREE.Sphere or OBB (import {OBB} from \"threedtiles\")\r\n     */\r\n    setClipShape(clipShape) {\r\n        if (clipShape instanceof OBB || clipShape instanceof THREE.Sphere) {\r\n            this.clipShape = clipShape;\r\n        }\r\n        else if (clipShape instanceof THREE.Box3) {\r\n            const center = new THREE.Vector3();\r\n            const halfSize = new THREE.Vector3();\r\n\r\n            clipShape.getCenter(center);\r\n            clipShape.getSize(halfSize).multiplyScalar(0.5);\r\n\r\n            // rotation is identity by default, so we omit the third argument\r\n            this.clipShape = new OBB([\r\n                center.x, center.y, center.z,\r\n                halfSize.x, 0, 0,\r\n                0, halfSize.y, 0,\r\n                0, 0, halfSize.z\r\n            ]);\r\n        }\r\n        else {\r\n            clipShape = undefined;\r\n        }\r\n        if (this.childrenTiles) {\r\n            this.childrenTiles.forEach(ct => {\r\n                ct._setClipShape(this.clipShape);\r\n            })\r\n        }\r\n\r\n    }\r\n\r\n    _setClipShape(clipShape) {\r\n        this.clipShape = clipShape;\r\n        if (this.childrenTiles) {\r\n            this.childrenTiles.forEach(ct => {\r\n                ct._setClipShape(this.clipShape);\r\n            })\r\n        }\r\n    }\r\n    /**\r\n     * Specify a size multiplier for splats\r\n     * @param {number} sizeMultiplier \r\n     */\r\n    setSplatsSizeMultiplier(sizeMultiplier) {\r\n        this.splatsSizeMultiplier = sizeMultiplier;\r\n        if (this.splatsMesh) {\r\n            this.splatsMesh.setSplatsSizeMultiplier(this.splatsSizeMultiplier)\r\n        }\r\n    }\r\n    /**\r\n     * specify a crop radius for splats\r\n     * @param {number} cropRadius \r\n     */\r\n    setSplatsCropRadius(cropRadius) {\r\n        this.splatsCropRadius = cropRadius;\r\n        if (this.splatsMesh) {\r\n            this.splatsMesh.setSplatsCropRadius(this.splatsCropRadius)\r\n        }\r\n    }\r\n\r\n    /**\r\n     * set a depth bias to render splats in front of other objects even when they are marginally behind. (avoids overlap issues when overlaying on mesh)\r\n     * @param {number} depthBias \r\n     */\r\n    setSplatsDepthBias(depthBias) {\r\n        this.splatsDepthBias = depthBias;\r\n        if (this.splatsMesh) {\r\n            this.splatsMesh.setDepthBias(this.splatsDepthBias)\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set the splats to use CPU culling. Faster sort and better frame rate at the cost of splats being absent when camera moves quickly.\r\n     * @param {boolean} splatsCPUCulling \r\n     */\r\n    setSplatsCPUCulling(splatsCPUCulling) {\r\n        this.splatsCPUCulling = splatsCPUCulling;\r\n        if (this.splatsMesh) this.splatsMesh.setSplatsCPUCulling(splatsCPUCulling)\r\n    }\r\n\r\n    setSplatsQuality(splatsQuality) {\r\n        this.splatsQuality = splatsQuality;\r\n        if (this.splatsMesh) this.splatsMesh.setQuality(splatsQuality)\r\n    }\r\n\r\n    /**\r\n     * Set exposure compensation (EV stops) for splats in this tile.\r\n     * @param {number} splatsExposureEV exposure in EV (stops). Useful range: -6 → +6. Positive brightens, negative darkens.\r\n     */\r\n    setSplatsExposureEV(splatsExposureEV) {\r\n        this.splatsExposureEV = splatsExposureEV;\r\n        if (this.splatsMesh && typeof this.splatsMesh.setExposureEV === \"function\") {\r\n            this.splatsMesh.setExposureEV(splatsExposureEV);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set saturation multiplier for splats in this tile.\r\n     * @param {number} splatsSaturation saturation multiplier. Useful range: 0.0 → 2.0 (1.0 = unchanged).\r\n     */\r\n    setSplatsSaturation(splatsSaturation) {\r\n        this.splatsSaturation = splatsSaturation;\r\n        if (this.splatsMesh && typeof this.splatsMesh.setSaturation === \"function\") {\r\n            this.splatsMesh.setSaturation(splatsSaturation);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set contrast multiplier for splats in this tile.\r\n     * @param {number} splatsContrast contrast multiplier. Useful range: 0.0 → 2.0 (1.0 = unchanged).\r\n     */\r\n    setSplatsContrast(splatsContrast) {\r\n        this.splatsContrast = splatsContrast;\r\n        if (this.splatsMesh && typeof this.splatsMesh.setContrast === \"function\") {\r\n            this.splatsMesh.setContrast(splatsContrast);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Set temperature and tint for splats in this tile.\r\n     * @param {number} splatsTemperature temperature adjustment in range [-100,100] (warm/cool).\r\n     * @param {number} splatsTint tint adjustment in range [-100,100] (green/magenta).\r\n     */\r\n    setSplatsTempTint(splatsTemperature, splatsTint) {\r\n        this.splatsTempTint = [splatsTemperature, splatsTint];\r\n        if (this.splatsMesh && typeof this.splatsMesh.setTempTint === \"function\") {\r\n            this.splatsMesh.setTempTint(splatsTemperature, splatsTint);\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Manually updates all the matrices of the tileset. \r\n     * To be called after transforming a {@link OGC3DTile tileset} instantiated with the \"static\" option\r\n     */\r\n    updateMatrices() {\r\n        this.updateMatrix();\r\n        if (this.splatsMesh) this.splatsMesh.updateMatrix();\r\n        if (this.static) {\r\n            this.traverse(o => {\r\n                if (o.isObject3D) {\r\n                    o.matrixWorldAutoUpdate = true;\r\n                }\r\n            });\r\n            if (this.splatsMesh) this.splatsMesh.matrixWorldAutoUpdate = true;\r\n        }\r\n        this.updateMatrixWorld(true);\r\n\r\n        if (this.static) {\r\n            this.traverse(o => {\r\n                if (o.isObject3D) o.matrixWorldAutoUpdate = false;\r\n            });\r\n            if (this.splatsMesh) this.splatsMesh.matrixWorldAutoUpdate = false;\r\n        }\r\n    }\r\n    /**\r\n     * Call this to specify the canvas width/height when it changes (used to compute tiles geometric error that controls tile refinement).\r\n     * It's unnecessary to call this when the {@link OGC3DTile} is instantiated with the renderer.\r\n     * \r\n     * @param {Number} width \r\n     * @param {Number} height \r\n     */\r\n    setCanvasSize(width, height) {\r\n        this.rendererSize.set(width, height);\r\n    }\r\n\r\n    async _setup(properties) {\r\n        const self = this;\r\n\r\n\r\n        if (properties.json.extensionsRequired) {\r\n            if (properties.json.extensionsRequired.includes(\"JDULTRA_gaussian_splats\") || properties.json.extensionsRequired.includes(\"JDULTRA_gaussian_splats_V2\")) {\r\n                self.oldUltraMeshSplats = true;\r\n            }\r\n        }\r\n        if (!!properties.json.root) {\r\n            self.json = properties.json.root;\r\n            if (!self.json.refine) self.json.refine = properties.json.refine;\r\n            if (!self.json.geometricError) self.json.geometricError = properties.json.geometricError;\r\n            if (!self.json.transform) self.json.transform = properties.json.transform;\r\n            if (!self.json.boundingVolume) self.json.boundingVolume = properties.json.boundingVolume;\r\n        } else {\r\n            self.json = properties.json;\r\n        }\r\n\r\n\r\n        if (!self.json.children) {\r\n            if (self.json.getChildren) {\r\n                self.json.children = await self.json.getChildren();\r\n            } else {\r\n                self.json.children = [];\r\n            }\r\n        }\r\n        self.rootPath = !!properties.json.rootPath ? properties.json.rootPath : properties.rootPath;\r\n\r\n        // decode refine\r\n        if (!!self.json.refine) {\r\n            self.refine = self.json.refine;\r\n        } else {\r\n            self.refine = properties.parentRefine;\r\n        }\r\n        // decode geometric error\r\n        if (!!self.json.geometricError) {\r\n            self.geometricError = self.json.geometricError;\r\n        } else {\r\n            self.geometricError = properties.parentGeometricError;\r\n        }\r\n\r\n\r\n        // decode transform\r\n        if (!!self.json.transform) {\r\n            let mat = new THREE.Matrix4();\r\n            mat.elements = self.json.transform;\r\n            self.applyMatrix4(mat);\r\n\r\n        }\r\n\r\n        /* self.matrixWorldNeedsUpdate = true;\r\n        //self.updateMatrix();\r\n        if (self.parentTile) {\r\n            self.parentTile.updateMatrixWorld(true);\r\n            //self.parentTile.updateWorldMatrix(true, true);\r\n        } */\r\n\r\n        // decode volume\r\n        if (!!self.json.boundingVolume) {\r\n            if (!!self.json.boundingVolume.box) {\r\n                self.boundingVolume = new OBB(self.json.boundingVolume.box);\r\n            } else if (!!self.json.boundingVolume.region) {\r\n                const region = self.json.boundingVolume.region;\r\n                self._transformWGS84ToCartesian(region[0], region[1], region[4], tempVec1);\r\n                self._transformWGS84ToCartesian(region[2], region[3], region[5], tempVec2);\r\n                tempVec1.lerp(tempVec2, 0.5);\r\n                self.boundingVolume = new THREE.Sphere(new THREE.Vector3(tempVec1.x, tempVec1.y, tempVec1.z), tempVec1.distanceTo(tempVec2));\r\n            } else if (!!self.json.boundingVolume.sphere) {\r\n                const sphere = self.json.boundingVolume.sphere;\r\n                self.boundingVolume = new THREE.Sphere(new THREE.Vector3(sphere[0], sphere[1], sphere[2]), sphere[3]);\r\n            } else {\r\n                self.boundingVolume = properties.parentBoundingVolume;\r\n            }\r\n        } else {\r\n            self.boundingVolume = properties.parentBoundingVolume;\r\n        }\r\n\r\n\r\n\r\n\r\n\r\n        function _checkContent(e) {\r\n            if (!!e.uri && e.uri.includes(\"json\")) {\r\n                self.hasUnloadedJSONContent++;\r\n            } else if (!!e.url && e.url.includes(\"json\")) {\r\n                self.hasUnloadedJSONContent++;\r\n            } else {\r\n                self.hasMeshContent++;\r\n            }\r\n        }\r\n\r\n        if (!!self.json.content) { //if there is a content, json or otherwise, schedule it to be loaded \r\n            _checkContent(self.json.content);\r\n            if (self.hasMeshContent == 0) {\r\n                self.level = Math.max(0, self.parentTile ? self.parentTile.level + 0.01 : 0.0);\r\n            }\r\n            self._load();\r\n\r\n        } else if (!!self.json.contents) { //if there is a content, json or otherwise, schedule it to be loaded \r\n            self.json.contents.forEach(e => _checkContent(e))\r\n            if (self.hasMeshContent == 0) {\r\n                self.level = Math.max(0, self.parentTile ? self.parentTile.level + 0.01 : 0.0);\r\n            }\r\n\r\n            //scheduleLoadTile(this);\r\n        }\r\n\r\n\r\n        if (!!self.centerModel) {\r\n            tempVec2.copy(self.boundingVolume.center);\r\n\r\n            //tempSphere.applyMatrix4(self.matrixWorld);\r\n            if (!!this.json.boundingVolume.region) {\r\n                this._transformWGS84ToCartesian(\r\n                    (this.json.boundingVolume.region[0] + this.json.boundingVolume.region[2]) * 0.5,\r\n                    (this.json.boundingVolume.region[1] + this.json.boundingVolume.region[3]) * 0.5,\r\n                    (this.json.boundingVolume.region[4] + this.json.boundingVolume.region[5]) * 0.5,\r\n                    tempVec1);\r\n\r\n                tempQuaternion.setFromUnitVectors(tempVec1.normalize(), upVector.normalize());\r\n                self.applyQuaternion(tempQuaternion);\r\n            }\r\n            tempVec2.applyMatrix4(self.matrix);\r\n            self.position.sub(tempVec2);\r\n\r\n            self.updateMatrices();\r\n            //self.updateMatrixWorld(true);\r\n        }\r\n        if (self.onLoadCallback) {\r\n            self.onLoadCallback(self);\r\n        }\r\n        if (!self.parentTile && self.physics && self.physics.sim) {\r\n            self.physics.rigidBodyID = self.physics.sim.addObject({\r\n                object: self,\r\n                type: self.physics.type,\r\n                mass: self.physics.mass,\r\n                position: self.position,\r\n                rotation: self.quaternion,\r\n                velocity: self.physics.velocity,\r\n                angularVelocity: self.physics.angularVelocity\r\n            });\r\n\r\n\r\n\r\n        }\r\n        self.isSetup = true;\r\n\r\n\r\n        if (self.level > 0 && self.drawBoundingVolume) {\r\n            if (self.bbox) {\r\n                console.log(\"double setup\")\r\n            }\r\n            if (this.boundingVolume.aabb) {\r\n                let box = this.boundingVolume.aabb.clone();\r\n                box.applyMatrix4(this.matrixWorld);\r\n                self.bbox = new THREE.Box3Helper(box, new THREE.Color(Math.random(), Math.random(), Math.random()));\r\n                //self.bbox.renderOrder = -1;\r\n                self.add(self.bbox);\r\n                self.bbox.material.visible = false;\r\n            } else if (self.boundingVolume instanceof OBB) {\r\n                self.bbox = self.boundingVolume.helper();\r\n                self.add(self.bbox);\r\n                self.bbox.material.visible = false;\r\n            }\r\n        }\r\n\r\n    }\r\n    _assembleURL(root, relative) {\r\n        // Append a slash to the root URL if it doesn't already have one\r\n        if (!root.endsWith('/')) {\r\n            root += '/';\r\n        }\r\n\r\n        try {\r\n            const rootUrl = new URL(root);\r\n            let rootParts = rootUrl.pathname.split('/').filter(p => p !== '');\r\n            let relativeParts = relative.split('/').filter(p => p !== '');\r\n\r\n            for (let i = 1; i <= rootParts.length; i++) {\r\n                if (i >= relativeParts.length) break;\r\n                const rootToken = rootParts.slice(rootParts.length - i, rootParts.length).join('/');\r\n                const relativeToken = relativeParts.slice(0, i).join('/');\r\n                if (rootToken === relativeToken) {\r\n                    for (let j = 0; j < i; j++) {\r\n                        rootParts.pop();\r\n                    }\r\n                    break;\r\n                }\r\n            }\r\n\r\n            while (relativeParts.length > 0 && relativeParts[0] === '..') {\r\n                rootParts.pop();\r\n                relativeParts.shift();\r\n            }\r\n\r\n            return `${rootUrl.protocol}//${rootUrl.host}/${[...rootParts, ...relativeParts].join('/')}`;\r\n        } catch (e) {\r\n            // If URL construction fails (likely a local path), fall back to simple concatenation.\r\n            // Ensure we don't accidentally produce double slashes.\r\n            if (!root.endsWith('/') && !relative.startsWith('/')) {\r\n                return root + '/' + relative;\r\n            } else {\r\n                return root + relative;\r\n            }\r\n        }\r\n    }\r\n\r\n    _extractQueryParams(url, params) {\r\n        try {\r\n            const urlObj = new URL(url);\r\n\r\n            // Iterate over all the search parameters\r\n            for (let [key, value] of urlObj.searchParams) {\r\n                params[key] = value;\r\n            }\r\n\r\n            // Remove the query string\r\n            urlObj.search = '';\r\n            return urlObj.toString();\r\n        } catch (e) {\r\n            // If URL construction fails (e.g. local file paths), return the original input URL unchanged.\r\n            return url;\r\n        }\r\n    }\r\n    async _load(loadJson = true, loadMesh = true) {\r\n\r\n        var self = this;\r\n        if (self.deleted && loadMesh) return;\r\n        if (!!self.json.content) {\r\n            await loadContent(self.json.content, null, loadJson, loadMesh);\r\n        } else if (!!self.json.contents) {\r\n            let promises = self.json.contents.map((content, index) => loadContent(content, index, loadJson, loadMesh));\r\n\r\n            Promise.all(promises)\r\n            //self.json.contents.forEach(content=> loadContent(content, i))\r\n        }\r\n\r\n        async function loadContent(content, contentIndex, loadJson, loadMesh) {\r\n            let url;\r\n            if (!!content.uri) {\r\n                url = content.uri;\r\n            } else if (!!content.url) {\r\n                url = content.url;\r\n            }\r\n            const urlRegex = /^(?:http|https|ftp|tcp|udp):\\/\\/\\S+/;\r\n\r\n            if (urlRegex.test(self.rootPath)) { // url\r\n\r\n                if (!urlRegex.test(url)) {\r\n                    url = self._assembleURL(self.rootPath, url);\r\n                }\r\n            } else { //path\r\n                url = self.rootPath + path.sep + url;\r\n            }\r\n            if (!url.startsWith(\"/local-tiles\")) {\r\n                url = self._extractQueryParams(url, self.queryParams);\r\n            }\r\n            if (self.queryParams) {\r\n                var props = \"\";\r\n                for (let key in self.queryParams) {\r\n                    if (self.queryParams.hasOwnProperty(key)) { // This check is necessary to skip properties from the object's prototype chain\r\n                        props += \"&\" + key + \"=\" + self.queryParams[key];\r\n                    }\r\n                }\r\n                if (url.includes(\"?\")) {\r\n                    url += props;\r\n                } else {\r\n                    url += \"?\" + props.substring(1);\r\n                }\r\n            }\r\n\r\n            if (!!url) {\r\n                self.contentURL.push(url);\r\n                if (loadMesh && (url.includes(\".b3dm\") || url.includes(\".glb\") || url.includes(\".gltf\"))) {\r\n\r\n                    try {\r\n\r\n                        self.tileLoader.get(self.abortController, self.uuid, url, mesh => {\r\n\r\n                            if (!!self.deleted) {\r\n                                return;\r\n                            }\r\n\r\n\r\n                            if (mesh.asset && mesh.asset.copyright) {\r\n                                mesh.asset.copyright.split(';').forEach(s => {\r\n                                    if (!!copyright[s]) {\r\n                                        copyright[s]++;\r\n                                    } else {\r\n                                        copyright[s] = 1;\r\n                                    }\r\n                                });\r\n                                if (self.displayCopyright) {\r\n                                    _updateCopyrightLabel();\r\n                                }\r\n                            }\r\n\r\n                            if (mesh.isSplatsData) {\r\n                                if (!self.splatsMesh) {\r\n\r\n                                    //self.splatsMesh = self.tileLoader.renderer.isWebGPURenderer? new SplatsMeshWebGPU(self.tileLoader.renderer): new SplatsMesh(self.tileLoader.renderer, undefined, undefined, self.oldUltraMeshSplats?0.25:1);\r\n                                    self.splatsMesh = new SplatsMesh(self.tileLoader.renderer, undefined, undefined, self.oldUltraMeshSplats ? 0.25 : 1);\r\n                                    self.splatsMesh.setQuality(self.splatsQuality);\r\n                                    self.splatsMesh.setSplatsCPUCulling(self.splatsCPUCulling)\r\n                                    self.splatsMesh.setSplatsCropRadius(self.splatsCropRadius)\r\n                                    self.splatsMesh.setSplatsSizeMultiplier(self.splatsSizeMultiplier)\r\n\r\n                                    // Apply any visual tuning parameters that might have been set on the OGC3DTile\r\n                                    if (typeof self.splatsExposureEV !== \"undefined\" && typeof self.splatsMesh.setExposureEV === \"function\") {\r\n                                        self.splatsMesh.setExposureEV(self.splatsExposureEV);\r\n                                    }\r\n                                    if (typeof self.splatsSaturation !== \"undefined\" && typeof self.splatsMesh.setSaturation === \"function\") {\r\n                                        self.splatsMesh.setSaturation(self.splatsSaturation);\r\n                                    }\r\n                                    if (typeof self.splatsContrast !== \"undefined\" && typeof self.splatsMesh.setContrast === \"function\") {\r\n                                        self.splatsMesh.setContrast(self.splatsContrast);\r\n                                    }\r\n                                    if (typeof self.splatsTempTint !== \"undefined\" && typeof self.splatsMesh.setTempTint === \"function\") {\r\n                                        const tt = self.splatsTempTint || [0.0, 0.0];\r\n                                        self.splatsMesh.setTempTint(tt[0], tt[1]);\r\n                                    }\r\n\r\n                                    if (self.static) {\r\n                                        self.splatsMesh.matrixAutoUpdate = false;\r\n                                        self.splatsMesh.matrixWorldAutoUpdate = false;\r\n                                    }\r\n                                    self.add(self.splatsMesh);\r\n                                    self.updateMatrices();\r\n                                }\r\n                                mesh = self.splatsMesh.addSplatsTile(mesh.positions, mesh.colors, mesh.cov0, mesh.cov1)\r\n\r\n\r\n                            }\r\n\r\n                            if (!mesh.isSplatsBatch) {\r\n\r\n\r\n                                mesh.traverse((o) => {\r\n                                    if (o.isMesh || o.isPoints) {\r\n                                        o.layers.disable(0);\r\n\r\n                                        //if(o.material.transparent) o.layers.enable(31);\r\n                                    }\r\n                                    if (o.isMesh) {\r\n\r\n                                        if (self.occlusionCullingService) {\r\n                                            const position = o.geometry.attributes.position;\r\n                                            const colors = [];\r\n                                            for (let i = 0; i < position.count; i++) {\r\n                                                colors.push(self.color.r, self.color.g, self.color.b);\r\n                                            }\r\n                                            o.geometry.setAttribute('color', new THREE.Float32BufferAttribute(colors, 3));\r\n                                        }\r\n\r\n                                        //o.material.visible = false;\r\n                                    }\r\n                                });\r\n                                self.add(mesh);\r\n                                self.updateMatrices();\r\n\r\n                            }\r\n\r\n                            self.meshContent.push(mesh);\r\n                            return mesh;\r\n\r\n                        }, !self.cameraOnLoad ? () => 0 : () => {\r\n                            /* if (self.parentTile && (self.parentTile.metric != undefined && self.parentTile.metric < 0) || self.parentTile.deleted) {\r\n                                return Number.MAX_VALUE;\r\n                            }  */\r\n\r\n                            if (self.loadingStrategy == \"IMMEDIATE\") {\r\n                                return self._calculateDistanceToCamera(self.cameraOnLoad);\r\n                            }\r\n                            if (self.loadingStrategy == \"INCREMENTAL\") {\r\n\r\n                                if (self.parentTile) {\r\n                                    return self.parentTile._calculateDistanceToCamera(self.cameraOnLoad) / Math.max(1, self.parentTile.level);\r\n                                } else {\r\n                                    return self._calculateDistanceToCamera(self.cameraOnLoad) / Math.max(1, self.level);\r\n                                }\r\n                                /* if (self.parentTile) {\r\n                                    if(self.parentTile.materialVisibility) return 0;\r\n                                    return 1/self.parentTile._calculateDistanceToCamera(self.cameraOnLoad);\r\n                                } else {\r\n                                    return 0;\r\n                                } */\r\n                            }\r\n                            if (self.loadingStrategy == \"PERLEVEL\") {\r\n                                if (self.parentTile) {\r\n                                    return self.level + self.parentTile._calculateDistanceToCamera(self.cameraOnLoad);\r\n                                } else {\r\n                                    return self.level + self._calculateDistanceToCamera(self.cameraOnLoad);\r\n                                }\r\n                            }\r\n                            return 0;\r\n\r\n                            /* let multiplier = 1;\r\n                            if ((self.metric!=undefined && self.metric < 0) || self.deleted) multiplier = 2;\r\n                            if (self.parentTile) {\r\n                                return self.parentTile._calculateDistanceToCamera(self.cameraOnLoad) * multiplier * self.level;\r\n                            } else {\r\n                                return self._calculateDistanceToCamera(self.cameraOnLoad) * multiplier * self.level;\r\n                            } */\r\n                        }, () => self._getSiblings(),\r\n                            self.level,\r\n                            self.loadingStrategy,\r\n                            !!self.json.boundingVolume.region ? false : true,\r\n                            !!self.json.boundingVolume.region,\r\n                            self.geometricError,\r\n                            self.oldUltraMeshSplats\r\n                        );\r\n                    } catch (e) {\r\n                        if (self.displayErrors) _showError(e)\r\n                    }\r\n\r\n\r\n                } else if (loadJson && url.includes(\".json\")) {\r\n                    self.jsonRequested = url;\r\n                    self.tileLoader.get(self.abortController, self.uuid, url, async json => {\r\n                        self.jsonReceived = true;\r\n                        //if (!!self.deleted) return;\r\n\r\n                        json.rootPath = path.dirname(url);\r\n                        self.json.children.push(json);\r\n                        if (contentIndex == null) {\r\n                            delete self.json.content;\r\n                        } else {\r\n                            delete self.json.contents.splice(contentIndex, 1);\r\n                        }\r\n\r\n                        self.hasUnloadedJSONContent--;\r\n                        /* self.matrixWorldNeedsUpdate = true;\r\n                        self.updateMatrix();\r\n                        if (self.parentTile) {\r\n                            self.parentTile.updateMatrixWorld(true);\r\n                            //self.parentTile.updateWorldMatrix(true, true);\r\n                        } */\r\n                        //return json;\r\n                    });\r\n\r\n                }\r\n\r\n\r\n                /* self.matrixWorldNeedsUpdate = true;\r\n                self.updateMatrix();\r\n                if (self.parentTile) {\r\n                    self.parentTile.updateMatrixWorld(true);\r\n                    //self.parentTile.updateWorldMatrix(true, true);\r\n                } */\r\n            }\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Disposes of all the resources used by the tileset.\r\n     */\r\n    dispose() {\r\n        const self = this;\r\n\r\n        if (self.physics && self.physics.sim) {\r\n            if (self.colliderUUID) {\r\n                self.physics.sim.detachCollider({ colliderId: self.colliderUUID });\r\n                self.colliderUUID = undefined;\r\n            }\r\n            if (Array.isArray(self.colliderUUIDs) && self.colliderUUIDs.length) {\r\n                for (const colId of self.colliderUUIDs) {\r\n                    self.physics.sim.detachCollider({ colliderId: colId });\r\n                }\r\n                self.colliderUUIDs = [];\r\n            }\r\n        }\r\n\r\n        self.meshContent.forEach(mc => {\r\n            if (!!mc && !!mc.asset && mc.asset.copyright) {\r\n                mc.asset.copyright.split(';').forEach(s => {\r\n                    if (!!copyright[s]) {\r\n                        copyright[s]--;\r\n                    }\r\n                });\r\n                if (self.displayCopyright) {\r\n                    _updateCopyrightLabel();\r\n                }\r\n            }\r\n        })\r\n\r\n\r\n\r\n        self.childrenTiles.forEach(tile => tile.dispose());\r\n        self.deleted = true;\r\n\r\n        if (self.splatsMesh) {\r\n\r\n            self.meshContent.forEach(splat => splat.hide());\r\n            if (!self.parentTile) {\r\n                self.splatsMesh.dispose();\r\n                self.splatsMesh = undefined;\r\n            }\r\n        }\r\n        if (!!self.contentURL) {\r\n            self.contentURL.forEach(url => {\r\n                self.tileLoader.invalidate(url, self.uuid);\r\n            })\r\n            self.contentURL = [];\r\n        }\r\n\r\n        if (!!self.abortController && !self.jsonRequested) { // abort tile request\r\n            self.abortController.abort(\"tile not needed\");\r\n        }\r\n        this.parent = null;\r\n        self.meshContent = [];\r\n        if (self.bbox) self.bbox.dispose();\r\n        //this.parentTile = null;\r\n        this.dispatchEvent({ type: 'removed' });\r\n    }\r\n    _disposeMeshContent() {\r\n        const self = this;\r\n        if (!!self.deleted) return;\r\n        self.deleted = true;\r\n        if (!!self.abortController) { // abort tile request\r\n            self.abortController.abort(\"tile not needed\");\r\n            self.abortController = new AbortController();\r\n        }\r\n        for (let i = self.meshContent.length - 1; i >= 0; i--) {\r\n            const mc = self.meshContent[i];\r\n            if (!!mc && !!mc.asset && mc.asset.copyright) {\r\n                mc.asset.copyright.split(';').forEach(s => {\r\n                    if (!!copyright[s]) {\r\n                        copyright[s]--;\r\n                    }\r\n                });\r\n                if (self.displayCopyright) {\r\n                    _updateCopyrightLabel();\r\n                }\r\n            }\r\n\r\n            self.remove(mc);\r\n        }\r\n        if (self.splatsMesh) {\r\n            self.meshContent.forEach(splat => splat.hide());\r\n        }\r\n        self.meshContent = [];\r\n        self.contentURL.forEach(url => {\r\n            //console.log(url)\r\n            self.tileLoader.invalidate(url, self.uuid);\r\n        })\r\n        self.contentURL = [];\r\n\r\n    }\r\n    _disposeChildren() {\r\n        var self = this;\r\n\r\n        self.childrenTiles.forEach(tile => {\r\n            tile.dispose();\r\n            self.remove(tile)\r\n        });\r\n        self.childrenTiles = [];\r\n        /* self.children = [];\r\n        if (self.meshContent.length > 0) {\r\n            self.meshContent.forEach(mc => {\r\n                self.children.push(mc);\r\n            });\r\n        } */\r\n    }\r\n\r\n    raycast(raycaster, intersects) {\r\n        //console.log(\"raycast\")\r\n        if (!this.splatsMesh) {\r\n            return super.raycast(raycaster, intersects);\r\n        } else {\r\n            tempRay.copy(raycaster.ray);\r\n            inverseWorld.copy(this.matrixWorld).invert();\r\n            tempRay.applyMatrix4(inverseWorld);\r\n            let intersection = false;\r\n            if (this.boundingVolume instanceof OBB) {\r\n                intersection = this.boundingVolume.intersectsRay(tempRay);\r\n            } else if (this.boundingVolume instanceof THREE.Sphere) {\r\n                //sphere\r\n                intersection = ray.intersectsSphere(this.boundingVolume);\r\n            } else {\r\n                return false;\r\n\r\n            }\r\n            if (intersection && this.materialVisibility && !!this.splatsReady) {\r\n                tempIntersects.length = 0;\r\n                this.meshContent.forEach(mc => {\r\n                    if (mc.isSplatsBatch) {\r\n                        mc.raycast(tempRay, tempIntersects, raycaster.params.Points.threshold);\r\n                        tempIntersects.forEach(t => {\r\n                            t.point.applyMatrix4(this.matrixWorld);\r\n                        }),\r\n                            intersects.push(...tempIntersects);\r\n                    }\r\n                })\r\n            }\r\n\r\n            return intersection;\r\n        }\r\n    }\r\n\r\n    /**\r\n     * To be called in the render loop.\r\n     * @param {THREE.Camera} camera a camera that the tileset will be rendered with.\r\n     * @returns {{numTilesLoaded: number, numTilesRendered: number, maxLOD: number, percentageLoaded: number}} An object containing describing the current state of the loaded tileset.\r\n     */\r\n    update(camera) {\r\n        if (this.splatsMesh) {\r\n            this.splatsMesh.updateShaderParams(camera, this.renderer);\r\n        }\r\n        const frustum = new THREE.Frustum();\r\n        frustum.setFromProjectionMatrix(new THREE.Matrix4().multiplyMatrices(camera.projectionMatrix, camera.matrixWorldInverse));\r\n\r\n\r\n\r\n        let numTiles = [0];\r\n        let numTilesRendered = [0];\r\n        let maxLOD = [0];\r\n        let percentageLoaded = [0];\r\n        if (this.refine == \"REPLACE\") {\r\n            switch (this.loadingStrategy) {\r\n                case \"IMMEDIATE\": this._updateImmediate(camera, frustum); this._statsImmediate(maxLOD, numTiles, percentageLoaded, numTilesRendered); break;\r\n                default: this._update(camera, frustum); this._stats(maxLOD, numTiles, percentageLoaded, numTilesRendered);\r\n            }\r\n        } else {\r\n            this._update(camera, frustum);\r\n            this._stats(maxLOD, numTiles, percentageLoaded, numTilesRendered);\r\n        }\r\n\r\n        if (numTiles > 0) {\r\n            percentageLoaded[0] /= numTiles[0];\r\n        }\r\n\r\n        //// sort ////\r\n        if (this.splatsMesh) {\r\n            transformedCameraPosition.copy(camera.position);\r\n            inverseWorld.copy(this.matrixWorld).invert();\r\n            transformedCameraPosition.applyMatrix4(inverseWorld);\r\n\r\n            if (this.splatsCPUCulling) {\r\n                const viewProjModel = new THREE.Matrix4()\r\n                    .multiplyMatrices(camera.projectionMatrix, camera.matrixWorldInverse) //  P·V\r\n                    .multiply(this.matrixWorld);\r\n                this.splatsMesh.sort(transformedCameraPosition, viewProjModel);\r\n            } else {\r\n                this.splatsMesh.sort(transformedCameraPosition);\r\n            }\r\n\r\n\r\n        }\r\n\r\n        if (this.splatsMesh) {\r\n            this.splatsMesh.update();\r\n        }\r\n\r\n        return { numTilesLoaded: numTiles[0], numTilesRendered: numTilesRendered[0], maxLOD: maxLOD[0], percentageLoaded: percentageLoaded[0] }\r\n    }\r\n\r\n    _updateImmediate(camera, frustum) {\r\n        this._computeMetricRecursive(camera, frustum);\r\n        this._updateNodeVisibilityImmediate();\r\n        this._expandTreeImmediate(camera);\r\n        this.shouldBeVisible = this.metric > 0 ? true : !!this.loadOutsideView;\r\n        this._shouldBeVisibleUpdateImmediate();\r\n        this._trimTreeImmediate();\r\n        this._loadMeshImmediate();\r\n\r\n\r\n    }\r\n\r\n\r\n    _statsImmediate(maxLOD, numTiles, percentageLoaded, numTilesRendered) {\r\n        maxLOD[0] = Math.max(maxLOD[0], this.level);\r\n        if (this.shouldBeVisible || !!this.materialVisibility) {\r\n            numTiles[0]++;\r\n            if (!!this.materialVisibility) percentageLoaded[0]++;\r\n        }\r\n        if (!!this.materialVisibility) numTilesRendered[0]++;\r\n\r\n\r\n        this.childrenTiles.forEach(child => {\r\n            child._statsImmediate(maxLOD, numTiles, percentageLoaded, numTilesRendered);\r\n        })\r\n    }\r\n    _stats(maxLOD, numTiles, percentageLoaded, numTilesRendered) {\r\n        maxLOD[0] = Math.max(maxLOD[0], this.level);\r\n        if (this.hasMeshContent) {\r\n            numTiles[0]++;\r\n            if (this.meshContent.length == this.hasMeshContent) percentageLoaded[0]++;\r\n            if (!!this.materialVisibility) numTilesRendered[0]++;\r\n        }\r\n\r\n\r\n        this.childrenTiles.forEach(child => {\r\n            child._stats(maxLOD, numTiles, percentageLoaded, numTilesRendered);\r\n        })\r\n    }\r\n\r\n\r\n\r\n    _trimTreeImmediate() {\r\n        const self = this;\r\n        if (self.metric == undefined) return;\r\n\r\n        if (self.hasMeshContent && ((self.shouldBeVisible && self.materialVisibility))) {\r\n            if (self.splatsMesh && !self.splatsReady) {\r\n                return;\r\n            }\r\n            self._disposeChildren();\r\n        } else {\r\n            self.childrenTiles.forEach(child => {\r\n                child._trimTreeImmediate();\r\n            })\r\n        }\r\n\r\n    }\r\n    _updateNodeVisibilityImmediate(parentDisplaysMesh = false) {\r\n        //updateNodeVisibilityCount++;\r\n\r\n        const self = this;\r\n        if (!self.hasMeshContent) {\r\n            self.childrenTiles.forEach(child => {\r\n                child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n            })\r\n            return;\r\n        }\r\n\r\n        if (self.shouldBeVisible) {\r\n            if (self.meshContent.length == self.hasMeshContent) {\r\n                if (!self.materialVisibility) {\r\n                    //console.log(!!self.splatsReady)\r\n                    self._changeContentVisibility(true);\r\n                    self.childrenTiles.forEach(child => {\r\n                        child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n                    })\r\n                } else {\r\n                    self.childrenTiles.forEach(child => {\r\n                        child._updateNodeVisibilityImmediate(true);\r\n                    })\r\n                }\r\n\r\n            } else {\r\n                self.childrenTiles.forEach(child => {\r\n                    child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n                })\r\n            }\r\n        } else {\r\n            if (!self.loadOutsideView && self.metric < 0) {\r\n                self._changeContentVisibility(false);\r\n                if (self.meshContent.length > 0) self._disposeMeshContent();\r\n                self.childrenTiles.forEach(child => {\r\n                    child._updateNodeVisibilityImmediate(true);\r\n                })\r\n                return;\r\n            }\r\n\r\n            if (self.materialVisibility && (!self.splatsMesh || !!self.splatsReady)) {\r\n\r\n                if (parentDisplaysMesh) {\r\n                    self._changeContentVisibility(false);\r\n                    if (self.meshContent.length > 0) self._disposeMeshContent();\r\n                    self.childrenTiles.forEach(child => {\r\n                        child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n                    })\r\n                } else {\r\n                    let allChildrenReady = true;\r\n                    self.childrenTiles.every(child => {\r\n\r\n                        if (!child._isReadyImmediate()) {\r\n                            allChildrenReady = false;\r\n                            return false;\r\n                        }\r\n                        return true;\r\n                    });\r\n                    if (allChildrenReady && self.childrenTiles.length > 0) {\r\n                        self._changeContentVisibility(false);\r\n                        if (self.meshContent.length > 0) self._disposeMeshContent();\r\n                        self.childrenTiles.forEach(child => {\r\n                            child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n                        })\r\n                    } else {\r\n\r\n                        self.childrenTiles.forEach(child => {\r\n                            child._updateNodeVisibilityImmediate((!self.splatsMesh || !!self.splatsReady));\r\n                        })\r\n                    }\r\n                }\r\n\r\n            } else {\r\n\r\n                self.childrenTiles.forEach(child => {\r\n                    child._updateNodeVisibilityImmediate(parentDisplaysMesh);\r\n                })\r\n            }\r\n        }\r\n\r\n\r\n\r\n    }\r\n    _shouldBeVisibleUpdateImmediate() {\r\n        const self = this;\r\n        if (!self.hasMeshContent) {\r\n\r\n            self.childrenTiles.forEach(child => {\r\n                child.shouldBeVisible = true;\r\n                child._shouldBeVisibleUpdateImmediate();\r\n            })\r\n            self.shouldBeVisible = false;\r\n\r\n        }\r\n        else if (self.metric == undefined) {\r\n            self.shouldBeVisible = false;\r\n        }\r\n        else if (self.metric < 0) {\r\n            self.shouldBeVisible = !!self.loadOutsideView;\r\n            self.childrenTiles.forEach(child => {\r\n                child._setShouldNotBeVisibleRecursive();\r\n            });\r\n        }\r\n        else if (self.metric < self.geometricErrorMultiplier * self.geometricError) {\r\n            if (self.hasUnloadedJSONContent) {\r\n                //self.shouldBeVisible = true;\r\n\r\n            } else {\r\n                if (!!self.json && !!self.json.children && self.json.children.length > 0) {\r\n                    self.shouldBeVisible = false;\r\n                    self.childrenTiles.forEach(child => {\r\n                        child.shouldBeVisible = true;\r\n                        child._shouldBeVisibleUpdateImmediate();\r\n                    })\r\n\r\n                } else {\r\n                    self.shouldBeVisible = true;\r\n\r\n                }\r\n            }\r\n\r\n        } else {\r\n\r\n            self.childrenTiles.forEach(child => {\r\n                child._setShouldNotBeVisibleRecursive();\r\n            });\r\n        }\r\n    }\r\n\r\n    _setShouldNotBeVisibleRecursive() {\r\n        const self = this;\r\n        self.shouldBeVisible = false;\r\n        self.childrenTiles.forEach(child => {\r\n            child._setShouldNotBeVisibleRecursive();\r\n        })\r\n    }\r\n    _loadMeshImmediate() {\r\n        const self = this;\r\n        if (!self.hasMeshContent) {\r\n            self.childrenTiles.forEach(child => {\r\n                child._loadMeshImmediate();\r\n            });\r\n            return;\r\n        }\r\n        if (self.shouldBeVisible) {\r\n            if (self.meshContent.length < self.hasMeshContent &&\r\n                self.contentURL.length == 0) {\r\n\r\n                self.deleted = false;\r\n\r\n                self._load(false, true);\r\n            }\r\n        } else {\r\n            self.childrenTiles.forEach(child => {\r\n                child._loadMeshImmediate();\r\n            })\r\n        }\r\n\r\n    }\r\n\r\n    _computeMetricRecursive(camera, frustum) {\r\n        const self = this;\r\n        self.metric = -1;\r\n        if (!self.isSetup) return;\r\n\r\n        if (!!self.boundingVolume && !!self.geometricError) {\r\n            self.metric = self._calculateUpdateMetric(camera, frustum);\r\n        }\r\n        self.childrenTiles.forEach(child => child._computeMetricRecursive(camera, frustum));\r\n\r\n\r\n    }\r\n\r\n\r\n    _expandTreeImmediate(camera) {\r\n        const self = this;\r\n\r\n        if (!self.hasUnloadedJSONContent) {\r\n            if (!self.hasMeshContent) {\r\n                if (!!self.json && !!self.json.children && self.childrenTiles.length < self.json.children.length) {\r\n                    self._loadJsonChildren(camera);\r\n\r\n                }\r\n            } else {\r\n                if (self.occlusionCullingService && self.hasMeshContent && !self.occlusionCullingService.hasID(self.colorID)) {\r\n                    // don't load children\r\n                } else {\r\n                    if (self.metric >= 0 && self.metric < self.geometricErrorMultiplier * self.geometricError &&\r\n                        !!self.json && !!self.json.children && self.childrenTiles.length < self.json.children.length\r\n                    ) {\r\n                        self._loadJsonChildren(camera);\r\n                    }\r\n                }\r\n            }\r\n\r\n        }\r\n\r\n        self.childrenTiles.forEach(child => child._expandTreeImmediate(camera));\r\n    }\r\n\r\n\r\n    _update(camera, frustum) {\r\n        const self = this;\r\n\r\n        if (!self.isSetup) return;\r\n        // let dist = self.boundingVolume.distanceToPoint(new THREE.Vector3(3980, 4980.416656099139, 3.2851604304346775));\r\n        // if (dist< 1) {\r\n        //     self._changeContentVisibility(false);\r\n        //     console.log(dist+\" \"+self.level)\r\n        // }\r\n        const visibilityBeforeUpdate = self.materialVisibility;\r\n\r\n        if (!!self.boundingVolume && !!self.geometricError) {\r\n            self.metric = self._calculateUpdateMetric(camera, frustum);\r\n        }\r\n        self.childrenTiles.forEach(child => child._update(camera, frustum));\r\n\r\n        _updateNodeVisibility(self.metric);\r\n        _updateTree(self.metric);\r\n        _trimTree(self.metric, visibilityBeforeUpdate);\r\n\r\n\r\n\r\n        function _updateTree(metric) {\r\n            // If this tile does not have mesh content but it has children\r\n            if (metric < 0 && self.hasMeshContent) return;\r\n            if (self.occlusionCullingService && self.hasMeshContent && !self.occlusionCullingService.hasID(self.colorID)) {\r\n                return;\r\n            }\r\n            if (!self.hasMeshContent || (metric <= self.geometricErrorMultiplier * self.geometricError && (self.meshContent.length > 0 || self.splatsMesh))) {\r\n                if (!!self.json && !!self.json.children && self.childrenTiles.length != self.json.children.length) {\r\n                    self._loadJsonChildren(camera);\r\n                    return;\r\n                }\r\n            }\r\n        }\r\n\r\n\r\n        function _updateNodeVisibility(metric) {\r\n\r\n            // outside frustum\r\n            if (metric < 0) {\r\n                self.inFrustum = false;\r\n                self._changeContentVisibility(!!self.loadOutsideView);\r\n                return;\r\n            } else {\r\n                self.inFrustum = true;\r\n            }\r\n            //doesn't have a mesh content\r\n            if (!self.hasMeshContent) return;\r\n\r\n            // mesh content not yet loaded\r\n            if (self.meshContent.length < self.hasMeshContent) {\r\n                return;\r\n            }\r\n\r\n\r\n\r\n\r\n            // has no children\r\n            if (self.childrenTiles.length == 0) {\r\n                self._changeContentVisibility(true);\r\n                return;\r\n            }\r\n\r\n            // has children\r\n            if (metric >= self.geometricErrorMultiplier * self.geometricError) { // Ideal LOD or before this lod\r\n\r\n                self._changeContentVisibility(true);\r\n            } else if (metric < self.geometricErrorMultiplier * self.geometricError) { // Ideal LOD is past this one\r\n                // if children are visible and have been displayed, can be hidden\r\n                if (self.refine == \"REPLACE\") {\r\n                    let allChildrenReady = true;\r\n                    self.childrenTiles.every(child => {\r\n\r\n                        if (!child._isReady()) {\r\n                            allChildrenReady = false;\r\n                            return false;\r\n                        }\r\n                        return true;\r\n                    });\r\n                    if (allChildrenReady) {\r\n                        self._changeContentVisibility(false);\r\n                    }\r\n                    else {\r\n                        self._changeContentVisibility(true);\r\n                    }\r\n                }\r\n\r\n\r\n            }\r\n        }\r\n\r\n\r\n\r\n        function _trimTree(metric, visibilityBeforeUpdate) {\r\n            if (!self.hasMeshContent) return;\r\n            if (!self.inFrustum) { // outside frustum\r\n                self._disposeChildren();\r\n                //_updateNodeVisibility(metric);\r\n                return;\r\n            }\r\n            if (self.occlusionCullingService &&\r\n                !visibilityBeforeUpdate &&\r\n                self.hasMeshContent &&\r\n                self.meshContent.length > 0 &&\r\n                self.materialVisibility &&\r\n                self._areAllChildrenLoadedAndHidden()) {\r\n\r\n                if (self.splatsMesh && self.materialVisibility && !self.splatsReady) {\r\n                    return;\r\n                }\r\n                self._disposeChildren();\r\n                //_updateNodeVisibility(metric);\r\n                return;\r\n            }\r\n            if (metric >= self.geometricErrorMultiplier * self.geometricError) {\r\n                if (self.splatsMesh && self.materialVisibility && !self.splatsReady) {\r\n                    return;\r\n                }\r\n                self._disposeChildren();\r\n                //_updateNodeVisibility(metric);\r\n                return;\r\n            }\r\n\r\n        }\r\n\r\n\r\n\r\n    }\r\n\r\n    _loadJsonChildren(camera) {\r\n        const self = this;\r\n        for (let i = self.json.children.length - 1; i >= 0; i--) {\r\n            if (!self.json.children[i].root && !self.json.children[i].children && !self.json.children[i].getChildren && !self.json.children[i].content && !self.json.children[i].contents) {\r\n                self.json.children.splice(i, 1);\r\n            }\r\n        }\r\n        self.json.children.forEach(childJSON => {\r\n\r\n            let childTile = new OGC3DTile({\r\n                parentTile: self,\r\n                queryParams: self.queryParams,\r\n                parentGeometricError: self.geometricError,\r\n                parentBoundingVolume: self.boundingVolume,\r\n                parentRefine: self.refine,\r\n                json: childJSON,\r\n                rootPath: self.rootPath,\r\n                geometricErrorMultiplier: self.geometricErrorMultiplier,\r\n                loadOutsideView: self.loadOutsideView,\r\n                level: Math.floor(self.level) + 1,\r\n                tileLoader: self.tileLoader,\r\n                cameraOnLoad: camera,\r\n                occlusionCullingService: self.occlusionCullingService,\r\n                renderer: self.renderer,\r\n                static: self.static,\r\n                centerModel: false,\r\n                displayErrors: self.displayErrors,\r\n                displayCopyright: self.displayCopyright,\r\n                distanceBias: self.distanceBias,\r\n                loadingStrategy: self.loadingStrategy,\r\n                drawBoundingVolume: self.drawBoundingVolume,\r\n                splatsMesh: self.splatsMesh,\r\n                clipShape: self.clipShape,\r\n                oldUltraMeshSplats: self.oldUltraMeshSplats,\r\n                physics: self.physics,\r\n            });\r\n            self.childrenTiles.push(childTile);\r\n            self.add(childTile);\r\n        });\r\n\r\n        self.updateMatrices(true);\r\n    }\r\n\r\n    _areAllChildrenLoadedAndHidden() {\r\n        let allLoadedAndHidden = true;\r\n        const self = this;\r\n        this.childrenTiles.every(child => {\r\n            if (child.hasMeshContent) {\r\n                if (child.childrenTiles.length > 0) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n                if (child.metric < 0) {\r\n                    return true;\r\n                }\r\n                if (child.materialVisibility && (!self.splatsMesh || !!self.splatsReady)) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                } else if (self.occlusionCullingService.hasID(child.colorID)) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n            } else {\r\n                if (!child._areAllChildrenLoadedAndHidden()) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n            }\r\n            return true;\r\n        });\r\n        return allLoadedAndHidden;\r\n    }\r\n\r\n    /**\r\n     * Node is ready if it is outside frustum, if it was drawn at least once or if all it's children are ready\r\n     * @returns true if ready\r\n     */\r\n    _isReady() {\r\n\r\n        // if outside frustum\r\n        if (this.metric == undefined) {\r\n            return false;\r\n        }\r\n        if (this.metric < 0) {\r\n            return true;\r\n        }\r\n        // if json is not done loading\r\n        if (this.hasUnloadedJSONContent) {\r\n            return false;\r\n        }\r\n        // if empty tile\r\n        if (!this.hasMeshContent && this.json.children.length == 0 && !this.hasUnloadedJSONContent) {\r\n            return true;\r\n        }\r\n        // if this tile has no mesh content or if it's marked as visible false, look at children\r\n        if ((!this.hasMeshContent || this.meshContent.length == 0 || (!this.materialVisibility))) {\r\n            if (this.children.length > 0) {\r\n                var allChildrenReady = true;\r\n                this.childrenTiles.every(child => {\r\n                    if (!child._isReady()) {\r\n                        allChildrenReady = false;\r\n                        //console.log(child.level)\r\n                        return false;\r\n                    }\r\n                    return true;\r\n                });\r\n                return allChildrenReady;\r\n            } else {\r\n                return false\r\n            }\r\n\r\n        }\r\n\r\n\r\n        // if this tile has no mesh content\r\n        if (!this.hasMeshContent) {\r\n            return true;\r\n        }\r\n        // if mesh content not yet loaded\r\n        if (this.meshContent.length < this.hasMeshContent) {\r\n            return false;\r\n        }\r\n\r\n\r\n        if (this.materialVisibility) {\r\n            return true;\r\n        }\r\n\r\n\r\n\r\n        return false;\r\n\r\n    }\r\n\r\n    _isReadyImmediate() {\r\n\r\n        if (!!this.materialVisibility || (!this.loadOutsideView && this.metric < 0)) {\r\n            return true;\r\n        } else {\r\n            /* if (this.splatsMesh) {\r\n                if (this.splatsReady) {\r\n                    return true\r\n                } else {\r\n                    return false;\r\n                }\r\n            } else {\r\n                return false;\r\n            } */\r\n            //return false;\r\n            if (this.childrenTiles.length > 0) {\r\n                var allChildrenReady = true;\r\n                this.childrenTiles.every(child => {\r\n                    if (!child._isReadyImmediate()) {\r\n                        allChildrenReady = false;\r\n                        return false;\r\n                    }\r\n                    return true;\r\n                });\r\n                return allChildrenReady;\r\n            } else {\r\n                return false;\r\n                /* if (this.splatsMesh) {\r\n                    if (this.splatsReady) {\r\n                        return true\r\n                    } else {\r\n                        return false;\r\n                    }\r\n                } else {\r\n                    return false;\r\n                } */\r\n            }\r\n        }\r\n\r\n\r\n    }\r\n\r\n\r\n    _changeContentVisibility(visibility) {\r\n        const self = this;\r\n        if (self.materialVisibility == visibility) return;\r\n        if (self.bbox) {\r\n\r\n            self.bbox.material.visible = visibility;\r\n        }\r\n        if (self.splatsMesh) {\r\n            if (visibility != self.materialVisibility) {\r\n                let splatsCount = 0;\r\n                self.meshContent.forEach(mc => {\r\n                    if (visibility && mc.isSplatsBatch) {\r\n                        //self.splatsReady = true;\r\n                        splatsCount++;\r\n\r\n                        mc.show(() => {\r\n                            if (self.materialVisibility) {\r\n                                self.splatsReady = true;\r\n                            }\r\n\r\n                        });\r\n\r\n                    }\r\n                    else {\r\n                        mc.hide();\r\n                        self.splatsReady = false;\r\n                    }\r\n                });\r\n\r\n                self.materialVisibility = visibility;\r\n            }\r\n        } else {\r\n            if (self.hasMeshContent && self.meshContent.length > 0) {\r\n                if (visibility) {\r\n                    self.meshContent.forEach(mc => {\r\n                        mc.traverse((o) => {\r\n                            if (o.isMesh || o.isPoints) {\r\n                                o.layers.enable(0);\r\n                            }\r\n                        });\r\n                    })\r\n\r\n                } else {\r\n                    self.meshContent.forEach(mc => {\r\n                        mc.traverse((o) => {\r\n                            if (o.isMesh || o.isPoints) {\r\n                                o.layers.disable(0);\r\n                            }\r\n                        });\r\n                    })\r\n\r\n                }\r\n            }\r\n\r\n            if (self.materialVisibility == visibility) {\r\n                return;\r\n            }\r\n            self.materialVisibility = visibility\r\n        }\r\n\r\n        self._updateCollider();\r\n        \r\n\r\n\r\n\r\n    }\r\n\r\n    /**\r\n     * Set the world-space pose of this tileset.\r\n     *\r\n     * IMPORTANT: When a physics simulation is attached (this.physics && this.physics.sim && this.physics.rigidBodyID),\r\n     * you MUST use this method to transform the object. Do NOT modify transforms using THREE.Object3D core methods\r\n     * (e.g. position.set, quaternion.set, applyQuaternion, setRotationFromEuler, etc.) because the physics engine\r\n     * is authoritative for the object's transform. This method keeps the physics rigid body in sync and updates colliders.\r\n     *\r\n     * @param {THREE.Vector3} position - New world-space position. Must be an instance of THREE.Vector3.\r\n     * @param {THREE.Euler|THREE.Quaternion} rotation - Rotation can be either a THREE.Euler or a THREE.Quaternion.\r\n     * @param {THREE.Vector3} scale - New scale. Must be an instance of THREE.Vector3.\r\n     * @throws {TypeError} If position or scale are not THREE.Vector3, or if rotation is not THREE.Euler/THREE.Quaternion.\r\n     */\r\n    setPose(position, rotation, scale) {\r\n        // Validate required argument types\r\n        if (!(position.isVector3)) {\r\n            throw new TypeError(\"OGC3DTile.setPose: 'position' must be an instance of THREE.Vector3\");\r\n        }\r\n        if (!(scale.isVector3)) {\r\n            throw new TypeError(\"OGC3DTile.setPose: 'scale' must be an instance of THREE.Vector3\");\r\n        }\r\n        if (!(rotation.isEuler) && !(rotation.isQuaternion)) {\r\n            throw new TypeError(\"OGC3DTile.setPose: 'rotation' must be a THREE.Euler or THREE.Quaternion\");\r\n        }\r\n        if (this.physics && this.physics.sim && this.physics.rigidBodyID) {\r\n            \r\n\r\n            // Sync pose with physics simulation (position and rotation)\r\n            this.physics.sim.setPose({\r\n                bodyId: this.physics.rigidBodyID,\r\n                position: position,\r\n                rotation: rotation\r\n            });\r\n\r\n            // If scale changed, update local scale and colliders\r\n            if (scale && !scale.equals(this.scale)) {\r\n                this.scale.copy(scale);\r\n                this.updateMatrices();\r\n                this.traverse(child => {\r\n                    if (child._updateCollider) child._updateCollider();\r\n                });\r\n            }\r\n        } else {\r\n            // No physics -> directly update the THREE.Object3D transform.\r\n            this.scale.copy(scale);\r\n\r\n            if (rotation.isQuaternion) {\r\n                this.setRotationFromQuaternion(rotation);\r\n            } else { // instance of THREE.Euler (validated above)\r\n                this.setRotationFromEuler(rotation);\r\n            }\r\n\r\n            this.position.copy(position);\r\n            this.updateMatrices();\r\n        }\r\n    }\r\n    _updateCollider() {\r\n        const self = this;\r\n        if (!self.physics || !self.physics.sim) return;\r\n    \r\n        const rbId = self.physics.rigidBodyID;\r\n        const level = Math.floor(self.level || 0);\r\n        const isVisible = !!self.materialVisibility;\r\n        const hasChildrenTiles = Array.isArray(self.childrenTiles) && self.childrenTiles.length > 0;\r\n\r\n        // Advanced colliders configuration (optional)\r\n        const coll = (self.physics && self.physics.colliders && typeof self.physics.colliders === 'object') ? self.physics.colliders : null;\r\n\r\n        // Global LOD cap: colliders.maxLOD > legacy physics.maxLOD > Infinity\r\n        const maxLOD = Number.isFinite(coll?.maxLOD) ? coll.maxLOD\r\n            : (Number.isFinite(self.physics.maxLOD) ? self.physics.maxLOD : Infinity);\r\n\r\n        // Selection helpers\r\n        const pickByPriority = (candidates, priority) => {\r\n            const list = Array.isArray(priority) && priority.length ? priority : [\"mesh\", \"hull\", \"bounds\"];\r\n            for (const s of list) if (candidates.includes(s)) return s;\r\n            return null;\r\n        };\r\n        const chooseColliderShape = () => {\r\n            // If advanced rules present, use them\r\n            const priority = coll?.priority || [\"mesh\", \"hull\", \"bounds\"];\r\n            if (coll && (Array.isArray(coll.byGeometricError) && coll.byGeometricError.length)) {\r\n                const ge = self.geometricError;\r\n                if (typeof ge === \"number\") {\r\n                    const candidates = [];\r\n                    for (const r of coll.byGeometricError) {\r\n                        if (!r || !r.shape) continue;\r\n                        const min = (typeof r.min === \"number\") ? r.min : -Infinity;\r\n                        const max = (typeof r.max === \"number\") ? r.max : Infinity;\r\n                        if (ge >= min && ge < max) candidates.push(r.shape);\r\n                    }\r\n                    const picked = pickByPriority(candidates, priority);\r\n                    if (picked) return picked;\r\n                }\r\n                // No match on geometricError -> fallback default\r\n                if (coll.defaultShape) return coll.defaultShape;\r\n                if (self.physics.shape) return self.physics.shape;\r\n                return \"none\";\r\n            } else if (coll && (Array.isArray(coll.byLevel) && coll.byLevel.length)) {\r\n                const lvl = Math.floor(self.level || 0);\r\n                const candidates = [];\r\n                for (const r of coll.byLevel) {\r\n                    if (!r || !r.shape) continue;\r\n                    const min = (typeof r.min === \"number\") ? r.min : -Infinity;\r\n                    const max = (typeof r.max === \"number\") ? r.max : Infinity;\r\n                    if (lvl >= min && lvl <= max) candidates.push(r.shape);\r\n                }\r\n                const picked = pickByPriority(candidates, priority);\r\n                if (picked) return picked;\r\n                if (coll.defaultShape) return coll.defaultShape;\r\n                if (self.physics.shape) return self.physics.shape;\r\n                return \"none\";\r\n            } else {\r\n                // Legacy behavior: use top-level shape\r\n                return self.physics.shape || \"none\";\r\n            }\r\n        };\r\n        const effectiveShape = chooseColliderShape();\r\n\r\n        // helpers\r\n        const detachBoundsCollider = () => {\r\n            if (self.colliderUUID) {\r\n                self.physics.sim.detachCollider({ colliderId: self.colliderUUID });\r\n                self.colliderUUID = undefined;\r\n            }\r\n        };\r\n        const detachMeshColliders = () => {\r\n            if (Array.isArray(self.colliderUUIDs) && self.colliderUUIDs.length) {\r\n                for (const colId of self.colliderUUIDs) {\r\n                    self.physics.sim.detachCollider({ colliderId: colId });\r\n                }\r\n                self.colliderUUIDs = [];\r\n            }\r\n        };\r\n        const detachAll = () => {\r\n            detachBoundsCollider();\r\n            detachMeshColliders();\r\n            self._activeColliderShape = undefined;\r\n        };\r\n\r\n        // If no body or shape is \"none\", clear any existing colliders and abort\r\n        if (!rbId || !effectiveShape || effectiveShape === \"none\") {\r\n            detachAll();\r\n            self._activeColliderShape = undefined;\r\n            return;\r\n        }\r\n\r\n        // Tiles strictly above maxLOD must never have colliders\r\n        if (level > maxLOD) {\r\n            detachAll();\r\n            self._activeColliderShape = undefined;\r\n            return;\r\n        }\r\n\r\n        // Desired creation state for this frame\r\n        const wantsColliderNow = isVisible && level <= maxLOD;\r\n\r\n        // Handle shape switching (detach previous type when rules change),\r\n        // except when we retain at maxLOD while invisible.\r\n        const prevShape = self._activeColliderShape || \"none\";\r\n        const atRetention = (!isVisible && level === maxLOD && hasChildrenTiles);\r\n        if (prevShape !== effectiveShape && !atRetention) {\r\n            if ((prevShape === \"mesh\" || prevShape === \"hull\") && effectiveShape === \"bounds\") {\r\n                detachMeshColliders();\r\n            } else if (prevShape === \"bounds\" && (effectiveShape === \"mesh\" || effectiveShape === \"hull\")) {\r\n                detachBoundsCollider();\r\n            } else if ((prevShape === \"mesh\" && effectiveShape === \"hull\") || (prevShape === \"hull\" && effectiveShape === \"mesh\")) {\r\n                // switching between mesh and hull -> rebuild\r\n                detachMeshColliders();\r\n            } else {\r\n                // any other change -> remove all\r\n                detachAll();\r\n            }\r\n            self._activeColliderShape = (effectiveShape && effectiveShape !== \"none\") ? effectiveShape : undefined;\r\n        }\r\n    \r\n        // Common root transforms (RB owner with RT only - ignore root scale)\r\n        let rbOwner = self;\r\n        while (rbOwner && rbOwner.parentTile) rbOwner = rbOwner.parentTile;\r\n        const rootP = new THREE.Vector3(), rootQ = new THREE.Quaternion(), rootS = new THREE.Vector3();\r\n        if (rbOwner && rbOwner.matrixWorld) rbOwner.matrixWorld.decompose(rootP, rootQ, rootS);\r\n        const rootRT = new THREE.Matrix4().compose(rootP, rootQ, new THREE.Vector3(1, 1, 1));\r\n        const invRootRT = new THREE.Matrix4().copy(rootRT).invert();\r\n    \r\n        // Shape-specific handling\r\n        if (effectiveShape === \"bounds\") {\r\n            \r\n            // Make sure no stray mesh colliders remain if shape switched\r\n            detachMeshColliders();\r\n    \r\n            if (wantsColliderNow) {\r\n                // Create only if not already present\r\n                if (!self.colliderUUID) {\r\n                    if (self.boundingVolume instanceof OBB || self.boundingVolume?.isOBB) {\r\n                        // Center (tile-local) -> world -> body-local\r\n                        const centerWorld = self.localToWorld(self.boundingVolume.center.clone());\r\n                        const centerInBody = centerWorld.clone().applyMatrix4(invRootRT);\r\n    \r\n                        // Origin (tile-local 0,0,0) in world/body\r\n                        const originWorld = self.localToWorld(new THREE.Vector3(0, 0, 0));\r\n                        const originBody = originWorld.clone().applyMatrix4(invRootRT);\r\n    \r\n                        // Half-axis vectors in tile-local\r\n                        const a1Local = self.boundingVolume.e1.clone().multiplyScalar(self.boundingVolume.halfSize.x);\r\n                        const a2Local = self.boundingVolume.e2.clone().multiplyScalar(self.boundingVolume.halfSize.y);\r\n                        const a3Local = self.boundingVolume.e3.clone().multiplyScalar(self.boundingVolume.halfSize.z);\r\n    \r\n                        // Map to body space\r\n                        const a1BodyEnd = self.localToWorld(a1Local.clone()).applyMatrix4(invRootRT);\r\n                        const a2BodyEnd = self.localToWorld(a2Local.clone()).applyMatrix4(invRootRT);\r\n                        const a3BodyEnd = self.localToWorld(a3Local.clone()).applyMatrix4(invRootRT);\r\n    \r\n                        const v1Body = a1BodyEnd.clone().sub(originBody);\r\n                        const v2Body = a2BodyEnd.clone().sub(originBody);\r\n                        const v3Body = a3BodyEnd.clone().sub(originBody);\r\n    \r\n                        const hx = v1Body.length();\r\n                        const hy = v2Body.length();\r\n                        const hz = v3Body.length();\r\n    \r\n                        const v1n = hx > 0 ? v1Body.clone().multiplyScalar(1 / hx) : new THREE.Vector3(1, 0, 0);\r\n                        const v2n = hy > 0 ? v2Body.clone().multiplyScalar(1 / hy) : new THREE.Vector3(0, 1, 0);\r\n                        const v3n = hz > 0 ? v3Body.clone().multiplyScalar(1 / hz) : new THREE.Vector3(0, 0, 1);\r\n    \r\n                        const basisMat = new THREE.Matrix4().makeBasis(v1n, v2n, v3n);\r\n                        const localQuat = new THREE.Quaternion().setFromRotationMatrix(basisMat);\r\n    \r\n                        self.colliderUUID = self.physics.sim.attachShapeCollider({\r\n                            bodyId: rbId,\r\n                            shape: ColliderShape.createBox(hx, hy, hz),\r\n                            localPosition: [centerInBody.x, centerInBody.y, centerInBody.z],\r\n                            localRotation: localQuat\r\n                        });\r\n                        self._activeColliderShape = \"bounds\";\r\n                    } else if (self.boundingVolume instanceof THREE.Sphere || self.boundingVolume?.isSphere) {\r\n                        const centerWorld = self.localToWorld(self.boundingVolume.center.clone());\r\n                        const centerInBody = centerWorld.clone().applyMatrix4(invRootRT);\r\n    \r\n                        const originWorld = self.localToWorld(new THREE.Vector3(0, 0, 0));\r\n                        const originBody = originWorld.clone().applyMatrix4(invRootRT);\r\n    \r\n                        // Axis unit lengths in body space\r\n                        const exBody = self.localToWorld(new THREE.Vector3(1, 0, 0)).applyMatrix4(invRootRT).sub(originBody).length();\r\n                        const eyBody = self.localToWorld(new THREE.Vector3(0, 1, 0)).applyMatrix4(invRootRT).sub(originBody).length();\r\n                        const ezBody = self.localToWorld(new THREE.Vector3(0, 0, 1)).applyMatrix4(invRootRT).sub(originBody).length();\r\n    \r\n                        const sMax = Math.max(exBody, eyBody, ezBody);\r\n                        const radiusScaled = self.boundingVolume.radius * sMax;\r\n    \r\n                        self.colliderUUID = self.physics.sim.attachShapeCollider({\r\n                            bodyId: rbId,\r\n                            shape: ColliderShape.createBall(radiusScaled),\r\n                            localPosition: [centerInBody.x, centerInBody.y, centerInBody.z],\r\n                        });\r\n                        self._activeColliderShape = \"bounds\";\r\n                    }\r\n                }\r\n            } else {\r\n                // Invisible: apply maxLOD retention rule\r\n                if (level === maxLOD && hasChildrenTiles) {\r\n                    // keep any existing collider as fallback for deeper LODs\r\n                } else {\r\n                    // detach if exists\r\n                    detachBoundsCollider();\r\n                    self._activeColliderShape = undefined;\r\n                }\r\n            }\r\n            return;\r\n        }\r\n    \r\n        if (effectiveShape === \"mesh\" || effectiveShape === \"hull\") {\r\n            //console.log(effectiveShape+\"  \"+this.level)\r\n            // Make sure no stray bounds collider remains if shape switched\r\n            detachBoundsCollider();\r\n    \r\n            if (wantsColliderNow) {\r\n                // Only create when tile mesh is fully loaded\r\n                if (!(self.hasMeshContent && self.meshContent.length === self.hasMeshContent)) return;\r\n    \r\n                // Avoid duplicate creation\r\n                if (!Array.isArray(self.colliderUUIDs) || self.colliderUUIDs.length === 0) {\r\n                    self.colliderUUIDs = [];\r\n                    const attachMethod = (effectiveShape === \"hull\") ? \"addConvexHullCollider\" : \"attachTrimeshCollider\";\r\n\r\n                    const addMeshCollider = (meshObj) => {\r\n                        if (!meshObj || !meshObj.isMesh || !meshObj.geometry || !meshObj.geometry.isBufferGeometry) return;\r\n    \r\n                        // Transform from RB local (root RT) to mesh's world transform\r\n                        const m = new THREE.Matrix4().multiplyMatrices(invRootRT, meshObj.matrixWorld);\r\n                        const lp = new THREE.Vector3();\r\n                        const lq = new THREE.Quaternion();\r\n                        const lsTmp = new THREE.Vector3();\r\n                        m.decompose(lp, lq, lsTmp);\r\n    \r\n                        // Use true world scale for baking (positive, includes root scale)\r\n                        const worldS = new THREE.Vector3();\r\n                        meshObj.getWorldScale(worldS);\r\n                        worldS.set(Math.abs(worldS.x), Math.abs(worldS.y), Math.abs(worldS.z));\r\n    \r\n                        self.physics.sim[attachMethod]({\r\n                            bodyId: rbId,\r\n                            geometry: meshObj.geometry,\r\n                            localPosition: [lp.x, lp.y, lp.z],\r\n                            localRotation: lq,\r\n                            localScale: [worldS.x, worldS.y, worldS.z]\r\n                        }).then((colId) => {\r\n                            // If this tile ceases to be eligible, drop the collider immediately\r\n                            const currentShape = chooseColliderShape();\r\n                            const stillEligible = !self.deleted && (currentShape === \"mesh\" || currentShape === \"hull\");\r\n                            const stillWithinLOD = Math.floor(self.level || 0) <= maxLOD;\r\n                            const stillKeepWhenInvisible = (Math.floor(self.level || 0) === maxLOD && (Array.isArray(self.childrenTiles) && self.childrenTiles.length > 0));\r\n                            const shouldKeep = stillEligible && (self.materialVisibility ? stillWithinLOD : stillWithinLOD && stillKeepWhenInvisible);\r\n\r\n                            if (!shouldKeep) {\r\n                                if (colId) self.physics.sim.detachCollider({ colliderId: colId });\r\n                                return;\r\n                            }\r\n                            if (colId) self.colliderUUIDs.push(colId);\r\n                            self._activeColliderShape = effectiveShape;\r\n                        }).catch(() => { /* worker may have been disposed */ });\r\n                    };\r\n    \r\n                    // Iterate over all mesh contents and their children\r\n                    for (const mc of self.meshContent) {\r\n                        if (!mc || mc.isSplatsBatch) continue;\r\n                        if (mc.isMesh) addMeshCollider(mc);\r\n                        if (mc.traverse) mc.traverse(o => { if (o.isMesh) addMeshCollider(o); });\r\n                    }\r\n                }\r\n            } else {\r\n                // Invisible: apply maxLOD retention rule\r\n                if (level === maxLOD && hasChildrenTiles) {\r\n                    // keep existing colliders as fallback for deeper LODs\r\n                } else {\r\n                    detachMeshColliders();\r\n                    self._activeColliderShape = undefined;\r\n                }\r\n            }\r\n        }\r\n    }\r\n    _calculateUpdateMetric(camera, frustum) {\r\n        ////// return -1 if not in frustum\r\n        let distance = 0;\r\n        if (this.boundingVolume instanceof OBB) {\r\n            // box\r\n            tempOBB.copy(this.boundingVolume);\r\n            tempOBB.applyMatrix4(this.matrixWorld);\r\n            if (!tempOBB.inFrustum(frustum)) return -1;\r\n            if (this.clipShape != undefined) {\r\n                if ((this.clipShape.isSphere && !tempOBB.intersectsSphere(this.clipShape)) ||\r\n                    (this.clipShape.isOBB && !tempOBB.intersectsOBB(this.clipShape))\r\n                ) {\r\n                    return Number.MAX_VALUE;\r\n                }\r\n            }\r\n\r\n\r\n            distance = Math.max(0, tempOBB.distanceToPoint(camera.position) - camera.near);\r\n\r\n            /* tempSphere.center.copy(this.boundingVolume.center);\r\n            tempSphere.radius = Math.sqrt(this.boundingVolume.halfSize.x*this.boundingVolume.halfSize.x+ this.boundingVolume.halfSize.y*this.boundingVolume.halfSize.y+ this.boundingVolume.halfSize.z*this.boundingVolume.halfSize.z)\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n            distance = Math.max(0, camera.position.distanceTo(tempSphere.center) - tempSphere.radius - camera.near); */\r\n            //console.log(\"distSphere \" + distance)\r\n        } else if (this.boundingVolume instanceof THREE.Sphere) {\r\n            //sphere\r\n            tempSphere.copy(this.boundingVolume);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            if (this.clipShape != undefined) {\r\n                if ((this.clipShape.isOBB && !this.clipShape.intersectsSphere(tempSphere)) ||\r\n                    (this.clipShape.isSphere && !this.clipShape.intersectsSphere(tempSphere))\r\n                ) {\r\n                    return Number.MAX_VALUE;\r\n                }\r\n            }\r\n\r\n            if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n            distance = Math.max(0, camera.position.distanceTo(tempSphere.center) - tempSphere.radius - camera.near);\r\n        } else {\r\n            console.error(\"unsupported shape\");\r\n            return -1\r\n\r\n        }\r\n        /////// Apply the bias factor to the distance\r\n        distance = Math.pow(distance, this.distanceBias);\r\n        /////// return metric based on geometric error and distance\r\n\r\n\r\n        if (distance == 0) {\r\n            return 0;\r\n        }\r\n        const scale = this.matrixWorld.getMaxScaleOnAxis();\r\n        if (!!this.renderer) {\r\n            this.renderer.getDrawingBufferSize(this.rendererSize);\r\n        }\r\n        let s = this.rendererSize.y;\r\n        let fov = camera.fov;\r\n        if (camera.aspect < 1) {\r\n            fov *= camera.aspect;\r\n            s = this.rendererSize.x;\r\n        }\r\n\r\n        let lambda = 2.0 * Math.tan(0.5 * fov * 0.01745329251994329576923690768489) * distance;\r\n        return (16 * lambda) / (s * scale);\r\n    }\r\n\r\n    _getSiblings() {\r\n        const self = this;\r\n        const tiles = [];\r\n        if (!self.parentTile) return tiles;\r\n        let p = self.parentTile;\r\n        while (!p.hasMeshContent && !!p.parentTile) {\r\n            p = p.parentTile;\r\n        }\r\n        p.childrenTiles.forEach(child => {\r\n            if (!!child && child != self) {\r\n                while (!child.hasMeshContent && !!child.childrenTiles[0]) {\r\n                    child = child.childrenTiles[0];\r\n                }\r\n                tiles.push(child);\r\n            }\r\n        });\r\n        return tiles;\r\n    }\r\n    _calculateDistanceToCamera(camera) {\r\n        if (this.boundingVolume instanceof OBB) {\r\n            // box\r\n            tempOBB.copy(this.boundingVolume);\r\n            tempOBB.applyMatrix4(this.matrixWorld);\r\n            return Math.max(0, tempOBB.distanceToPoint(camera.position));\r\n            //if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n        } else if (this.boundingVolume instanceof THREE.Sphere) {\r\n            //sphere\r\n            tempSphere.copy(this.boundingVolume);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            return Math.max(0, camera.position.distanceTo(tempSphere.center) - tempSphere.radius);\r\n        }\r\n        else {\r\n            console.error(\"unsupported shape\");\r\n            return -1;\r\n        }\r\n\r\n    }\r\n\r\n    /**\r\n     * Set the Geometric Error Multiplier for the tileset.\r\n     * the {@param geometricErrorMultiplier} can be a number between 1 and infinity.\r\n     * A {@param geometricErrorMultiplier} of 1 (default) corresponds to a max ScreenSpace error (MSE) of 16.  \r\n     * A lower {@param geometricErrorMultiplier} loads less detail (higher MSE) and a higher {@param geometricErrorMultiplier} loads more detail (lower MSE)\r\n     * \r\n     * @param {Number} geometricErrorMultiplier set the LOD multiplier for the entire tileset\r\n     */\r\n    setGeometricErrorMultiplier(geometricErrorMultiplier) {\r\n        this.geometricErrorMultiplier = geometricErrorMultiplier;\r\n        //this.splatsReady = true;\r\n        this.childrenTiles.forEach(child => child.setGeometricErrorMultiplier(geometricErrorMultiplier));\r\n    }\r\n\r\n    /**\r\n     * Set the Distance Bias for the tileset.\r\n     * the {@param distanceBias} can be a number between 0 and infinity.\r\n     * A {@param distanceBias} is applied as an exponent to camera-to-tile distance.  \r\n     * the {@link geometricErrorMultiplier} should be used to balance out the amount of detail loaded\r\n     * \r\n     * @param {Number} distanceBias set the distance bias for the entire tileset\r\n     */\r\n    setDistanceBias(distanceBias) {\r\n        this.distanceBias = distanceBias;\r\n        this.childrenTiles.forEach(child => child.setDistanceBias(distanceBias));\r\n    }\r\n\r\n    _transformWGS84ToCartesian(lon, lat, h, sfct) {\r\n        const a = 6378137.0;\r\n        const e = 0.006694384442042;\r\n        const N = a / (Math.sqrt(1.0 - (e * Math.pow(Math.sin(lat), 2))));\r\n        const cosLat = Math.cos(lat);\r\n        const cosLon = Math.cos(lon);\r\n        const sinLat = Math.sin(lat);\r\n        const sinLon = Math.sin(lon);\r\n        const nPh = (N + h);\r\n        const x = nPh * cosLat * cosLon;\r\n        const y = nPh * cosLat * sinLon;\r\n        const z = (0.993305615557957 * N + h) * sinLat;\r\n\r\n        sfct.set(x, y, z);\r\n    }\r\n\r\n\r\n    hideCopyright() {\r\n        _hideCopyright();\r\n    }\r\n    showCopyright() {\r\n        _showCopyright();\r\n    }\r\n}\r\nexport { OGC3DTile, getOGC3DTilesCopyrightInfo };\r\n\r\nfunction _showError(error) {\r\n    // Create a new div element\r\n    var errorDiv = document.createElement(\"div\");\r\n\r\n    // Set its text content\r\n    errorDiv.textContent = error;\r\n\r\n    // Set styles\r\n    errorDiv.style.position = 'fixed'; // Fix position to the viewport\r\n    errorDiv.style.top = '10px'; // Set top position\r\n    errorDiv.style.left = '50%'; // Center horizontally\r\n    errorDiv.style.transform = 'translateX(-50%)'; // Make sure it's centered accurately\r\n    errorDiv.style.padding = '10px'; // Add some padding\r\n    errorDiv.style.backgroundColor = '#ff8800'; // Set a background color\r\n    errorDiv.style.color = '#ffffff'; // Set a text color\r\n    errorDiv.style.zIndex = '9999'; // Make sure it's on top of other elements\r\n\r\n    // Append the new div to the body\r\n    document.body.appendChild(errorDiv);\r\n\r\n    // After 3 seconds, remove the error message\r\n    setTimeout(function () {\r\n        errorDiv.remove();\r\n    }, 8000);\r\n}\r\n\r\nfunction _hideCopyright() {\r\n    if (!copyrightDiv) {\r\n        copyrightDiv = document.createElement('div');\r\n        copyrightDiv.style.position = 'fixed';\r\n        copyrightDiv.style.bottom = '20px';\r\n        copyrightDiv.style.left = '20px';\r\n        copyrightDiv.style.color = 'white';\r\n        copyrightDiv.style.textShadow = '2px 2px 0 #000, -1px -1px 0 #000, 1px -1px 0 #000, -1px 1px 0 #000, 1px 1px 0 #000';\r\n        copyrightDiv.style.padding = '10px';\r\n        copyrightDiv.style.backgroundColor = 'rgba(0, 0, 0, 0.1)'; // semi-transparent black background\r\n\r\n        // Append the div to the body of the document\r\n        document.body.appendChild(copyrightDiv);\r\n    }\r\n    copyrightDiv.style.opacity = 0;\r\n}\r\nfunction _showCopyright() {\r\n    if (!copyrightDiv) {\r\n        copyrightDiv = document.createElement('div');\r\n        copyrightDiv.style.position = 'fixed';\r\n        copyrightDiv.style.bottom = '20px';\r\n        copyrightDiv.style.left = '20px';\r\n        copyrightDiv.style.color = 'white';\r\n        copyrightDiv.style.textShadow = '2px 2px 0 #000, -1px -1px 0 #000, 1px -1px 0 #000, -1px 1px 0 #000, 1px 1px 0 #000';\r\n        copyrightDiv.style.padding = '10px';\r\n        copyrightDiv.style.backgroundColor = 'rgba(0, 0, 0, 0.1)'; // semi-transparent black background\r\n\r\n        // Append the div to the body of the document\r\n        document.body.appendChild(copyrightDiv);\r\n    }\r\n    copyrightDiv.style.opacity = 1;\r\n}\r\nfunction _updateCopyrightLabel() {\r\n    // Create a new div\r\n    if (!copyrightDiv) {\r\n        copyrightDiv = document.createElement('div');\r\n        copyrightDiv.style.position = 'fixed';\r\n        copyrightDiv.style.bottom = '20px';\r\n        copyrightDiv.style.left = '20px';\r\n        copyrightDiv.style.color = 'white';\r\n        copyrightDiv.style.textShadow = '2px 2px 0 #000, -1px -1px 0 #000, 1px -1px 0 #000, -1px 1px 0 #000, 1px 1px 0 #000';\r\n        copyrightDiv.style.padding = '10px';\r\n        copyrightDiv.style.backgroundColor = 'rgba(0, 0, 0, 0.1)'; // semi-transparent black background\r\n\r\n        // Append the div to the body of the document\r\n        document.body.appendChild(copyrightDiv);\r\n    }\r\n\r\n    // Set the text content of the div\r\n    const list = getOGC3DTilesCopyrightInfo();\r\n    let listString = \"\";\r\n    list.forEach(item => {\r\n        listString += item + \", \";\r\n    });\r\n    listString = listString.slice(0, -2);\r\n\r\n    copyrightDiv.textContent = listString\r\n    // Style the div\r\n\r\n}\r\n\r\n","import * as THREE from 'three';\r\nimport { OBB } from \"../../geometry/obb\";\r\nimport { v4 as uuidv4 } from \"uuid\";\r\nimport * as path from \"path-browserify\";\r\n\r\nconst tempSphere = new THREE.Sphere(new THREE.Vector3(0, 0, 0), 1);\r\nconst tempVec1 = new THREE.Vector3(0, 0, 0);\r\nconst tempVec2 = new THREE.Vector3(0, 0, 0);\r\nconst upVector = new THREE.Vector3(0, 1, 0);\r\nconst rendererSize = new THREE.Vector2();\r\nconst tempQuaternion = new THREE.Quaternion();\r\nconst tempMatrix = new THREE.Matrix4();\r\n\r\nclass InstancedTile extends THREE.Object3D {\r\n\r\n    /**\r\n     * \r\n     * @param {\r\n     *   json: optional,\r\n     *   url: optional,\r\n     *   rootPath: optional,\r\n     *   parentGeometricError: optional,\r\n     *   parentBoundingVolume: optional,\r\n     *   parentRefinement: optional,\r\n     *   loadOutsideView: Boolean,\r\n     *   tileLoader : InstancedTileLoader,\r\n     *   cameraOnLoad: camera,\r\n     *   parentTile: OGC3DTile,\r\n     *   onLoadCallback: function,\r\n     *   centerModel: Boolean,\r\n     *   queryParams: String,\r\n     *   distanceBias: distanceBias\r\n     * } properties \r\n     */\r\n    constructor(properties) {\r\n        super();\r\n        const self = this;\r\n        if (properties.queryParams) {\r\n            this.queryParams = { ...properties.queryParams };\r\n        }\r\n        this.uuid = uuidv4();\r\n        if (!!properties.tileLoader) {\r\n            this.tileLoader = properties.tileLoader;\r\n        } else {\r\n            console.error(\"an instanced tileset must be provided an InstancedTilesetLoader\");\r\n        }\r\n        // set properties general to the entire tileset\r\n        this.master = properties.master;\r\n        this.loadOutsideView = properties.loadOutsideView;\r\n        this.cameraOnLoad = properties.cameraOnLoad;\r\n        this.parentTile = properties.parentTile;\r\n        this.distanceBias = Math.max(0.0001,properties.distanceBias? properties.distanceBias:1);\r\n\r\n        // declare properties specific to the tile for clarity\r\n        this.childrenTiles = [];\r\n        this.jsonChildren = [];\r\n        this.meshContent = new Set();\r\n\r\n        this.static = properties.static;\r\n        if (this.static) {\r\n            this.matrixAutoUpdate = false;\r\n            this.matrixWorldAutoUpdate = false;\r\n        }\r\n        this.tileContent;\r\n        this.refinement; // defaults to \"REPLACE\"\r\n        this.rootPath;\r\n        this.geometricError;\r\n        this.boundingVolume;\r\n        this.json; // the json corresponding to this tile\r\n        this.materialVisibility = false;\r\n        this.inFrustum = true;\r\n        this.level = properties.level ? properties.level : 0;\r\n        this.hasMeshContent = 0; // true when the provided json has a content field pointing to a B3DM file\r\n        this.hasUnloadedJSONContent = 0; // true when the provided json has a content field pointing to a JSON file that is not yet loaded\r\n        this.centerModel = properties.centerModel;\r\n\r\n        this.deleted = false;\r\n        this.abortController = new AbortController();\r\n\r\n        if (!!properties.json) { // If this tile is created as a child of another tile, properties.json is not null\r\n            this.rootPath = !!properties.json.rootPath ? properties.json.rootPath : properties.rootPath;\r\n            if (properties.json.children) this.jsonChildren = properties.json.children;\r\n            self.setup(properties);\r\n        } else if (properties.url) { // If only the url to the tileset.json is provided\r\n\r\n\r\n            this.loadJson = (json, url) => {\r\n                //json = JSON.parse(JSON.stringify(json))\r\n                const p = path.dirname(url);\r\n                self.setup({ rootPath: p, json: json, onLoadCallback: properties.onLoadCallback });\r\n\r\n\r\n\r\n            }\r\n            var url = properties.url;\r\n            if (self.queryParams) {\r\n                var props = \"\";\r\n                for (let key in self.queryParams) {\r\n                    if (self.queryParams.hasOwnProperty(key)) { // This check is necessary to skip properties from the object's prototype chain\r\n                        props += \"&\" + key + \"=\" + self.queryParams[key];\r\n                    }\r\n                }\r\n                if (url.includes(\"?\")) {\r\n                    url += props;\r\n                } else {\r\n                    url += \"?\" + props.substring(1);\r\n                }\r\n            }\r\n            self.tileLoader.get(self.abortController, url, self.uuid, self);\r\n        }\r\n    }\r\n\r\n    async setup(properties) {\r\n        const self = this;\r\n\r\n        if (!!properties.json.root) {\r\n            self.json = properties.json.root;\r\n            if (!self.json.children && self.json.getChildren) {\r\n                self.json.children = await self.json.getChildren();\r\n            }\r\n            self.jsonChildren = self.json.children;\r\n            if (!self.json.refinement) self.json.refinement = properties.json.refinement;\r\n            if (!self.json.geometricError) self.json.geometricError = properties.json.geometricError;\r\n            if (!self.json.transform) self.json.transform = properties.json.transform;\r\n            if (!self.json.boundingVolume) self.json.boundingVolume = properties.json.boundingVolume;\r\n        } else {\r\n            self.json = properties.json;\r\n            if (!self.json.children && self.json.getChildren) {\r\n                self.json.children = await self.json.getChildren();\r\n                self.jsonChildren = self.json.children;\r\n            }\r\n        }\r\n\r\n        self.rootPath = !!properties.json.rootPath ? properties.json.rootPath : properties.rootPath;\r\n\r\n        // decode refinement\r\n        if (!!self.json.refinement) {\r\n            self.refinement = self.json.refinement;\r\n        } else {\r\n            self.refinement = properties.parentRefinement;\r\n        }\r\n        // decode geometric error\r\n        if (!!self.json.geometricError) {\r\n            self.geometricError = self.json.geometricError;\r\n        } else {\r\n            self.geometricError = properties.parentGeometricError;\r\n        }\r\n        // decode transform\r\n        let mat = new THREE.Matrix4();\r\n        if (!!self.json.transform && !self.centerModel) {\r\n            mat.elements = self.json.transform;\r\n        }\r\n\r\n        self.applyMatrix4(mat);\r\n\r\n        if (!!self.parentTile && !!self.parentTile.matrix) {\r\n\r\n            self.matrix.premultiply(self.parentTile.matrix);\r\n            //self.matrix.premultiply(self.master.matrixWorld);\r\n            self.matrix.decompose(self.position, self.quaternion, self.scale)\r\n        }\r\n\r\n\r\n        self.matrixWorldNeedsUpdate = true;\r\n        self.updateWorldMatrix(true, true)\r\n        \r\n\r\n        // decode volume\r\n        if (!!self.json.boundingVolume) {\r\n            if (!!self.json.boundingVolume.box) {\r\n                self.boundingVolume = new OBB(self.json.boundingVolume.box);\r\n            } else if (!!self.json.boundingVolume.region) {\r\n                const region = self.json.boundingVolume.region;\r\n                self.transformWGS84ToCartesian(region[0], region[1], region[4], tempVec1);\r\n                self.transformWGS84ToCartesian(region[2], region[3], region[5], tempVec2);\r\n                tempVec1.lerp(tempVec2, 0.5);\r\n                self.boundingVolume = new THREE.Sphere(new THREE.Vector3(tempVec1.x, tempVec1.y, tempVec1.z), tempVec1.distanceTo(tempVec2));\r\n            } else if (!!self.json.boundingVolume.sphere) {\r\n                const sphere = self.json.boundingVolume.sphere;\r\n                self.boundingVolume = new THREE.Sphere(new THREE.Vector3(sphere[0], sphere[1], sphere[2]), sphere[3]);\r\n            } else {\r\n                self.boundingVolume = properties.parentBoundingVolume;\r\n            }\r\n        } else {\r\n            self.boundingVolume = properties.parentBoundingVolume;\r\n        }\r\n\r\n        function checkContent(e) {\r\n            if (!!e.uri && e.uri.includes(\"json\")) {\r\n                self.hasUnloadedJSONContent++;\r\n            } else if (!!e.url && e.url.includes(\"json\")) {\r\n                self.hasUnloadedJSONContent++;\r\n            } else {\r\n                self.hasMeshContent++;\r\n            }\r\n        }\r\n        if (!!self.json.content) { //if there is a content, json or otherwise, schedule it to be loaded \r\n            checkContent(self.json.content);\r\n\r\n            self.load();\r\n        } else if (!!self.json.contents) { //if there is a content, json or otherwise, schedule it to be loaded \r\n            self.json.contents.forEach(e => checkContent(e))\r\n\r\n            self.load();\r\n            //scheduleLoadTile(this);\r\n        }\r\n\r\n        if (!!self.centerModel) {\r\n            const tempSphere = new THREE.Sphere();\r\n            if (self.boundingVolume instanceof OBB) {\r\n                // box\r\n                tempSphere.copy(self.boundingVolume.sphere);\r\n            } else if (self.boundingVolume instanceof THREE.Sphere) {\r\n                //sphere\r\n                tempSphere.copy(self.boundingVolume);\r\n            }\r\n\r\n            //tempSphere.applyMatrix4(self.matrixWorld);\r\n            if (!!this.json.boundingVolume.region) {\r\n                self.transformWGS84ToCartesian(\r\n                    (self.json.boundingVolume.region[0] + self.json.boundingVolume.region[2]) * 0.5,\r\n                    (self.json.boundingVolume.region[1] + self.json.boundingVolume.region[3]) * 0.5,\r\n                    (self.json.boundingVolume.region[4] + self.json.boundingVolume.region[5]) * 0.5,\r\n                    tempVec1);\r\n\r\n                tempQuaternion.setFromUnitVectors(tempVec1.normalize(), upVector.normalize());\r\n                self.master.applyQuaternion(tempQuaternion);\r\n                self.master.updateWorldMatrix(false, false)\r\n            }\r\n            tempMatrix.makeTranslation(-tempSphere.center.x * self.scale.x, -tempSphere.center.y * self.scale.y, -tempSphere.center.z * self.scale.z);\r\n            //self.master.applyMatrix4(tempMatrix);\r\n            self.master.matrix.multiply(tempMatrix);\r\n            self.master.matrix.decompose(self.master.position, self.master.quaternion, self.master.scale);\r\n        }\r\n\r\n        self.isSetup = true;\r\n        if (properties.onLoadCallback) properties.onLoadCallback(self);\r\n    }\r\n\r\n    isAbsolutePathOrURL(input) {\r\n        // Check if it's an absolute URL with various protocols\r\n        const urlRegex = /^(?:http|https|ftp|tcp|udp):\\/\\/\\S+/;\r\n        const absoluteURL = urlRegex.test(input);\r\n\r\n        // Check if it's an absolute path\r\n        const absolutePath = input.startsWith('/') && !input.startsWith('//');\r\n\r\n        return absoluteURL || absolutePath;\r\n    }\r\n\r\n    assembleURL(root, relative) {\r\n        // Append a slash to the root URL if it doesn't already have one\r\n        if (!root.endsWith('/')) {\r\n            root += '/';\r\n        }\r\n\r\n        const rootUrl = new URL(root);\r\n        let rootParts = rootUrl.pathname.split('/').filter(p => p !== '');\r\n        let relativeParts = relative.split('/').filter(p => p !== '');\r\n\r\n        for (let i = 1; i <= rootParts.length; i++) {\r\n            if (i >= relativeParts.length) break;\r\n            const rootToken = rootParts.slice(rootParts.length - i, rootParts.length).join('/');\r\n            const relativeToken = relativeParts.slice(0, i).join('/');\r\n            if (rootToken === relativeToken) {\r\n                for (let j = 0; j < i; j++) {\r\n                    rootParts.pop();\r\n                }\r\n                break;\r\n            }\r\n        }\r\n\r\n\r\n        while (relativeParts.length > 0 && relativeParts[0] === '..') {\r\n            rootParts.pop();\r\n            relativeParts.shift();\r\n        }\r\n\r\n        return `${rootUrl.protocol}//${rootUrl.host}/${[...rootParts, ...relativeParts].join('/')}`;\r\n    }\r\n    extractQueryParams(url, params) {\r\n        const urlObj = new URL(url);\r\n\r\n        // Iterate over all the search parameters\r\n        for (let [key, value] of urlObj.searchParams) {\r\n            params[key] = value;\r\n        }\r\n\r\n        // Remove the query string\r\n        urlObj.search = '';\r\n        return urlObj.toString();\r\n    }\r\n    load() {\r\n        var self = this;\r\n        if (self.deleted) return;\r\n        if (!!self.json.content) {\r\n\r\n            loadContent(self.json.content);\r\n        } else if (!!self.json.contents) {\r\n            self.json.contents.forEach(content => loadContent(content))\r\n        }\r\n        function loadContent(content) {\r\n            let url;\r\n            if (!!content.uri) {\r\n                url = content.uri;\r\n            } else if (!!content.url) {\r\n                url = content.url;\r\n            }\r\n            const urlRegex = /^(?:http|https|ftp|tcp|udp):\\/\\/\\S+/;\r\n\r\n            if (urlRegex.test(self.rootPath)) { // url\r\n                if (!urlRegex.test(url)) {\r\n                    url = self.assembleURL(self.rootPath, url)\r\n                }\r\n            } else { //path\r\n                if (path.isAbsolute(self.rootPath)) {\r\n                    url = self.rootPath + path.sep + url;\r\n                }\r\n            }\r\n            url = self.extractQueryParams(url, self.queryParams);\r\n            if (self.queryParams) {\r\n                var props = \"\";\r\n                for (let key in self.queryParams) {\r\n                    if (self.queryParams.hasOwnProperty(key)) { // This check is necessary to skip properties from the object's prototype chain\r\n                        props += \"&\" + key + \"=\" + self.queryParams[key];\r\n                    }\r\n                }\r\n                if (url.includes(\"?\")) {\r\n                    url += props;\r\n                } else {\r\n                    url += \"?\" + props.substring(1);\r\n                }\r\n            }\r\n\r\n            if (!!url) {\r\n                if (url.includes(\".b3dm\") || url.includes(\".glb\") || url.includes(\".gltf\")) {\r\n                    self.contentURL = url;\r\n\r\n\r\n                    self.tileLoader.get(self.abortController, url, self.uuid, self, !self.cameraOnLoad ? () => 0 : () => {\r\n                        return self.calculateDistanceToCamera(self.cameraOnLoad);\r\n                    }, () => self.getSiblings(),\r\n                        self.level,\r\n                        !!self.json.boundingVolume.region ? false : true,\r\n                        !!self.json.boundingVolume.region,\r\n                        self.geometricError);\r\n                } else if (url.includes(\".json\")) {\r\n                    self.tileLoader.get(self.abortController, url, self.uuid, self);\r\n                }\r\n            }\r\n\r\n            \r\n        }\r\n\r\n    }\r\n\r\n    loadMesh(mesh) {\r\n        const self = this;\r\n        if (self.deleted) {\r\n            return;\r\n        }\r\n        //self.updateWorldMatrix(false, true);\r\n        self.meshContent.add(mesh);\r\n\r\n    }\r\n\r\n    loadJson(json, url) {\r\n        if (this.deleted) {\r\n            return;\r\n        }\r\n        if (!!this.json.children) {\r\n            this.jsonChildren = this.json.children;\r\n        }\r\n\r\n        json.rootPath = path.dirname(url);\r\n        this.jsonChildren.push(json);\r\n        this.hasUnloadedJSONContent--;\r\n    }\r\n\r\n    dispose() {\r\n\r\n        const self = this;\r\n        self.childrenTiles.forEach(tile => tile.dispose());\r\n\r\n        self.deleted = true;\r\n        if (self.abortController) self.abortController.abort();\r\n        this.parent = null;\r\n        this.parentTile = null;\r\n        this.dispatchEvent({ type: 'removed' });\r\n    }\r\n    disposeChildren() {\r\n\r\n        var self = this;\r\n\r\n        self.childrenTiles.forEach(tile => tile.dispose());\r\n        self.childrenTiles = [];\r\n\r\n    }\r\n\r\n\r\n    _update(camera, frustum) {\r\n        const self = this;\r\n        if (!self.isSetup) return;\r\n\r\n        const visibilityBeforeUpdate = self.materialVisibility;\r\n\r\n        if (!!self.boundingVolume && !!self.geometricError) {\r\n            self.metric = self.calculateUpdateMetric(camera, frustum);\r\n        }\r\n        self.childrenTiles.forEach(child => child._update(camera, frustum));\r\n\r\n        updateNodeVisibility(self.metric);\r\n        updateTree(self.metric);\r\n        trimTree(self.metric, visibilityBeforeUpdate);\r\n\r\n        function updateTree(metric) {\r\n            // If this tile does not have mesh content but it has children\r\n            if (metric < 0 && self.hasMeshContent) return;\r\n\r\n            if ((!self.hasMeshContent && self.rootPath) || (metric < self.master.geometricErrorMultiplier * self.geometricError && self.meshContent.size > 0)) {\r\n                if (!!self.json && !!self.jsonChildren && self.childrenTiles.length != self.jsonChildren.length) {\r\n                    loadJsonChildren();\r\n                    return;\r\n                }\r\n            }\r\n        }\r\n\r\n        function updateNodeVisibility(metric) {\r\n\r\n            //doesn't have a mesh content\r\n            if (!self.hasMeshContent) {\r\n                return;\r\n            }\r\n            // mesh content not yet loaded\r\n            if (self.meshContent.size < self.hasMeshContent) {\r\n                return;\r\n            }\r\n\r\n            // outside frustum\r\n            if (metric < 0) {\r\n                self.inFrustum = false;\r\n                self.changeContentVisibility(!!self.loadOutsideView);\r\n                return;\r\n            } else {\r\n                self.inFrustum = true;\r\n            }\r\n\r\n            // has no children\r\n            if (self.childrenTiles.length == 0) {\r\n                self.changeContentVisibility(true);\r\n                return;\r\n            }\r\n\r\n            // has children\r\n            if (metric >= self.master.geometricErrorMultiplier * self.geometricError) { // Ideal LOD or before ideal lod\r\n\r\n                self.changeContentVisibility(true);\r\n            } else if (metric < self.master.geometricErrorMultiplier * self.geometricError) { // Ideal LOD is past this one\r\n                // if children are visible and have been displayed, can be hidden\r\n                let allChildrenReady = true;\r\n                self.childrenTiles.every(child => {\r\n\r\n                    if (!child.isReady()) {\r\n                        allChildrenReady = false;\r\n                        return false;\r\n                    }\r\n                    return true;\r\n                });\r\n                if (allChildrenReady) {\r\n                    self.changeContentVisibility(false);\r\n                }\r\n            }\r\n        }\r\n\r\n        function trimTree(metric, visibilityBeforeUpdate) {\r\n            if (!self.hasMeshContent) return;\r\n            if (!self.inFrustum) { // outside frustum\r\n                self.disposeChildren();\r\n                updateNodeVisibility(metric);\r\n                return;\r\n            }\r\n            if (metric >= self.master.geometricErrorMultiplier * self.geometricError) {\r\n                self.disposeChildren();\r\n                updateNodeVisibility(metric);\r\n                return;\r\n            }\r\n\r\n        }\r\n\r\n\r\n        function loadJsonChildren() {\r\n            self.jsonChildren.forEach(childJSON => {\r\n                if (!childJSON.root && !childJSON.children && !childJSON.getChildren && !childJSON.content && !childJSON.contents) {\r\n                    return;\r\n                }\r\n                let childTile = new InstancedTile({\r\n                    parentTile: self,\r\n                    queryParams: self.queryParams,\r\n                    parentGeometricError: self.geometricError,\r\n                    parentBoundingVolume: self.boundingVolume,\r\n                    parentRefinement: self.refinement,\r\n                    json: childJSON,\r\n                    rootPath: self.rootPath,\r\n                    loadOutsideView: self.loadOutsideView,\r\n                    level: self.level + 1,\r\n                    tileLoader: self.tileLoader,\r\n                    cameraOnLoad: camera,\r\n                    master: self.master,\r\n                    centerModel: false,\r\n                });\r\n                self.childrenTiles.push(childTile);\r\n                //self.add(childTile);\r\n            });\r\n        }\r\n\r\n    }\r\n\r\n    areAllChildrenLoadedAndHidden() {\r\n        let allLoadedAndHidden = true;\r\n        const self = this;\r\n        this.childrenTiles.every(child => {\r\n            if (child.hasMeshContent) {\r\n                if (child.childrenTiles.length > 0) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n                if (!child.inFrustum) {\r\n                    return true;\r\n                };\r\n                if (!child.materialVisibility || child.meshesToDisplay != child.meshesDisplayed) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n            } else {\r\n                if (!child.areAllChildrenLoadedAndHidden()) {\r\n                    allLoadedAndHidden = false;\r\n                    return false;\r\n                }\r\n            }\r\n            return true;\r\n        });\r\n        return allLoadedAndHidden;\r\n    }\r\n\r\n    /**\r\n     * Node is ready if it is outside frustum, if it was drawn at least once or if all it's children are ready\r\n     * @returns true if ready\r\n     */\r\n    isReady() {\r\n        // if outside frustum\r\n        if (!this.inFrustum) return true;\r\n\r\n        // if json is not done loading\r\n        if (this.hasUnloadedJSONContent) {\r\n            return false;\r\n        }\r\n        if ((!this.hasMeshContent || this.meshContent.size == 0 || !this.materialVisibility)) {\r\n            if (this.childrenTiles.length > 0) {\r\n                var allChildrenReady = true;\r\n                this.childrenTiles.every(child => {\r\n                    if (!child.isReady()) {\r\n                        allChildrenReady = false;\r\n                        return false;\r\n                    }\r\n                    return true;\r\n                });\r\n                return allChildrenReady;\r\n            } else {\r\n                return false;\r\n            }\r\n\r\n        }\r\n        // if this tile has no mesh content\r\n        if (!this.hasMeshContent) {\r\n            return true;\r\n        }\r\n        // if mesh content not yet loaded\r\n        if (this.meshContent.size < this.hasMeshContent) {\r\n            return false;\r\n        }\r\n\r\n        // if this tile has been marked to hide it's content\r\n        if (!this.materialVisibility) {\r\n            return false;\r\n        }\r\n\r\n\r\n        return true;\r\n\r\n    }\r\n\r\n\r\n    changeContentVisibility(visibility) {\r\n        const self = this;\r\n        self.materialVisibility = visibility;\r\n\r\n\r\n\r\n    }\r\n    calculateUpdateMetric(camera, frustum) {\r\n        ////// return -1 if not in frustum\r\n        if (this.boundingVolume instanceof OBB) {\r\n            // box\r\n            tempSphere.copy(this.boundingVolume.sphere);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n        } else if (this.boundingVolume instanceof THREE.Sphere) {\r\n            //sphere\r\n            tempSphere.copy(this.boundingVolume);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n        } else {\r\n            console.error(\"unsupported shape\");\r\n            return -1\r\n        }\r\n\r\n        /////// return metric based on geometric error and distance\r\n\r\n        let distance = Math.max(0, camera.position.distanceTo(tempSphere.center) - tempSphere.radius);\r\n\r\n        /////// Apply the bias factor to the distance\r\n        distance = Math.pow(distance,this.distanceBias);\r\n\r\n        if (distance == 0) {\r\n            return 0;\r\n        }\r\n        const scale = this.matrixWorld.getMaxScaleOnAxis();\r\n        this.master._renderSize(rendererSize);\r\n        let s = rendererSize.y;\r\n        let fov = camera.fov;\r\n        if (camera.aspect < 1) {\r\n            fov *= camera.aspect;\r\n            s = rendererSize.x;\r\n        }\r\n\r\n        let lambda = 2.0 * Math.tan(0.5 * fov * 0.01745329251994329576923690768489) * distance;\r\n\r\n        return (window.devicePixelRatio * 16 * lambda) / (s * scale);\r\n\r\n    }\r\n\r\n    getSiblings() {\r\n        const self = this;\r\n        const tiles = [];\r\n        if (!self.parentTile) return tiles;\r\n        let p = self.parentTile;\r\n        while (!p.hasMeshContent && !!p.parentTile) {\r\n            p = p.parentTile;\r\n        }\r\n        p.childrenTiles.forEach(child => {\r\n            if (!!child && child != self) {\r\n                while (!child.hasMeshContent && !!child.childrenTiles[0]) {\r\n                    child = child.childrenTiles[0];\r\n                }\r\n                tiles.push(child);\r\n            }\r\n        });\r\n        return tiles;\r\n    }\r\n    calculateDistanceToCamera(camera) {\r\n        if (this.boundingVolume instanceof OBB) {\r\n            // box\r\n            tempSphere.copy(this.boundingVolume.sphere);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            //if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n        } else if (this.boundingVolume instanceof THREE.Sphere) {\r\n            //sphere\r\n            tempSphere.copy(this.boundingVolume);\r\n            tempSphere.applyMatrix4(this.matrixWorld);\r\n            //if (!frustum.intersectsSphere(tempSphere)) return -1;\r\n        }\r\n        else {\r\n            console.error(\"unsupported shape\")\r\n        }\r\n        return Math.max(0, camera.position.distanceTo(tempSphere.center) - tempSphere.radius);\r\n    }\r\n\r\n    getWorldMatrix() {\r\n        const self = this;\r\n        return self.matrixWorld;\r\n    }\r\n\r\n    transformWGS84ToCartesian(lon, lat, h, sfct) {\r\n        const a = 6378137.0;\r\n        const e = 0.006694384442042;\r\n        const N = a / (Math.sqrt(1.0 - (e * Math.pow(Math.sin(lat), 2))));\r\n        const cosLat = Math.cos(lat);\r\n        const cosLon = Math.cos(lon);\r\n        const sinLat = Math.sin(lat);\r\n        const sinLon = Math.sin(lon);\r\n        const nPh = (N + h);\r\n        const x = nPh * cosLat * cosLon;\r\n        const y = nPh * cosLat * sinLon;\r\n        const z = (0.993305615557957 * N + h) * sinLat;\r\n\r\n        sfct.set(x, y, z);\r\n    }\r\n}\r\nexport { InstancedTile };","import * as THREE from 'three';\r\nimport {InstancedTile} from \"./InstancedTile.js\"\r\n\r\n/**\r\n * Similarly to {@link OGC3DTile}, this class that extends THREE.Object3D loads a tiled and multileveled OGC3DTiles 1.0 or 1.1 dataset.\r\n * The difference is that tiles are instanced. This is useful when one wants to load the same tileset hundreds or even thousands of times.\r\n * Imagine rendering hundreds of very high detail cars driving in a city.\r\n * Each tile content is instanced but each {@link InstancedOGC3DTile} object also has it's own LOD tree making this scenario very efficient.\r\n * @class\r\n */\r\nclass InstancedOGC3DTile extends THREE.Object3D {\r\n\r\n    /**\r\n     * \r\n     * @param {Object} [properties] - the properties for this tileset\r\n     * @param {Object} [properties.url] - the url to the parent tileset.json\r\n     * @param {Object} [properties.pathParams] - optional, path params to add to individual tile urls (starts with \"?\").\r\n     * @param {Object} [properties.geometricErrorMultiplier] - the geometric error of the parent. 1.0 by default corresponds to a maxScreenSpaceError of 16\r\n     * @param {Object} [properties.loadOutsideView] - if truthy, tiles otside the camera frustum will be loaded with the least possible amount of detail\r\n     * @param {Object} [properties.tileLoader] - A tile loader that can be shared among tilesets in order to share a common cache.\r\n     * @param {Object} [properties.pointsCallback] - A callback function that will be called on every points\r\n     * @param {Object} [properties.onLoadCallback] - A callback function that will be called when the root tile has been loaded\r\n     * @param {Object} [properties.occlusionCullingService] - A service that handles occlusion culling\r\n     * @param {Object} [properties.centerModel] - If true, the tileset will be centered on 0,0,0 and in the case of georeferenced tilesets that use the \"region\" bounding volume, it will also be rotated so that the up axis matched the world y axis.\r\n     * @param {Object} [properties.static] - If true, the tileset is considered static which improves performance but the tileset cannot be moved\r\n     * @param {Object} [properties.rootPath] - optional the root path for fetching children\r\n     * @param {Object} [properties.json] - optional json object representing the tileset sub-tree\r\n     * @param {Object} [properties.parentGeometricError] - optional geometric error of the parent\r\n     * @param {Object} [properties.parentBoundingVolume] - optional bounding volume of the parent\r\n     * @param {Object} [properties.parentRefinement] - optional refinement strategy of the parent of the parent\r\n     * @param {Object} [properties.cameraOnLoad] - optional the camera used when loading this particular sub-tile\r\n     * @param {Object} [properties.parentTile] - optional the OGC3DTile object that loaded this tile as a child\r\n     * @param {Number} [properties.domWidth = 1000] - optional the canvas width (used to calculate geometric error). If a renderer is provided, it'll be used instead, else a default value is used.  \r\n     * @param {Number} [properties.domHeight = 1000] - optional the canvas height (used to calculate geometric error). If a renderer is provided, it'll be used instead, else a default value is used.  \r\n     * @param {Object} [properties.renderer = undefined] - optional the renderer is used to infer the canvas size and compute tiles geometric error.\r\n     * @param {Number} [properties.distanceBias] - optional a bias that allows loading more or less detail closer to the camera relative to far away. The value should be a positive number. A value below 1 loads less detail near the camera and a value above 1 loads more detail near the camera. This needs to be compensated by the geometricErrorMultiplier in order to load a reasonable number of tiles.\r\n     */\r\n    constructor(properties) {\r\n        super();\r\n        properties.master = this;\r\n        \r\n        if(!!properties.domWidth && !!properties.domHeight){\r\n            this.rendererSize = new THREE.Vector2(properties.domWidth, properties.domHeight);\r\n        }else{\r\n            this.rendererSize = new THREE.Vector2(1000, 1000);\r\n        }\r\n        this.renderer = properties.renderer;\r\n        this.distanceBias = Math.max(0.0001,properties.distanceBias? properties.distanceBias:1);\r\n\r\n        this.geometricErrorMultiplier = properties.geometricErrorMultiplier? properties.geometricErrorMultiplier:1.0;\r\n        this.tileset = new InstancedTile(properties);\r\n        if (properties.static) {\r\n            this.matrixAutoUpdate = false;\r\n        }\r\n        this.tileLoader = properties.tileLoader;\r\n    }\r\n\r\n    _renderSize(size){\r\n        if(!!this.renderer){\r\n            this.renderer.getDrawingBufferSize(size);\r\n        }else{\r\n            size.copy(this.rendererSize);\r\n        }\r\n        \r\n    }\r\n\r\n    /**\r\n     * Call this to specify the canvas width/height when it changes (used to compute tiles geometric error that controls tile refinement).\r\n     * It's unnecessary to call this when the {@link OGC3DTile} is instantiated with the renderer.\r\n     * \r\n     * @param {Number} width \r\n     * @param {Number} height \r\n     */\r\n     setCanvasSize(width, height){\r\n        this.rendererSize.set(width, height);\r\n    }\r\n    /**\r\n     * To be called in the render loop.\r\n     * @param {Three.Camera} camera a camera that the tileset will be rendered with.\r\n     */\r\n    update(camera, frustum){\r\n        if(!!frustum){\r\n            this.tileset._update(camera, frustum);\r\n        }else{\r\n            const frustum = new THREE.Frustum();\r\n            frustum.setFromProjectionMatrix(new THREE.Matrix4().multiplyMatrices(camera.projectionMatrix, camera.matrixWorldInverse));\r\n            this.tileset._update(camera, frustum);\r\n        }\r\n        \r\n    }\r\n    \r\n    /** \r\n     * Set the Geometric Error Multiplier for the tileset.\r\n     * the {@param geometricErrorMultiplier} can be a number between 1 and infinity.\r\n     * A {@param geometricErrorMultiplier} of 1 (default) corresponds to a max ScreenSpace error (MSE) of 16.  \r\n     * A lower {@param geometricErrorMultiplier} loads less detail (higher MSE) and a higher {@param geometricErrorMultiplier} loads more detail (lower MSE)\r\n     * \r\n     * @param {Number} geometricErrorMultiplier set the LOD multiplier for the entire tileset\r\n     */\r\n    setGeometricErrorMultiplier(geometricErrorMultiplier) {\r\n        this.geometricErrorMultiplier = geometricErrorMultiplier?geometricErrorMultiplier:1.0;\r\n    }\r\n}\r\nexport { InstancedOGC3DTile };","import * as THREE from 'three';\r\n\r\nclass MeshTile{\r\n    constructor(scene){\r\n        const self = this;\r\n        self.scene = scene;\r\n        self.instancedTiles = [];\r\n        self.instancedMesh;\r\n        \r\n\r\n        self.reuseableMatrix = new THREE.Matrix4();\r\n    }\r\n    addInstance(instancedTile){\r\n        const self = this;\r\n        instancedTile.added = true;\r\n        instancedTile.listOMesh = self.instancedTiles;\r\n        self.instancedTiles.push(instancedTile);\r\n        if(self.instancedMesh){\r\n            instancedTile.loadMesh(self.instancedMesh)\r\n        }\r\n    }\r\n\r\n    addToScene(){\r\n        //this.instancedMesh.instanceMatrix.setUsage( THREE.DynamicDrawUsage );\r\n        const self = this;\r\n        self.instancedMesh.setMatrixAt(0,new THREE.Matrix4());\r\n        self.instancedMesh.instanceMatrix.needsUpdate = true;\r\n        self.instancedMesh.count = 1;\r\n        \r\n        self.scene.add(self.instancedMesh);\r\n        self.instancedMesh.onAfterRender = () => {\r\n            delete self.instancedMesh.onAfterRender;\r\n            self.instancedMesh.displayedOnce = true;\r\n        };\r\n    }\r\n\r\n    setObject(instancedMesh){\r\n        const self = this;\r\n        self.instancedMesh = instancedMesh;\r\n        self.instancedMesh.matrixAutoUpdate = false;\r\n        self.instancedMesh.matrixWorldAutoUpdate = false;\r\n        if(!self.scene.children.includes(instancedMesh)){\r\n            this.addToScene();\r\n        }\r\n        \r\n        for(let i = 0; i<self.instancedTiles.length; i++){\r\n            self.instancedTiles[i].loadMesh(self.instancedMesh)\r\n        }\r\n    }\r\n\r\n    update(){\r\n        const self = this;\r\n\r\n        for(let i = self.instancedTiles.length-1; i>=0; i--){\r\n            if(self.instancedTiles[i].deleted){\r\n                self.instancedTiles.splice(i,1);\r\n            }\r\n        }\r\n        \r\n        if(!!self.instancedMesh){\r\n            \r\n            self.instancedMesh.count = 0;\r\n            self.instancedMesh.instancedTiles = [];\r\n            for(let i = 0; i<self.instancedTiles.length; i++){\r\n                self.instancedTiles[i].meshContent.add(self.instancedMesh);\r\n                if(self.instancedTiles[i].materialVisibility){\r\n                    self.instancedMesh.count++;\r\n                    self.reuseableMatrix.set(1,0,0,0,0,1,0,0,0,0,1,0,0,0,0,1);\r\n                    self.reuseableMatrix.multiply(self.instancedTiles[i].matrixWorld);\r\n                    self.reuseableMatrix.multiply(self.instancedMesh.baseMatrix);\r\n                    //self.reuseableMatrix.premultiply(self.instancedTiles[i].master.matrixWorld);\r\n                    self.instancedMesh.setMatrixAt(self.instancedMesh.count-1, self.reuseableMatrix );\r\n                    //self.instancedMesh.getMatrixAt(0, t);\r\n                    //console.log(self.instancedMesh.baseMatrix)\r\n                    self.instancedMesh.instancedTiles.push(self.instancedTiles[i])\r\n                }\r\n            }\r\n            \r\n            self.instancedMesh.instanceMatrix.needsUpdate = true;\r\n            self.instancedMesh.needsUpdate = true;\r\n            self.instancedMesh.computeBoundingSphere();\r\n        }\r\n    }\r\n\r\n    getCount(){\r\n        return this.instancedTiles.length;\r\n    }\r\n\r\n    dispose(){\r\n        const self = this;\r\n        if(self.instancedTiles.length>0){\r\n            return false;\r\n        }\r\n        else{\r\n            if(!!self.instancedMesh){\r\n                //console.log(self.instancedMesh.parent)\r\n                self.scene.remove(self.instancedMesh);\r\n                self.instancedMesh.traverse((o) => {\r\n                    if(o.dispose) o.dispose();\r\n                    if (o.material) {\r\n                        // dispose materials\r\n                        if (o.material.length) {\r\n                            for (let i = 0; i < o.material.length; ++i) {\r\n                                o.material[i].dispose();\r\n                            }\r\n                        }\r\n                        else {\r\n                            o.material.dispose()\r\n                        }\r\n                    }\r\n                    if (o.geometry) o.geometry.dispose();\r\n                });\r\n                self.instancedMesh.dispose();\r\n                return true;\r\n            }\r\n            return false;\r\n        }\r\n    }\r\n\r\n}export { MeshTile };","\r\n\r\nclass JsonTile{\r\n    constructor(){\r\n        const self = this;\r\n        self.count = 0;\r\n        self.json;\r\n        self.instancedTiles = [];\r\n    }\r\n\r\n    addInstance(instanceTile){\r\n        this.instancedTiles.push(instanceTile);\r\n        if(this.json){\r\n            instanceTile.loadJson(this.json, this.url)\r\n        }\r\n    }\r\n\r\n    \r\n\r\n    setObject(json, url){\r\n        const self = this;\r\n        self.json = json;\r\n        self.url = url;\r\n        for(let i = 0; i<self.instancedTiles.length; i++){\r\n            self.instancedTiles[i].loadJson( self.json, self.url );\r\n        }\r\n    }\r\n\r\n    getCount(){\r\n        return this.instancedTiles.length;\r\n    }\r\n    update(){\r\n        const self = this;\r\n        for(let i = self.instancedTiles.length-1; i>=0; i--){\r\n            if(self.instancedTiles[i].deleted){\r\n                self.instancedTiles.splice(i,1);\r\n            }\r\n        }\r\n    }\r\n    dispose(){\r\n        if(!!this.json && this.instancedTiles.length == 0){\r\n            return true;\r\n        }\r\n        return false;\r\n    }\r\n\r\n}export { JsonTile };","import * as THREE from 'three';\r\nimport { LinkedHashMap } from '../../utils/LinkedHashMap';\r\nimport { B3DMDecoder } from \"../../decoder/B3DMDecoder\";\r\nimport { MeshTile } from './MeshTile';\r\nimport { JsonTile } from './JsonTile';\r\nimport { GLTFLoader } from 'three/addons/loaders/GLTFLoader.js';\r\nimport { DRACOLoader } from 'three/addons/loaders/DRACOLoader.js';\r\nimport { KTX2Loader } from \"three/addons/loaders/KTX2Loader\";\r\nimport { resolveImplicite } from '../implicit/ImplicitTileResolver.js';\r\nimport { InstancedOGC3DTile } from './InstancedOGC3DTile';\r\nimport { MeshoptDecoder } from 'meshoptimizer';\r\n\r\nlet concurrentDownloads = 0;\r\n\r\n\r\n/**\r\n * A Tile loader that manages caching and load order for instanced tiles.\r\n * The cache is an LRU cache and is defined by the number of items it can hold.\r\n * The actual number of cached items might grow beyond max if all items are in use.\r\n * \r\n * The load order is designed for optimal perceived loading speed (nearby tiles are refined first).\r\n *\r\n */\r\nclass InstancedTileLoader {\r\n    /**\r\n     * Creates a tile loader with a maximum number of cached items and callbacks.\r\n     * The only required property is a renderer that will be used to visualize the tiles.\r\n     * The maxCachedItems property is the size of the cache in number of objects, mesh tile and tileset.json files.\r\n     * The mesh and point callbacks will be called for every incoming mesh or points.\r\n     *\r\n     * @param {scene} [scene] - a threejs scene.\r\n     * @param {Object} [options] - Optional configuration object.\r\n     * @param {number} [options.maxCachedItems=100] - the cache size.\r\n     * @param {number} [options.maxInstances=1] - the cache size.\r\n     * @param {function} [options.meshCallback] - A callback to call on newly decoded meshes.\r\n     * @param {function} [options.pointsCallback] - A callback to call on newly decoded points.\r\n     * @param {sring} [options.proxy] - An optional proxy that tile requests will be directed too as POST requests with the actual tile url in the body of the request.\r\n     * @param {KTX2Loader} [options.ktx2Loader = undefined] - A KTX2Loader (three/addons)\r\n     * @param {DRACOLoader} [options.dracoLoader = undefined] - A DRACOLoader (three/addons)\r\n     * @param {renderer} [options.renderer = undefined] - optional the renderer, this is required only for on the fly ktx2 support. not needed if you pass a ktx2Loader manually\r\n     \r\n     */\r\n    constructor(scene, options) {\r\n        this.zUpToYUpMatrix = new THREE.Matrix4();\r\n        this.zUpToYUpMatrix.set(1, 0, 0, 0,\r\n            0, 0, -1, 0,\r\n            0, 1, 0, 0,\r\n            0, 0, 0, 1);\r\n        this.maxCachedItems = 100;\r\n        this.maxInstances = 1;\r\n        this.proxy = options.proxy;\r\n        if (!!options) {\r\n            this.meshCallback = options.meshCallback;\r\n            this.pointsCallback = options.pointsCallback;\r\n            if (options.maxCachedItems) this.maxCachedItems = options.maxCachedItems;\r\n            if (options.maxInstances) this.maxInstances = options.maxInstances;\r\n\r\n        }\r\n\r\n\r\n        this.gltfLoader = new GLTFLoader();\r\n        if (!!options && !!options.dracoLoader) {\r\n            this.gltfLoader.setDRACOLoader(options.dracoLoader);\r\n            this.hasDracoLoader = true;\r\n        } else {\r\n            const dracoLoader = new DRACOLoader();\r\n            dracoLoader.setDecoderPath('https://www.gstatic.com/draco/versioned/decoders/1.4.3/');\r\n            this.gltfLoader.setDRACOLoader(dracoLoader);\r\n            this.gltfLoader.hasDracoLoader = true;\r\n        }\r\n\r\n        if (!!options && !!options.ktx2Loader) {\r\n            this.gltfLoader.setKTX2Loader(options.ktx2Loader);\r\n            this.hasKTX2Loader = true;\r\n        } else if (!!options && !!options.renderer) {\r\n            const ktx2Loader = new KTX2Loader();\r\n            ktx2Loader.setTranscoderPath('https://storage.googleapis.com/ogc-3d-tiles/basis/').detectSupport(options.renderer);\r\n            this.gltfLoader.setKTX2Loader(ktx2Loader);\r\n            this.gltfLoader.hasKTX2Loader = true;\r\n        }\r\n\r\n        this.gltfLoader.setMeshoptDecoder(MeshoptDecoder);\r\n        this.hasMeshOptDecoder = true;\r\n\r\n        this.b3dmDecoder = new B3DMDecoder(this.gltfLoader);\r\n\r\n\r\n        this.cache = new LinkedHashMap();\r\n        this.scene = scene;\r\n\r\n        this.ready = [];\r\n        this.downloads = [];\r\n        this.nextReady = [];\r\n        this.nextDownloads = [];\r\n\r\n    }\r\n\r\n    /**\r\n     * To be called in the render loop or at regular intervals.\r\n     * launches tile downloading and loading in an orderly fashion.\r\n     */\r\n    update() {\r\n        const self = this;\r\n        self._checkSize();\r\n        self.cache._data.forEach(v => {\r\n            v.update();\r\n        })\r\n\r\n        if (concurrentDownloads < 8) {\r\n            self._download();\r\n        }\r\n        self._loadBatch();\r\n    }\r\n\r\n\r\n    _download() {\r\n        const self = this;\r\n        if (self.nextDownloads.length == 0) {\r\n            self._getNextDownloads();\r\n            if (self.nextDownloads.length == 0) return;\r\n        }\r\n        while (self.nextDownloads.length > 0) {\r\n            const nextDownload = self.nextDownloads.shift();\r\n            if (!!nextDownload) {//} && nextDownload.shouldDoDownload()) {\r\n                //nextDownload.doDownload();\r\n                if (nextDownload.path.includes(\".b3dm\")) {\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(nextDownload.path);\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: nextDownload.path\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            console.error(\"could not load tile with path : \" + nextDownload.path)\r\n                            throw new Error(`couldn't load \"${nextDownload.path}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                        }\r\n                        return result.arrayBuffer();\r\n\r\n                    }).then(resultArrayBuffer => {\r\n                        return this.b3dmDecoder.parseB3DMInstanced(resultArrayBuffer, (mesh) => { self.meshCallback(mesh, nextDownload.geometricError) }, self.maxInstances, nextDownload.sceneZupToYup, nextDownload.meshZupToYup);\r\n                    }).then(mesh => {\r\n                        mesh.frustumCulled = false;\r\n                        nextDownload.tile.setObject(mesh);\r\n                        self.ready.unshift(nextDownload);\r\n\r\n                    }).catch(e => console.error(e))\r\n                        .finally(() => {\r\n                            concurrentDownloads--;\r\n                        });\r\n                } if (nextDownload.path.includes(\".glb\") || (nextDownload.path.includes(\".gltf\"))) {\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(nextDownload.path);\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: nextDownload.path\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            throw new Error(\"missing content\");\r\n                        }\r\n                        return result.arrayBuffer();\r\n                    }).then(async arrayBuffer => {\r\n                        await _checkLoaderInitialized(this.gltfLoader);\r\n                        this.gltfLoader.parse(arrayBuffer, null, gltf => {\r\n                            gltf.scene.asset = gltf.asset;\r\n\r\n                            if (nextDownload.sceneZupToYup) {\r\n                                gltf.scene.applyMatrix4(this.zUpToYUpMatrix);\r\n                            }\r\n                            gltf.scene.traverse((o) => {\r\n                                o.geometricError = nextDownload.geometricError;\r\n                                if (o.isMesh) {\r\n                                    if (nextDownload.meshZupToYup) {\r\n                                        o.applyMatrix4(this.zUpToYUpMatrix);\r\n                                    }\r\n                                    if (!!self.meshCallback) {\r\n                                        self.meshCallback(o, o.geometricError);\r\n                                    }\r\n                                }\r\n                                if (o.isPoints) {\r\n                                    console.error(\"instanced point cloud is not supported\");\r\n                                }\r\n                            });\r\n                            let instancedMesh;\r\n                            gltf.scene.updateWorldMatrix(false, true)\r\n                            gltf.scene.traverse(child => {\r\n                                //TODO several meshes in a single gltf\r\n                                if (child.isMesh) {\r\n                                    instancedMesh = new THREE.InstancedMesh(child.geometry, child.material, self.maxInstances);\r\n                                    instancedMesh.baseMatrix = child.matrixWorld;\r\n                                }\r\n\r\n                            });\r\n                            self.ready.unshift(nextDownload);\r\n                            if (!instancedMesh) {\r\n                                gltf.scene.traverse(c => {\r\n                                    if (c.dispose) c.dispose();\r\n                                    if (c.material) c.material.dispose();\r\n                                });\r\n                            } else {\r\n                                instancedMesh.frustumCulled = false;\r\n                                nextDownload.tile.setObject(instancedMesh);\r\n                            }\r\n                        });\r\n                    }, e => {\r\n                        console.error(\"could not load tile : \" + nextDownload.path)\r\n                    }).finally(() => {\r\n                        concurrentDownloads--;\r\n                    });\r\n\r\n\r\n\r\n                } else if (nextDownload.path.includes(\".json\")) {\r\n                    var fetchFunction;\r\n                    if (!self.proxy) {\r\n                        fetchFunction = () => {\r\n                            return fetch(nextDownload.path);\r\n                        }\r\n                    } else {\r\n                        fetchFunction = () => {\r\n                            return fetch(self.proxy,\r\n                                {\r\n                                    method: 'POST',\r\n                                    body: nextDownload.path\r\n                                }\r\n                            );\r\n                        }\r\n                    }\r\n                    concurrentDownloads++;\r\n                    fetchFunction().then(result => {\r\n                        if (!result.ok) {\r\n                            console.error(\"could not load tile with path : \" + nextDownload.path)\r\n                            throw new Error(`couldn't load \"${nextDownload.path}\". Request failed with status ${result.status} : ${result.statusText}`);\r\n                        }\r\n                        return result.json();\r\n\r\n                    }).then(json => {\r\n                        return resolveImplicite(json, nextDownload.path)\r\n                    }).then(json => {\r\n                        nextDownload.tile.setObject(json, nextDownload.path);\r\n                        self.ready.unshift(nextDownload);\r\n                    })\r\n                        .catch(e => console.error(e)).finally(() => {\r\n                            concurrentDownloads--;\r\n                        });\r\n                }\r\n            }\r\n        }\r\n        return;\r\n    }\r\n\r\n    _loadBatch() {\r\n        if (this.nextReady.length == 0) {\r\n            this._getNextReady();\r\n            if (this.nextReady.length == 0) return 0;\r\n        }\r\n        const download = this.nextReady.shift();\r\n        if (!download) return 0;\r\n\r\n        //if (!!download.tile.addToScene) download.tile.addToScene();\r\n        return 1;\r\n    }\r\n\r\n    _getNextReady() {\r\n        let smallestDistance = Number.MAX_VALUE;\r\n        let closest = -1;\r\n        for (let i = this.ready.length - 1; i >= 0; i--) {\r\n\r\n            if (!this.ready[i].distanceFunction) {// if no distance function, must be a json, give absolute priority!\r\n                this.nextReady.push(this.ready.splice(i, 1)[0]);\r\n            }\r\n        }\r\n        if (this.nextReady.length > 0) return;\r\n        for (let i = this.ready.length - 1; i >= 0; i--) {\r\n            const dist = this.ready[i].distanceFunction() * this.ready[i].level;\r\n            if (dist < smallestDistance) {\r\n                smallestDistance = dist;\r\n                closest = i\r\n            }\r\n        }\r\n        if (closest >= 0) {\r\n            const closestItem = this.ready.splice(closest, 1).pop();\r\n            this.nextReady.push(closestItem);\r\n            const siblings = closestItem.getSiblings();\r\n            for (let i = this.ready.length - 1; i >= 0; i--) {\r\n                if (siblings.includes(this.ready[i].uuid)) {\r\n                    this.nextready.push(this.ready.splice(i, 1).pop());\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    /**\r\n     * Schedules a tile content to be downloaded\r\n     * \r\n     * @param {AbortController} abortController \r\n     * @param {string} path path or url to tile content \r\n     * @param {string|Number} uuid tile id\r\n     * @param {InstancedOGC3DTile} instancedOGC3DTile \r\n     * @param {Function} distanceFunction \r\n     * @param {Function} getSiblings \r\n     * @param {Number} level \r\n     * @param {Boolean} sceneZupToYup \r\n     * @param {Boolean} meshZupToYup \r\n     * @param {Number} geometricError \r\n     */\r\n    get(abortController, path, uuid, instancedOGC3DTile, distanceFunction, getSiblings, level, sceneZupToYup, meshZupToYup, geometricError) {\r\n        const self = this;\r\n        const key = _simplifyPath(path);\r\n\r\n        if (!path.includes(\".b3dm\") && !path.includes(\".json\") && !path.includes(\".glb\") && !path.includes(\".gltf\")) {\r\n            console.error(\"the 3DTiles cache can only be used to load B3DM, gltf and json data\");\r\n            return;\r\n        }\r\n\r\n        const cachedTile = self.cache.get(key);\r\n        if (!!cachedTile) {\r\n            cachedTile.addInstance(instancedOGC3DTile);\r\n            return;\r\n        } else {\r\n\r\n            if (path.includes(\".b3dm\") || path.includes(\".glb\") || path.includes(\".gltf\")) {\r\n                const tile = new MeshTile(self.scene);\r\n                tile.addInstance(instancedOGC3DTile);\r\n\r\n                self.cache.put(key, tile);\r\n                //self._checkSize();\r\n                const realAbortController = new AbortController();\r\n                abortController.signal.addEventListener(\"abort\", () => {\r\n                    if (tile.getCount() == 0) {\r\n                        realAbortController.abort();\r\n                    }\r\n                })\r\n                this.downloads.push({\r\n                    abortController: realAbortController,\r\n                    tile: tile,\r\n                    key: key,\r\n                    path: path,\r\n                    distanceFunction: distanceFunction,\r\n                    getSiblings: getSiblings,\r\n                    level: level,\r\n                    uuid: uuid,\r\n                    sceneZupToYup: sceneZupToYup,\r\n                    meshZupToYup: meshZupToYup,\r\n                    geometricError: geometricError,\r\n                    shouldDoDownload: () => {\r\n                        return true;\r\n                    },\r\n                })\r\n            } else if (path.includes(\".json\")) {\r\n                const tile = new JsonTile();\r\n                tile.addInstance(instancedOGC3DTile);\r\n                self.cache.put(key, tile);\r\n                //self._checkSize();\r\n                const realAbortController = new AbortController();\r\n                abortController.signal.addEventListener(\"abort\", () => {\r\n                    if (tile.getCount() == 0) {\r\n                        realAbortController.abort();\r\n                    }\r\n                })\r\n                this.downloads.push({\r\n                    abortController: realAbortController,\r\n                    tile: tile,\r\n                    key: key,\r\n                    path: path,\r\n                    distanceFunction: distanceFunction,\r\n                    getSiblings: getSiblings,\r\n                    level: level,\r\n                    shouldDoDownload: () => {\r\n                        return true;\r\n                    },\r\n                })\r\n\r\n            }\r\n        }\r\n    }\r\n\r\n\r\n\r\n    _getNextDownloads() {\r\n        let smallestDistance = Number.MAX_VALUE;\r\n        let closest = -1;\r\n        for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n            const download = this.downloads[i];\r\n            if (!download.shouldDoDownload()) {\r\n                this.downloads.splice(i, 1);\r\n                continue;\r\n            }\r\n            if (!download.distanceFunction) { // if no distance function, must be a json, give absolute priority!\r\n                this.nextDownloads.push(this.downloads.splice(i, 1)[0]);\r\n            }\r\n        }\r\n        if (this.nextDownloads.length > 0) return;\r\n        for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n            const download = this.downloads[i];\r\n            const dist = download.distanceFunction() * download.level;\r\n            if (dist < smallestDistance) {\r\n                smallestDistance = dist;\r\n                closest = i;\r\n            }\r\n        }\r\n        if (closest >= 0) {\r\n            const closestItem = this.downloads.splice(closest, 1).pop();\r\n            this.nextDownloads.push(closestItem);\r\n            const siblings = closestItem.getSiblings();\r\n            for (let i = this.downloads.length - 1; i >= 0; i--) {\r\n                if (siblings.includes(this.downloads[i].uuid)) {\r\n                    this.nextDownloads.push(this.downloads.splice(i, 1).pop());\r\n                }\r\n            }\r\n        }\r\n    }\r\n\r\n    _checkSize() {\r\n        const self = this;\r\n\r\n        let i = 0;\r\n\r\n        while (self.cache.size() > self.maxCachedItems && i < self.cache.size()) {\r\n            i++;\r\n            const entry = self.cache.head();\r\n            self.cache.remove(entry.key);\r\n            if (!entry.value.dispose()) {\r\n                self.cache.put(entry.key, entry.value);\r\n            } else {\r\n                //console.log(\"disposed and removed\")\r\n            }\r\n\r\n        }\r\n    }\r\n}\r\n\r\nasync function _checkLoaderInitialized(loader) {\r\n\r\n    const self = this;\r\n    return new Promise((resolve) => {\r\n        const interval = setInterval(() => {\r\n            if ((!loader.hasDracoLoader || loader.dracoLoader) && (!loader.hasKTX2Loader || loader.ktx2Loader)) {\r\n                clearInterval(interval);\r\n                resolve();\r\n            }\r\n        }, 10); // check every 100ms\r\n    });\r\n};\r\n\r\nfunction _simplifyPath(main_path) {\r\n\r\n    var parts = main_path.split('/'),\r\n        new_path = [],\r\n        length = 0;\r\n    for (var i = 0; i < parts.length; i++) {\r\n        var part = parts[i];\r\n        if (part === '.' || part === '' || part === '..') {\r\n            if (part === '..' && length > 0) {\r\n                length--;\r\n            }\r\n            continue;\r\n        }\r\n        new_path[length++] = part;\r\n    }\r\n\r\n    if (length === 0) {\r\n        return '/';\r\n    }\r\n\r\n    var result = '';\r\n    for (var i = 0; i < length; i++) {\r\n        result += '/' + new_path[i];\r\n    }\r\n\r\n    return result;\r\n}\r\n\r\nexport { InstancedTileLoader };","// Main-thread physics orchestration with a worker backend (skeleton).\r\n// - Spawns ./physics.worker.js (inline) and bridges rendering objects with simulated rigid bodies\r\n// - Supports SharedArrayBuffer geometry sharing when COOP/COEP enables crossOriginIsolated\r\n// - Provides ID-based APIs for rigid bodies and colliders, plus attach/detach\r\n//\r\n// NOTE: This file wires up the API and message protocol. physics.worker.js will contain placeholder logic initially.\r\n\r\nimport * as THREE from 'three';\r\nimport PhysicsRapierWorkerConstructor from './physicsRapier.worker.js?worker'\r\nimport PhysicsHelperWorkerConstructor from './physicsHelper.worker.js?worker'\r\n\r\nfunction normalizeVector3(input, fallback = [0, -9.81, 0]) {\r\n  if (!input) return fallback.slice();\r\n  if (Array.isArray(input) && input.length === 3) return [Number(input[0]), Number(input[1]), Number(input[2])];\r\n  if (input.isVector3) return [input.x, input.y, input.z];\r\n  if (typeof input === 'object' && 'x' in input && 'y' in input && 'z' in input) return [Number(input.x), Number(input.y), Number(input.z)];\r\n  return fallback.slice();\r\n}\r\n\r\nfunction normalizeQuaternion(input, fallback = [0, 0, 0, 1]) {\r\n  if (!input) return fallback.slice();\r\n  if (Array.isArray(input) && input.length === 4) return [Number(input[0]), Number(input[1]), Number(input[2]), Number(input[3])];\r\n  if (input.isQuaternion) return [input.x, input.y, input.z, input.w];\r\n  if (input.isEuler) {\r\n    const q = new THREE.Quaternion().setFromEuler(input);\r\n    return [q.x, q.y, q.z, q.w];\r\n  }\r\n  return fallback.slice();\r\n}\r\n\r\nfunction normalizeGravity(gravity) {\r\n  // Supports:\r\n  // - { mode: 'vector', vector: [x,y,z] }\r\n  // - { mode: 'geocentric', planetCenter: [x,y,z], intensity: 9.81 }\r\n  // - simple [x,y,z]\r\n  if (Array.isArray(gravity) || (gravity && gravity.isVector3)) {\r\n    return { mode: 'vector', vector: normalizeVector3(gravity) };\r\n  }\r\n  const g = gravity || {};\r\n  const mode = (g.mode || 'vector').toLowerCase();\r\n  if (mode === 'geocentric') {\r\n    return {\r\n      mode: 'geocentric',\r\n      planetCenter: normalizeVector3(g.planetCenter || [0, 0, 0], [0, 0, 0]),\r\n      intensity: typeof g.intensity === 'number' ? g.intensity : 9.81\r\n    };\r\n  }\r\n  return { mode: 'vector', vector: normalizeVector3(g.vector || g, [0, -9.81, 0]) };\r\n}\r\n\r\n// Try deriving a Rapier primitive collider shape from a Three.js geometry.\r\n// Returns null if geometry is not a known simple primitive.\r\nfunction shapeFromThreeGeometry(geometry) {\r\n  if (!geometry || !geometry.parameters) return null;\r\n  const type = geometry.type;\r\n\r\n  // Follow the three.js example mapping to Rapier shapes\r\n  if (type === 'RoundedBoxGeometry') {\r\n    const p = geometry.parameters;\r\n    const sx = (p.width !== undefined ? p.width : 1) / 2;\r\n    const sy = (p.height !== undefined ? p.height : 1) / 2;\r\n    const sz = (p.depth !== undefined ? p.depth : 1) / 2;\r\n    const radius = p.radius !== undefined ? p.radius : 0.1;\r\n    return {\r\n      kind: 'roundCuboid',\r\n      params: { hx: sx - radius, hy: sy - radius, hz: sz - radius, radius }\r\n    };\r\n  } else if (type === 'BoxGeometry') {\r\n    const p = geometry.parameters;\r\n    const sx = (p.width !== undefined ? p.width : 1) / 2;\r\n    const sy = (p.height !== undefined ? p.height : 1) / 2;\r\n    const sz = (p.depth !== undefined ? p.depth : 1) / 2;\r\n    return { kind: 'box', params: { hx: sx, hy: sy, hz: sz } };\r\n  } else if (type === 'SphereGeometry' || type === 'IcosahedronGeometry') {\r\n    const p = geometry.parameters;\r\n    const radius = p.radius !== undefined ? p.radius : 1;\r\n    return { kind: 'ball', params: { radius } };\r\n  } else if (type === 'CylinderGeometry') {\r\n    const p = geometry.parameters;\r\n    const radius = (p.radiusBottom !== undefined ? p.radiusBottom :\r\n      (p.radiusTop !== undefined ? p.radiusTop : (p.radius !== undefined ? p.radius : 0.5)));\r\n    const length = p.height !== undefined ? p.height : 1.0;\r\n    return { kind: 'cylinder', params: { halfHeight: length / 2, radius } };\r\n  } else if (type === 'CapsuleGeometry') {\r\n    const p = geometry.parameters;\r\n    const radius = p.radius !== undefined ? p.radius : 0.5;\r\n    const length = p.height !== undefined ? p.height : 1.0;\r\n    return { kind: 'capsule', params: { halfHeight: length / 2, radius } };\r\n  }\r\n\r\n  // Not a recognized primitive\r\n  return null;\r\n}\r\n\r\nfunction makeSharedCopyIfSupported(typed, shared) {\r\n  // Returns { array: TypedArray, transferred: boolean, isShared: boolean, transferList?: ArrayBuffer[] }\r\n  // If SharedArrayBuffer is supported and 'shared' is true, allocates a SAB-backed typed array and copies data.\r\n  // Otherwise, returns the original typed array and proposes its ArrayBuffer for transferList.\r\n  if (!typed) return { array: undefined, transferred: false, isShared: false, transferList: [] };\r\n\r\n  const Ctor = typed.constructor;\r\n  if (shared && typeof SharedArrayBuffer !== 'undefined') {\r\n    const sab = new SharedArrayBuffer(typed.byteLength);\r\n    const sharedArray = new Ctor(sab);\r\n    sharedArray.set(typed);\r\n    return { array: sharedArray, transferred: false, isShared: true, transferList: [] };\r\n  }\r\n\r\n  // non-shared path: Transfer the ArrayBuffer to worker\r\n  const ab = typed.buffer;\r\n  return { array: typed, transferred: true, isShared: false, transferList: ab ? [ab] : [] };\r\n}\r\n\r\nfunction nowMs() {\r\n  return (typeof performance !== 'undefined' && performance.now) ? performance.now() : Date.now();\r\n}\r\n\r\nexport class Physics {\r\n  /**\r\n   * constructor(options)\r\n   *  - updateIntervalMs: number (default 16). setTimeout tick period on the main thread\r\n   *  - fixedDt: number seconds per physics step (default: updateIntervalMs/1000)\r\n   *  - gravity: [x,y,z] OR { mode:'vector', vector:[x,y,z] } OR { mode:'geocentric', planetCenter:[x,y,z], intensity:number }\r\n   *  - autoStart: boolean (default true)\r\n   */\r\n  constructor(options = {}) {\r\n    this.updateIntervalMs = typeof options.updateIntervalMs === 'number' ? options.updateIntervalMs : 16;\r\n    this.fixedDt = typeof options.fixedDt === 'number' ? options.fixedDt : (this.updateIntervalMs / 1000);\r\n    this.gravity = normalizeGravity(options.gravity);\r\n    this.autoStart = options.autoStart !== false;\r\n\r\n    // Shared memory support requires crossOriginIsolation (COOP/COEP headers)\r\n    this.sharedMemorySupported = (typeof SharedArrayBuffer !== 'undefined') && !!(globalThis && globalThis.crossOriginIsolated);\r\n\r\n    // Worker and messaging setup\r\n    // Use a module worker constructed via new URL() so Rollup/Vite can emit the worker and its chunks\r\n    // with correct relative paths. Try Vite's inline worker build first (helps with wasm locateFile resolution\r\n    // when the worker loads a .wasm relative to its own module). Fall back to the standard emitted module worker.\r\n    // Always emit a separate module worker so locateFile(import.meta.url) can resolve the .wasm asset correctly.\r\n    // Inlining workers breaks relative URL resolution for WASM in many bundlers.\r\n    this.worker = new PhysicsRapierWorkerConstructor({ type: 'module' });\r\n    //this.worker = new Worker(new URL('./physicsRapier.worker.js', import.meta.url), { type: 'module' });\r\n    this._msgId = 0;\r\n    this._pending = new Map();\r\n    this._onWorkerMessage = this._onWorkerMessage.bind(this);\r\n    this.worker.onmessage = this._onWorkerMessage;\r\n    this.worker.onerror = (e) => {\r\n      console.error('Physics worker error:', e?.message || e);\r\n    };\r\n\r\n    // Helper worker (convex hull computation) - lazy initialized\r\n    this.helperWorker = null;\r\n    this._helperMsgId = 0;\r\n    this._helperPending = new Map();\r\n    this._onHelperMessage = this._onHelperMessage ? this._onHelperMessage.bind(this) : ((_) => {});\r\n\r\n    // State tracking\r\n    this._paused = false;\r\n    this._lastTickTime = nowMs();\r\n    this._lastState = null;   // { timeMs, bodies: { [id]: { p:[3], q:[4] } } }\r\n    this._currentState = null;\r\n    this._interpolationMax = 1.25; // bounds interp alpha\r\n\r\n    // Mappings and registries\r\n    this._nextBodyId = 1;\r\n    this._nextColliderId = 1;\r\n    this.rigidBodies = new Map();       // id -> { object, type, mass, ... }\r\n    this.bodyToColliders = new Map();   // bodyId -> Set<colliderId>\r\n    this.colliderToBody = new Map();    // colliderId -> bodyId | undefined\r\n\r\n    // Optional listeners map (simple event system)\r\n    this._listeners = new Map(); // type -> Set<fn>\r\n\r\n    // Send init to worker and keep the promise so we don't start ticking before Rapier is ready.\r\n    // _post returns a promise that resolves when the worker replies; schedule ticks only after init ack.\r\n    this._initPromise = this._post({\r\n      type: 'init',\r\n      gravity: this.gravity,\r\n      sharedMemorySupported: this.sharedMemorySupported,\r\n      fixedDt: this.fixedDt\r\n    });\r\n\r\n    if (this.autoStart) {\r\n      this._initPromise\r\n        .then(() => { this._scheduleNextTick(); })\r\n        .catch((err) => { console.error('Physics init failed:', err); });\r\n    }\r\n  }\r\n\r\n  // Public API\r\n\r\n  /**\r\n   * addObject({ object, type, mass, position, rotation, velocity, angularVelocity })\r\n   *  - object: THREE.Object3D (e.g., OGC3DTile or any Object3D)\r\n   *  - type: 'dynamic' | 'kinematic' | 'fixed' (default 'dynamic')\r\n   *  - mass: number (default 1)\r\n   *  - position: array|Vector3\r\n   *  - rotation: Euler|Quaternion|[x,y,z,w]\r\n   *  - velocity: array|Vector3 (optional)\r\n   *  - angularVelocity: array|Vector3 (optional)\r\n   */\r\n  addObject(options = {}) {\r\n    const id = `rb-${this._nextBodyId++}`;\r\n    const type = (options.type || 'dynamic').toLowerCase();\r\n    const mass = typeof options.mass === 'number' ? options.mass : 1;\r\n\r\n    const p = normalizeVector3(options.position, [0, 0, 0]);\r\n    const q = normalizeQuaternion(options.rotation, [0, 0, 0, 1]);\r\n    const v = options.velocity ? normalizeVector3(options.velocity, [0, 0, 0]) : undefined;\r\n    const w = options.angularVelocity ? normalizeVector3(options.angularVelocity, [0, 0, 0]) : undefined;\r\n\r\n    this.rigidBodies.set(id, {\r\n      id,\r\n      object: options.object || null,\r\n      type,\r\n      mass,\r\n      last: { p, q },\r\n      current: { p: p.slice(), q: q.slice() }\r\n    });\r\n    this.bodyToColliders.set(id, new Set());\r\n\r\n    this._post({\r\n      type: 'addObject',\r\n      id,\r\n      body: { type, mass, p, q, v, w }\r\n    });\r\n\r\n    return id;\r\n  }\r\n\r\n\r\n\r\n  /**\r\n   * attachTrimeshCollider({ bodyId, geometry?, positions?, indices?, localPosition?, localRotation?, localScale? }) => Promise<string colliderId>\r\n   * Creates a TRIMESH collider with baked non-uniform scale and attaches it to the body.\r\n   * Positions/indices are always duplicated on the main thread and their ArrayBuffers are transferred.\r\n   */\r\n  attachTrimeshCollider({ bodyId, geometry, positions, indices, localPosition, localRotation, localScale }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`attachTrimeshCollider: unknown bodyId ${bodyId}`);\r\n      return Promise.resolve(null);\r\n    }\r\n\r\n    // Extract/duplicate buffers\r\n    let posArray = null;\r\n    let idxArray = null;\r\n\r\n    if (geometry && geometry.isBufferGeometry) {\r\n      const posAttr = geometry.getAttribute('position');\r\n      if (!posAttr) {\r\n        console.warn('attachTrimeshCollider: geometry has no position attribute');\r\n      } else if (posAttr.isInterleavedBufferAttribute) {\r\n        const count = posAttr.count;\r\n        posArray = new Float32Array(count * 3);\r\n        for (let i = 0; i < count; i++) {\r\n          posArray[3 * i + 0] = posAttr.getX(i);\r\n          posArray[3 * i + 1] = posAttr.getY(i);\r\n          posArray[3 * i + 2] = posAttr.getZ(i);\r\n        }\r\n      } else if (posAttr.array) {\r\n        posArray = new Float32Array(posAttr.array);\r\n      }\r\n\r\n      const idxAttr = geometry.getIndex?.();\r\n      if (idxAttr && idxAttr.array) {\r\n        const src = idxAttr.array;\r\n        idxArray = src instanceof Uint32Array ? new Uint32Array(src) : new Uint32Array(src);\r\n      }\r\n    } else {\r\n      if (positions) {\r\n        posArray = Array.isArray(positions)\r\n          ? new Float32Array(positions)\r\n          : (positions instanceof Float32Array\r\n            ? new Float32Array(positions)\r\n            : new Float32Array(positions.buffer || positions));\r\n      }\r\n      if (indices) {\r\n        idxArray = Array.isArray(indices)\r\n          ? new Uint32Array(indices)\r\n          : (indices instanceof Uint32Array\r\n            ? new Uint32Array(indices)\r\n            : new Uint32Array(indices.buffer || indices));\r\n      }\r\n    }\r\n\r\n    if (!(posArray instanceof Float32Array)) {\r\n      console.warn('attachTrimeshCollider: missing or invalid positions buffer');\r\n      return Promise.resolve(null);\r\n    }\r\n\r\n    const lp = localPosition ? normalizeVector3(localPosition, [0, 0, 0]) : [0, 0, 0];\r\n    const lq = localRotation ? normalizeQuaternion(localRotation, [0, 0, 0, 1]) : [0, 0, 0, 1];\r\n    const ls = (Array.isArray(localScale) && localScale.length === 3)\r\n      ? [Number(localScale[0]), Number(localScale[1]), Number(localScale[2])]\r\n      : [1, 1, 1];\r\n\r\n    const colliderId = `col-${this._nextColliderId++}`;\r\n\r\n    const set = this.bodyToColliders.get(bodyId) || new Set();\r\n    set.add(colliderId);\r\n    this.bodyToColliders.set(bodyId, set);\r\n    this.colliderToBody.set(colliderId, bodyId);\r\n\r\n    const msg = {\r\n      type: 'attachTrimeshCollider',\r\n      id: colliderId,\r\n      bodyId,\r\n      positions: posArray,\r\n      indices: idxArray || null,\r\n      local: { p: lp, q: lq, s: ls }\r\n    };\r\n\r\n    const transfer = [];\r\n    if (posArray?.buffer) transfer.push(posArray.buffer);\r\n    if (idxArray?.buffer) transfer.push(idxArray.buffer);\r\n\r\n    return this._post(msg, transfer).then(() => colliderId);\r\n  }\r\n\r\n  /**\r\n   * addConvexHullCollider({ bodyId, geometry?, positions?, indices?, localPosition?, localRotation?, localScale? }) => Promise<string colliderId>\r\n   * Computes a convex hull in a helper worker (with non-uniform scale baked in) and attaches it as a collider.\r\n   * Positions/indices are duplicated on the main thread and their ArrayBuffers are transferred to the helper worker.\r\n   */\r\n  addConvexHullCollider({ bodyId, geometry, positions, indices, localPosition, localRotation, localScale }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`addConvexHullCollider: unknown bodyId ${bodyId}`);\r\n      return Promise.resolve(null);\r\n    }\r\n\r\n    // Extract/duplicate buffers (same logic as attachTrimeshCollider)\r\n    let posArray = null;\r\n    let idxArray = null;\r\n\r\n    if (geometry && geometry.isBufferGeometry) {\r\n      const posAttr = geometry.getAttribute('position');\r\n      if (!posAttr) {\r\n        console.warn('addConvexHullCollider: geometry has no position attribute');\r\n      } else if (posAttr.isInterleavedBufferAttribute) {\r\n        const count = posAttr.count;\r\n        posArray = new Float32Array(count * 3);\r\n        for (let i = 0; i < count; i++) {\r\n          posArray[3 * i + 0] = posAttr.getX(i);\r\n          posArray[3 * i + 1] = posAttr.getY(i);\r\n          posArray[3 * i + 2] = posAttr.getZ(i);\r\n        }\r\n      } else if (posAttr.array) {\r\n        posArray = new Float32Array(posAttr.array);\r\n      }\r\n\r\n      const idxAttr = geometry.getIndex?.();\r\n      if (idxAttr && idxAttr.array) {\r\n        const src = idxAttr.array;\r\n        idxArray = src instanceof Uint32Array ? new Uint32Array(src) : new Uint32Array(src);\r\n      }\r\n    } else {\r\n      if (positions) {\r\n        posArray = Array.isArray(positions)\r\n          ? new Float32Array(positions)\r\n          : (positions instanceof Float32Array\r\n            ? new Float32Array(positions)\r\n            : new Float32Array(positions.buffer || positions));\r\n      }\r\n      if (indices) {\r\n        idxArray = Array.isArray(indices)\r\n          ? new Uint32Array(indices)\r\n          : (indices instanceof Uint32Array\r\n            ? new Uint32Array(indices)\r\n            : new Uint32Array(indices.buffer || indices));\r\n      }\r\n    }\r\n\r\n    if (!(posArray instanceof Float32Array)) {\r\n      console.warn('addConvexHullCollider: missing or invalid positions buffer');\r\n      return Promise.resolve(null);\r\n    }\r\n\r\n    const lp = localPosition ? normalizeVector3(localPosition, [0, 0, 0]) : [0, 0, 0];\r\n    const lq = localRotation ? normalizeQuaternion(localRotation, [0, 0, 0, 1]) : [0, 0, 0, 1];\r\n    const ls = (Array.isArray(localScale) && localScale.length === 3)\r\n      ? [Number(localScale[0]), Number(localScale[1]), Number(localScale[2])]\r\n      : [1, 1, 1];\r\n\r\n    const colliderId = `col-${this._nextColliderId++}`;\r\n\r\n    const set = this.bodyToColliders.get(bodyId) || new Set();\r\n    set.add(colliderId);\r\n    this.bodyToColliders.set(bodyId, set);\r\n    this.colliderToBody.set(colliderId, bodyId);\r\n\r\n    // Send to helper worker for convex hull computation\r\n    const helperMsg = {\r\n      type: 'computeConvexHull',\r\n      positions: posArray,\r\n      indices: idxArray || null,\r\n      localScale: ls\r\n    };\r\n    const helperTransfer = [];\r\n    if (posArray?.buffer) helperTransfer.push(posArray.buffer);\r\n    if (idxArray?.buffer) helperTransfer.push(idxArray.buffer);\r\n\r\n    return this._helperPost(helperMsg, helperTransfer).then((res) => {\r\n      const hullVerts = res?.vertices;\r\n      if (!(hullVerts instanceof Float32Array) || hullVerts.length < 9) {\r\n        throw new Error('convex hull computation failed or returned insufficient vertices');\r\n      }\r\n      // Attach as a convex hull primitive collider\r\n      const shape = { kind: 'convexHull', params: { vertices: hullVerts } };\r\n      const msg = {\r\n        type: 'attachShapeCollider',\r\n        id: colliderId,\r\n        bodyId,\r\n        shape,\r\n        local: { p: lp, q: lq }\r\n      };\r\n      const transfer = [];\r\n      if (hullVerts?.buffer) transfer.push(hullVerts.buffer);\r\n      return this._post(msg, transfer).then(() => colliderId);\r\n    }).catch((err) => {\r\n      // Roll back mapping on failure\r\n      const set2 = this.bodyToColliders.get(bodyId);\r\n      if (set2) set2.delete(colliderId);\r\n      this.colliderToBody.delete(colliderId);\r\n      console.warn('addConvexHullCollider failed:', err);\r\n      return null;\r\n    });\r\n  }\r\n\r\n  /**\r\n   * attachShapeCollider({ bodyId, shape, localPosition?, localRotation? }) => Promise<string colliderId>\r\n   * Creates a primitive/analytic collider (via engine-agnostic shape descriptor) and attaches it to the body.\r\n   * Note: Any scale must be baked into the shape's parameters; no scale is applied at runtime.\r\n   */\r\n  attachShapeCollider({ bodyId, shape, localPosition, localRotation }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`attachShapeCollider: unknown bodyId ${bodyId}`);\r\n      return Promise.resolve(null);\r\n    }\r\n    if (!shape || typeof shape !== 'object') {\r\n      console.warn('attachShapeCollider: missing or invalid shape descriptor');\r\n      return Promise.resolve(null);\r\n    }\r\n\r\n    const lp = localPosition ? normalizeVector3(localPosition, [0, 0, 0]) : [0, 0, 0];\r\n    const lq = localRotation ? normalizeQuaternion(localRotation, [0, 0, 0, 1]) : [0, 0, 0, 1];\r\n    const colliderId = `col-${this._nextColliderId++}`;\r\n\r\n    const set = this.bodyToColliders.get(bodyId) || new Set();\r\n    set.add(colliderId);\r\n    this.bodyToColliders.set(bodyId, set);\r\n    this.colliderToBody.set(colliderId, bodyId);\r\n\r\n    const msg = {\r\n      type: 'attachShapeCollider',\r\n      id: colliderId,\r\n      bodyId,\r\n      shape,\r\n      local: { p: lp, q: lq }\r\n    };\r\n\r\n    this._post(msg);\r\n    return colliderId;\r\n  }\r\n\r\n  /**\r\n   * detachCollider({ colliderId })\r\n   */\r\n  detachCollider({ colliderId }) {\r\n    const bodyId = this.colliderToBody.get(colliderId);\r\n    if (!bodyId) return;\r\n    const set = this.bodyToColliders.get(bodyId);\r\n    if (set) set.delete(colliderId);\r\n    this.colliderToBody.delete(colliderId);\r\n\r\n    this._post({ type: 'detachCollider', colliderId });\r\n  }\r\n\r\n  /**\r\n   * removeObject({ bodyId })\r\n   */\r\n  removeObject({ bodyId }) {\r\n    if (!this.rigidBodies.has(bodyId)) return;\r\n    const set = this.bodyToColliders.get(bodyId);\r\n    if (set) {\r\n      for (const colId of set) {\r\n        this.colliderToBody.delete(colId);\r\n      }\r\n    }\r\n    this.bodyToColliders.delete(bodyId);\r\n    this.rigidBodies.delete(bodyId);\r\n    this._post({ type: 'removeObject', id: bodyId });\r\n  }\r\n\r\n  /**\r\n   * applyForce({ bodyId, force, worldPoint?, wake = true, impulse = false, resetForces = false, resetTorques = false })\r\n   */\r\n  applyForce({ bodyId, force, worldPoint, wake = true, impulse = false, resetForces = false, resetTorques = false }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`applyForce: unknown bodyId ${bodyId}`);\r\n      return;\r\n    }\r\n    const f = normalizeVector3(force, [0, 0, 0]);\r\n    const p = worldPoint ? normalizeVector3(worldPoint, [0, 0, 0]) : undefined;\r\n    this._post({\r\n      type: 'applyForce',\r\n      id: bodyId,\r\n      force: f,\r\n      point: p,\r\n      wake: !!wake,\r\n      impulse: !!impulse,\r\n      resetForces: !!resetForces,\r\n      resetTorques: !!resetTorques\r\n    });\r\n  }\r\n\r\n  /**\r\n   * applyForces({ bodyId, forces: [[x,y,z],...], worldPoints?: [ [x,y,z]|null ], wake=true, impulse=false, resetForces=false, resetTorques=false })\r\n   */\r\n  applyForces({ bodyId, forces, worldPoints, wake = true, impulse = false, resetForces = false, resetTorques = false }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`applyForces: unknown bodyId ${bodyId}`);\r\n      return;\r\n    }\r\n    if (!Array.isArray(forces)) return;\r\n    const fs = forces.map(f => normalizeVector3(f, [0, 0, 0]));\r\n    const pts = Array.isArray(worldPoints) ? worldPoints.map(p => p ? normalizeVector3(p, [0, 0, 0]) : undefined) : [];\r\n    this._post({\r\n      type: 'applyForces',\r\n      id: bodyId,\r\n      forces: fs,\r\n      points: pts,\r\n      wake: !!wake,\r\n      impulse: !!impulse,\r\n      resetForces: !!resetForces,\r\n      resetTorques: !!resetTorques\r\n    });\r\n  }\r\n\r\n  /**\r\n   * applyTorque({ bodyId, torque, wake = true, impulse = false, resetTorques = false })\r\n   */\r\n  applyTorque({ bodyId, torque, wake = true, impulse = false, resetTorques = false }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`applyTorque: unknown bodyId ${bodyId}`);\r\n      return;\r\n    }\r\n    const t = normalizeVector3(torque, [0, 0, 0]);\r\n    this._post({\r\n      type: 'applyTorque',\r\n      id: bodyId,\r\n      torque: t,\r\n      wake: !!wake,\r\n      impulse: !!impulse,\r\n      resetTorques: !!resetTorques\r\n    });\r\n  }\r\n\r\n  /**\r\n   * applyTorques({ bodyId, torques: [[x,y,z],...], wake=true, impulse=false, resetTorques=false })\r\n   */\r\n  applyTorques({ bodyId, torques, wake = true, impulse = false, resetTorques = false }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`applyTorques: unknown bodyId ${bodyId}`);\r\n      return;\r\n    }\r\n    if (!Array.isArray(torques)) return;\r\n    const ts = torques.map(t => normalizeVector3(t, [0, 0, 0]));\r\n    this._post({\r\n      type: 'applyTorques',\r\n      id: bodyId,\r\n      torques: ts,\r\n      wake: !!wake,\r\n      impulse: !!impulse,\r\n      resetTorques: !!resetTorques\r\n    });\r\n  }\r\n\r\n  /**\r\n   * setGravity(gravityOptions)\r\n   */\r\n  setGravity(gravityOptions) {\r\n    this.gravity = normalizeGravity(gravityOptions);\r\n    this._post({ type: 'setGravity', gravity: this.gravity });\r\n  }\r\n \r\n  /**\r\n   * setPose({ bodyId, position?, rotation?, wake = true })\r\n   * Teleport a rigid body to a new pose immediately.\r\n   * - position: [x,y,z] or THREE.Vector3 (optional)\r\n   * - rotation: [x,y,z,w] or THREE.Quaternion/Euler (optional)\r\n   * - wake: boolean (default true)\r\n   */\r\n  setPose({ bodyId, position, rotation, wake = true }) {\r\n    if (!this.rigidBodies.has(bodyId)) {\r\n      console.warn(`setPose: unknown bodyId ${bodyId}`);\r\n      return;\r\n    }\r\n    const p = (position !== undefined && position !== null) ? normalizeVector3(position, [0, 0, 0]) : null;\r\n    const q = (rotation !== undefined && rotation !== null) ? normalizeQuaternion(rotation, [0, 0, 0, 1]) : null;\r\n \r\n    // Send command to worker; worker handles dynamic vs kinematic details\r\n    this._post({ type: 'setPose', id: bodyId, p, q, wake: !!wake });\r\n \r\n    // Optimistically update cached state and linked Object3D so render matches immediately\r\n    const body = this.rigidBodies.get(bodyId);\r\n    if (body) {\r\n      if (p) {\r\n        body.last.p = p.slice();\r\n        body.current.p = p.slice();\r\n        if (body.object?.isObject3D) body.object.position.set(p[0], p[1], p[2]);\r\n      }\r\n      if (q) {\r\n        body.last.q = q.slice();\r\n        body.current.q = q.slice();\r\n        if (body.object?.isObject3D) body.object.quaternion.set(q[0], q[1], q[2], q[3]);\r\n      }\r\n      if (body.object?.isObject3D) {\r\n        if (body.object.updateMatrices) body.object.updateMatrices();\r\n        else {\r\n          if (body.object.matrixAutoUpdate !== false) body.object.updateMatrix();\r\n          if (body.object.matrixWorldAutoUpdate !== false) body.object.updateMatrixWorld(true);\r\n        }\r\n      }\r\n    }\r\n  }\r\n \r\n  /**\r\n   * raycast({ origin, direction, maxToi = 1e6, filter? }) => Promise<hits[]>\r\n   */\r\n  raycast({ origin, direction, maxToi = 1e6, filter }) {\r\n    const o = normalizeVector3(origin, [0, 0, 0]);\r\n    const d = normalizeVector3(direction, [0, -1, 0]);\r\n    return this._post({ type: 'raycast', origin: o, direction: d, maxToi, filter: filter || null });\r\n  }\r\n\r\n  /**\r\n   * pause / resume\r\n   */\r\n  pause() { this._paused = true; }\r\n  resume() {\r\n    if (!this._paused) return;\r\n    this._paused = false;\r\n    this._lastTickTime = nowMs();\r\n    this._scheduleNextTick();\r\n  }\r\n\r\n  /**\r\n   * setUpdateInterval(ms: number)\r\n   */\r\n  setUpdateInterval(ms) {\r\n    this.updateIntervalMs = Math.max(1, Number(ms) || 16);\r\n  }\r\n\r\n  /**\r\n   * stepOnce(dtSeconds?: number)\r\n   * Requests a single physics integration step on worker.\r\n   */\r\n  stepOnce(dtSeconds) {\r\n    const dt = typeof dtSeconds === 'number' ? dtSeconds : this.fixedDt;\r\n    return this._post({ type: 'step', dt });\r\n  }\r\n\r\n  /**\r\n   * update()\r\n   * Interpolates between the last two physics snapshots and applies transforms to linked THREE.Object3D.\r\n   * This is automatically called on a setTimeout loop by the constructor, but can also be called manually.\r\n   */\r\n  update() {\r\n    if (!this._currentState) return;\r\n\r\n    const last = this._lastState || this._currentState;\r\n    const curr = this._currentState;\r\n\r\n    const tNow = nowMs();\r\n    const t0 = last.timeMs || tNow;\r\n    const t1 = curr.timeMs || tNow;\r\n    const denom = Math.max(1e-3, (t1 - t0));\r\n    let alpha = THREE.MathUtils.clamp((tNow - t1) / denom + 1.0, 0.0, this._interpolationMax);\r\n    // Bound to [0,1] primarily\r\n    alpha = THREE.MathUtils.clamp(alpha, 0.0, 1.0);\r\n\r\n    const tmpQ0 = new THREE.Quaternion();\r\n    const tmpQ1 = new THREE.Quaternion();\r\n    const tmpQT = new THREE.Quaternion();\r\n\r\n    for (const [id, body] of this.rigidBodies.entries()) {\r\n      const s0 = last.bodies?.[id];\r\n      const s1 = curr.bodies?.[id];\r\n\r\n      if (!s1 && !s0) continue;\r\n\r\n      const p0 = s0?.p || body.current.p;\r\n      const q0 = s0?.q || body.current.q;\r\n      const p1 = s1?.p || body.current.p;\r\n      const q1 = s1?.q || body.current.q;\r\n\r\n      const px = THREE.MathUtils.lerp(p0[0], p1[0], alpha);\r\n      const py = THREE.MathUtils.lerp(p0[1], p1[1], alpha);\r\n      const pz = THREE.MathUtils.lerp(p0[2], p1[2], alpha);\r\n\r\n      tmpQ0.set(q0[0], q0[1], q0[2], q0[3]);\r\n      tmpQ1.set(q1[0], q1[1], q1[2], q1[3]);\r\n      tmpQT.copy(tmpQ0).slerp(tmpQ1, alpha);\r\n\r\n      if (body.object && body.object.isObject3D) {\r\n        body.object.position.set(px, py, pz);\r\n        body.object.quaternion.copy(tmpQT);\r\n        if (body.object.updateMatrices) body.object.updateMatrices();\r\n        else {\r\n          if (body.object.matrixAutoUpdate !== false) {\r\n            body.object.updateMatrix();\r\n          }\r\n          if (body.object.matrixWorldAutoUpdate !== false) {\r\n            body.object.updateMatrixWorld(true);\r\n          }\r\n        }\r\n\r\n      }\r\n\r\n      // Keep the latest \"current\" cached for next round\r\n      body.last = { p: p0.slice(), q: q0.slice() };\r\n      body.current = { p: p1.slice(), q: q1.slice() };\r\n    }\r\n  }\r\n\r\n  /**\r\n   * dispose()\r\n   * Terminates the worker and clears all registries.\r\n   */\r\n  dispose() {\r\n    try { this.worker.terminate(); } catch (_) {}\r\n    try { this.helperWorker?.terminate(); } catch (_) {}\r\n    this.rigidBodies.clear();\r\n    this.bodyToColliders.clear();\r\n    this.colliderToBody.clear();\r\n    this._pending.clear();\r\n    this._listeners.clear();\r\n    this._lastState = null;\r\n    this._currentState = null;\r\n  }\r\n\r\n  // Internal\r\n\r\n  _scheduleNextTick() {\r\n    if (this._paused) return;\r\n    setTimeout(() => this._onTick(), this.updateIntervalMs);\r\n  }\r\n\r\n  _onTick() {\r\n    if (this._paused) return;\r\n\r\n    const t = nowMs();\r\n    const dt = Math.max(0.000001, (t - this._lastTickTime) / 1000);\r\n    this._lastTickTime = t;\r\n\r\n    // Ask worker to step by a fixed dt (deterministic), regardless of real dt. Could change to adaptive if desired.\r\n    this._post({ type: 'step', dt: this.fixedDt });\r\n\r\n    // Interpolate and push transforms to render objects\r\n    this.update();\r\n\r\n    // schedule next loop\r\n    this._scheduleNextTick();\r\n  }\r\n\r\n  _onWorkerMessage(ev) {\r\n    const data = ev.data || {};\r\n    if (data.replyTo) {\r\n      const pending = this._pending.get(data.replyTo);\r\n      if (pending) {\r\n        this._pending.delete(data.replyTo);\r\n        if (data.error) {\r\n          pending.rej ? pending.rej(data.error) : console.error('Physics worker error:', data.error);\r\n        } else {\r\n          pending.res ? pending.res(data.result) : null;\r\n        }\r\n      }\r\n      return;\r\n    }\r\n\r\n    switch (data.type) {\r\n      case 'state': {\r\n        // { timeMs, bodies: { id: { p:[3], q:[4] } } }\r\n        this._lastState = this._currentState;\r\n        this._currentState = data.state || null;\r\n        this._emit('state', this._currentState);\r\n        break;\r\n      }\r\n      case 'event': {\r\n        // e.g., collision events (placeholder)\r\n        this._emit('event', data.event);\r\n        break;\r\n      }\r\n      default:\r\n        // unknown broadcast\r\n        break;\r\n    }\r\n  }\r\n\r\n  _ensureHelperWorker() {\r\n    if (this.helperWorker) return;\r\n    this.helperWorker = new PhysicsHelperWorkerConstructor({ type: 'module' });\r\n    this.helperWorker.onmessage = this._onHelperMessage;\r\n    this.helperWorker.onerror = (e) => {\r\n      console.error('Physics helper worker error:', e?.message || e);\r\n    };\r\n  }\r\n\r\n  _onHelperMessage(ev) {\r\n    const data = ev.data || {};\r\n    if (data.replyTo) {\r\n      const pending = this._helperPending.get(data.replyTo);\r\n      if (pending) {\r\n        this._helperPending.delete(data.replyTo);\r\n        if (data.error) {\r\n          pending.rej ? pending.rej(data.error) : console.error('Physics helper worker error:', data.error);\r\n        } else {\r\n          pending.res ? pending.res(data.result) : null;\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  _helperPost(msg, transfer = []) {\r\n    this._ensureHelperWorker();\r\n    const id = ++this._helperMsgId;\r\n    const envelope = { ...msg, _envId: id };\r\n    this.helperWorker.postMessage(envelope, transfer);\r\n    return new Promise((res, rej) => {\r\n      this._helperPending.set(id, { res, rej });\r\n    });\r\n  }\r\n\r\n  _post(msg, transfer = []) {\r\n    const id = ++this._msgId;\r\n    // Preserve any domain-level \"id\" in msg (e.g., body/collider ids) and attach\r\n    // an envelope identifier used to correlate replies from the worker.\r\n    const envelope = { ...msg, _envId: id };\r\n    this.worker.postMessage(envelope, transfer);\r\n    return new Promise((res, rej) => {\r\n      this._pending.set(id, { res, rej });\r\n      // Optional: timeout for robustness\r\n      // setTimeout(() => { if (this._pending.has(id)) { this._pending.delete(id); rej(new Error('Worker timeout')); } }, 15000);\r\n    });\r\n  }\r\n\r\n  // Simple event system\r\n  on(type, fn) {\r\n    if (!this._listeners.has(type)) this._listeners.set(type, new Set());\r\n    this._listeners.get(type).add(fn);\r\n    return () => this.off(type, fn);\r\n  }\r\n  off(type, fn) {\r\n    const set = this._listeners.get(type);\r\n    if (set) set.delete(fn);\r\n  }\r\n  _emit(type, payload) {\r\n    const set = this._listeners.get(type);\r\n    if (!set) return;\r\n    for (const fn of set) {\r\n      try { fn(payload); } catch (e) { console.error(e); }\r\n    }\r\n  }\r\n}\r\n\r\nexport default Physics;","import * as THREE from 'three';\r\n\r\n\r\n/**\r\n * An occlusion culling service that helps to only refine tiles that are visible.\r\n * This occlusion culling has a cost but allows downloading much less data.\r\n * For models that have a lot of geometry that is often hidden from the camera by walls, this can improve the frame-rate.\r\n * @class\r\n */\r\nclass OcclusionCullingService {\r\n\r\n    /**\r\n     * Creates an Occlusion Culling service to be passed to {@link OGC3DTile} Tilesets\r\n     */\r\n    constructor() {\r\n        this.cullMap = [];\r\n        this.cullMaterial = new THREE.MeshBasicMaterial({ vertexColors: true });\r\n        this.cullMaterial.side = THREE.FrontSide;\r\n        this.cullTarget = this._createCullTarget();\r\n        this.cullPixels = new Uint8Array(4 * this.cullTarget.width * this.cullTarget.height);\r\n    }\r\n\r\n    /**\r\n     * \r\n     * @param {Integer} side use THREE.FrontSide, THREE.BackSide or THREE.DoubleSide (FrontSide default)\r\n     */\r\n    setSide(side){\r\n        this.cullMaterial.side = side;\r\n    }\r\n\r\n    _createCullTarget() {\r\n        const target = new THREE.WebGLRenderTarget(Math.floor(window.innerWidth * 0.05), Math.floor(window.innerHeight * 0.05));\r\n        target.texture.format = THREE.RGBAFormat;\r\n        target.texture.colorSpace = THREE.LinearSRGBColorSpace;\r\n        target.texture.minFilter = THREE.NearestFilter;\r\n        target.texture.magFilter = THREE.NearestFilter;\r\n        target.texture.generateMipmaps = false;\r\n        target.stencilBuffer = false;\r\n        target.depthBuffer = true;\r\n        target.depthTexture = new THREE.DepthTexture();\r\n        target.depthTexture.format = THREE.DepthFormat;\r\n        target.depthTexture.type = THREE.UnsignedShortType;\r\n        return target;\r\n    }\r\n\r\n    /**\r\n     * Update function to be called on every frame in the render loop.\r\n     * @param {THREE.scene} scene \r\n     * @param {THREE.Renderer} renderer \r\n     * @param {THREE.camera} camera \r\n     */\r\n    update(scene, renderer, camera) {\r\n        let tempRenderTarget = renderer.getRenderTarget();\r\n        let tempOverrideMaterial = scene.overrideMaterial;\r\n\r\n        scene.overrideMaterial = this.cullMaterial;\r\n        renderer.setRenderTarget(this.cullTarget);\r\n        renderer.render(scene, camera);\r\n\r\n        scene.overrideMaterial = tempOverrideMaterial;\r\n        renderer.setRenderTarget(tempRenderTarget);\r\n\r\n        renderer.readRenderTargetPixels(this.cullTarget, 0, 0, this.cullTarget.width, this.cullTarget.height, this.cullPixels);\r\n        this.cullMap = [];\r\n        \r\n        for (let i = 0; i < this.cullPixels.length; i += 4) {\r\n            const c = THREE.MathUtils.clamp(this.cullPixels[i], 0, 255) << 16 ^ THREE.MathUtils.clamp(this.cullPixels[i + 1], 0, 255) << 8 ^ THREE.MathUtils.clamp(this.cullPixels[i + 2], 0, 255) << 0;\r\n            this.cullMap[c] = true;\r\n        }\r\n\r\n    }\r\n\r\n    /**\r\n     * check if the given tile ID was visible in the last rendered frame.\r\n     * @param {string|Number} id \r\n     * @returns true if tile is visible\r\n     */\r\n    hasID(id) {\r\n        return this.cullMap[id];\r\n    }\r\n}\r\nexport { OcclusionCullingService };"]}